A ROBUST AND EFFICIENT FLOODING-BASED ROUTING FOR WIRELESS SENSOR NETWORKS

Flooding protocols for wireless networks in general have been shown to be very inefficient and therefore are mainly used in network initialization or route discovery and maintenance. In this paper, we propose a framework of constrained flooding protocols. The framework incorporates a reinforcement learning kernel, a differential delay mechanism, and a constrained and probabilistic retransmission policy. This type of protocol takes the advantages of robustness from flooding, but maintains energy efficiency by constraining retransmissions. Without the use of any control packets, such a protocol adapts to the specific routing requirements of the task and the dynamic changes of the network. We analyze this framework in simulation using some real-world applications in sensor networks.

RNG RELAY SUBSET FLOODING PROTOCOLS IN MOBILE AD-HOC NETWORKS

In this paper, we study broadcasting protocols where nodes use some of their neighbors to forward messages. We propose a new protocol based on a variant of neighbor elimination scheme using RNG graph to ensure a full coverage of the network. The computation of RNG uses two kinds of distance: a geometrical one and and neighborhood-based distance that permits to use our protocol without positioning system. This protocol, called RRS for RNG Relay Subset, provides a self-selecting forwarding neighbor operating mode which guarantees a fair broadcast loading. In RRS a node v is a relay for a node u if and only if v is a neighbor of u and v has a RNG-neighbor which is not covered by u transmission. Moreover, experiments with 802.11-like MAC layer show that RRS is efficient.