摘要
邻居发现可以使网络中的节点通过简单的信息交互彼此发现对方,适用于新型的移动低占空比传感网(MLDC-WSN)。然而,由于MLDC-WSN中节点具有可随机移动、睡眠等特性,使网络拓扑频繁发生改变,导致部分节点需要花费很多的能量和时间才能发现邻居。如何使网络中的全部节点实现快速邻居发现是目前研究的难点问题。为了解决这个难题,提出了一种新的基于多信标消息的低时延邻居发现算法,节点通过发送一种简短的信标消息来寻找自己的邻居,并且通过调整信标消息发送的时刻及发送的次数,从而获取较低的邻居发现时延。最后,通过定量分析和仿真实验发现,与已有算法相比,该算法能够在MLDC-WSN中以更小的能耗、更低的时延和更大的概率发现全部的邻居节点。
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.
作者
梁俊斌
周翔
马方强
蒋婵
何宗键
LIANG Junbin;ZHOU Xiang;MA Fangqiang;JIANG Chan;HE Zongjian(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)
出处
《通信学报》
EI
CSCD
北大核心
2019年第8期178-188,共11页
Journal on Communications
基金
国家自然科学基金资助项目(No.61562005,No.61762010)
广西自然科学基金资助项目(No.2018GXNSFBA281169)
广西高等学校千名中青年骨干教师培育计划基金资助项目(桂教人(2017)49号)~~
关键词
移动低占空比传感网
邻居发现
低时延
信标消息
mobile low-duty-cycle sensor network
neighbor discovery
low latency
beacon message
