Article ID: | iaor20115199 |
Volume: | 10 |
Issue: | 2 |
Start Page Number: | 205 |
End Page Number: | 212 |
Publication Date: | Jun 2011 |
Journal: | Journal of Mathematical Modelling and Algorithms |
Authors: | Jarray Fethi |
Keywords: | programming: integer, combinatorial optimization |
We study the dual power management problem in wireless sensor networks. Given a wireless sensor network with two possible power levels (heigh and low) for each sensor, the problem consists in minimizing the number of sensors assigned heigh power while ensuring the connectivity of the network. We formulate the problem by a binary integer programming model to minimize the total power consumption. Since the problem is NP‐complete, we provide an iterative approximation based on iterative methods in combinatorial optimization. We solve the separation subproblem as a minimum spanning tree.