Paper Info
Title
Maximum-residual multicasting and aggregating in wireless ad hoc networks
Abstract
Power-aware routing in wireless ad hoc networks has been extensively explored in recent years, and various routing metrics were developed for the prolongation of network lifetime. This work studies power-aware routing so as to maximize the minimum remaining energy of all nodes after routing. This routing metric, referred to as Maximum-Residual Routing, aims at maintaining the minimum remaining energy as high as possible so as to delay the fist failure time of nodes in the network. In this paper, a polynomial-time optimal algorithm is proposed for Maximum-Residual Multicasting. We then show that Maximum-Residual Aggregating is $${\mathcal{NP}}$$ -hard and that, unless $${\mathcal{P = NP}},$$ its minimization version cannot be approximated within a ratio better than (2 驴 驴) for any 驴 0. The proposed routing algorithm for Maximum-Residual Multicasting can be applied to existing routing protocols, especially those based on the link-state approach. The capability of the algorithm was evaluated by a series of experiments, for which we have very encouraging results in network lifetime and load balance.
Year
DOI
Venue
2010
10.1007/s11276-009-0163-4
Wireless Networks
Keywords
DocType
Volume
Maximum-Residual Routing,Routing algorithms,Ad hoc networks
Journal
16
Issue
ISSN
Citations 
3
1022-0038
0
PageRank 
References 
Authors
0.34
23
3
Name
Order
Citations
PageRank
Pi-Cheng Hsiu139834.30
Chin-Hsien Wu241947.93
Tei-Wei Kuo33203326.35