A survey on connected dominating set construction algorithm for wireless sensor networks

Information Technology Journal

Volumn 9, Issue 6, 2010, Pages 1081-1092

  Liu, Zhuo ^a   Wang, Bingwen ^a   Guo, Lejiang ^a  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

CDS; Connected dominating set; Construction algorithm; MIS; WSN

Indexed keywords

CLUSTERING ALGORITHMS; ENERGY EFFICIENCY; MANAGEMENT INFORMATION SYSTEMS; SENSOR NODES; SURVEYS;

CONNECTED DOMINATING SET; CONNECTED DOMINATING SETS; CONSTRUCTION ALGORITHMS; EFFICIENT DESIGNS; ENERGY EFFICIENT ALGORITHMS; ENERGY-CONSTRAINED; NODE FAILURE; VIRTUAL BACKBONE;

WIRELESS SENSOR NETWORKS;

EID: 77954531375     PISSN: 18125638     EISSN: 18125646     Source Type: Journal    
DOI: 10.3923/itj.2010.1081.1092     Document Type: Article

References (44)

1. Abbasi, A.A. and M. Younis, 2007. A survey on clustering algorithms for wireless sensor networks. Comput. Commun., 30: 2826-2841. (Pubitemid 47445736)
2. Akyildiz, I.F., W. Su, Y. Sankarasubramaniam and E. Cayirci, 2002a. Wireless sensor networks: A survey. Comput. Networks, 38: 393-422.
3. Alzoubi, K.M., P.J. Wan and O. Frieder, 2002a. Distributed heuristics for connected dominating sets in wireless ad hoc networks. J. Commun. Networks, 4: 22-29.
4. Alzoubi, K.M., P.J. Wan and O. Frieder, 2002b. Message-optimal connected dominating sets in mobile ad hoc networks. Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, June 9-11, Lausanne, Switzerland, pp: 157-164.
5. Alzoubi, K.M., P.J. Wan and O. Frieder, 2003. Maximal independent set, weakly connected dominating set and induced spanners for mobile ad hoc networks. Int. J. Found. Comput. Sci., 14: 287-303.
6. Bharghavan, V. and B. Das, 1999. Routing in ad hoc networks using minimum connected dominating sets. Proceedings of the International Conference on Communications, (ICC'99), Montreal, Canada, pp: 376-380.
7. Butenko, S., X. Cheng, C. Oliveira and P.M. Pardalos, 2004. A New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks. In: Recent Developments in Cooperative Control and Optimization, Butenko, S., R. Murphey and P. Pardalos (Eds.). Kluwer Academic Publishers, Boston, pp: 61-73.
8. Cadei, M., X. Cheng and D.Z. Du, 2002. Connected domination in ad hoc wireless networks. Proceedings of the 6th International Conference on Computer Science and Informatics, (ICCST02), Durham, NC, USA., pp: 1-5.
9. Chen, G. and I. Stojmenovic, 1999. Clustering and routing in wireless ad hoc networks. Technical Report TR-99-105, Computer Science, SITE, University of Ottawa.
10. Cheng, X., M. Ding, D.H. Du and X. Jia, 2004. On the construction of connected dominating set in ad hoc wireless networks. To Appear in Special Issue on Ad Hoc Networks of Wireless Communications and Mobile Computing.
11. Chong, C.Y. and S.P. Kumar, 2003. Sensor networks: Evolution, opportunities and challenges. Proc. IEEE, 91: 1247-1256.
12. Chvátal, V., 1979. A greedy heuristic for the set-covering problem. Math. Operat. Res., 4: 233-235.
13. Cidon, I. and O. Mokryn, 1998. Propagation and leader election in multihop broadcast environment. Proceedings of the 12th International Symposium on Distributed Computing, Sept. 24-26, Springer-Verlag, pp: 104-119.
14. Dai, F. and J. Wu, 2004. An extended localized algorithms for connected dominating set formation in ad hoc wireless networks. IEEE Trans. Parallel Distributed Syst, 15: 908-920.
15. Das, B. and V. Bharghavan, 1997. Routing in ad hoc networks using minimum connected dominating sets. Proc. IEEE Int. Conf. Commun., 1: 376-380.
16. Das, B., R. Sivakumar and V. Bharghavan, 1997. Routing in ad hoc networks using a spine. Proceedings of the 6th International Conference on Computer Communications and Networks, Sept. 22-25, Washington, DC, USA., pp: 34-34
17. Deborah, E., G. Ramesh, H. John and S. Kumar, 1999. Next century challenges: Scalable coordination in sensor networks. Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Aug. 15-19, Seattle, Washington, USA., pp: 263-270.
18. Funke, S., A. Kesselman, U. Meyer and M. Segal, 2006. A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sensor Networks, 2: 444-453.
19. Gao, B., Y. Yang and H. Ma, 2005. A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks. Int. J. Commnn. Syst, 18: 743-762.
20. Gerla, M. and J.T. Tsai, 1995. Multicluster, mobile, multimedia radio network. ACM-Baltzer J. Wireless Networks, 1: 255-265.
21. Guha, S. and S. Khuller, 1998. Approximation algorithms for connected dominating sets. Algorithmica, 20: 374-387.
22. Jeremy, B., D. Min, T. Andrew and C. Xiuzhen, 2004. Connected Dominating Set in Sensor Networks and MANETs. Handbook of Combinatorial Optimization, Springer, US.,.
23. Kahn, J.M., R.H. Katz and K.S.J. Pister, 1999. Next century challenges: Mobile networking for smart dust. Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, Aug. 15-19, Seattle, WA., pp: 271-278.
24. Li, Y., S. Zhu, M.T. Thai and D.Z. Du, 2004. Localized construction of connected dominating set in wireless networks. Proceedings of US Nat'l Science Foundation Int'l Workshop Theoretical Aspects of Wireless Ad Hoc, Sensor and Peer-to-Peer Networks.
25. Li, Y., M.T. Thai, W. Feng, C.W. Yi, P.J. Wan and D.Z. Du, 2005. On greedy construction of connected dominating sets in wireless networks. Wireless Commun. Mobile Comput, 5: 927-932.
26. Lin, C.R. and M. Gerla, 1997. Adaptive clustering for mobile wireless networks. IEEE J. Selected Areas Commun., 15: 1265-1275.
27. Liu, Z., B. Wang and Q. Tang, 2010a. Approximation two independent sets based connected dominating set construction algorithm for wireless sensor networks. Inform. Technol. J., Volume: 9.
28. Liu, Z., B. Wang and W. Yang, 2010b. Design and deployment of bridge structual health monitoring system based on wireless sensor network. 6th International conference on wireless communications networking and mobile computing.
29. Misra, R. and C. Mandal, 2010. Minimum connected dominating set using a collaborative cover heuristic for ad hoc sensor networks. IEEE Trans. Parallel Distributed Syst, 21: 292-302.
30. Pottie, G.J. and W.J. Kaiser, 2000. Embedding the internet: Wireless integrated network sensors. ACM Commun., 43: 51-58.
31. Rabaey, J.M., M. Josie Ammer, J.L. da Silva, D. Patel and S. Roundy, 2000. PicoRadio supports ad hoc ultra low power wireless networking. Computer, 33: 42-48.
32. Raei, H., M. Sarram, F. Adibniya and F. Tashtarian, 2008. Optimal distributed algorithm for minimum connected dominating sets in wireless sensor networks. Proceedings of the 5th IEEE International Conference on Mobile Ad Hoc and Sensor Systems, Sept. 29-Oct. 2, Atlanta, GA., pp: 695-700.
33. Raei, H., M.A. Fathi, A. Akhlaghi and B. Ahmadipoor, 2009. A new distributed algorithm for virtual backbone in wireless sensor networks with different transmission ranges. Proceeding of the IEEE/ACS International Conference on Computer Systems and Applications, May 10-13, USA., pp: 983-988.
34. Rai, M., S. Verma and S. Tapaswi, 2009. A heuristic for minimum connected dominating set with local repair for wireless sensor networks. Proceedings of the 8th International Conference on Networks, March 1-6, Washington, DC, USA., pp: 106-111.
35. Rong, X., Q. Deyu, L. Yongjun and Z.W. James, 2009. A novel distributed MCDS approximation algorithm for wireless sensor networks. Wireless Commun. Mobile Comput, 9: 427-437.
36. Ruan, L., H. Du, X. Jia, W. Wu, Y. Li and K. Ker-I, 2004. A greedy approximation for minimum connected dominating sets. Theor. Comput. Set, 329: 325-330.
37. Sivakumar, R., B. Das and V. Bharghavan, 1998. An improved spine-based infrastructure for routing in ad hoc networks. Proceedings of IEEE Symposium on Computer and Communication, June 1998, Athens, Greece, pp: 356-362.
38. Stojmenovic, I., M. Seddigh and J. Zunic, 2001. Dominating sets and neighbor elimination based broadcasting algorithms in wireless networks. Proc. IEEE Hawaii Int. Conf. Syst. Sci., 13: 14-25.
39. Thai, M.T., W. Feng, L. Dan, Z. Shiwei and D. Ding-Zhu, 2007. Connected dominating sets in wireless networks with different transmission ranges. IEEE Trans. Mobile Comput., 6: 721-730.
40. Wan, P.J., K.M. Alzoubi and O. Frieder, 2002. Distributed construction of connected dominating set in wireless ad hoc networks. Proceedings of IEEE 21st Annual Joint Conference of the IEEE Computer and Communications Societies, June 23-27, New York, pp: 1597-1604.
41. Wang, H., J. Elson, L. Girod, D. Estrin and K. Yao, 2003. Target classification and localization in habitat monitoring. Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, April 6-10, Hong Kong, China, pp: 1-4.
42. Wu, J. and H. Li, 1999. On calculating connected dominating set for efficient routing in ad hoc wireless networks. Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Aug. 20-20, Seattle, Washington, United States, pp: 7-14.
43. Yingchang, X., X. Kai, C. Wei, E.K. Park and R. Shmuel, 2009. Distributed virtual backbone construction in sensor networks with asymmetric links. Wireless Commun. Mobile Comput, 10.1002/wcm.810.
44. Zeng, Y., X. Jia and Y. He, 2006. Energy efficient distributed connected dominating sets construction in wireless sensor networks. Proceedings of the International Conference on Wireless Communications and Mobile Computing, July 3-6, Vancouver, British Columbia, Canada, pp: 797-802. (Pubitemid 46645292)