Skipping technique in face routing for wireless ad hoc and sensor networks
by Jie Lian, Kshirasagar Naik
International Journal of Sensor Networks (IJSNET), Vol. 4, No. 1/2, 2008

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.

Online publication date: Fri, 04-Jul-2008

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email