Distributed Neighbor Discovery Research Articles

Distributed neighbor discovery with mobility adaptive probing for beyond 5G D2D communications

Representing a paradigm shift in cellular communication, Device-to-Device (D2D) Communication is an emerging technology that enables direct communication between two User Equipments(UEs) without going through the Base Station. It enables decentralization of cellular networks, enhances network capacity, increases spectral efficiency, and offloads network traffic. In order to proceed with direct D2D communication, the devices must have knowledge of the proximal devices and should work in all coverage scenarios such as in-coverage, partial-coverage and out-of-coverage. Most of the existing works on Device Discovery are based on 3GPP Model A and Model B. However, these schemes suffer from overhead of discovery message exchanges with the increase in the number of devices in a mobile environment. To address these issues, we propose a distributed and adaptive device discovery mechanism that can discover the proximal UEs in all possible scenarios. To achieve this, we propose a Hybrid Discovery Model ‘H’, which uses the concept of ‘Who are there?’. In Model ‘H’, the discoverer sends a single request message to discover all proximal devices. The responses of the proximal UEs are staggered based on the estimated number of neighbors to avoid collisions. In addition to that, we adapt the discovery mechanism to the relative mobility of the neighborhood using our proposed Adaptive Probing Algorithm named ‘ReMAP’. The relative mobility is determined based on the current and previous neighbor lists of each UE. The key advantage of our proposed mechanism is that we do not require the knowledge of position and mobility pattern of the UEs. We implement and evaluate our proposed work in D2D Module of the NS3 simulator. From the simulation results, we observe that our proposed model shows better performance in terms of the number of UEs discovered and reduced number of discovery message exchanges compared to the state-of-the-art. We also compare the performance of ReMAP with a constant probing mechanism and show the improvement in terms of adaptability to the mobility of the neighborhood.

Meet in the air: Distributed neighbor discovery in 3D networks with directional transceivers

We formulate and analyze a generic neighbor discovery problem in three-dimensional wireless networks with directional transceivers, where any pair of neighbor nodes in 3D Euclidean space need to steer their transceivers towards each other simultaneously to discover each other. This problem, termed as 3D directional neighbor discovery, arises in a variety of emerging networked systems such as flying ad hoc networks composed of drones and distributed space systems composed of spacecrafts. Compared to the omni-directional 2D neighbor discovery problem extensively investigated in the literature, the 3D directional neighbor discovery problem is intuitively more challenging. Motivated by this observation, we establish an algorithmic framework on the 3D directional neighbor discovery problem. We first mathematically formulate the problem and derive the worst-case discovery delay of any neighbor discovery algorithm. Guided by the performance limit, we then design distributed neighbor discovery algorithms achieving bounded and minimal worst-case discovery delay. We further demonstrate how our algorithmic framework can be generalized to solve generic multi-dimensional rendezvous problems. Extensive numerical analysis is then presented to empirically evaluate of our neighbor discovery algorithms.

Self-Adaptive Neighbor Discovery in Wireless Sensor Networks with Sectored-Antennas

Integration of sectored antenna in wireless networks improves network performance through increased network capacity and extended transmission range. However, incorporating sectored antenna makes the trivial process of discovering neighbors even more challenging and complicated. Moreover, due to the duty-cycled nature of Wireless Sensor Networks (WSNs), self-adaptive and distributed neighbor discovery mechanisms are highly sought-after. In this paper, we present a Neighbor Discovery with Sectored Antenna (NDSA) protocol for WSNs with the sectored antenna. NDSA distinguish itself from other protocols in four distinct ways. Firstly, the introduction of super-frame like structure to support the duty-cycled operation of WSNs. Secondly, the protocol adapts its operation according to the network dynamics by leveraging the in-network information. Thirdly, a cooperative mechanism through which nodes utilize the information about their discovered neighbors to avoid an excessive exchange of control messages. Finally, handling the channel access details to discover neighbors faster with fewer message collisions. Through a comprehensive simulation-based study, the results show that the proposed protocol outperformed the random and serialized approaches to neighbor discovery in terms of discovery latency while significantly minimizing the communication overhead.

Neighbor discovery in mobile sensing applications: A comprehensive survey

The ubiquitous deployment of personal mobile devices today has boosted numerous mobile sensing applications where sensing data should be timely collected and exchanged among participating sensors. An important bootstrapping primitive in such applications is neighbor discovery. Designing distributed neighbor discovery protocols in mobile sensing applications is particularly challenging because of the duty cycling operation mode where mobile devices, usually battery-powered, switch between active and dormant modes periodically to conserve energy. In this paper, we give a comprehensive survey on the latest advance and development in this field by covering probabilistic, deterministic and collaborative neighbor discovery approaches developed in the literature. The focus of our survey on the developed neighbor discovery protocols is their design ideas and methodologies that may inspire and guide the development of new solutions in the future research. We also highlight a number of important and relevant research challenges that have not been addressed in the existing literature and that deserve further attention and investigation.

Distributed communication model in hierarchical Infostation systems

AbstractThe Infostations system, small and separated islands of coverage, provides intermittent but very high speed data rates. A new communication model is needed to carry this kind of architecture. Mainly, the discontinuous coverage affects the way data are exchanged between mobile terminals and the network. Moreover, the short time the mobile terminal spends in the coverage area has a direct impact on the network performance. Thus, it is essential to avoid bandwidth wasting due to the overall delay by performing mobility prediction. A new mobility prediction protocol called the Distributed Neighbor Discovery Protocol (DNDP) is proposed. DNDP handles a neighbor graph table that dynamically configures itself according to the terminals' mobility. The simulation shows that the terminals service continuity is significantly improved thanks to DNDP. Copyright © 2007 John Wiley & Sons, Ltd.