Maximum-residual multicasting and aggregating in wireless ad hoc networks

  • Authors:

  • Pi-Cheng Hsiu;Chin-Hsien Wu;Tei-Wei Kuo

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, ROC 106;Department of Electronic Engineering, National Taiwan University of Science and Technology, Taipei, Taiwan, ROC 106;Department of Computer Science and Information Engineering, Graduate Institute of Networking and Multimedia, National Taiwan University, Taipei, Taiwan, ROC 106

  • Venue:
  • Wireless Networks
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.