Abstract: A data communication method implemented by a sensor node of a telecommunications network including a plurality of sensor nodes and a concentrator node, which share a communication channel. The method includes: selecting a time interval in a contention window including a plurality of time intervals and preceding a transmission period including a plurality of transmission intervals; emitting a request signal during the selected time interval to the concentrator node; receiving a response signal carrying encoded information representing an ordered combination of the intervals marked during which the signals were received by the concentrator node; determining a transmission rank according to a number of intervals marked by the concentrator node; and deciding to emit data to the concentrator node in the transmission period when the transmission rank is lower than or equal to the number of intervals of the transmission period.

Abstract: A data communication method implemented by a sensor node of a telecommunications network including a plurality of sensor nodes and a concentrator node, which share a communication channel. The method includes: selecting a time interval in a contention window including a plurality of time intervals and preceding a transmission period including a plurality of transmission intervals; emitting a request signal during the selected time interval to the concentrator node; receiving a response signal carrying encoded information representing an ordered combination of the intervals marked during which the signals were received by the concentrator node; determining a transmission rank according to a number of intervals marked by the concentrator node; and deciding to emit data to the concentrator node in the transmission period when the transmission rank is lower than or equal to the number of intervals of the transmission period.

Abstract: A method for a node to transmit data in a telecommunications network is disclosed. In one method aspect, it comprises, selecting a time slot j in a window having a plurality of time slots and preceding a transmission period, listening to time slots preceding the time slot j, wherein the transmission period presents a plurality of transmission channels. Furthermore, the method comprises counting a number of time-slot transmissions during the time slots preceding the time slot j wherein when the number of time-slot transmissions is greater than a threshold, the data transmission is postponed or cancelled. Furthermore, when the number of time-slot transmissions is less than or equal to the threshold, a transmission is made during the time slot j, and one of the transmission channels is determined as a function of the number of time-slot transmissions.

Abstract: Disclosed is a method for calculating a route for a transfer of data between a source node and a destination node via at least one intermediate node in a network comprising a plurality of nodes, which, for a current node of said route, comprises a set of nodes adjacent to said current node. The method is suitable for selecting a selection law from a set of selection laws and for choosing an intermediate node according to the current node, by applying the selected law to all or a portion of the nodes of the predetermined set for the current node. Also disclosed is a node-forming device which implements the route calculation method.

Abstract: A method for a node to transmit data in a telecommunications network is disclosed. In one method aspect, it comprises, selecting a time slot j in a window having a plurality of time slots and preceding a transmission period, listening to time slots preceding the time slot j, wherein the transmission period presents a plurality of transmission channels. Furthermore, the method comprises counting a number of time-slot transmissions during the time slots preceding the time slot j wherein when the number of time-slot transmissions is greater than a threshold, the data transmission is postponed or cancelled. Furthermore, when the number of time-slot transmissions is less than or equal to the threshold, a transmission is made during the time slot j, and one of the transmission channels is determined as a function of said number of time-slot transmissions.

Abstract: A system and method organize a network of communicating objects in at least one partition comprising a plurality of communication cells respectively covered by a plurality of leader nodes, the network having a set of allocatable addresses split into a plurality of address pools distributively managed by the leader nodes. Upon a new node arrival, phase (a) and possibly phase (b) are executed. During phase (a), if the new node detects a leader node, it allocates an address from its managed address pool and the new node assumes a member node roll in the leader node cell. If the new node does not detect any leader node in its vicinity, it goes on to the phase (b), wherein, if the new node detects a first cell member node, it assumes the role of leader covering a second cell, obtains an available pool of managed addresses and is allocated one of the obtained addresses.

Abstract: A system and method organize a network of communicating objects in at least one partition comprising a plurality of communication cells respectively covered by a plurality of leader nodes, the network having a set of allocatable addresses split into a plurality of address pools distributively managed by the leader nodes. Upon a new node arrival, phase (a) and possibly phase (b) are executed. During phase (a), if the new node detects a leader node, it allocates address from its managed address pool and the new node assumes a member node roll in the leader node cell. If the new node does not detect any leader node in its vicinity, it goes on to the phase b). (b), wherein, if the new node detects a first cell member node, it assumes the role of leader covering a second cell, obtains an available pool of managed addresses and is allocated one of the obtained addresses.