基于栅格的传感网多移动Sink数据收集方案
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:A Data Gathering Scheme Based on Grid in Sensor Network with Mobile Sinks
  • 作者:杨瑞 ; 沙超 ; 卞遥 ; 朱毅凯 ; 王汝传
  • 英文作者:YANG Rui;SHA Chao;BIAN Yao;ZHU Yi-kai;WANG Ru-chuan;School of Computer Science,Software and Cyberspace Security,Nanjing University of Posts and Telecommunications;Network Information Center of Nanjing University;
  • 关键词:无线传感网 ; 多移动Sink ; 数据收集 ; 栅格划分
  • 英文关键词:wireless sensor network;;mobile Sinks;;data gathering;;grid division
  • 中文刊名:WJFZ
  • 英文刊名:Computer Technology and Development
  • 机构:南京邮电大学计算机学院软件学院网络空间安全学院;南京大学网络信息中心;
  • 出版日期:2018-03-07 15:04
  • 出版单位:计算机技术与发展
  • 年:2018
  • 期:v.28;No.256
  • 基金:江苏省优秀青年基金(BK20160089);; 江苏省青蓝工程优秀青年骨干教师培养计划;; 江苏省普通高校研究生培养创新工程(KYCX17_0796,KYCX17_0797,SJCX17_0238);; 南京邮电大学1311人才计划
  • 语种:中文;
  • 页:WJFZ201808040
  • 页数:5
  • CN:08
  • ISSN:61-1450/TP
  • 分类号:193-197
摘要
为延长无线传感网的生命期并减少其数据收集延迟,提出了一种基于栅格的多移动Sink数据收集方案。首先,将网络划分为规模一致的矩形栅格,逗留点位于其中心。移动Sink的数量由网络规模和栅格总量决定。其次,在各栅格内,构建了基于最小单跳距离的数据收集树,以实现低功耗数据上传,并根据栅格内各节点的缓存状态,确定其优先级。最终,多个Sink以恒定速度在逗留点间移动,且根据邻居栅格的优先级决定其遍历顺序,以尽可能实现公平的数据收集。仿真结果表明,该方案在有效降低全网节点的平均能耗并延长网络生命期的同时,确保了较高的数据传输成功率。此外,由于采用了多Sink协同的数据收集方式,大大缩短了移动路径的长度,有效降低了数据收集延迟。
        To prolong the lifetime of wireless sensor network and reduce time delay on data collection,we propose a type of data gathering scheme based on grid with mobile Sinks.The network is firstly divided into several rectangular grids with uniform size,whose center just is stay point.The number of mobile Sinks is decided by the network scale as well as the total number of grids.Next,the data collection tree based on minimum single-hop distance is constructed in each grid to achieve lowpower consumption on data uploading.In addition,the grid priority depends on the cache status of each node in this grid.Finally,mobile Sinks moves from one stay point to another at a constant speed,and the traversal order can be determined according to the neighbor grids priority to realize the fairness in data collection.Simulation shows that this method not only reduces the average energy consumption of whole network nodes and prolongs the network lifetime effectively,but also ensures a higher data transmission success rate.Furthermore,the length of the moving path is greatly shortened due to the multi-Sink's cooperation,which effectively reduces the end to end delay in data collection.
引文
[1]王雷,王珺,朱志伟,等.无线传感网中基于能量均衡的机会路由算法[J].计算机技术与发展,2017,27(4):34-38.
    [2]李继楼,柯家龙.基于压缩感知的WSN数据压缩与重构[J].计算机技术与发展,2015,25(9):111-114.
    [3]LIAN Jie,NAIK K,AGNEW G B.Data capacity improvement of w ireless sensor netw orks using non-uniform sensor distribution[J].International Journal of Distributed Sensor Netw orks,2006,2(2):121-145.
    [4]梁青,熊伟,韩昊澎.各向异性无线传感器网络DVHop算法性能仿真[J].西安邮电大学学报,2013,18(5):31-36.
    [5]蒋畅江,石为人,唐贤伦,等.能量均衡的无线传感器网络非均匀分簇路由协议[J].软件学报,2012,23(5):1222-1232.
    [6]张诗悦,吴建德,王晓东,等.一种能耗均衡的无线传感器网络分簇路由算法[J].计算机工程,2014,40(8):6-9.
    [7]LI A,XIAO J.Efficient data gathering algorithm in wireless sensor netw orks w ith optimal-path mobile sink[J].Journal of Computational Information Systems,2012,8(22):9269-9279.
    [8]袁远,彭宇行,李珊珊,等.高效的移动sink路由问题的启发式算法[J].通信学报,2011,32(10):107-117.
    [9]沙超,邱建美,陆天宇,等.面向能耗均衡的传感网单移动Sink数据收集方法[J].北京邮电大学学报,2016,39(1):102-106.
    [10]KHAN A W,ABDULLAH A H,RAZZAQUE M A,et al.VGDD:a virtual grid based data dissemination scheme for w ireless sensor netw orks w ith mobile sink[J].International Journal of Distributed Sensor Netw orks,2015,11(9):1-19.
    [11]郜帅,张宏科.时延受限传感器网络移动Sink路径选择方法研究[J].电子学报,2011,39(4):742-747.
    [12]SHA Chao,QIU Jianmei,LU Tianyu,et al.Virtual region based data gathering method w ith mobile sink for sensor netw orks[J].Wireless Netw orks,2017,23(1):1-15.
    [13]梁青,焦峰.WSN基于多移动sink的高效数据收集协议[J].计算机工程与设计,2016,37(12):3191-3195.
    [14]梁俊斌,王建新,陈建二.在传感器网络中构造延迟限定的最大化生命周期树[J].电子学报,2010,38(2):345-351.
    [15]SHA Chao,QIU Jianmei,LI Shuyan,et al.A type of low-latency data gathering method w ith multi-sink for sensor netw orks[J].Sensors,2016,16(6):923.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700