Journal of Combinatorial Optimization

, Volume 11, Issue 1, pp 99-112

First online:

Minimum power assignment in wireless ad hoc networks with spanner property

  • Yu WangAffiliated withDepartment of Computer Science, University of North Carolina at Charlotte Email author 
  • , Xiang-Yang LiAffiliated withDepartment of Computer Science, Illinois Institute of Technology

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research efforts have focused on finding the minimum power assignment to guarantee the connectivity or fault-tolerance of the network. In this paper, we study a new problem of finding the power assignment such that the induced communication graph is a spanner for the original communication graph when all nodes have the maximum power. Here, a spanner means that the length of the shortest path in the induced communication graph is at most a constant times of the length of the shortest path in the original communication graph. Polynomial time algorithm is given to minimize the maximum assigned power with spanner property. The algorithm also works for any other property that can be tested in polynomial time and is monotone. We then give a polynomial time approximation method to minimize the total transmission radius of all nodes. Finally, we propose two heuristics and conduct extensive simulations to study their performance when we aim to minimize the total assigned power of all nodes.


Graph theory Power assignment Spanner Wireless ad hoc networks