Abstract: A method implemented by computer to transmit data blocks formed by several data fragments, in a wireless network includes a plurality of nodes, the network having at least one routing path defined between a source node and a destination node and composed of a plurality of nodes such that three nodes at positions n/n+1/n+2 on the routing path define a child/parent/grandparent triad, the method comprising at least the following steps carried out on a triad of child, parent and grandparent nodes: sending from a child node a child/parent probing message, referred to as a “ping” message, to a parent node; sending from the parent node having received the “ping” message a parent/grandparent probing message, referred to as a “yin” message, to a grandparent node, if the parent node is available in a wait state; sending from the grandparent node having received the “yin” message a parent/grandparent probing response message, referred to as a “yang” message, to the parent node, if the grandparent node is available; send

Abstract: A method for selecting a router node in a LLN (Low power and Lossy Network) type telecommunication network wherein, upon receipt by a router node of a data packet from a host node or an adherence request to a multicast group from a host node, the router node transmits to a root node a MER_Request request of configuration as a multicast router node to serve the host node, and upon receipt of the MER_Request request, the root node determines, from an association table, a configuration of the router node and transmits to the router node a MER_Reply reply message including the determined configuration.

Abstract: A method for preselecting a router in a LLN (Lower power and Lossy Network) network from a plurality of nodes in which each router node transmits to the other router nodes of the LLN network within direct radio range of the router node an announcement message, and, upon receiving the announcement message, each of the other router nodes compares its current status with respect to a router node with the status indicated in the announcement message, and configures its status depending on the comparison so that a single node from among the nodes of the LLN network within direct radio range of the router node transmits to the root node a configuration request MER_Request as a multicast router for data from or intended for the host node.

Abstract: A method for selecting a router node in a LLN (Low power and Lossy Network) type telecommunication network wherein, upon receipt by a router node of a data packet from a host node or an adherence request to a multicast group from a host node, the router node transmits to a root node a MER_Request request of configuration as a multicast router node to serve the host node, and upon receipt of the MER_Request request, the root node determines, from an association table, a configuration of the router node and transmits to the router node a MER_Reply reply message including the determined configuration.

Abstract: A method equalizing sizes of data packets by blocks of a multimedia stream including a succession of data packets of variable sizes. The method includes: storing a group of N (a predefined integer) data packets in a buffer memory; computing average size Tm of a packet from the different sizes of the N packets; generating a base stream including N data packets to be transmitted, wherein each has a size equal either to the rounded-down integer part ?Tm?, or to the rounded-up integer part ?Tm? of the average size, and at least one additional stream including N redundant data packets computed from the base stream packets, having same size as the base stream packets, and intended to enable a receiver to restore any lost packets if the loss rate is greater than a predefined threshold; and transmitting the base stream and the additional stream(s) to the receivers.

Abstract: The invention relates to a method for routing in non-storing mode, a stream exchanged between a source and at least one receiver including the following steps: associating in a multicast routing table managed by a root node (4) the unicast address of the receiver and the multicast address of the group which the receiver has joined, sending the stream from the source to the root node, and, on receipt of the stream, the root node (4) generates a copy of the said stream, inserts in the packets of the copy of the generated stream a routing header including the unicast address of the addressee receiver of the stream, and sends the said stream to the receiver.

Abstract: A method equalizing sizes of data packets by blocks of a multimedia stream including a succession of data packets of variable sizes. The method includes: storing a group of N (a predefined integer) data packets in a buffer memory; computing average size Tm of a packet from the different sizes of the N packets; generating a base stream including N data packets to be transmitted, wherein each has a size equal either to the rounded-down integer part [Tm], or to the rounded-up integer part [Tm] of the average size, and at least one additional stream including N redundant data packets computed from the base stream packets, having same size as the base stream packets, and intended to enable a receiver to restore any lost packets if the loss rate is greater than a predefined threshold; and transmitting the base stream and the additional stream(s) to the receivers.

Abstract: A mobile communication network comprises a home agent supporting mobility of a mobile entity by generating bindings between a home address of the mobile entity and a care of address of the mobile entity. A mapping processor provides at least one set of mappings between a potential future care of address for a mobile entity and a real time characteristic criterion. The mappings may for example be determined in response to previous movements of the mobile entity in the communication network. A processor determines a real time characteristic and the home agent is arranged to change a binding between the home address and a current care of address in response to the at least one set of mappings and the real time characteristic, and without receiving binding updates from the mobile entity. The approach may allow support for mobility of a mobile entity while reducing signalling in support of mobility.

Abstract: A mobile communication network comprises a home agent supporting mobility of a mobile entity by generating bindings between a home address of the mobile entity and a care of address of the mobile entity. A mapping processor provides at least one set of mappings between a potential future care of address for a mobile entity and a real time characteristic criterion. The mappings may for example be determined in response to previous movements of the mobile entity in the communication network. A processor determines a real time characteristic and the home agent is arranged to change a binding between the home address and a current care of address in response to the at least one set of mappings and the real time characteristic, and without receiving binding updates from the mobile entity. The approach may allow support for mobility of a mobile entity while reducing signalling in support of mobility.

Abstract: A method of inter-area rekeying of encryption keys in secure mobile muiticast communications, in which a Domain Group Controller Key Server (Domain GCKS) distributes Traffic Encryption Keys (TEK) to a plurality of local Group Controller Key Servers (local GCKS), and said local Group Controller Key Servers forward said Traffic Encryption Keys, encrypted using Key Encryption Keys (KEKi, KEKj) that are specific to the respective local Group Controller Key Server (local GCKSi, GCKSj), to group members, said local Group Controller Key Servers (GCKSi, GCKSj) constituting Extra Key Owner Lists (EKOLi, EKOLj) for group key management areas (areai, areaj) that distinguish group members (MMi, MMj) possessing Key Encryption Keys (KEKi, KEKj) and situated in the corresponding group key management area (areai, areaj) from group members (MMij) possessing Key Encryption Keys (KEKi) that were situated in the corresponding group key management area (areai) but are visiting another area (areaj).