Abstract
Due to the lack of dependency on beacon messages for location exchange, the beaconless geographic routing protocol has attracted considerable attention from the research community. However, existing beaconless geographic routing protocols are likely to generate duplicated data packets when multiple winners in the greedy area are selected. Furthermore, these protocols are designed for a uniform sensor field, so they cannot be directly applied to practical irregular sensor fields with partial voids. To prevent the failure of finding a forwarding node and to remove unnecessary duplication, in this paper, we propose a region-based collision avoidance beaconless geographic routing protocol to increase forwarding opportunities for randomly-deployed sensor networks. By employing different contention priorities into the mutually-communicable nodes and the rest of the nodes in the greedy area, every neighbor node in the greedy area can be used for data forwarding without any packet duplication. Moreover, simulation results are given to demonstrate the increased packet delivery ratio and shorten end-to-end delay, rather than well-referred comparative protocols.
Highlights
The geographic routing protocol requires nodes to know the position of their neighbors for forwarding data, so each node periodically exchanges HELLO messages, including its position with its neighbors.periodical message exchange can be another overhead when considering the node’s constraints in wireless sensor networks
If some of the neighbors in the greedy area cannot hear the message of other neighbors, because any two nodes may be possibly out of the radio range, it is hard to guarantee that every forwarding candidate overhears each other
Both Link quality and Geographical-aware OR protocol (LINGO) and XLINGO can provide realistic and practical dynamic forwarding delay (DFD) for beaconless routing, but they cannot be directly adopted to wireless sensor networks due to their strict route creation for the hidden terminal problem
Summary
The geographic routing protocol requires nodes to know the position of their neighbors for forwarding data, so each node periodically exchanges HELLO messages, including its position with its neighbors. If some of the neighbors in the greedy area cannot hear the message of other neighbors, because any two nodes may be possibly out of the radio range, it is hard to guarantee that every forwarding candidate overhears each other This circumstance is very similar to the hidden terminal problem in the 802.11 wireless networks, and it might lead to a large number of packet duplications in such overhearing-based beaconless routing protocols, due to multiple winners among these neighbors. Such a temporal difference allows a sender to know whether there is a partial hole in the high prioritized region without any control messages This information could give the sender an opportunity to select an appropriate next-hop forwarder in the rest of the area without the packet duplication problem.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
