Stateless Data Flow Approach with Void Avoidance for Wireless Ad Hoc and Sensor Networks

In this paper, we propose a void avoidance algorithm for the stateless weight routing (SWR) algorithm which was developed stateless geographical routing protocol for wireless sensor and ad hoc networks. In order to demonstrate the efficiency of the method we started with the illustration of transmission coverage of relay nodes during the course of routing in the SWR protocol. The threshold value to retransmit a packet defined in the SWR may be used for several purposes including elimination of the void problem. It can be shown that the threshold value provides a tool to balance the tradeoff between energy consumption and reliability.. A number of scenario has been considered to test the performance of the void avoidance (recovery!) algorithm. The initial simulation results indicates the proposed algorithm works with the SWR and providing it with an additional feature of adaptivity for wireless ad hoc and sensor networks.