Abdel-Rahman Hedar
ABSTRACT
Finding an efficient communication structure among wireless network access points and wireless sensor nodes is essential in optimizing energy consumption and minimizing broadcast latency. Wireless networks Can control their nodes for efficient resource utilization via Topology Control. A topology control based on obtaining Minimum Connected Dominating Set (MCDS) is an efficient approach for constructing wireless network virtual backbone. A virtual backbone reduces energy consumption, reduce communication interference, reduce routing latency, and increase the bandwidth. We propose a new parallel genetic algorithm with elite and diverse cores for constructing wireless network virtual backbone based on finding MCDS of wireless nodes to be used in wireless network topology control. There are predefined number parallel workers, an elite core and a diverse core. All parallel components run genetic operators, and the elite core selects elite solutions among processed sub-population. On the other hand, diverse core looks for new solutions upon receiving elite solution in addition to received processed sub-population. Experimental results show that this algorithm gives better results compared to other methods, particularly for high dimension graph, which is the case in wireless sensor networks. Actually, using parallelism and featured elite and diverse search could help the proposed method to achieve 100% better results compared to its predecessor versions of sequential genetic algorithms. In addition to that, the algorithm is very stable as each result match the average result.
- James Edward Baker. Adaptive selection methods for genetic algorithms. In Proceedings of an International Conference on Genetic Algorithms and their applications, pages 101--111. Hillsdale, New Jersey, 1985. Google Scholar
Digital Library
- Shankar M Banik and Sridhar Radhakrishnan. Minimizing broadcast latency in ad hoc wireless networks. In Proceedings of the 45th annual southeast regional conference, pages 533--534. ACM, 2007. Google ScholarDigital Library
- Paolo Casari and Albert F Harris. Energy-efficient reliable broadcast in underwater acoustic networks. In Proceedings of the second workshop on Underwater networks, pages 49--56. ACM, 2007. Google ScholarDigital Library
- Rodolfo WL Coutinho, Azzedine Boukerche, Luiz FM Vieira, and Antonio AF Loureiro. Gedar: geographic and opportunistic routing protocol with depth adjustment for mobile underwater sensor networks. In Communications (ICC), 2014 IEEE International Conference on, pages 251--256. IEEE, 2014.Google ScholarCross Ref
- Rodolfo WL Coutinho, Azzedine Boukerche, Luiz FM Vieira, and Antonio AF Loureiro. Underwater wireless sensor networks: A new challenge for topology control-based systems. ACM Computing Surveys (CSUR), 51(1):19, 2018. Google ScholarDigital Library
- Hongwei Du, Qiang Ye, Weili Wu, Wonjun Lee, Deying Li, Dingzhu Du, and Stephen Howard. Constant approximation for virtual backbone construction with guaranteed routing cost in wireless sensor networks. In INFOCOM, 2011 Proceedings IEEE, pages 1737--1744. IEEE, 2011.Google ScholarCross Ref
- Stefan Funke, Alexander Kesselman, Ulrich Meyer, and Michael Segal. A simple improved distributed algorithm for minimum cds in unit disk graphs. ACM Transactions on Sensor Networks (TOSN), 2(3):444--453, 2006. Google ScholarDigital Library
- Xiaofeng Gao, Xudong Zhu, Jun Li, Fan Wu, Guihai Chen, Ding-Zhu Du, and Shaojie Tang. A novel approximation for multi-hop connected clustering problem in wireless networks. IEEE/ACM Transactions on Networking, 25(4):2223--2234, 2017. Google ScholarDigital Library
- Xu Gong, David Plets, Emmeric Tanghe, Toon De Pessemier, Luc Martens, and Wout Joseph. An efficient genetic algorithm for large-scale planning of dense and robust industrial wireless networks. Expert Systems with Applications, 96:311--329, 2018. Google ScholarDigital Library
- Abdel-Rahman Hedar, Rashad Ismail, Gamal A El Sayed, and Khalid M Jamil Khayyat. Two meta-heuristics for the minimum connected dominating set problem with an application in wireless networks. In Applied Computing and Information Technology/2nd International Conference on Computational Science and Intelligence (ACIT-CSI), 2015 3rd International Conference on, pages 355--362. IEEE, 2015. Google ScholarDigital Library
- Abdel-Rahman Hedar, Rashad Ismail, Gamal A. El-Sayed, and Khalid M. Jamil Khayyat. Two meta-heuristics designed to solve the minimum connected dominating set problem for wireless networks design and management. Submitted, 2018.Google Scholar
- Francisco Herrera, Manuel Lozano, and Jose L. Verdegay. Tackling real-coded genetic algorithms: Operators and tools for behavioural analysis. Artificial intelligence review, 12(4):265--319, 1998. Google ScholarDigital Library
- Raka Jovanovic and Milan Tuba. Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem. Computer Science and Information Systems, 10(1):133--149, 2013.Google ScholarCross Ref
- Enan A Khalil and Suat Ozdemir. Prolonging stability period of cds based wsns. In Wireless Communications and Mobile Computing Conference (IWCMC), 2015 International, pages 776--781. IEEE, 2015.Google ScholarCross Ref
- Ruizhi Li, Shuli Hu, Jian Gao, Yupeng Zhou, Yiyuan Wang, and Minghao Yin. Grasp for connected dominating set problems. Neural Computing and Applications, pages 1--9, 2016. Google ScholarDigital Library
- Bei Liu, Wei Wang, Donghyun Kim, Deying Li, Jingyi Wang, Alade O Tokuta, and Yaolin Jiang. On approximating minimum 3-connected m-dominating set problem in unit disk graph. IEEE/ACM Transactions on Networking, 24(5):2690--2701, 2016. Google ScholarDigital Library
- Chuanwen Luo, Wenping Chen, Jiguo Yu, Yongcai Wang, and Deying Li. A novel centralized algorithm for constructing virtual backbones in wireless sensor networks. EURASIP Journal on Wireless Communications and Networking, 2018(1):55, 2018.Google ScholarCross Ref
- Chuanwen Luo, Yongcai Wang, Jiguo Yu, Wenping Chen, and Deying Li. A new greedy algorithm for constructing the minimum size connected dominating sets in wireless networks. In International Conference on Wireless Algorithms, Systems, and Applications, pages 109--114. Springer, 2017.Google ScholarCross Ref
- Yannis Manolopoulos, Dimitrios Katsaros, and Alexis Papadimitriou. Topology control algorithms for wireless sensor networks: a critical survey. In Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies, pages 1--10. ACM, 2010. Google ScholarDigital Library
- Usama Mehboob, Junaid Qadir, Salman Ali, and Athanasios Vasilakos. Genetic algorithms in wireless networking: techniques, applications, and issues. Soft Computing, 20(6):2467--2501, 2016. Google ScholarDigital Library
- Kais Mnif, Bo Rong, and Michel Kadoch. Virtual backbone based on mcds for topology control in wireless ad hoc networks. In Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks, pages 230--233. ACM, 2005. Google ScholarDigital Library
- Jasaswi Prasad Mohanty, Chittaranjan Mandal, and Chris Reade. Distributed construction of minimum connected dominating set in wireless sensor network using two-hop information. Computer Networks, 123:137--152, 2017.Google ScholarCross Ref
- Milen Nikolov and Zygmunt J Haas. Towards optimal broadcast in wireless networks. IEEE Transactions on Mobile Computing, 14(7):1530--1544, 2015.Google ScholarDigital Library
- Priyanka Rawat, Kamal Deep Singh, Hakima Chaouchi, and Jean Marie Bonnin. Wireless sensor networks: a survey on recent developments and potential synergies. The Journal of supercomputing, 68(1):1--48, 2014. Google ScholarDigital Library
- Yishuo Shi, Zhao Zhang, Yuchang Mo, and Ding-Zhu Du. Approximation algorithm for minimum weight fault-tolerant virtual backbone in unit disk graphs. IEEE/ACM Transactions on Networking (TON), 25(2):925--933, 2017. Google ScholarDigital Library
- Fahong Yu, Xiaoyun Xia, Wenping Li, Jiang Tao, Longhua Ma, and Zhao-quan Cai. Critical node identification for complex network based on a novel minimum connected dominating set. Soft Computing, 21(19):5621--5629, 2017. Google ScholarDigital Library
- Dingxing Zhang, Ming Xu, Wei Xiao, Junwen Gao, and Wenshen Tang. Minimization of the redundant sensor nodes in dense wireless sensor networks. In International Conference on Evolvable Systems, pages 355--367. Springer, 2007. Google ScholarDigital Library
- Jiao Zhou, Zhao Zhang, Shaojie Tang, Xiaohui Huang, Yuchang Mo, and Ding-Zhu Du. Fault-tolerant virtual backbone in heterogeneous wireless sensor network. IEEE/ACM Transactions on Networking, 25(6):3487--3499, 2017. Google ScholarDigital Library
Index Terms
- Parallel genetic algorithm with elite and diverse cores for solving the minimum connected dominating set problem in wireless networks topology control
Recommendations
A distributed algorithm for constructing energy-balanced connected dominating set in wireless sensor networks
One important characteristic of wireless sensor networks is stringent energy of sensor nodes. Constructing a Connected Dominating Set (CDS) as the backbone has been widely used as a topology control strategy to reduce the network communication overhead ...
Double elite co-evolutionary genetic algorithm
A new double elite co-evolutionary genetic algorithm is proposed to avoid the premature convergence and low speed of convergence based on the elite strategy and the concept of co-evolution. In the DECGA, the two different and high fitness individuals (...
Comments