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

- Journal title : Industrial Engineering and Management Systems
- Volume 10, Issue 3, 2011, pp.221-231
- Publisher : Korean Institute of Industrial Engineers
- DOI : 10.7232/iems.2011.10.3.221

Title & Authors

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

Ahn, Nam-Su; Park, Sung-Soo;

Ahn, Nam-Su; Park, Sung-Soo;

Abstract

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.

Keywords

Connected Dominating Set;Cutting Plane;Integer Programming;Wireless Sensor Networks;

Language

English

References

1.

Alzoubi, K. M., Wan, P. J., and Frieder, O. (2002), Distributed Heuristics for Connected Dominating Sets in Wireless Ad hoc Networks, Journal of Communication Networks, 4(1), 22-29.

2.

Blum, J., Ding, M., Thaeler, A., and Cheng, X. (2004), Handbook of combinatorial optimization, Kluwer Academic Publishers, Netherlands.

3.

Carle, J. and Simplot-Ryl, D. (2004), Energy-efficient Area Monitoring for Sensor Networks, IEEE Computer Society, 37(2), 40-46.

4.

Chen, B., Jamieson, K., Balakrishnan, H., and Morris, R. (2002) Span: An Energy Efficient Coordination Algorithm for Topology Maintenance in Ad hoc Wireless Networks, ACM Wireless Networks, 8(5), 481-494.

5.

Chen, S., Ljubic, I., and Raghavan, S. (2010), The Regenerator Location Problem, Networks, 55, 205-220.

6.

Chen, Q., Fan, W. T., and Zhang, M. (2009), Distributed heuristic approximation algorithm for minimum connected dominating set, Computer Engineering, 35(10), 92-94.

7.

Cormen, T. H., Leiserson, C. E., and Rivest, R. L. (1989), Introduction to Algorithms, The MIT Press, New York.

8.

Dai, F. and Wu, J. (2004), An Extended Localized Algorithm for Connected Dominating Set Formation in Ad hoc Wireless Networks, IEEE Transaxtion on Paralel. Distributing, 15(10), 908-920.

9.

Fomin, F. V., Grandoni, F., and Kratsch, D. (2008), Solving Connected Dominating Set Faster Than $2^n$ , Algorithmica, 52, 153-166.

10.

Garey, M. R. and Johnson, D. S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco.

11.

Guha, S. and Khuller, S. (1998), Approximation algorithms for connected dominating sets, Algorithmica, 20, 374-387.

12.

Li, Y., Thai M. T., Wang, F., Yi, C. W., Wan, P. J., and Du, D. Z. (2005), On Greedy Construction of Connected Dominating Sets in Wireless Networks, Wireless Communication Mobile Computing, 5, 927-932.

13.

Min, M., Du, H., Jia, X., Huang, C. X., Huang, S. C. H., and Wu, W. (2006), Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks, Journalof Global Optimization, 35, 11-119.

14.

Morgan, M. and Grout, V. (2008), Finding Optimal Solutions to Backbone Minimisation Problems using Mixed Integer Programming, 7th International Network Conference, Plymouth, United Kingdom, 53-63.

15.

Ng, M. J. and Lu, I. T. (1999), A Peer-to-Peer Zonebased Two-level Link State Routing for Mobile Ad Hoc Networks, IEEE Journal on Selected Area Communication, 17(8), 1415-1425.

16.

Ni, S. Y., Tseng, Y. C., Chen, Y. S., and Sheu, J. P. (2002), The broadcast Storm Problem in a Mobile Ad hoc Network, Wireless Networks, 8, 153-167.

17.

Pei, G., Gerla, M., and Chen, T. W. (2000), Fisheye State Routing: A Routing Scheme for Ad hoc Wireless Networks, IEEE International Conference on Communication, New Orleans, LA, 70-74.

18.

Ruan, L., Du, H., Jia, X., Wu, W., Li, Y., and Ko, K. I. (2004), A Greedy Approximation for Minimum Connected Dominating Set, Theory of Computer Science, 329, 325-330.

19.

Sinha, P., Sivakumar, R., and Bharghavan, V. (2001), Enhancing Ad hoc Routing with Dynamic Virtual Infrastructures, 20th Annual Joint Conference of the IEEE Computer and Communications Societies, Anchorage, Alaska, 1763-1772.

20.

Stojmenovic, I., Seddigh, M., Zunic, J. (2002), Dominating Sets and Neighbor Elimination Based Broadcasting Algorithms in Wireless Networks, IEEE Transaction on Parallel Distributing, 13, 14-25.

21.

Thulasiraman, K. and Swamy, M. N. S. (1992), Graphs: Theory And Algorithms, Wiley, New York.

22.

Wang, L. Y., Zhang, Q., and Liu, A. M. (2009), Distributed MCDS constructing algorithm in Ad hoc networks, AppliedComputing, 26, 2241-2243.

23.

Wu, J., Li, H. (1999), On Calculating Connected Dominating Set for Efficient Routing in Adhoc Wireless Networks, 3rd ACM International Workshop on Discrete Algorithms and Methods for MOBILE Computing and Communications, Dallas, Texas, 7-14.

24.

Wu, J., Dai, F. (2004), A Generic Distributed Broadcast Scheme in Ad hoc Wireless Networks, IEEE Transaction on Computing, 53, 1343-1354.

25.

Yuan, D. (2005), Energy-Efficient Broadcasting in Wireless Ad Hoc Networks: Performance Benchmarking and Distributed Algorithms Based on Network Connectivity Characterizatio, 8th ACM International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems. Montreal, Canada, 28-35.