A New Mathematical Formulation and a Heuristic for the Maximum Disjoint Set Covers Problem to Improve the Lifetime of the Wireless Sensor Network

One of the critical issues in wireless sensor network is the lifetime of the network. Since each sensor is equipped with a limited amount of battery capacity, efficient management of the battery powers is important to prolong the lifetime of the network. One possible network management scheme is to partition the sensors into disjoint sets, so that sensors in each of the disjoint sets can completely cover the targets. Then these sets are activated successively. As a result, the larger the number of disjoint sets, the longer the lifetime of the network. In this paper, we propose a new BIP formulation and a new heuristic algorithm to find such disjoint sets. Compared with the previous researches, our formulation may be used to find an optimal solution much faster than the previous formulation and our heuristic is capable of finding good quality solutions quite fast.
Publisher
OLD CITY PUBLISHING INC
Issue Date
2011
Language
ENG
Article Type
Article
Citation

AD HOC SENSOR WIRELESS NETWORKS, v.13, no.3-4, pp.209 - 225

ISSN
1551-9899
URI
http://hdl.handle.net/10203/97913
Appears in Collection
IE-Journal Papers(저널논문)
  • Hit : 572
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 8 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0