Computational geometry: an introduction
Computational geometry: an introduction
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
LANDMARC: indoor location sensing using active RFID
Wireless Networks - Special issue: Pervasive computing and communications
Location Awareness in Unstructured Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
Contour map matching for event detection in sensor networks
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Skipping technique in face routing for wireless ad hoc and sensor networks
International Journal of Sensor Networks
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Routing techniques in wireless sensor networks: a survey
IEEE Wireless Communications
Geocasting with guaranteed delivery in sensor networks
IEEE Wireless Communications
Localized Delaunay triangulation with application in ad hoc wireless networks
IEEE Transactions on Parallel and Distributed Systems
Skipping technique in face routing for wireless ad hoc and sensor networks
International Journal of Sensor Networks
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
| Hi-index | 0.00 |
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.