Stateless data flow approach with void avoidance for wireless ad hoc and sensor networks

Mujdat Soyturk*, D. Turgay Altilar

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Citations (Scopus)

Abstract

In this paper, we propose a void avoidance algorithm for the Stateless Weight Routing (SWR) algorithm which is recently 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.

Original languageEnglish
Title of host publication2007 2nd International Symposium on Wireless Pervasive Computing
Pages252-257
Number of pages6
DOIs
Publication statusPublished - 2007
Event2007 2nd International Symposium on Wireless Pervasive Computing - San Juan, PR, United States
Duration: 5 Feb 20077 Feb 2007

Publication series

Name2007 2nd International Symposium on Wireless Pervasive Computing

Conference

Conference2007 2nd International Symposium on Wireless Pervasive Computing
Country/TerritoryUnited States
CitySan Juan, PR
Period5/02/077/02/07

Fingerprint

Dive into the research topics of 'Stateless data flow approach with void avoidance for wireless ad hoc and sensor networks'. Together they form a unique fingerprint.

Cite this