An optimization algorithm for the minimum k-connected m-dominating set problem in wireless sensor networks

Cited 12 time in webofscience Cited 0 time in scopus
  • Hit : 422
  • Download : 0
In wireless sensor networks (WSNs), virtual backbone has been proposed as the routing infra-structure and connected dominating set has been widely adopted as virtual backbone. However, since the sensors in WSNs are prone to failures, recent studies suggest that it is also important to maintain a certain degree of redundancy in the backbone. To construct a robust backbone, so called k-connected m-dominating set has been proposed. In this research, we propose an integer programming formulation and an optimal algorithm for the minimum k-connected m-dominating set problem. To the best of our knowledge, this is the first integer programming formulation for the problem, and extensive computational results show that our optimal algorithm is capable of finding a solution within a reasonable amount of time.
Publisher
SPRINGER
Issue Date
2015-04
Language
English
Article Type
Article
Citation

WIRELESS NETWORKS, v.21, no.3, pp.783 - 792

ISSN
1022-0038
DOI
10.1007/s11276-014-0819-6
URI
http://hdl.handle.net/10203/198285
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 12 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0