Abstract: A communication network comprises a packet core network and at least one wireless access node, arranged to provide the core network with access to user equipment via a first interface established between the access node and a network element of the core network. The network comprises at least one management entity configured to establish a virtual second interface passing through it and linking the access node and the network element and in which the first interface is encapsulated.

Abstract: A communication network comprises a packet core network and at least one wireless access node, arranged to provide the core network with access to user equipment via a first interface established between the access node and a network element of the core network. The network comprises at least one management entity configured to establish a virtual second interface passing through it and linking the access node and the network element and in which the first interface is encapsulated.

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 organizing nodes of a network into clusters of nodes comprises a step (130) of calculating, for each node, a weight, representing the aptness of this node to be the master node of a grouping, and a step (190) of electing a master node of a grouping, such that the weight of this master node is greater than or equal to the weights of the other nodes of the grouping. The method furthermore comprises a step (140 180) of storing, in each node, an information cue (14) containing an identifier of the node of highest weight known by this node and the value of this highest weight, a step (150) of transmitting, by each node to nodes adjacent to this node, the information cue (14) stored in this node, and a step (170) of comparing, for each node, the information cues (14) transmitted to this node during the transmitting step (150) with the information cue stored in this node, so as to determine a new node of highest weight known by this node.

Abstract: A method relates to routing data in a network, between source nodes and destination nodes pertaining respectively to distinct source groups and destination groups. The network includes intermediate groups forming at least two potential data transmission paths through which the data can be transmitted. The method includes a determination step, for each group of nodes of the network, including feedback by the nodes of the information group for determination of a quality level, representing quality of the data transmission through this group, and a step of selecting at least one transmission path from among the potential paths, for the transmission of data between the source nodes and destination nodes through the selected transmission path. The selection is made based on the quality levels of the intermediate groups of the network.

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 organizing nodes of a network into clusters of nodes comprises a step (130) of calculating, for each node, a weight, representing the aptness of this node to be the master node of a grouping, and a step (190) of electing a master node of a grouping, such that the weight of this master node is greater than or equal to the weights of the other nodes of the grouping. The method furthermore comprises a step (140 180) of storing, in each node, an information cue (14) containing an identifier of the node of highest weight known by this node and the value of this highest weight, a step (150) of transmitting, by each node to nodes adjacent to this node, the information cue (14) stored in this node, and a step (170) of comparing, for each node, the information cues (14) transmitted to this node during the transmitting step (150) with the information cue stored in this node, so as to determine a new node of highest weight known by this node.