Neighbor Discovery with Reception Status Feedback to Transmitters

Abstract

Abstract-Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and synchronous network, where time is divided into slots, each of duration equal to the time required to transmit a hello message, and potentially, some sort of feedback message. Our main contributions lie in detailing the physical layer mechanism for how nodes in receive mode detect the channel status, describing algorithms at higher layers that exploit such a knowledge, and characterizing the significant gain obtained. In particular, we describe one possible physical layer architecture that allows receivers to detect collisions, and then introduce a feedback mechanism that makes the collision information available to the transmitters. This allows nodes to stop transmitting packets as soon as they learn about the successful reception of their discovery messages by the other nodes in the network. Hence, the number of nodes that need to transmit packets decreases over time. These nodes transmit with a probability that is inversely proportional to the number of active nodes in their neighborhood, which is estimated using the collision information available at the nodes. We show through analysis and simulations that our algorithm allows nodes to discover their neighbors in a significantly smaller amount of time compared to the case where reception status feedback is not available to the transmitters.

Cooperative Content Downloading Framework over Cellular Network

“…Since the bandwidth of the 3G/3.5G network over moving vehicular networks is unstable and insufficient, the video quality of the requested video stream may not be good enough. Even using 4G network, the bandwidth still may not be enough for the following concerns [4]. First, other applications may utilize the 4G network simultaneously.…”

Optimized Asynchronous Multichannel Discovery of IEEE 802.15.4-Based Wireless Personal Area Networks

“…Discovery will be achieved at the intersections of the columns and rows. Probabilistic approaches [7], [14], [8] have in common that nodes select their operational state out of the two states, transmit and listen, with a predefined probability. In [7], nodes may also select with some probability a state sleep.…”

“…In [7], nodes may also select with some probability a state sleep. Strategies described in [14], [8] are based on additional feedback. If a node can not receive a beacon due to collisions, it transmits a feedback message.…”

“…Section 4 describes the suggested approach and introduces two discovery strategies, named OPT and SWOPT. We compare the performance of these strategies [5] single RX, TX deterministic -U-Connect [6] single RX, TX deterministic -Birthday Protocols [7] single RX, TX probabilistic number of nodes R. Khalili et al [8] single RX, TX probabilistic max. number of neighbors Quorum-based [9] single RX, TX deterministic size n of groups Theis et al [10] multi RX, TX deter.…”

Group-based discovery in low-duty-cycle mobile sensor networks

“…Discovery in always-awake networks mainly focuses on network models with directional antennas [17], [6], [18], while solutions for discovery in duty-cycled networks are highly diverse, especially in mobile environments which impose time constraints on how fast discovery should be finished. Notable ones includes: stochastic-based protocols [13], [2], quorum-based protocols [16], [20], [12], [11], Disco [3], U-Connect [8], multichannel discovery [9] and collision-aware discovery [10]. In birthday protocol [13], nodes listen, transmit or sleep in a probabilistic round-robin fashion, which statistically trades off between discovery energy with discovery latency.…”