Computer Science ›› 2017, Vol. 44 ›› Issue (5): 61-65.doi: 10.11896/j.issn.1002-137X.2017.05.011

Previous Articles     Next Articles

Dynamic Path Planning Design of Mobile Sink for Single Region Bursty Traffic

WAN Cheng, CHANG Jie and ZHANG Ling   

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

Abstract: In a wireless sensor network which sensor nodes collect the whole network data periodically,the bursty data traffic need to be sent to base station correctly in short time if a region generates some.At the same time,we must take the regular data of other regions into consideration.This paper proposed a dynamic path planning for mobile Sink algorithm.First at all,the network is divided into square virtual grids and each grid is a cluster,dividing every singal node to a grid and selecting the cluster head.Secondly,a mobile Sink is used to collect data through the shortest path which is established by related TSP algorithm.Finally,mobile Sink will change the path dynamically to collect data when there is a bursty data traffic in any region.After lots of simulation in NS-2 simulation platform,it shows that the proposed algorithm can change the path of mobile Sink dynamically to collect the bursty data traffic correctly as soon as possible,ba-lance accuracy,real time of bursty data traffic and packet loss rate,delay of periodic reginal data flow,and prolong the network lifetime as well.

Key words: Wireless sensor network,Bursty data traffic,Mobile Sink,Path planning

[1] QIAN Z H,WANG Y J.Internet of Things-oriented WirelessSensor Networks Review[J].Journal of Electronics & Information Technology,2013,35(1):215-227.(in Chinees) 钱志鸿,王义君.面向物联网的无线传感网罗综述[J].电子与信息学报,2013,35(1):215-227.
[2] LIANG W F,LUO J,XU X.Prolonging Network Lifetime via a Controllen Mobile Sink in Wireless Sensor Networks [C]∥Proceedings of 2010 IEEE Global Communications Conference.Washington D C,USA:IEEE Press,2010:1-6.
[3] TIAN K,ZHANG B,HUANG K,et al.Date gathering protocolsfor wireless sensor networks with mobile sinks[C]∥2010 IEEE Global Communications Conference.Washington D C,USA:IEEE Press,2010:6-10.
[4] LUO H,YE F,CHENG J,et al.TTDD:Two-tier data dissemination in large-scale wireless sensor networks[J].Wireless networks,2005,11(1/2):161-175.
[5] KHAN N M,ALI I,KHALID Z,et al.Quasi centralized clustering approach for an energy-efficient and vulnerability-aware routing in wireless sensor networks[C]∥Proceedings of the 1st ACM international workshop on Heterogeneous sensor and actor networks.ACM,2008:67-72.
[6] LIN Z G,ZHANG W,SUN Y W,et al.A mobile routing algorithm in WSN with mobile relays[J].Journal of Northwest University(Natural Science Edition),2015,45(5):727-732.(in Chinees) 林志贵,张炜,孙有为,等.带移动中继的WSN移动路由算法[J].西北大学学报(自然科学版),2015,45(5):727-732.
[7] SONG S J,LIU G F,ZHOU Z Y,et al.An Improved Ant Colony Algorithm Solving the Shortest Path and TSP Problem[J].C omputer Technology and Development,2010,20(4):144-147.(in Chinees) 宋世杰,刘高峰,周忠友,等.基于改进蚁群算法求解最短路径和TSP问题[J].计算机技术与发展,2010,20(4):144-147.
[8] ERMAN A T,HAVINGA P.Data dissemination of energencymessages in mobile multi-sink wireless sensor networks[C]∥Proc.of the 9th IFIP Annual Mediterranean Ad Hoc Networking Workshop.Juan Les Pins,France,2010:1-8.
[9] DING J,LIU D P.Energy saving algorithm for data collection of wireless sensor networks in mobile Sink environments[J].Journal of Beijing University of Posts and Telecommunications,2013,36(5):51-55.(in Chinees) 丁杰,刘丹谱.移动Sink环境下的无线传感器网络数据收集节能算法[J].北京邮电大学学报,2013,36(5):51-55.
[10] LU X J,CHEN Z R.Research of Energy Efficient Target Covera-ge and Routing Assignment in Wireless Sensor Networks[J].Chinese Jourbal of Sensors and Actuators,2015,28(26):900-906.
[11] GAO S,ZHANG H,DAS S K.Efficient data collection in wireless sensor networks with path-constrained mobile Sinks[J].IEEE Transactions on Mobile Computing,2011,10(4):592-608.
[12] ZHANG Y,JU D W,CHEN Z,et al.Research on Clustering Alo-grithm of Wireless Sensor Networks Based on Predictable Mobile Sink[J].Computer Science,2012,39(6):89-92.(in Chinees) 章韵,巨德文,陈志,等.基于可预测移动汇聚节点的无线传感网分簇算法研究[J].计算机科学,2012,39(6):89-92.
[13] XU Z,LIANG W,XU Y.Network lifetime maximization in delay-tolerant sensor networks with a mobile Sink[C]∥2012 IEEE 8th International Conference on Distributed Computing in Sensor Systems (DCOSS).IEEE,2012:9-16.
[14] SAAD E M,AWADALLA M H,DARWISH R R.A data ga-thering algorithm for a mobile Sink in large-scale sensor networks[C]∥The Fourth International Conference on Wireless and Mobile Communications,2008(ICWMC’08).IEEE,2008:207-213.
[15] CHANG J,ZHANG L,ZENG B.Data Gathering Algorithm for Mobile Sink Based on the Global Delivery Latency Minimization[J].Chinese Journal of Sensors and Actuators,2016,29(2):264-270.(in Chinees) 常捷,张灵,曾碧.基于全局时延最小化的移动Sink数据收集算法[J].传感技术学报,2016,29(2):264-270.

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 .