In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work invo...In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.展开更多
邻居发现(ND)协议是网络设备必须支持的协议之一。基于 Linux 操作系统,本文提出了适合于具有分布式结构的 T 比特级高性能路由器的一种 ND 协议实现方案,该方案利用 Linux 内核提供的 netlink 机制,分别给出了 T比特路由器中先应式地...邻居发现(ND)协议是网络设备必须支持的协议之一。基于 Linux 操作系统,本文提出了适合于具有分布式结构的 T 比特级高性能路由器的一种 ND 协议实现方案,该方案利用 Linux 内核提供的 netlink 机制,分别给出了 T比特路由器中先应式地址解析以及主机路由的实现方法,测试结果表明,该方案使得 T 比特路由器控制平面能够高效可靠地完成邻居发现功能。展开更多
基金supported in part by the National Natural Science Foundations of CHINA(Grant No.61771392,No.61771390,No.61871322 and No.61501373)Science and Technology on Avionics Integration Laboratory and the Aeronautical Science Foundation of China(Grant No.201955053002 and No.20185553035)。
文摘In this paper,we propose a Multi-token Sector Antenna Neighbor Discovery(M-SAND)protocol to enhance the efficiency of neighbor discovery in asynchronous directional ad hoc networks.The central concept of our work involves maintaining multiple tokens across the network.To prevent mutual interference among multi-token holders,we introduce the time and space non-interference theorems.Furthermore,we propose a master-slave strategy between tokens.When the master token holder(MTH)performs the neighbor discovery,it decides which 1-hop neighbor is the next MTH and which 2-hop neighbors can be the new slave token holders(STHs).Using this approach,the MTH and multiple STHs can simultaneously discover their neighbors without causing interference with each other.Building on this foundation,we provide a comprehensive procedure for the M-SAND protocol.We also conduct theoretical analyses on the maximum number of STHs and the lower bound of multi-token generation probability.Finally,simulation results demonstrate the time efficiency of the M-SAND protocol.When compared to the QSAND protocol,which uses only one token,the total neighbor discovery time is reduced by 28% when 6beams and 112 nodes are employed.
文摘邻居发现(ND)协议是网络设备必须支持的协议之一。基于 Linux 操作系统,本文提出了适合于具有分布式结构的 T 比特级高性能路由器的一种 ND 协议实现方案,该方案利用 Linux 内核提供的 netlink 机制,分别给出了 T比特路由器中先应式地址解析以及主机路由的实现方法,测试结果表明,该方案使得 T 比特路由器控制平面能够高效可靠地完成邻居发现功能。
