Abstract
Throughput capacity of large ad hoc networks has been shown to scale adversely with the size of network . 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.
Highlights
In wireless ad hoc networks, the terminals communicate without the aid of any infrastructure
The subject of this paper is the effect of the route discovery process (RDP) on the throughput capacity of ad hoc networks
We introduce the following notation for the quantities related to the RDP processes
Summary
In wireless ad hoc networks, the terminals (nodes) communicate without the aid of any infrastructure. The subject of this paper is the effect of the route discovery process (RDP) on the throughput capacity of ad hoc networks. We determine the impact of the route discovery process on network throughput (defined as in [11]) by determining the asymptotic behavior and scalability with the number of nodes for a network that has both data and RDP transmissions. Which implies routing can cause even more severe throughput scaling problems in ad hoc networks This occurs, for example, when new nodes join a network for which τ(n) is independent of n. When a source node is in the N state, it tries to discover a route to its new destination For that purpose, it broadcasts RREQ packets. If the RDP’s k and m run in the time intervals [tk, sk] and [tm, sm], respectively, the random variables fk and fm are independent provided either sk < tm or sm < tk
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have