EEGFGR: an energy-efficient greedy-face geographic routing for wireless sensor networks

Authors:
Tao Zi-Jin;Wu Yi;Gong Zheng-Hu
Affiliations:
School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China;School of Computer, National University of Defense Technology, Changsha, China
Venue:
NPC'07 Proceedings of the 2007 IFIP international conference on Network and parallel computing
Year:
2007

Citing 8
Cited 0

GPSR: greedy perimeter stateless routing for wireless networks

MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
On the Spanning Ratio of Gabriel Graphs and beta-skeletons

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Worst-Case optimal and average-case efficient geometric ad-hoc routing

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Path Vector Face Routing: Geographic Routing with Local Face Information

ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Geographic routing made practical

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Avoid 'void' in geographic routing for data aggregation in sensor networks

International Journal of Ad Hoc and Ubiquitous Computing
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The geographic routing technology is good for the self-organizing and large-scale Wireless Sensor Networks(WSNs), and the energy-limited sensor nodes require the energy used for routing to be minimum. In this paper a new energy-efficient geographic routing algorithm is proposed and it is distributed and based on the geographic routing, the topology characteristics of the network and the wireless communication energy model. The algorithm is based on the planarized graph (GG) of the network, it deals with the routing void by saving more face neighbors in every node, and selects the most energy-efficient nexthop node by using the energy-saving technologies including the Minimum Energy One-hop Neighbor Path Selection and the Optimal Faceneighbor Selection. The theoretical analysis and simulations show that the algorithm is feasible and more energy-efficient than many existed geographic routing algorithms. In the end, the means of face information maintenance are proposed.