Route Discovery and Capacity of Ad hoc Networks

02/18/2022
by   Eugene Perevalov, et al.
0

Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network n. However the need for the nodes to find or repair routes has not been analyzed in this context. In this paper, we explicitly take route discovery into account and obtain the scaling law for the throughput capacity under general assumptions on the network environment, node behavior, and the quality of route discovery algorithms. We also discuss a number of possible scenarios and show that the need for route discovery may change the scaling for the throughput capacity dramatically.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2019

Minus HELLO: Minus Hello Embedded Protocols for Energy Preservation in Mobile Ad-hoc networks

In mobile ad-hoc networks, nodes have to transmit HELLO or Route Request...
research
05/26/2019

Fuzzy-Controlled Scheduling of Route-Request Packets (FSRR) in Mobile Ad Hoc Networks

In ad hoc networks, the scheduling of route-request packets should be di...
research
05/29/2020

On Search Friction of Route Discovery in Offchain Networks

Offchain networks provide a promising solution to overcome the scalabili...
research
04/19/2020

Mobility-Assisted Covert Communication over Wireless Ad Hoc Networks

We study the effect of node mobility on the throughput scaling of the co...
research
06/21/2021

Objective discovery of dominant dynamical processes with intelligible machine learning

The advent of big data has vast potential for discovery in natural pheno...
research
11/17/2021

Search and Rescue in a Maze-like Environment with Ant and Dijkstra Algorithms

With the growing reliability of modern Ad Hoc Networks, it is encouragin...
research
12/13/2017

Performance Analysis of Dynamic Source Routing Protocol

Dynamic Source Routing (DSR) is an efficient on-demand routing protocol ...

Please sign up or login with your details

Forgot password? Click here to reset