计算机与现代化 ›› 2022, Vol. 0 ›› Issue (10): 88-94.

• 网络与通信 • 上一篇    下一篇

非对称异步移动传感网中低延时邻居发现算法

  

  1. (1.中国石油大学(华东)计算机科学与技术学院,山东青岛266580;2.中国石油大学(华东)海洋与空间信息学院,山东青岛266580)
  • 出版日期:2022-10-20 发布日期:2022-10-21
  • 作者简介:黄庭培(1980—),女(土家族),湖北建始人,副教授,硕士生导师,博士,研究方向:物联网,无线传感器网络,移动计算,E-mail: huangtingpei@upc.edu.cn; 通信作者:张亚(1996—),女,山东临清人,硕士研究生,研究方向:无线传感器网络,邻居发现,E-mail: 867464355@qq.com; 李世宝(1978—),男,山东潍坊人,副教授,硕士,研究方向:Ad Hoc,移动计算,复杂网络,E-mail: lishibao@upc.edu.cn; 刘建航(1978—),男,山东潍坊人,副教授,硕士生导师,博士,研究方向:车联网,无线传感器网络,E-mail: liujianhang@upc.edu.cn。
  • 基金资助:
    国家自然科学基金资助项目(61872385, 61673396, 61772551, 61801517); 中央高校基本科研业务费专项资金资助项目(18CX02133A, 18CX02134A, 18CX02137A)

Low Latency Neighbor Discovery Algorithm in Asymmetric Asynchronous Mobile Sensor Networks

  1. (1. College of Computer Science and Technology, China University of Petroleum, Qingdao 266580, China;
    2. College of Oceanography and Space Informatics, China University of Petroleum, Qingdao 266580, China)
  • Online:2022-10-20 Published:2022-10-21

摘要: 邻居发现即通过一定的手段快速而有效地去感知与节点能够直接通信的一跳范围内的邻居的问题,是移动传感网(MSN)的重要部分。非对称异步MSN中,已有的算法需要大量的时间和能量去完成相互发现。针对此问题,基于信标与活动时隙分离的邻居发现模型,提出一种适用于异步对称场景的BMCS-A算法,信标在工作周期的不同时隙进行广播以保证邻居发现的确定性。其次,扩展BMCS-A,提出一种持续性广播的BMCS-B算法,节点在第一个子周期内持续性广播信标,接收到该信标的节点将自适应地调整信标的发送时刻以加快邻居发现过程。最后,实现协作式BMCS-B算法,基于已发现邻居的睡眠苏醒调度信息,节点主动发送信标去发现潜在的邻居。仿真实验结果表明,与Searchlight、G-Nihao和Disco相比,协作式BMCS-B将最坏发现时延分别降低了84.62%、85.71%和81.82%。

关键词: 低占空比, 信标消息, 低延时, 主动式邻居发现, 持续性广播

Abstract: Neighbor discovery is an important part of mobile sensor networks, which is to quickly and effectively sense the neighbors in the one hop range that can communicate with nodes directly. In asymmetric asynchronous MSN, the existing neighbor discovery algorithms need a lot of time and energy to complete mutual discovery. To solve this problem, based on the separation model of beacon and active time slot, a BMCS-A algorithm for asynchronous symmetric scene is proposed. The beacon broadcasts in different time slots of the work cycle to ensure the certainty of neighbor discovery. Secondly, BMCS-A is extended and BMCS-B for persistent broadcast is proposed. The node continuously broadcasts the beacon in the first sub cycle, and the node receiving the beacon will adaptively adjust the beacon sending time to speed up the neighbor discovery process. Finally, the cooperative BMCS-B algorithm is implemented. Based on the sleep wake-up scheduling information of the discovered neighbors, the nodes actively send beacons to discover potential neighbors. Simulation results show that, compared with Searchlight, G-Nihao and Disco, collaborative BMCS-B can reduce the worst case discovery delay by 84.62%, 85.71% and 81.82% respectively.

Key words: low duty cycle, beacon message, low latency, proactive neighbor discovery, continuous broadcasting