Data gathering via mobile sink in WSNs using game theory and enhanced ant colony optimization

被引:0
作者
P. V. Pravija Raj
Ahmed M. Khedr
Zaher Al Aghbari
机构
[1] University of Sharjah,Department of Computer Science
[2] Zagazig University,Mathematics Department
来源
Wireless Networks | 2020年 / 26卷
关键词
Ant colony optimization (ACO); Data gathering (DG); Game theory (GT); Rendezvous points (RPs); Mobile sink (MS) trajectory; Wireless sensor network (WSN);
D O I
暂无
中图分类号
学科分类号
摘要
Optimal performance and improved lifetime are the most desirable design benchmarks for WSNs and the mechanism for data gathering is a major constituent influencing these standards. Several researchers have provided significant evidence on the advantage of mobile sink (MS) in performing effective gathering of relevant data. However, determining the trajectory for MS is an NP-hard-problem. Especially in delay-inevitable applications, it is challenging to select the best-stops or rendezvous points (RPs) for MS and also to design an efficient route for MS to gather data. To provide a suitable solution to these challenges, we propose in this paper, a game theory and enhanced ant colony based MS route selection and data gathering (GTAC-DG) technique. This is a distributed method of data gathering using MS, combining the optimal decision making skill of game theory in selecting the best RPs and computational swarm intelligence of enhanced ant colony optimization in choosing the best path for MS. GTAC-DG helps to reduce data transfer and management, energy consumption and delay in data delivery. The MS moves in a reliable and intelligent trajectory, extending the lifetime and conserving the energy of WSN. The simulation results prove the effectiveness of GTAC-DG in terms of metrics such as energy and network lifetime.
引用
收藏
页码:2983 / 2998
页数:15
相关论文
共 145 条
[1]  
Kim B-S(2019)Wireless sensor networks for big data systems Sensors 19 1565-10880
[2]  
Kim K-I(2019)Adaptive distributed service discovery protocol for Internet of Things based mobile wireless sensor networks IEEE Sensor Journal 19 10869-938
[3]  
Shah B(2019)SATC: A simulated annealing based tree construction and scheduling algorithm for minimizing aggregation time in wireless sensor networks Wireless Personal Communications 108 921-77387
[4]  
Chow F(2019)Cluster-tree routing scheme for data gathering in periodic monitoring applications IEEE Access 6 77372-1525
[5]  
Kim K(2018)An information entropy based-clustering algorithm in heterogeneous wireless sensor networks Wireless Networks 20 1515-18
[6]  
Osamy W(2014)IBLEACH: Effective LEACH protocol for wireless sensor networks Wireless Networks 2016 1-897
[7]  
Khedr AM(2016)Wireless sensor networks formation: Approaches and techniques Journal of Sensors 16 877-2721
[8]  
Salim A(2014)Distributed mobile sink routing for wireless sensor networks: A survey IEEE Communications Surveys & Tutorials 25 2697-118
[9]  
Osamy W(2019)E2SR2: An acknowledgement-based mobile sink routing protocol with rechargeable sensors for wireless sensor networks Wireless Networks 73 110-12
[10]  
El-sawy Ahmed A(2017)Energy efficient path selection for mobile sink and data gathering in wireless sensor networks AEU—International Journal of Electronics and Communications 96 1-128