Abstract
Protocols such as Virtual Ring Routing (VRR) and Scalable Source Routing (SSR) provide DHT-inspired routing directly in the network layer. Being cross-layer approaches, they are expected to have a low control message overhead, which is important especially for wireless ad hoc networks. Both, VRR and SSR establish a virtual ring that links nodes in the address space. Establishing and maintaining this ring accounts for the major fraction of the protocols' control message overhead. In this paper, we consider theoretical results on graph linearization to seek a further improvement of the ring maintenance protocols. To this end, we re-investigate SSR's original ISPRP mechanism and compare it to the more recent linearization approach. Our results show that linearization converges more quickly. It also leads to significantly shorter source routes between ring neighbors. On the other hand, ISPRP is slightly more robust and needs less state on the nodes.
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.
