Wireless Networks

, Volume 16, Issue 3, pp 701–711

Maximum-residual multicasting and aggregating in wireless ad hoc networks

Authors

  • Pi-Cheng Hsiu
    • Department of Computer Science and Information EngineeringNational Taiwan University
  • Chin-Hsien Wu
    • Department of Electronic EngineeringNational Taiwan University of Science and Technology
    • Department of Computer Science and Information Engineering, Graduate Institute of Networking and MultimediaNational Taiwan University
Article

DOI: 10.1007/s11276-009-0163-4

Cite this article as:
Hsiu, P., Wu, C. & Kuo, T. Wireless Netw (2010) 16: 701. doi:10.1007/s11276-009-0163-4
  • 66 Views

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.

Keywords

Maximum-Residual RoutingRouting algorithmsAd hoc networks

Copyright information

© Springer Science+Business Media, LLC 2009