The aim of a routing protocol is to compute routes between every couple of nodes. When the topology evolves over time, routing decisions should be constantly reconsidered to ensure continuous valid routing. Conventional proactive routing protocols periodically re-compute their routing-tables. However, due to their inherent nature based on shortest-paths, they select longer links (victims of rapid breakages as nodes move). Increasing the updates' frequency certainly allows a better tracking of the topology changes; however, it induces higher signaling overhead.

The host identity protocol-based (HIP) machine-to-machine (M2M) overlay network is a virtual, self-organised and secure M2M network build on the top of the internet. M2M devices forming this overlay network may change their point of attachment to the overlay while having running sessions. HIP provides a native mobility support to these M2M devices. However, this support is not adapted for the M2M context. We propose in this paper a regular and lightweight mobility strategies to efficiently handle M2M devices mobility within this overlay.

Graph coloring was exploited in wireless sensor networks to solve many optimization problems, mainly related to channel assignment. In this paper, we propose to use coloring to jointly manage channel access and routing to the sink. We introduce CHRA, a coloring based hierarchical routing approach. Coloring is exploited to avoid interferences and also to schedule nodes transmissions to the sink.

The efficiency of live Peer-to-Peer (P2P) streaming protocols depends on the appropriateness and the management abilities of their underlying overlay multicast. While a tree overlay structure confines transmission delays efficiently by maintaining deterministic delivery paths, an overlay mesh structure provides adequate resiliency to peers dynamics and easy maintenance. On the other hand, content freshness, playback fluidity and streaming continuity are still challenging issues that require viable solutions.