Abstract: A method is provided for managing the spatial reuse of slots in a mobile network comprising several nodes Ni, said network comprising one or more Potentially Disruptive Nodes (PDN), said nodes Ni and PDN comprising a local table, a global table, and a summary of the global table comprising the interleaving of two sub-cycles: a first sub-cycle, the normal S-cycle, where S-SLOTs are all assigned statically and where each node has one or only one S-SLOT allocation, a second sub-cycle, the improved S-cycle, where each node has one S-SLOT assigned statically, and where for all nodes except PDN nodes, one or more additional S-SLOTs is assigned dynamically when topology makes it possible, dynamic S-SLOT allocation being equitably shared in a 2-hop neighborhood, and determined by performing S-SLOT spatial reuse.

Abstract: A method is provided for managing the spatial reuse of slots in a mobile network comprising several nodes Ni, said network comprising one or more Potentially Disruptive Nodes (PDN), said nodes Ni and PDN comprising a local table, a global table, and a summary of the global table comprising the interleaving of two sub-cycles: a first sub-cycle, the normal S-cycle, where S-SLOTs are all assigned statically and where each node has one or only one S-SLOT allocation, a second sub-cycle, the improved S-cycle, where each node has one S-SLOT assigned statically, and where for all nodes except PDN nodes, one or more additional S-SLOTs is assigned dynamically when topology makes it possible, dynamic S-SLOT allocation being equitably shared in a 2-hop neighbourhood, and determined by performing S-SLOT spatial reuse.

Abstract: A method for managing node communications in a mobile ad-hoc network is provided where at least a node in the said network performs the following steps: identifying if it is a Potentially Disruptive Node (PDN) or a non-PDN node, a PDN node being a node that has a number of connected 1-hop neighbor nodes greater than a predetermined value K; when the node is identified as a PDN node, selecting a subset of its 1-hop neighbor nodes, the selected nodes being the only 1-hop neighbor nodes that are allowed to communicate directly with the PDN node, the selected nodes being called Bridge Nodes (BN), non-BN nodes being called Regular Nodes (RN), the said RN nodes being able to communicate with PDN nodes via the selected BN nodes.

Abstract: A method for managing node communications in a mobile ad-hoc network is provided where at least a node in the said network performs the following steps: identifying if it is a Potentially Disruptive Node (PDN) or a non-PDN node, a PDN node being a node that has a number of connected 1-hop neighbour nodes greater than a predetermined value K; when the node is identified as a PDN node, selecting a subset of its 1-hop neighbour nodes, the selected nodes being the only 1-hop neighbour nodes that are allowed to communicate directly with the PDN node, the selected nodes being called Bridge Nodes (BN), non-BN nodes being called Regular Nodes (RN), the said RN nodes being able to communicate with PDN nodes via the selected BN nodes.

Abstract: A distributed synchronization method in a communication network is disclosed. A number of stations exchange messages between themselves. A synchronization pattern characteristic of the clock reference of the sender is inserted into each message transmitted by a sender. The clock reference of each station is updated with the clock reference that it receives from another station of the network if, and only if, the received time is leading the clock reference. The update is done by calculating the difference ?X=T?a?Ta between the time of sending T?a of the message received by a station A and the time of reception Ta of the same message by the station B, and applying a correction 0<?Y<=?X if the received time of sending is leading by a quantity of at least ? (?X>?>0).

Abstract: A distributed synchronization method in a communication network comprising a number of stations exchanging messages between themselves comprising at least the following steps: inserting into each message transmitted by a sender a synchronization pattern characteristic of the clock reference of the sender, updating the clock reference of each station with the clock reference that it receives from another station of the network if, and only if, the received time is leading the clock reference, the update being done as follows: calculating the difference ?X=T?a?Ta between the time of sending T?a of the message received by a station A and the time of reception Ta of the same message by the station B, applying a correction 0<?Y<=?X if the received time of sending is leading by a quantity of at least ? (?X>?>0).