The Community for Technology Leaders
2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation (2006)
Singapore
May 24, 2006 to May 26, 2006
ISSN: 1087-4097
ISBN: 0-7695-2587-3
pp: 130
El Moustapha Ould-Ahmed-Vall , Georgia Institute of Technology, USA
George F. Riley , Georgia Institute of Technology, USA
Bonnie S. Heck , Georgia Institute of Technology, USA
ABSTRACT
The objective of reconfiguration in sensor networks is to maximize the overall network lifetime while maintaining a minimum quality of service. This is performed by turning some of the nodes off whenever they are not needed to maintain the required quality of service. This requires a way of detecting node failures to reconfigure accordingly. <p>The reconfiguration problem can be formulated as an integer linear programming optimization problem. A solution to this problem consists of a binary vector, where a "0" in position k means that the corresponding node can turn itself off in the next reconfiguration period, while a "1" means that the node is required to remain active. A centralized solution to this problem is designed and implemented. However, this solution suffers high energy costs and long delays. In addition, it does not scale well with the network size. A cluster-based solution is derived, and we are currently working on a localized solution where nodes interact only with neighbors to decide whether to turn off or remain active.</p>
INDEX TERMS
null
CITATION
El Moustapha Ould-Ahmed-Vall, George F. Riley, Bonnie S. Heck, "The Reconfiguration Problem in Sensor Networks: An Optimization Approach", 2012 ACM/IEEE/SCS 26th Workshop on Principles of Advanced and Distributed Simulation, vol. 00, no. , pp. 130, 2006, doi:10.1109/PADS.2006.35
83 ms
(Ver 3.3 (11022016))