Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/3231053.3231080acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicfndsConference Proceedingsconference-collections
research-article

Parallel genetic algorithm with elite and diverse cores for solving the minimum connected dominating set problem in wireless networks topology control

Published: 26 June 2018 Publication History

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.

References

[1]
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.
[2]
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.
[3]
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.
[4]
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.
[5]
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.
[6]
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.
[7]
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.
[8]
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.
[9]
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.
[10]
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.
[11]
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.
[12]
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.
[13]
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.
[14]
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.
[15]
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.
[16]
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.
[17]
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.
[18]
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.
[19]
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.
[20]
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.
[21]
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.
[22]
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.
[23]
Milen Nikolov and Zygmunt J Haas. Towards optimal broadcast in wireless networks. IEEE Transactions on Mobile Computing, 14(7):1530--1544, 2015.
[24]
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.
[25]
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.
[26]
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.
[27]
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.
[28]
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.

Cited By

View all
  • (2024)Adaptive Memory Differential Evolutionary Algorithm for Network Management Using Variants of Dominating Set Models2024 Intelligent Methods, Systems, and Applications (IMSA)10.1109/IMSA61967.2024.10652728(205-212)Online publication date: 13-Jul-2024
  • (2022)Polynomial Algorithm for Minimal (1,2)-Dominating Set in NetworksElectronics10.3390/electronics1103030011:3(300)Online publication date: 19-Jan-2022
  • (2021)Wireless Sensor Networks Management Using Differential Evolution and Minimum Dominating Sets2021 International Telecommunications Conference (ITC-Egypt)10.1109/ITC-Egypt52936.2021.9513962(1-5)Online publication date: 13-Jul-2021

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICFNDS '18: Proceedings of the 2nd International Conference on Future Networks and Distributed Systems
June 2018
469 pages
ISBN:9781450364287
DOI:10.1145/3231053
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 June 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. minimum connected dominating sets
  2. network topology control
  3. parallel genetic algorithm
  4. wireless networks

Qualifiers

  • Research-article

Funding Sources

  • Umm Al-Qura University

Conference

ICFNDS'18

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)1
Reflects downloads up to 21 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Adaptive Memory Differential Evolutionary Algorithm for Network Management Using Variants of Dominating Set Models2024 Intelligent Methods, Systems, and Applications (IMSA)10.1109/IMSA61967.2024.10652728(205-212)Online publication date: 13-Jul-2024
  • (2022)Polynomial Algorithm for Minimal (1,2)-Dominating Set in NetworksElectronics10.3390/electronics1103030011:3(300)Online publication date: 19-Jan-2022
  • (2021)Wireless Sensor Networks Management Using Differential Evolution and Minimum Dominating Sets2021 International Telecommunications Conference (ITC-Egypt)10.1109/ITC-Egypt52936.2021.9513962(1-5)Online publication date: 13-Jul-2021
  • (2020)Wireless Sensor Networks Fault-Tolerance Based on Graph Domination with Parallel Scatter SearchSensors10.3390/s2012350920:12(3509)Online publication date: 21-Jun-2020

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media