An Iterative Exact Solution for the Dual Power Management Problem in Wireless Sensor Network

Authors:
Fethi Jarray
Affiliations:
Laboratoire CEDRIC-CNAM, Paris, France 75003 and Al-Imam University, Riyadh, Kingdom of Saudi Arabia
Venue:
Journal of Mathematical Modelling and Algorithms
Year:
2011

Citing 8
Cited 0

Power consumption in packet radio networks

Theoretical Computer Science
Algorithmic aspects of topology control problems for ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Topology control in wireless ad hoc and sensor networks

ACM Computing Surveys (CSUR)
On approximate optimal dual power assignment for biconnectivity and edge-biconnectivity

Theoretical Computer Science
Energy conservation in wireless sensor networks: A survey

Ad Hoc Networks
A multi-objective evolutionary algorithm for the deployment and power assignment problem in wireless sensor networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms

Ad Hoc Networks
Energy-efficient networking techniques for wireless sensor networks

MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.