Randomized algorithms
Capacity bounds for three classes of wireless networks: asymmetric, cluster, and hybrid
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Scaling laws for ad hoc wireless networks: an information theoretic approach
Foundations and Trends® in Networking
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
Interference and outage in clustered wireless ad hoc networks
IEEE Transactions on Information Theory
The capacity of wireless networks
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Stochastic geometry and random graphs for the analysis and design of wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Capacity scaling of large wireless networks with heterogeneous clusters
Performance Evaluation
Capacity scaling of wireless networks with inhomogeneous node density: lower bounds
IEEE/ACM Transactions on Networking (TON)
Capacity bounds of three-dimensional wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Capacity scaling of general cognitive networks
IEEE/ACM Transactions on Networking (TON)
A Constructive Capacity Lower Bound of the Inhomogeneous Wireless Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We analyze the capacity scaling laws of wireless ad hoc networks comprising significant inhomogeneities in the node spatial distribution over the network area. In particular, we consider nodes placed according to a shot-noise Cox process, which allows to model the clustering behavior usually recognized in large-scale systems. For this class of networks, we introduce novel techniques to compute upper bounds to the available per-flow throughput as the number of nodes tends to infinity, which are tight in the case of interference limited systems.