Reliable neighbor discovery for mobile ad hoc networks

Abstract

We define a reliable neighbor discovery layer for mobile adhoc networks and present two algorithms that implement this layer as a service with varying progress guarantees. Our algorithms are implemented atop an abstract MAC layer [13], which deals with the lower level details of collision detection and contention. Specifically, we first describe a basic region-based neighbor discovery protocol with weak progress guarantees. Informally speaking, this protocol does not guarantee communication links when nodes move quickly across region boundaries. To overcome this limitation, we describe a technique that uses a basic neighbor discovery protocol as a black box and boosts its progress guarantees. The key idea behind this technique is to use multiple partitions overlayed in a specific way, and associate with each partition an instance of the basic neighbor discovery protocol. We show the output of these instances can be composed in a way that provides stronger progress guarantees. In the last section of the paper we discuss different user layer algorithms which would benefit from the reliable neighbor discovery layer described in this paper.

A binary artificial bee colony algorithm for constructing spanning trees in vehicular ad hoc networks

“…Gorrieri et al analyzed the performance of clustered vehicular sensor networks, and found some insights in the trade-off between decision delay and energy efficiency [12]. Cornejo et al studied a reliable neighbor discovery layer for MANETs, which could be applied in regular square region or hexagonal tiling region [13]. Han et al investigated the relay placement and power allocation for cooperative relaying [14].…”

Trust-Aware Consensus-Inspired Distributed Cooperative Spectrum Sensing for Cognitive Radio Ad Hoc Networks

“…The determination of the direct neighboring nodes is generally done using hello protocols where each node periodically broadcasts a hello message. Each node considers another node as a direct one-hop neighbor only if it receives at least one hello message from it [33] [34]. The random access discovery schemes require the nodes to be randomly in a "listen" or "transmit" mode in each time slot so that each node receives the hello message from every neighbor at least once in a predefined time period.…”

A Local Broadcast Layer for the SINR Network Model

“…al [37] using Decay, and by [38] using Analog Network Coding. Applications of absMACs: The first to study an advanced problem using the absMAC of [41] were Cornejo et al [10,11], who investigated neighbor discovery in a mobile ad hoc network environment. Global SMB and MMB broadcast were studied by [37] in probabilistic environments and by Ghaffari et al [23] in the presence of unreliable links.…”

“…Due to the choice of Q this is O(log α (Λ) · log(1/ε approg )). All this is executed for each of the Φ phases of an epoch (Lines [6][7][8][9][10][11][12][13][14][15]. Thus the total runtime of an epoch is…”