Authors: Jie Lian, Kshirasagar Naik
Addresses: Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada. ' Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario N2L 3G1, Canada
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.
Keywords: location based routing; skipping face routing; sensor networks; ad hoc networks; wireless networks; face traversal cost; simulation; WSN.
International Journal of Sensor Networks, 2008 Vol.4 No.1/2, pp.92 - 103
Available online: 04 Jul 2008 *Full-text access for editors Access for subscribers Purchase this article Comment on this article