References

Alzoubi, K., P.J. Wan and O. Frieder, 2002. New distributed algorithm for connected dominating set in wireless ad hoc networks. Proceedings of the 35th Annual Hawaii International Conference on System Sciences, Jan. 7-10, Washington, DC., USA., pp: 3849-3855.

Azarderakhsh, R., A.H. Jahangir and M. Keshtgary, 2006. A new virtual backbone for wireless ad-hoc sensor networks with connected dominating set. Proceedings of the 3rd Annual Conference on Wireless On-demand Network Systems and Services (WONS’06), January 30, 2006, Open Access Publishing, France, pp: 191-195.

Barbut, M., 1970. Ordre et classification. Hachette Universite, Paris, France, Pages : 176.

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.M. Pardalos (Eds.). Chapter 4, Kluwer Academic Publishers, Dordrecht, The Netherlands, ISBN: 978-1-4613-7947-8, pp: 61-73.

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.

Das, B. and V. Bharghavan, 1997. Routing in Ad-Hoc networks using minimum connected dominating sets. Proceedings of the IEEE International Conference on Communications, June 8-12, 1997, Montreal, Que, pp: 376-380.

Guha, S. and S. Khuller, 1998. Approximation algorithms for connected dominating sets. Algorithmica, 20: 374-387.
CrossRef  |  

Jeremy, B., D. Min, T. Andrew and C. Xiuzhen, 2004. Connected Dominating Set in Sensor Networks and MANETs. In: Handbook of Combinatorial Optimization, Du, D.Z. and P. Pardalos (Eds.). Springer, USA., pp: 329-369.

Kaviya, P. and G. Sankareeswari, 2014. Connected dominating set construction a1gorithm for wireless sensor networks: A survey. Intl. J. Sci. Res. Dev., 2: 316-319.
Direct Link  |  

Liu, Z., B. Wang and Q. Tang, 2010. Approximation two independent sets based connected dominating set construction algorithm for wireless sensor networks. Inform. Technol. J., 9: 864-876.
CrossRef  |  Direct Link  |  

Moulahi, T., S. Touil, S. Nasri and H. Guyennet, 2016. Reliable relay‐based broadcasting through formal concept analysis for WSNs. Secur. Commun. Netw., 9: 2042-2050.
CrossRef  |  Direct Link  |  

Rai, M., S. Verma and S. Tapaswi, 2009. A power aware minimum connected dominating set for wireless sensor networks. J. Netw., 4: 511-519.
Direct Link  |  

Torkestani, J.A. and M.R. Meybodi, 2010. An intelligent backbone formation algorithm for wireless ad hoc networks based on distributed learning automata. Comput. Networks, 54: 826-843.
CrossRef  |  

Wan, P.J., K.M. Alzoubi and O. Frieder, 2002. Distributed construction of connected dominating set in wireless ad hoc networks. Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies, June 23-27, 2002, New York, USA., pp: 1597-1604.

Wille, R., 1982. Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts. In: Ordered Sets, Rival, I. (Ed.). D. Reidel Pub. Co., USA., pp: 445-470.

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, August 20, 1999, Seattle, WA., USA., pp: 7-14.