• DocumentCode
    1928946
  • Title

    The Reconfiguration Problem in Sensor Networks: An Optimization Approach

  • Author

    Ould-Ahmed-Vall, El Moustapha ; Riley, George F. ; Heck, Bonnie S.

  • Author_Institution
    Georgia Institute of Technology, USA
  • fYear
    2006
  • fDate
    2006
  • Firstpage
    130
  • Lastpage
    130
  • 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. 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.
  • Keywords
    Computer networks; Costs; Electronic mail; Integer linear programming; Intelligent networks; Linear programming; Maintenance engineering; Quality of service; Turning; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Principles of Advanced and Distributed Simulation, 2006. PADS 2006. 20th Workshop on
  • Conference_Location
    Singapore
  • ISSN
    1087-4097
  • Print_ISBN
    0-7695-2587-3
  • Type

    conf

  • DOI
    10.1109/PADS.2006.35
  • Filename
    1630718