A Multi-Token Sector Antenna Neighbor Discovery Protocol for Directional Ad Hoc Networks

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.

Sensing and Communication Integrated Fast Neighbor Discovery for UAV Networks

In unmanned aerial vehicle(UAV)networks,the high mobility of nodes leads to frequent changes in network topology,which brings challenges to the neighbor discovery(ND)for UAV networks.Integrated sensing and communication(ISAC),as an emerging technology in 6G mobile networks,has shown great potential in improving communication performance with the assistance of sensing information.ISAC obtains the prior information about node distribution,reducing the ND time.However,the prior information obtained through ISAC may be imperfect.Hence,an ND algorithm based on reinforcement learning is proposed.The learning automaton(LA)is applied to interact with the environment and continuously adjust the probability of selecting beams to accelerate the convergence speed of ND algorithms.Besides,an efficient ND algorithm in the neighbor maintenance phase is designed,which applies the Kalman filter to predict node movement.Simulation results show that the LA-based ND algorithm reduces the ND time by up to 32%compared with the Scan-Based Algorithm(SBA),which proves the efficiency of the proposed ND algorithms.

An Adaptive Scheme for Neighbor Discovery in Mobile Ad Hoc Networks

The neighbor knowledge in mobile ad hoc networks is important information. However, the accuracy of neighbor knowledge is paid in terms of energy consumption. In traditional schemes for neighbor discovery, a mobile node uses fixed period to send HELLO messages to notify its existence. An adaptive scheme was proposed. The objective is that when mobile nodes are distributed sparsely or move slowly, fewer HELLO messages are needed to achieve reasonable accuracy, while in a mutable network where nodes are dense or move quickly, they can adaptively send more HELLO messages to ensure the accuracy. Simulation results show that the adaptive scheme achieves the objective and performs effectively.

Directional neighbor discovery in mmWave wireless networks

The directional neighbor discovery problem,i.e,spatial rendezvous,is a fundamental problem in millimeter wave(mmWave)wireless networks,where directional transmissions are used to overcome the high attenuation.The challenge is how to let the transmitter and the receiver beams meet in space under deafness caused by directional transmission and reception,where no control channel,prior information,and coordination are available.In this paper,we present a Hunting based Directional Neighbor Discovery(HDND)scheme for ad hoc mmWave networks,where a node follows a unique sequence to determine its transmission or reception mode,and continuously r0-tates its directional beam to scan the neighborhood for other mmWave nodes.Through a rigorous analysis,we derive the conditions for ensured neighbor discovery,as well as a bound for the worst-case discovery time and the impact of sidelobes.We validate the analysis with extensive simulations and demonstrate the superior perfor-mance of the proposed scheme over several baseline schemes.

Accurate Analysis on Bluetooth Low Energy Neighbor Discovery

The basic concept of Bluetooth Low Energy (BLE) is short packet transmission and transient connection. It can quickly establish a connection, send data, and quickly disconnect, so that neighbor discovery is frequent and becomes an important issue. In the neighbor discovery which includes advertising and scanning, the BLE specification defines several important parameters. The parameters on the advertiser side include advertising interval, advertising duration, etc. On the scanner side, there are scan interval, scan window, etc. How to configure these parameters for quick neighbor discovery has been troublesome for BLE implementers. Prior analyses on BLE discovery process also showed some disagreements or made some incorrect assumptions. In this paper, we use rigorous probability-theory based derivations to obtain different kinds of successful discovery probabilities. We clarify disagreements in prior works and also provide insights on how to configure parameters for maximizing discovery probability. In particular, we prove that the discovery probabilities on each of the three channels are correlated. We also find that, when the advertising duration is set close to some multiples of the scan interval, an ill-fated synchronization problem will occur. To have a high discovery probability, both scan window and scan interval should be set at a large value, though it might not be good for energy saving.

Reducing neighbor discovery latency in docking applications

Neighbor discovery is important for docking applications,where mobile nodes communicate with static nodes situated at various rendezvous points.Among the existing neighbor discovery protocols,the probabilistic methods perform well in average cases but they have aperiodic,unpredictable,and unbounded discovery latency.Yet,deterministic protocols can provide bounded worst-case discovery latency by sacrificing the average-case performance.In this study,we propose a mobility-assisted slot index synchronization(MASS),which is a new synchronization technique that can improve the average-case performance of deterministic neighbor discovery protocols via slot index synchronization without incurring additional energy consumption.Furthermore,we propose an optimized beacon strategy in MASS to mitigate beaconing collisions,which can lead to discovery failures in situations where multiple neighbors are in the vicinity.We evaluate MASS with theoretical analysis and simulations using real traces from a tourist tracking system deployed at the Mogao Grottoes,which is a famous cultural heritage site in China.We show that MASS can reduce the average discovery latency of state-of-the-art deterministic neighbor discovery protocols by up to two orders of magnitude.

Opportunistic Routing with Multi-Channel Cooperative Neighbour Discovery

Due to the scattered nature of the network,data transmission in a dis-tributed Mobile Ad-hoc Network(MANET)consumes more energy resources(ER)than in a centralized network,resulting in a shorter network lifespan(NL).As a result,we build an Enhanced Opportunistic Routing(EORP)protocol architecture in order to address the issues raised before.This proposed routing protocol goal is to manage the routing cost by employing power,load,and delay to manage the routing energy consumption based on theflooding of control pack-ets from the target node.According to the goal of the proposed protocol techni-que,it is possible to manage the routing cost by applying power,load,and delay.The proposed technique also manage the routing energy consumption based on theflooding of control packets from the destination node in order to reduce the routing cost.Control packet exchange between the target and all the nodes,on the other hand,is capable of having an influence on the overall efficiency of the system.The EORP protocol and the Multi-channel Cooperative Neighbour Discovery(MCCND)protocol have been designed to detect the cooperative adja-cent nodes for each node in the routing route as part of the routing path discovery process,which occurs during control packet transmission.While control packet transmission is taking place during the routing path discovery process,the EORP protocol and the Multi-channel Cooperative Neighbour Discovery(MCCND)protocol have been designed to detect the cooperative adjacent nodes for each node in the routing.Also included is a simulation of these protocols in order to evaluate their performance across a wide range of packet speeds using Constant Bit Rate(CBR).When the packet rate of the CBR is 20 packets per second,the results reveal that the EORP-MCCND is 0.6 s quicker than the state-of-the-art protocols,according to thefindings.Assuming that the CBR packet rate is 20 packets per second,the EORP-MCCND achieves 0.6 s of End 2 End Delay,0.05 s of Routing Overhead Delay,120 s of Network Lifetime,and 20 J of Energy Consumption efficiency,which is much better than that of the state-of-the-art protocols.

Neighboring AP discovery and information exchange methods in Plug-and-Play WLAN system

To overcome the problem of existing neighboring access point （AP） discovery methods in WLAN, for example they （PnP） of mul proposed. Us can not provide the accurate neighboring APs information needed for the Plug-and-Play ti-mode APs, three kinds of neighboring AP discovery and information exchange methods are ing these three neighboring AP discovery methods, passive discovery method, active discovery method and station assistant discovery method, the multi-mode AP can discover all neighboring APs and obtain needed information. We further propose two whole process flows, which combine three discovery methods in different manner, to achieve different goals. One process flow is to discover the neighboring AP as fast as possible, called fast discovery process flow. The other is to discover the neighboring AP with minimal interference to neighboring and accuracy of the method is confirmed APs, called the minimal interference process flow. The validity by the simulation.

Anonymous-address-resolution model

Address-resolution protocol （ARP） is an important protocol of data link layers that aims to obtain the corresponding relationship between Internet Protocol （IP） and Media Access Control （MAC） addresses. Traditional ARPs （address-resolution and neighbor-discovery protocols） do not consider the existence of malicious nodes, which reveals destination addresses in the resolution process. Thus, these traditional protocols allow malicious nodes to easily carry out attacks, such as man-in-the-middle attack and denial-of-service attack. To overcome these weaknesses, we propose an anonymous-address-resolution （AS-AR） protocol. AS-AR does not publicize the destination address in the address-resolution process and hides the IP and MAC addresses of the source node, The malicious node cannot obtain the addresses of the destination and the node which initiates the address resolution; thus, it cannot attack. Analyses and experiments show that AS-AR has a higher security level than existing security methods, such as secure-neighbor discovery.