Abstract
To alleviate the broadcast storm problem in the route discovery process, this article proposes a novel routing protocol considering the boundary effects for ad hoc networks, named NRP. The novelty of NRP lies in the following: first, NRP defines a forwarding area criterion considering the effects of the node transmission area boundary to reduce the broken links due to the mobility of nodes; second, NRP adopts the idea of a piecewise function to estimate the node degree when the nodes are in the center, borderline, and corner areas, respectively, which considers the effects of both network boundaries and node communication boundaries without broadcasting Hello messages periodically; third, NRP applies the static game forwarding strategy to calculate the forwarding probability during the route discovery process. NRP reduces the redundant retransmissions and collision probability among neighboring nodes, thus improving the forwarding efficiency. The extensive simulation results by NS-2 simulator have shown that NRP performs better than AODV + FDG, AODV + Hello, ad hoc on-demand distance vector, ad hoc on-demand multipath distance vector, and energy-efficient ant-based routing in terms of packet delivery ratio, routing overhead, normalized medium access control load, throughput, and network lifetime.
Highlights
Ad hoc networks are temporary networks consisting of a special kind of wireless mobile nodes without any infrastructure or centralized administration, which have a wide application prospect in civil and military fields
On-demand routing protocols are highly concerned by researchers all over the world for their advantages, such as low routing overhead and no need for maintaining the whole network information
NRP and ad hoc on-demand distance vector (AODV) perform significantly better than AODV + FDG, AODV + Hello, ad hoc ondemand multipath distance vector (AOMDV), and efficient ant-based routing (EEABR)
Summary
Ad hoc networks are temporary networks consisting of a special kind of wireless mobile nodes without any infrastructure or centralized administration, which have a wide application prospect in civil and military fields. Neighbor number, is an efficient factor for calculating forwarding probability as described in the literature.[4,5,6,7,8,9] in the aforementioned studies, nodes need to periodically broadcast Hello messages to obtain node degrees, which consumes a large amount of energy and takes up a lot of bandwidth To overcome these obstacles, this article presents a novel routing protocol considering the boundary effects for ad hoc networks, named NRP. The rest of this article is organized as follows: section ‘‘Related work’’ introduces the related previous works; section ‘‘Node degree estimation and static game forwarding strategy–based ad hoc network routing protocol: NRP’’ proposes a node degree estimation algorithm considering boundary effects, and the NRP protocol and its implementation process are described in detail; section ‘‘Performance evaluation’’ verifies the performance of NRP using the NS-2 simulator; section ‘‘Conclusion and future work’’ concludes this article and follows the future work
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 callMore From: International Journal of Distributed Sensor Networks
Disclaimer: 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.
