Capacity of Ad Hoc wireless networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
On the maximum stable throughput problem in random networks with directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On the capacity improvement of ad hoc wireless networks using directional antennas
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Impact of interferences on connectivity in ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Wireless Communications & Mobile Computing - Special Issue: Scalability Issues in Wireless Networks—Architectures, Protocols and Services
Capacity regions for wireless ad hoc networks
IEEE Transactions on Wireless Communications
The capacity of wireless networks
IEEE Transactions on Information Theory
Towards an information theory of large networks: an achievable rate region
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Propagation measurements and models for wireless communications channels
IEEE Communications Magazine
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
On unbounded path-loss models: effects of singularity on wireless network performance
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
| Hi-index | 0.00 |
We consider a wireless network of N nodes equipped with omnidirectional antennas, and we extend the capacity results of some previous works by finding bounds on the maximum achievable per-node end-to-end throughput, λe, while using a general network model and a bounded propagation model. Specifically, we show that when the network domain has a fixed area, λe is Θ(1/N) even when the mobility pattern of the nodes, the temporal variation of transmission powers, the source-destination pairs, and the possibly multi-path routes between them are optimally chosen. This result continues to hold even when the nodes are capable of maintaining multiple transmissions and/or receptions simultaneously, or when the communication bandwidth is partitioned into sub-channels of smaller bandwidth. We also address how λe depends on the other network parameters such as the area of the network domain, the path loss exponent, or the average number of hops between a source and a destination. Finally, we determine some required conditions to achieve a non-vanishing per-node end-to-end throughput as the number of nodes in the network grows large.