Throughput capacity of random ad hoc networks with infrastructure support

• DOI: 10.1145/938985.938992
• Publication Date: 2004-04-19T17:18:43Z
• Authors: Ulaş C. Kozat; Leandros Tassiulas
• Keywords: Random access

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