Source-Initiated Geographical Data Flow for Wireless Ad Hoc and Sensor Networks

A novel source-initiated geographical data flow technique, called stateless weighted routing (SWR), is presented in this paper. Nodes keep only their own virtual geographical position and require no local topological information. Each node calculates the weight of its own. Initially, this value is its relative distance to the sink. Each node decides to retransmit or to drop the packet received by comparing its own weight to the weight of the sender and the weight of the sink, i.e, destination, which are contained in the received packet. The comparison actually provides the mean for stateless routing. Although the weight parameter includes only the distance information for the time being, it may also include QoS (quality of service) parameters such as the energy left at the node. QoS will definitely help to increase the lifetime of the system. Having had the feature of being stateless, the technique is made free from the use of excessive communications to handle the routing tables. The SWR provides braided-paths if not multi-paths, naturally which is essential to improve reliability and to serve for the time-critical data. The use of thresholds in retransmissions provides the system with a flexible and energy-efficient data flow. Moreover, to the best of our knowledge, the SWR is known to be the first stateless routing technique running independent of the MAC-layer underneath.

[1]  Ahmed Helmy,et al.  The effect of mobility-induced location errors on geographic routing in mobile ad hoc sensor networks: analysis and improvement using mobility prediction , 2004, IEEE Transactions on Mobile Computing.

[2]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[3]  Torsten Braun,et al.  Optimized Stateless Broadcasting in Wireless Multi-Hop Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[4]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[5]  Ivan Stojmenovic,et al.  Position Based Routing Algorithms for Ad Hoc Networks: A Taxonomy , 2004 .

[6]  Jörg Widmer,et al.  Beaconless Position-Based Routing for Mobile Ad-Hoc Networks , 2003 .

[7]  Marc Heissenbuttel A Novel Position-based and Beacon-less Routing Algorithm for Mobile Ad-Hoc Networks , 2003 .

[8]  Ivan Stojmenovic,et al.  Beaconless position based routing with guaranteed delivery for wireless ad-hoc and sensor networks , 2006 .

[9]  Mohamed F. Younis,et al.  A survey on routing protocols for wireless sensor networks , 2005, Ad Hoc Networks.

[10]  Viktor K. Prasanna,et al.  On communication models for algorithm design in networked sensor systems: A case study, , 2005, Pervasive Mob. Comput..

[11]  MUJDAT SOYTURK,et al.  THE CHALLENGES AND THE APPROACHES FOR THE GEOGRAPHIC ROUTING PROTOCOLS IN WIRELESS SENSOR NETWORKS , 2006 .

[12]  Chen Avin Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs , 2008, Internet Math..

[13]  Filipe Ara,et al.  Survey on Position-Based Routing 1 , 2006 .