# A neighbor detection algorithm based on multiple virtual mobile nodes for mobile ad hoc networks

## Details

Serval ID

serval:BIB_AA6FB8E27955

Type

**Article**: article from journal or magazin.

Collection

Publications

Institution

Title

A neighbor detection algorithm based on multiple virtual mobile nodes for mobile ad hoc networks

Journal

Computer Networks

ISSN

1389-1286

Publication state

Published

Issued date

01/2017

Peer-reviewed

Oui

Volume

112

Pages

294-313

Language

english

Abstract

We introduce an algorithm that implements a time-limited neighbor detector service in mobile ad hoc networks. The time-limited neighbor detector enables a mobile device to detect other nearby devices in the past, present and up to some bounded time interval in the future. In particular, it can be used by a new trend of mobile applications known as proximity-based mobile applications. To implement the time-limited neighbor detector, our algorithm uses n = 2(k) virtual mobile nodes where k is a non-negative integer. A virtual mobile node is an abstraction that is akin to a mobile node that travels in the network in a predefined trajectory. In practice, it can be implemented by a set of real nodes based on a replicated state machine approach. Our algorithm implements the neighbor detector for real nodes located in a circular region. We also assume that each real node can accurately predict its own locations up to some bounded time interval Air Delta(predict) in the future. The key idea of the algorithm is that the virtual mobile nodes regularly collect location predictions of real nodes from different subregions, meet to share what they have collected with each other and then distribute the collected location predictions to real nodes. Thus, each real node can use the distributed location predictions for neighbor detection. We show that our algorithm is correct in periodically well-populated regions. We also define the minimum value of Delta(predict) for which the algorithm is correct. Compared to the previously proposed solution also based on the notion of virtual mobile nodes, our algorithm has two advantages: (1) it tolerates the failure of one to all virtual mobile nodes; (2) as n grows, it remains correct with smaller values of Delta(predict). This feature makes the real-world deployment of the neighbor detector easier since with the existing prediction methods, location predictions usually tend to become less accurate as Delta(predict) increases. We also show that the cost of our algorithm (in terms of communication) scales linearly with the number of virtual mobile nodes.

Keywords

Neighbor detection, Virtual mobile node, MANET, Proximity-based mobile applications, Distributed algorithms, Smartphone

Web of science

Create date

13/07/2017 13:49

Last modification date

20/08/2019 15:14