移动低占空比传感网中基于多信标消息的低时延邻居发现算法

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

通信学报 ›› 2019, Vol. 40 ›› Issue (8): 178-188.doi: 10.11959/j.issn.1000-436x.2019139

移动低占空比传感网中基于多信标消息的低时延邻居发现算法

梁俊斌^1,²,周翔^1,²,马方强^1,²,蒋婵^1,²,何宗键³

¹ 广西大学计算机与电子信息学院，广西南宁530004
² 广西大学广西多媒体通信与网络技术重点实验室，广西南宁530004
³ 奥克兰大学网络研究中心，奥克兰 1142

修回日期:2019-05-17 出版日期:2019-08-25 发布日期:2019-08-30
作者简介:梁俊斌（1979- ），男，广西南宁人，博士，广西大学教授，主要研究方向为无线传感器网络及分布式系统。|周翔（1995- ），男，湖北鄂州人，广西大学硕士生，主要研究方向为无线传感器网络。|马方强（1993- ），男，陕西咸阳人，广西大学硕士生，主要研究方向为无线传感器网络。|蒋婵（1980- ），女，广西合浦人，广西大学博士生，主要研究方向为无线传感器网络。|何宗键（1981- ），男，山东临沂人，博士，奥克兰大学网络研究中心研究员，主要研究方向为普适计算和无线移动网络。
基金资助:
国家自然科学基金资助项目(61562005);国家自然科学基金资助项目(61762010);广西自然科学基金资助项目(2018GXNSFBA281169);广西高等学校千名中青年骨干教师培育计划基金资助项目（桂教人（2017）49号）

Low-latency neighbor discovery algorithm based on multi-beacon message in mobile low-duty-cycle sensor network

Junbin LIANG^1,²,Xiang ZHOU^1,²,Fangqiang MA^1,²,Chan JIANG^1,²,Zongjian HE³

¹ School of Computer and Electronics Information,Guangxi University,Nanning 530004,China
² Guangxi Key Laboratory of Multimedia Communications and Network Technology,Guangxi University,Nanning 530004,China
³ Network Research Center,the University of Auckland,Auckland 1142,New Zealand

Revised:2019-05-17 Online:2019-08-25 Published:2019-08-30
Supported by:
The National Natural Science Foundation of China(61562005);The National Natural Science Foundation of China(61762010);The Natural Science Foundation of Guangxi Province(2018GXNSFBA281169);The Cultivation Plan for Thousands of Young and Middle-Aged Backbone Teachers in Guangxi Higher Education School (Guangxi Education People (2017) No.49)

摘要/Abstract

摘要：

邻居发现可以使网络中的节点通过简单的信息交互彼此发现对方，适用于新型的移动低占空比传感网（MLDC-WSN）。然而，由于MLDC-WSN中节点具有可随机移动、睡眠等特性，使网络拓扑频繁发生改变，导致部分节点需要花费很多的能量和时间才能发现邻居。如何使网络中的全部节点实现快速邻居发现是目前研究的难点问题。为了解决这个难题，提出了一种新的基于多信标消息的低时延邻居发现算法，节点通过发送一种简短的信标消息来寻找自己的邻居，并且通过调整信标消息发送的时刻及发送的次数，从而获取较低的邻居发现时延。最后，通过定量分析和仿真实验发现，与已有算法相比，该算法能够在MLDC-WSN中以更小的能耗、更低的时延和更大的概率发现全部的邻居节点。

关键词: 移动低占空比传感网, 邻居发现, 低时延, 信标消息

Abstract:

Neighbor discovery enables nodes in the networks to discover each other through simple information interaction,which was suitable for the new mobile low duty cycle sensor network (MLDC-WSN).However,because the nodes in MLDC-WSN can move randomly and sleep,the network topology was changed frequently,which results in that some nodes need a lot of energy and time to find their neighbors.How to realize fast neighbor discovery for all nodes in the network was a difficult problem in current research.To solve this problem,a new low-latency neighbor discovery algorithm based on multi-beacon messages was proposed.In this algorithm,the nodes were discovered by sending a short beacon message through their neighbor nodes,and by adjusting the time and frequency of beacon message sent,a lower neighbor discovery delay was obtained.Eventually,through quantitative analysis and simulation experiments,it is found that compared with existing algorithms,this algorithm can find all neighbor nodes in MLDC-WSN with less energy consumption,lower latency and greater probability.

Key words: mobile low-duty-cycle sensor network, neighbor discovery, low latency, beacon message

中图分类号:

TP393

梁俊斌,周翔,马方强,蒋婵,何宗键. 移动低占空比传感网中基于多信标消息的低时延邻居发现算法[J]. 通信学报, 2019, 40(8): 178-188.

Junbin LIANG,Xiang ZHOU,Fangqiang MA,Chan JIANG,Zongjian HE. Low-latency neighbor discovery algorithm based on multi-beacon message in mobile low-duty-cycle sensor network[J]. Journal on Communications, 2019, 40(8): 178-188.

图/表 9

图1

图2

图3

图4

表1

典型算法的占空比时延乘积对比"

算法	参数	DC	L	Λ
C-torus quorum	n	$\frac{2}{n}$	n²	2n
Disco	p₁、p₂	$\frac{1}{p_{1}} + \frac{1}{2}$	p ₁+p₂	p ₁+p₂
Searchlight	t	2 t	2 2 t	t
Nihao	m、n	$\frac{m + α n}{m n}$	mn	m+αn
ready-go	m、n	$\frac{m + α (n - 2)}{m n}$	2m+1	$\frac{(m + α (n - 2)) (2 m + 1)}{m n}$
U-connect	q	$\frac{3}{2 q}$	q²	$\frac{3 q}{2}$

表1

图5

图6

图7

图8

参考文献 21

[1]	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.
[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]	KOHVAKKA M , SUHONEN J , KUORILEHTO M ,et al. Energy-efficient neighbor discovery protocol for mobile wireless sensor networks[J]. Ad Hoc Networks, 2009,7(1): 24-41.
[4]	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,6(4): 553-565.
[5]	BOAVENTURA A S , CARVALHO N B . A low-power wakeup radio for application in WSN-based indoor location systems[J]. International Journal of Wireless Information Networks, 2013,20(1): 67-73.
[6]	BURGHAL D , TEHRANI A , MOLISCH A . On expected neighbor discovery time with prior information:modeling,bounds and optimization[J]. IEEE Transactions on Wireless Communications, 2018,17(1): 339-351.
[7]	JEON W S , DWIJAKSARA M H , DONG G J . Performance analysis of neighbor discovery process in bluetooth low-energy networks[J]. IEEE Transactions on Vehicular Technology, 2017,66(2): 1865-1871.
[8]	MCGLYNN M J , BORBASH S A . Birthday protocols for low energy deployment and flexible neighbor discovery in Ad Hoc wireless networks[C]// The ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM, 2001: 137-145.
[9]	CHEN S , RUSSELL A , JIN R ,et al. Asynchronous neighbor discovery on duty-cycled mobile devices:integer and non-integer schedules[C]// The ACM International Symposium on Mobile Ad Hoc Networking and Computing. ACM, 2015: 47-56.
[10]	DUTTA P , CULLER D . Practical asynchronous neighbor discovery and rendezvous for mobile sensing applications[C]// The ACM Conference on Embedded Network Sensor Systems. ACM, 2008: 71-84.
[11]	KANDHALU A , LAKSHMANAN K , RAJKUMAR R . U-connect:a low-latency energy-efficient asynchronous neighbor discovery protocol[C]// International Conference on Information Processing in Sensor Networks. ACM, 2010: 350-361.
[12]	KOHVAKKA M , SUHONEN J , KUORILEHTO M ,et al. Energy-efficient neighbor discovery protocol for mobile wireless sensor networks[J]. Ad Hoc Networks, 2009,7(1): 24-41.
[13]	陈良银, 颜秉姝, 张靖宇 ,等. 移动低占空比传感网邻居发现算法[J]. 软件学报, 2014(6): 1352-1368.
	CHEN L Y , YAN B S , ZHANG J Y ,et al. Neighbor discovery algorithm for mobile low duty ratio sensor networks[J]. Journal of Software, 2014(6): 1352-1368.
[14]	BAKHT M , TROWER M , KRAVETS R H . Searchlight:won't you bemy neighbor?[C]// The Annual International Conference on Mobile Computing and Networking. ACM, 2012: 185-196.
[15]	QIU Y , LI S , XU X ,et al. Talk more listen less:energy-efficient neighbor discovery in wireless sensor networks[C]// The IEEE International Conference on Computer Communications. IEEE, 2016: 1-9.
[16]	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. IEEE, 2017: 93-104.
[17]	梁俊斌, 周翔, 李陶深 . 移动低占空比无线传感网中低能耗的主动邻居发现算法[J]. 通信学报, 2018,39(4): 45-55.
	LIANG J B , ZHOU X , LI T S . Active neighbor discovery algorithms for low energy consumption in mobile low duty ratio wireless sensor networks[J]. Journal on Communications, 2018,39(4): 45-55.
[18]	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.
[19]	CHEN L , BIAN K . Neighbor discovery in mobile sensing applications:a comprehensive survey[J]. Ad Hoc Networks, 2016,48(9): 38-52.
[20]	YOON J , LIU M , NOBLE B . Random waypoint considered harmful[C]// The IEEE Computer and Communications Societies. IEEE, 2003: 1312-1321.
[21]	LUO L , CAO Q , HUANG C ,et al. EnviroMic:towards cooperative storage and retrieval in audio sensor networks[C]// International Conference on Distributed Computing Systems. IEEE, 2007: 34-44.

移动低占空比传感网中基于多信标消息的低时延邻居发现算法

Low-latency neighbor discovery algorithm based on multi-beacon message in mobile low-duty-cycle sensor network

在线阅读

PDF下载

可视化

摘要/Abstract

引用本文

使用本文

图/表 9

参考文献 21

相关文章 15

Metrics

推荐阅读 0

[1]	秦武韬, 王鹏, 李玉峰. 基于周期耦合处理的CAN总线数据组合加密方法[J]. 通信学报, 2023, 44(1): 29-38.
[2]	裴金川, 胡宇翔, 田乐, 胡涛, 李子勇. 联合路由规划的时间敏感网络流量调度方法[J]. 通信学报, 2022, 43(12): 54-65.
[3]	骆冰清, 王佩佩, 王正康, 孙知信. 低功耗蓝牙5.0邻居发现协议时延模型研究[J]. 通信学报, 2021, 42(6): 226-237.
[4]	孙国林,欧睿杰,刘贵松. 基于深度强化学习的应急物联网切片资源预留算法[J]. 通信学报, 2020, 41(9): 8-20.
[5]	伏玉笋,杨根科. 无线超可靠低时延通信：关键设计分析与挑战[J]. 通信学报, 2020, 41(8): 187-203.
[6]	左旭彤,王莫为,崔勇. 低时延网络：架构，关键场景与研究展望[J]. 通信学报, 2019, 40(8): 22-35.
[7]	黄韬,汪硕,黄玉栋,郑尧,刘江,刘韵洁. 确定性网络研究综述[J]. 通信学报, 2019, 40(6): 160-176.
[8]	梁俊斌,周翔,李陶深. 移动低占空比无线传感网中低能耗的主动邻居发现算法[J]. 通信学报, 2018, 39(4): 45-55.
[9]	蒋婵,李陶深,梁俊斌. 移动低占空比无线传感器网络中低时延的数据持续性提高算法[J]. 通信学报, 2018, 39(3): 53-62.
[10]	苏成龙,金光,江先亮,钮俊. 公平和低时延的主动队列管理算法研究[J]. 通信学报, 2017, 38(5): 199-206.
[11]	陈志刚,沈小建,刘立. 无线mesh网中最小编码代价低时延多播路由[J]. 通信学报, 2016, 37(1): 10-16.
[12]	尹星,吴国新,董永强,张三峰. 基于扩展邻居发现协议的嵌套移动网络路由优化方案[J]. 通信学报, 2015, 36(4): 58-69.
[13]	胡蓉华,董晓梅,王大玲. SenLeash：一种无线传感器网络虫洞攻击约束防御机制[J]. 通信学报, 2013, 34(10): 65-75.
[14]	胡蓉华，董晓梅，王大玲. SenLeash：一种无线传感器网络虫洞攻击约束防御机制[J]. 通信学报, 2013, 34(10): 8-75.
[15]	彭敏,洪佩琳,卢汉成,薛开平. 基于本地信息的移动模型检测框架[J]. 通信学报, 2010, 31(11): 73-79.