|
 
|
[Jar11] An iterative exact solution for the dual power management problem in wireless sensor network
Revue Internationale avec comité de lecture : Journal Journal of Mathematical Modelling and Algorithms, pp. 205-212, 2011, (doi:10.1007/s10852-011-9152-6)Mots clés: Wireless sensor network; Maximum spanning tree; Iterative methods; Integer programming
Résumé:
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 .
Equipe:
oc
BibTeX
| @article { | |||
| Jar11, | |||
| title | = | "{An iterative exact solution for the dual power management problem in wireless sensor network}", | |
| author | = | "F. Jarray", | |
| journal | = | "Journal of Mathematical Modelling and Algorithms", | |
| year | = | 2011, | |
| pages | = | "205-212", | |
| doi | = | "10.1007/s10852-011-9152-6", | |
| } | |||
