Abstract
This paper presents a geographic routing protocol, boundary state routing (BSR), which consists of two components. The first is an improved forwarding strategy, greedy-bounded compass, which can forward packets around concave boundaries, where the packet moves away from the destination without looping. The second component is a boundary mapping protocol (BMP), which is used to maintain link state information for boundaries containing concave vertices. The proposed forwarding strategy greedy-bounded compass is shown to produce a higher rate of path completion than Greedy forwarding and significantly improves the performance of greedy perimeter state routing (GPSR) in sparse networks when used in place of greedy forwarding. The proposed geographic routing protocol BSR is shown to produce significant improvements in performance in comparison to GPSR in sparse networks due to informed decisions regarding the direction of boundary traversal at local minima.
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.
