移动低占空比无线传感网中低能耗的主动邻居发现算法

doi:10.11959/j.issn.1000-436x.2018054

通信学报 ›› 2018, Vol. 39 ›› Issue (4): 45-55.doi: 10.11959/j.issn.1000-436x.2018054

移动低占空比无线传感网中低能耗的主动邻居发现算法

梁俊斌,周翔,李陶深

广西大学计算机与电子信息学院广西多媒体通信与网络技术重点实验室，广西南宁 530004

修回日期:2018-03-16 出版日期:2018-04-01 发布日期:2018-04-29
作者简介:梁俊斌（1979-），男，广西南宁人，博士，广西大学教授，主要研究方向为无线传感器网络。|周翔（1995-），男，湖北鄂州人，广西大学硕士生，主要研究方向为无线传感器网络。|李陶深（1957-），男，广西邕宁人，博士，广西大学教授，主要研究方向为无线Mesh网络、分布式工程数据库、遗传优化设计、网络计算与信息安全等。
基金资助:
国家自然科学基金资助项目(61562005);国家自然科学基金资助项目(61762010);国家自然科学基金资助项目(61363067);广西自然科学基金资助项目(2015GXNSFAA139286);广西高等学校千名中青年骨干教师培育计划基金资助项目（桂教人(2017)(49)

Energy saving proactive neighbor discovery algorithm in mobile low-duty-cycle wireless sensor network

Junbin LIANG,Xiang ZHOU,Taoshen LI

Guangxi Key Laboratory of Multimedia Communications and Network Technology,School of Computer and Electronics Information,Guangxi University,Nanning 530004,China

Revised:2018-03-16 Online:2018-04-01 Published:2018-04-29
Supported by:
The National Natural Science Foundation of China(61562005);The National Natural Science Foundation of China(61762010);The National Natural Science Foundation of China(61363067);The Natural Science Foundation of Guangxi Zhuang Autonomous Region(2015GXNSFAA139286);The Cultivation Plan for Thousands of Young and Middle-Aged Backbone Teachers in Guangxi Higher Education School (Guangxi Education People(49)

摘要/Abstract

摘要：

移动低占空比无线传感网（MLDC-WSN）是近年新兴的一种无线多跳网络，它由大量具有移动能力且会长时间进入睡眠状态的节点自组织而成，可以部署在恶劣环境中执行长期的监测任务，在国防、工业、农业等领域具有广泛的应用前景。但是，节点的移动和睡眠导致网络拓扑不断发生改变，使节点很难以较少的能耗快速发现其全部的邻居，导致节点无法获得最优的分布式决策结果，影响网络应用的效果。为了解决这个难题，提出一种新的主动式邻居发现算法。该算法使网络中的节点在苏醒时主动寻找自己的邻居，避免传统被动式邻居发现中长时间等待所产生的时延。此外，通过对邻居移动速度及距离的预测，快速确定未来下一时刻的邻居集合，在进一步减少时延的同时获得更准确的邻居发现结果。理论分析和实验结果表明，与已有算法相比，所提算法能够在MLDC-WSN中以更小的能耗、更低的时延发现全部的邻居。

关键词: 移动低占空比无线传感网, 低能耗, 邻居发现

Abstract:

Mobile low-duty-cycle wireless sensor network is a new kind of wireless multi-hop network,which is self-organized by a large number of nodes that have mobile ability and are able to get into sleep for a long time.Such networks have wide application prospects in national defense,industry,agriculture and other fields that need long term monitoring in severe environments.However,the movement and the sleeping features of nodes lead to constantly change of network topology,which makes the nodes difficult to discover their neighbors quickly.Therefore,the nodes cannot achieve optimal distribution decisions.In order to solve this problem,a new proactive neighbor discovery algorithm was proposed.This algorithm made the nodes in the network take the initiative to find their neighbors when they woke up,and avoided the delay caused by long time waiting in the traditional passive neighbor discovery.In addition,by predicting the movement speed and distance of neighbors,the neighbor set at the next moment can be quickly determined,which can further reduce the delay and obtain more accurate neighbor discovery results.Theoretical analysis and experimental results show that compared with the existing algorithms,the algorithm can find all the neighbors in MLDC-WSN with less energy consumption and lower delay.

Key words: mobile low-duty-cycle wireless sensor network, energy saving, neighbor discovery

中图分类号:

TP393

梁俊斌,周翔,李陶深. 移动低占空比无线传感网中低能耗的主动邻居发现算法[J]. 通信学报, 2018, 39(4): 45-55.

Junbin LIANG,Xiang ZHOU,Taoshen LI. Energy saving proactive neighbor discovery algorithm in mobile low-duty-cycle wireless sensor network[J]. Journal on Communications, 2018, 39(4): 45-55.

图/表 10

图1

图2

图3

图4

图5

图6

表1

图7

图8

表2

参考文献 18

[1]	RAZAQUE A , ELLEITHY K M . Low duty cycle,energy-efficient and mobility-based boarder node-MAC hybrid protocol for wireless sensor networks[J]. Journal of Signal Processing Systems, 2015,81(2): 265-284.
[2]	GUO S , YANG Y , WANG C . DaGCM:a concurrent data uploading framework for mobile data gathering in wireless sensor networks[J]. IEEE Transactions on Mobile Computing, 2016,15(3): 610-626.
[3]	陈权, 高宏 . 低占空比无线传感器网络中基于动态切换的实时路由协议[J]. 通信学报, 2015,10(36): 224-234.
	CHEN Q , GAO H . Dynamic switching based real-time routing in low-duty-cycle wireless sensor networks[J]. Journal on Communications, 2015,10(36): 224-234.
[4]	QIU Y , LI S , XU X ,et al. Talk more listen less:energy-efficient neighbor discovery in wireless sensor networks[C]// IEEE International Conference on Computer Communications. 2016: 1-9.
[5]	MENG T , WU F , CHEN G . Code-based neighbor discovery protocols in mobile wireless networks[J]. IEEE Transactions on Networking, 2016,24(2): 806-819.
[6]	MCGLYNN M J , BORBASH S A . Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks[C]// The ACM MobiHoc. 2001: 137-145.
[7]	YOU L , YUAN Z , YANG P ,et al. ALOHA-like neighbor discovery in low-duty-cycle wireless sensor networks[C]// 2011 IEEE Wireless Communications and Networking Conference (WCNC). 2011: 749-754.
[8]	JIANG J R , TSENG Y C , HSU C S ,et al. Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks[C]// Proceedings of Mobile Networks and Applications. 2005,10(12): 169-181.
[9]	ZHENG R , HOU J C , SHA L . Asynchronous wakeup for ad hoc networks[C]// The 4th ACM International Symposium on Mobile Ad Hoc Networking ＆ Computing. 2003: 35-45.
[10]	DUTTA P , CULLER D . Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications[C]// The 6th ACM Conference on Embedded Network Sensor Systems. 2008: 71-84.
[11]	NIVEN I , ZUCKERMAN H S . An introduction to the theory of numbers.4th ed[J]. American Mathematical Monthly, 1961,68(6): 401-405.
[12]	KANDHALU A , LAKSHMANAN K , RAJKUMAR R R . U-connect:a low-latency energy-efficient asynchronous neighbor discovery protocol[C]// The 9th ACM/IEEE International Conference on Information Processing in Sensor Networks. 2010: 350-361.
[13]	CHEN H , LOU W , WANG Z ,et al. On achieving asynchronous energy-efficient neighbor discovery for mobile sensor networks[J]. IEEE Transactions on Emerging Topics in Computing, 2016,PP(99): 1-12.
[14]	KINDT P H , YUNGE D , REINERTH G ,et al. Griassdi:mutually assisted slotless neighbor discovery[C]// ACM/IEEE International Conference on Information Processing in Sensor Networks. 2017: 93-104.
[15]	CHEN L , SHU Y , GU Y ,et al. Group-based neighbor discovery in low-duty-cycle mobile sensor networks[J]. IEEE Transactions on Mobile Computing, 2016,15(8): 1996-2009.
[16]	陈良银, 颜秉姝, 张靖宇 ,等. 移动低占空比传感网邻居发现算法[J]. 软件学报, 2014,25(6): 1352-1368.
	CHEN L Y , YAN B S , ZHANG J Y ,et al. Neighbor discovery algorithm in mobile low-duty-cycle wireless sensor networks[J]. Journal of Software, 2014,25(6): 1352-1368.
[17]	HUANG T , CHEN H , ZHANG Y ,et al. EasiND:effective neighbor discovery algorithms for asynchronous and asymmetric-duty-cycle multi-channel mobile WSNs[J]. Wireless Personal Communications, 2015,84(4): 3031-3055.
[18]	CAMP T , BOLENG J , DAVIES V . A survey of mobility models for ad hoc network research[J]. Wireless Communications and Mobile Computing, 2002,2(5): 483-502.

参数	设定值/J
E_p-run	1×10^?6
E_p-idle	0.3×10^?6
E_p-sleep	1×10^?9
E_c	1.5×10^?5
E_c-sleep	1×10^?6

算法	发现时延	网络能耗	主动苏醒次数	发现比率收敛
SPND	极小	极小	较小	较快
GBD	较小	较大	较大	较快
Disco	较大	较小	—	较快
Birthday	较大	较小	—	较慢

移动低占空比无线传感网中低能耗的主动邻居发现算法

Energy saving proactive neighbor discovery algorithm in mobile low-duty-cycle wireless sensor network

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 10

参考文献 18

相关文章 11

Metrics

推荐阅读 0

[1]	骆冰清, 王佩佩, 王正康, 孙知信. 低功耗蓝牙5.0邻居发现协议时延模型研究[J]. 通信学报, 2021, 42(6): 226-237.
[2]	梁俊斌,周翔,马方强,蒋婵,何宗键. 移动低占空比传感网中基于多信标消息的低时延邻居发现算法[J]. 通信学报, 2019, 40(8): 178-188.
[3]	尹星,吴国新,董永强,张三峰. 基于扩展邻居发现协议的嵌套移动网络路由优化方案[J]. 通信学报, 2015, 36(4): 58-69.
[4]	谷勇浩，郭达，林九川. 低能耗的隐私数据安全融合方法[J]. 通信学报, 2014, 35(Z2): 15-116.
[5]	谷勇浩,郭达,林九川. 低能耗的隐私数据安全融合方法[J]. 通信学报, 2014, 35(Z2): 112-116.
[6]	丁麟轩，黄昆，张大方. 基于TCAM的低能耗正则表达式匹配算法[J]. 通信学报, 2014, 35(8): 20-168.
[7]	丁麟轩,黄昆,张大方. 基于TCAM的低能耗正则表达式匹配算法[J]. 通信学报, 2014, 35(8): 162-168.
[8]	胡蓉华,董晓梅,王大玲. SenLeash：一种无线传感器网络虫洞攻击约束防御机制[J]. 通信学报, 2013, 34(10): 65-75.
[9]	胡蓉华，董晓梅，王大玲. SenLeash：一种无线传感器网络虫洞攻击约束防御机制[J]. 通信学报, 2013, 34(10): 8-75.
[10]	朱剑,赵海,徐久强,李大舟. WSN中可靠通信保障下的生存周期优化问题研究[J]. 通信学报, 2010, 31(6): 67-73.
[11]	彭敏,洪佩琳,卢汉成,薛开平. 基于本地信息的移动模型检测框架[J]. 通信学报, 2010, 31(11): 73-79.