Abstract
In a multihop wireless network, such as a wireless sensor network (WSN), with nodes being aware of their locations, the geographic routing scheme is an effective way of delivering packets to their destinations because of its 1-hop beacon broadcasting based routing related information exchange operation. The routing information obtained via 1-hop beaconing is local in the sense that it is just 1-hop compared to the multihop end-to-end routing. Hence, at some point, packets may experience no more place to be forwarded to (i.e., dead-ends). In this paper, we propose a geographical routing mechanism adopting the concept of the azimuth to reduce the possibility of packets confronting dead-ends. In other words, the node with a packet to be forwarded to the final destination figures out the next-hop node by utilizing the azimuth of the destination as a routing metric. Besides, we propose additional routing metrics for stable next-hop node selection to provide reliable IP connectivity. In order to validate the performance of the proposed routing mechanism, we evaluate its performance through the NS-2 based simulations and show that our mechanism outperforms the other schemes in terms of the packet delivery success rate, the end-to-end delay, and the number of dead-end encounters.
Highlights
With various and emerging IoT applications, seamless communication capability needs to be supported so that IP connectivity can be possible anywhere and anytime for any type of IoT services
The authors of [7] proposed the greedy perimeter stateless routing (GPSR) protocol in which a node determines the next-hop node of its packet by utilizing the location information in the beacon messages periodically broadcasted from its 1-hop neighbors
For each of the determined dead-end nonencountering neighbor nodes, that is, the real candidates for the next-hop node, the position of the azimuth θd (PA) is compared at first and, for the resolution of a tie, the progressed distance to the destination (PDD) and the number of possible routes (NPR) are used
Summary
With various and emerging IoT applications, seamless communication capability needs to be supported so that IP connectivity can be possible anywhere and anytime for any type of IoT services. We propose the geographical routing scheme with dead-end avoidance (RSDA) that provides reliable IP connectivity by selecting next-hop nodes with low possibility of encountering dead-ends. This can be achieved by utilizing the effectively summarized 2-hop neighbor information, the union range of the azimuth (URA), and the number of 2-hop neighbors (2HN). The rest of the paper is organized as follows: in Section 2, the operations of the greedy perimeter stateless routing (GPSR) [7] and the DR mechanisms are described in detail because their performance will be compared with ours.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
