An Optimization Algorithm for Minimum Connected Dominating Set Problem in Wireless Sensor Network

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 392
  • Download : 0
One of the critical issues in wireless sensor network is the design of a proper routing protocol. One possible approach is utilizing a virtual infrastructure, which is a subset of sensors to connect all the sensors in the network. Among the many virtual infrastructures, the connected dominating set is widely used. Since a small connected dominating set can help to decrease the protocol overhead and energy consumption, it is preferable to find a small sized connected dominating set. Although many algorithms have been suggested to construct a minimum connected dominating set, there have been few exact approaches. In this paper, we suggest an improved optimal algorithm for the minimum connected dominating set problem, and extensive computational results showed that our algorithm outperformed the previous exact algorithms. Also, we suggest a new heuristic algorithm to find the connected dominating set and computational results show that our algorithm is capable of finding good quality solutions quite fast.
Publisher
대한산업공학회
Issue Date
2011-09
Language
Korean
Citation

Industrial Engineeering & Management Systems, v.10, no.3, pp.221 - 231

ISSN
1598-7248
URI
http://hdl.handle.net/10203/102167
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0