Computer Science ›› 2017, Vol. 44 ›› Issue (2): 147-151.doi: 10.11896/j.issn.1002-137X.2017.02.022

Previous Articles     Next Articles

Optimal Path Planning for Mobile Sink in Random Distributed Wireless Sensor Networks

CHANG Jie and ZHANG Ling   

  • Online:2018-11-13 Published:2018-11-13

Abstract: In wireless sensor networks with a large number of normally distributed nodes,in order to improve the network lifetime,an efficient path planning scheme of a mobile sink was proposed in this paper.Firstly,the network is divided into several subregions by the distribution of nodes.Then,the best turning point of sink on this basis is found in order to maximize the network life time.Finally,an optimal path is got.Lots of simulation results under NS-2 show that compared with existing similar schemes,this scheme can effectively balance the network energy consumption,prolong the network lifetime and achieve better network performance.

Key words: Random distributed,Mobile sink,Path planning,Network lifetime

[1] AKYILDIZI,SUW,SANKARASUBDAM Y.Wireless sensornetworks:a survey[J].Computer Networks,2002,38(4):393-422.
[2] TANG L,JIAN P,XIAO F W,et al.Research on the energy hole problem based on non-uniform node distribution for wireless sensor network[J].Transactions on Internet and Information Systems,2012,6(9):2017-2036.
[3] XUE W,LUO Q,CHEN L,et al.Contour mapmatching for event detection in sensor networks[C]∥Proc of the ACM SIGMOD.Chicago,USA,2006:375-380.
[4] LI Z J,LI M,WANG J L,et al.Ubiquitous data collection formobile users in wireless sensor networks[C]∥Poc of the IEEE INFOCOM.Shanghai,China,2011:2246-2254.
[5] LUO J,ZHANG Q,WANG D.Delay tolerant event collectionfor underground coal mine using mobile sinks[C]∥Proc of the IEEE IWQoS.Charleston,USA,2009:1-9.
[6] HUI X W,LIU Y M.ComprehensiveStudy on the Problem of Mobile Sink Path Planning and the Cluster Head Node Selecting in WSN Data Collection[J].Chinese Journal of Sensors and Actuators,2014,7(1):118-122.(in Chinese) 惠晓威,刘彦每.WSN数据收集中移动Sink的路径规划和簇头节点选取问题的综合研究[J].传感技术学报,2014,27(1):118-122.
[7] ZHANG L,ZHANG K.Mobile Sink-Based Data Gathering Algorithm in Wireless Sensor Networks[J].Chinese Journal of Sensors and Actuators,2012,25(5):673-677.(in Chinese) 张蕾,张堃.无线传感器网络中一种基于移动sink的数据收集算法[J].传感技术学报,2012,25(5):673-677.
[8] MA M,YANG Y Y.SenCar:an energy-efficient data gathering mechanism for large-scale multihop sensor networks[J].IEEE Trans on Parallel and Distributed Systems,2007,18(10):1476-1488.
[9] ZHOU T,GAO M F.Optimal path selection for mobile sink in dense wireless sensor networks[J].Application Research of Computers.2013,30(4):1120-1122.(in Chinese) 周涛,高美凤.密集型传感器网络中移动sink的路径选择机制[J].计算机应用研究,2013,30(4):1120-1122.
[10] SOMASUNDARA A A,KANSAL A,JEA D.Controllably mobile infrastructure for low energy embedded networks [J].IEEE Transactions on Mobile Computing,2006,5(8):958-973.
[11] ZHANG X W,SHEN L,JIANG Y F,et al.Optimizing path selection of mobile Sink nodes in mobility-assistant WSN[J].Journal on Communications.2013,34(2):85-93.(in Chinese) 张希伟,沈琳,蒋益峰,等.移动协助传感器网络中Sink的路径优化策略[J].通信学报,2013,34(2):85-93.
[12] LEE H,WICKE M,KUSY B,et al.Data stashing:Energy-efficient information delivery to mobile sinks through trajectory prediction[C]∥Proc.ACM IPSN.2010:291-302.
[13] ZHAO M,YANG Y.Bounded relay hop mobile data gathering in wireless sensor networks[J].IEEE Trans.Comput.,2012,61(2):265-277.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] LEI Li-hui and WANG Jing. Parallelization of LTL Model Checking Based on Possibility Measure[J]. Computer Science, 2018, 45(4): 71 -75 .
[2] SUN Qi, JIN Yan, HE Kun and XU Ling-xuan. Hybrid Evolutionary Algorithm for Solving Mixed Capacitated General Routing Problem[J]. Computer Science, 2018, 45(4): 76 -82 .
[3] ZHANG Jia-nan and XIAO Ming-yu. Approximation Algorithm for Weighted Mixed Domination Problem[J]. Computer Science, 2018, 45(4): 83 -88 .
[4] WU Jian-hui, HUANG Zhong-xiang, LI Wu, WU Jian-hui, PENG Xin and ZHANG Sheng. Robustness Optimization of Sequence Decision in Urban Road Construction[J]. Computer Science, 2018, 45(4): 89 -93 .
[5] SHI Wen-jun, WU Ji-gang and LUO Yu-chun. Fast and Efficient Scheduling Algorithms for Mobile Cloud Offloading[J]. Computer Science, 2018, 45(4): 94 -99 .
[6] ZHOU Yan-ping and YE Qiao-lin. L1-norm Distance Based Least Squares Twin Support Vector Machine[J]. Computer Science, 2018, 45(4): 100 -105 .
[7] LIU Bo-yi, TANG Xiang-yan and CHENG Jie-ren. Recognition Method for Corn Borer Based on Templates Matching in Muliple Growth Periods[J]. Computer Science, 2018, 45(4): 106 -111 .
[8] GENG Hai-jun, SHI Xin-gang, WANG Zhi-liang, YIN Xia and YIN Shao-ping. Energy-efficient Intra-domain Routing Algorithm Based on Directed Acyclic Graph[J]. Computer Science, 2018, 45(4): 112 -116 .
[9] CUI Qiong, LI Jian-hua, WANG Hong and NAN Ming-li. Resilience Analysis Model of Networked Command Information System Based on Node Repairability[J]. Computer Science, 2018, 45(4): 117 -121 .
[10] WANG Zhen-chao, HOU Huan-huan and LIAN Rui. Path Optimization Scheme for Restraining Degree of Disorder in CMT[J]. Computer Science, 2018, 45(4): 122 -125 .