Abstract
Greedy routing and face routing route data by using location information of nodes to solve scalability problem incurred in table-driven routing. Greedy routing efficiently routes data in dense networks, but it does not guarantee message delivery. Face routing has been designed to achieve guaranteed message delivery. Face routing, however, is not efficient in terms of routing path length. In this paper, we present a Skipping Face Routing (SFR) protocol to reduce the face traversal cost incurred in the existing approaches. In SFR, we specify a set of sufficient conditions so that each node can determine if it can skip some intermediate nodes during face traversing based solely on the neighbour information of the node, resulting in reduced total number of transmissions. By using simulation studies, we show that SFR significantly reduces the communication cost and traversal time required in face traversal compared with the existing approaches.
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.
