Minimum power assignment in wireless ad hoc networks with spanner property |
| |
Authors: | Yu Wang Xiang-Yang Li |
| |
Institution: | (1) Department of Computer Science, University of North Carolina at Charlotte, Charlotte, NC 28223, USA;(2) Department of Computer Science, Illinois Institute of Technology, Chicago, IL 60616, USA |
| |
Abstract: | 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.
The author is partially supported by NSF CCR-0311174. |
| |
Keywords: | Graph theory Power assignment Spanner Wireless ad hoc networks |
本文献已被 SpringerLink 等数据库收录! |
|