Throughput capacity of random ad hoc networks with infrastructure support

DMCA

Throughput capacity of random ad hoc networks with infrastructure support (2003)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Ulas C. Kozat , Leandros Tassiulas

Venue:	in MOBICOM
Citations:	100 - 0 self

BibTeX

@INPROCEEDINGS{Kozat03throughputcapacity,
    author = {Ulas C. Kozat and Leandros Tassiulas},
    title = {Throughput capacity of random ad hoc networks with infrastructure support},
    booktitle = {in MOBICOM},
    year = {2003},
    pages = {55--65},
    publisher = {ACM}
}

OpenURL

Abstract

In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a network architecture allows ad hoc nodes to communicate with each other by purely using the remaining ad hoc nodes as their relays. In addition, ad hoc nodes can also utilize the existing infrastructure fully or partially by reaching any access point (or gateway) of the infrastructure network in a single or multi-hop fashion. Using the same tools as in [1], we show that the per source node capacity of Θ(W / log(N)) can be achieved in a random network scenario with the following assumptions: (i) The number of ad hoc nodes per access point is bounded above, (ii) each wireless node, including the access points, is able to transmit at W bits/sec using a fixed transmission range, and (iii) N ad hoc nodes, excluding the access points, constitute a connected topology graph. This is a significant improvement over the capacity of random ad hoc networks with no infrastructure support which is found as Θ(W / p N log(N)) in [1]. Although better capacity figures may be obtained by complex network coding or exploiting mobility in the network, infrastructure approach provides a simpler mechanism that has more practical aspects. We also show that even when less stringent requirements are imposed on topology connectivity, a per source node capacity figure that is arbitrarily close to Θ(1) cannot be obtained. Nevertheless, under these weak conditions, we can further improve per node throughput significantly.

Keyphrases

ad hoc node access point infrastructure support random ad hoc network throughput capacity complex network present support random flat topology stringent requirement practical aspect multi-hop fashion following assumption topology connectivity transport capacity significant improvement network architecture fixed transmission range random network scenario ad hoc network capacity figure weak condition connected topology graph node throughput infrastructure network source node capacity infinite capacity infrastructure network infrastructure approach simpler mechanism source node capacity figure

DMCA