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

Abstract

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 ofService) 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 ifnot 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.

A Routing Algorithm for Mobile Multiple Sinks in Large-Scale Wireless Sensor Networks

“…It can be used with any number sink nodes without any modification in the routing protocol. MS-SWR protocol is based on the Stateless Weight Routing (SWR) protocol [15]. SWR is a new novel stateless and beaconless routing algorithm for wireless sensor and ad hoc networks.…”

“…Each node derives its weight value dynamically from its current position and also it may involve some QoS (Quality of Service) parameters such energy left at the node. Nodes away from the sink node usually has greater weight values with respect to closer ones, as the sink has a weight value 0 [15]. A weight diagram is shown in Fig.…”

“…If its weight value is between the transmitting node's weight value and the destination's weight value, it rebroadcasts the packet, or drops the packet otherwise. The derived algorithm in [15] constructs multiple paths. Possible rebroadcasting nodes remain in the symmetric pedal curve shaped transmission area as shown Fig.…”

“…However, it is also show that GPRS and flooding do not exhibit the same performance enhancements without modification. Performance enhancement in the MS-SWR with respect to multiple-sink usage is related with the data flow approach presented in [15]. As the distance between the source node and the sink node becomes shorter, the number of retransmitting nodes (relay nodes) decreases.…”

“…In this paper, we show that mobile multiple sink usage enhances the energy-related performance metrics. The proposed algorithm is based on the data flow approach proposed in [14] and [15]. Mobility of the sink nodes enhances the performance of MS-SWR protocol due to reduction of transmissions in data flow to the sink.…”