Skip to main content
Article thumbnail
Location of Repository

Power efficient range assignment in ad-hoc wireless networks

By E. Althaus, G. Călinescu, I. I. Măndoiu and A. Zelikovsky N. Tchervenski S. Prasad

Abstract

We study the problem of assigning transmission ranges to the nodes of ad hoc wireless networks so that to minimize power consumption while ensuring network connectivity. We give (1) an exact branch and cut algorithm based on a new integer linear program formulation solving instances with up to 35-40 nodes in 1 hour; (2) a proof that MIN-POWER SYMMETRIC CONNECTIVITY WITH ASYMMETRIC POWER REQUIREMENTS is inapproximable within £¥¤§¦©¨������� � �� � factor for ¨��� � any unless; (3) an improved analysis for two approximation algo-rithms recently proposed by Călinescu et al. (TCS’02), decreasing the best known approximation factor to �������� ¨ ; (4) a comprehensive experimental study comparing new and previously proposed heuristics with the above exact and approximation algorithms

Year: 2003
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.7398
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://suez.cs.gsu.edu/~cscazz... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.