Di-GAFR: Directed Greedy Adaptive Face-Based Routing

Authors:
Tao Yang;Ye Huang;Jianxin Chen;Geng Yang;Chunming Rong
Affiliations:
College of Computer Science, Nanjing University of Posts and Telecommunications(NJUPT),;College of Computer Science, Nanjing University of Posts and Telecommunications(NJUPT),;College of Computer Science, Nanjing University of Posts and Telecommunications(NJUPT),;College of Computer Science, Nanjing University of Posts and Telecommunications(NJUPT),;Department of Electrical and Computer Engineering, University of Stavanger,
Venue:
ATC '08 Proceedings of the 5th international conference on Autonomic and Trusted Computing
Year:
2008

Citing 6
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
Protocols and Architectures for Wireless Sensor Networks

Protocols and Architectures for Wireless Sensor Networks
Beacon location service: a location service for point-to-point routing in wireless sensor networks

Proceedings of the 6th international conference on Information processing in sensor networks
Communicating via fireflies: geographic routing on duty-cycled sensors

Proceedings of the 6th international conference on Information processing in sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present Di-GAFR, a novel WSN geometric routing algorithm containing greedy, face and directed routing. In Di-GAFR, forwarding decisions merely depend on information about a node's immediate neighbors in the network topology, which made the algorithm absolutely local and highly scalable. Additionally, we have proved that Di-GAFR was asymptotically optimal. Simulations demonstrate that Di-GAFR sufficiently outperforms other prominent algorithms, such as GPSR and GOAFR, in the "critical" region.