期刊论文详细信息
IEEE Access
An Enhanced Multi-Objective Non-Dominated Sorting Genetic Routing Algorithm for Improving the QoS in Wireless Sensor Networks
Mahmoud Moshref1  Saleh Al-Sharaeh1  Rizik Al-Sayyed2 
[1] Department of Computer Science, King Abdullah II School for IT, The University of Jordan, Amman, Jordan;Department of Information Technology, King Abdullah II School for IT, The University of Jordan, Amman, Jordan;
关键词: Quality of service;    wireless sensor networks;    multi-objective algorithms;    clustering;    scheduling;    pareto front;   
DOI  :  10.1109/ACCESS.2021.3122526
来源: DOAJ
【 摘 要 】

In recent years, Wireless Sensor Networks (WSNs) have benefitted from their integration with Internet of Things (IoT) applications. WSN usage for monitoring and tracing applications shows massive acceleration, whether indoors or outdoors. WSN is constructed from interconnected sensors, limited resource (battery), which requires considerable importance on deployment and routing strategies, to improve the performance of Quality of Service (QoS) in WSNs. Many of the existing strategies are based on metaheuristics algorithms such as Genetic Algorithms to resolve the problem. This research proposes a new algorithm, Enhanced Non-Dominated Sorting Genetic Routing Algorithm (ENSGRA), to improve the QoS in WSNs. The proposed algorithm relies on Non-Dominated Sorting Genetic Algorithm 3 (NSGA-III), but adjusts reference points through the use of a dynamic weighted clustered scheduled vector to obtain new solutions. Moreover, ENSGRA can be used to find an integration between two parents crossover with multi-parent crossover (MPX), to produce multiple children and improve new offspring to obtain the optimal Pareto Fronts (PF). This algorithm excels when compared with the lagged multi-objective jumping particle swarm optimization, Non-dominated Sorting Genetic Algorithm–II and NSGA-III in terms of the QoS model (31% optimization percentage). Results show that the proposed ENSGRA is superior over other algorithms in evaluation measures for multi-objective algorithms.

【 授权许可】

Unknown   

  文献评价指标  
  下载次数:0次 浏览次数:0次