Abstract: Disclosed is a periodic broadcasting of data packets in an ad hoc network formed by a plurality of mobile nodes that can move along traffic lanes forming junctions and can be located. A data packet is broadcast by a broadcaster node elected from a set of candidate nodes at each junction. The broadcaster node is elected in a decentralized manner at each candidate node by comparing the estimated travel time to reach the center of the junction with a particular reference time period between two successive broadcasts.

Abstract: A method of broadcasting a data packet (D) in an ad hoc network comprising a plurality of groups of mobile nodes traveling along traffic lanes in a road network. The data packet (D) is broadcast within a group (G) during an intragroup broadcasting phase during which the data packet (D) propagates simultaneously in two opposing directions of movement (A1, A2), such that the packet (D) is received by peripheral nodes (B1, B2) of the group (G). During an intergroup broadcasting phase, a peripheral node (B) transmits the data packet (D) to another group.

Abstract: A method of routing data packets (P) between a source node (S) and a target node (C) in an ad hoc network comprising mobile nodes (1-14) that can be located and moving on traffic routes (L1, L2, L3, C1, C2, C3) of a particular geographical network (10) forming between them a plurality of intersections (I1-I6). This method comprises a destination intersection selection step in which a carrier node (S) of the packets (P) selects a destination intersection (12) from neighbor intersections and according to traffic conditions; a step of seeking one or more neighbor mobile nodes (1) of the packet carrier node nearer the selected destination intersection (12) than the carrier node; and, if one or more neighbor mobile nodes (1) are found, a step of transferring the packets (P) from the packet carrier node (S) to the neighbor node (1) that has been found, so as to route the data packets to the selected destination intersection.

Abstract: A method and an associated device for estimating the density of mobile node traffic in an ad-hoc network on the roads of a predetermined geographical network in which mobile nodes move. Each road is divided into coverage cells. For each cell, a principal mobile node located at the center of the cell counts the number of nodes in the cell, and inserts this number into a cell density packet (CDP) transmitted from cell to cell during a first stage.

Abstract: A method of broadcasting a data packet (D) in an ad hoc network comprising a plurality of groups of mobile nodes traveling along traffic lanes in a road network. The data packet (D) is broadcast within a group (G) during an intragroup broadcasting phase during which the data packet (D) propagates simultaneously in two opposing directions of movement (A1, A2), such that the packet (D) is received by peripheral nodes (B1, B2) of the group (G). During an intergroup broadcasting phase, a peripheral node (B) transmits the data packet (D) to another group.

Abstract: Disclosed is a periodic broadcasting of data packets in an ad hoc network formed by a plurality of mobile nodes that can move along traffic lanes forming junctions and can be located. A data packet is broadcast by a broadcaster node elected from a set of candidate nodes at each junction. The broadcaster node is elected in a decentralized manner at each candidate node by comparing the estimated travel time to reach the center of the junction with a particular reference time period between two successive broadcasts.

Abstract: A method and an associated device for estimating the density of mobile node traffic in an ad-hoc network on the roads of a predetermined geographical network in which mobile nodes move. Each road is divided into coverage cells. For each cell, a principal mobile node located at the center of the cell counts the number of nodes in the cell, and inserts this number into a cell density packet (CDP) transmitted from cell to cell during a first stage.

Abstract: A method of routing data packets (P) between a source node (S) and a target node (C) in an ad hoc network comprising mobile nodes (1-14) that can be located and moving on traffic routes (L1, L2, L3, C1, C2, C3) of a particular geographical network (10) forming between them a plurality of intersections (I1-I6). This method comprises a destination intersection selection step in which a carrier node (S) of the packets (P) selects a destination intersection (12) from neighbor intersections and according to traffic conditions; a step of seeking one or more neighbor mobile nodes (1) of the packet carrier node nearer the selected destination intersection (12) than the carrier node; and, if one or more neighbor mobile nodes (1) are found, a step of transferring the packets (P) from the packet carrier node (S) to the neighbor node (1) that has been found, so as to route the data packets to the selected destination intersection.