Generic energy-efficient geographic routing for ad-hoc wireless networks

Authors:
Chao-Lieh Chen;Jeng-Wei Lee;Cheng-Zh Lin;Yi-Tsung Chen;Jar-Shone Ker;Yau-Hwang Kuo
Affiliations:
Department of Electronic Engineering, Kun-Shan University, Yung-Kang, Tainan County, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan City, Taiwan;Advance Multimedia Internet Technology Corp., Tainan County, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan City, Taiwan;Advance Multimedia Internet Technology Corp., Tainan County, Taiwan;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan City, Taiwan
Venue:
EUC'07 Proceedings of the 2007 conference on Emerging direction in embedded and ubiquitous computing
Year:
2007

Citing 6
Cited 0

Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Location-aided routing (LAR) in mobile ad hoc networks

MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing

Proceedings of the 7th annual international conference on Mobile computing and networking
Span: an energy-efficient coordination algorithm for topology maintenance in ad hoc wireless networks

Wireless Networks
Energy-Efficient Communication Protocol for Wireless Microsensor Networks

HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Ad-hoc On-Demand Distance Vector Routing

WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The proposed energy-efficient geographical routing (EGR) mechanism is generally applicable to reduce energy consumption in wireless communication networks. No matter for table-driven or on-demand ad-hoc routing algorithms, EGR enhances them by constructing an initial routing path considering location information. Then, to further improve energy utilization it selects relay nodes of links on the initial path. The EGR finds an optimum relay node in a relay region between any two traffic nodes to conserve energy and balance traffic load. The relay region is derived from the radio propagation model constraining energy-saving when relaying transmissions between two nodes. Any node within this region is a relaying candidate to decrease total traffic energy consumption and to balance traffic load. According to the Energy-Proportional Principle (EPP), we also propose an energy-saving criterion. To balance traffic load, the EGR follows the EPP and in the relay region selects the relay node with the highest score corresponding to the criterion. Compared to the traditional routing methods, EGR effectively utilizes energy and prolongs network lifetime.