Randomized algorithms
Scheduling nonuniform traffic in a packet-switching system with small propagation delay
IEEE/ACM Transactions on Networking (TON)
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
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
Capacity scaling of wireless networks with inhomogeneous node density: upper bounds
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
On capacity scaling in arbitrary wireless 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
A Constructive Capacity Lower Bound of the Inhomogeneous Wireless Networks
Wireless Personal Communications: An International Journal
On the critical delays of mobile networks under Lévy walks and Lévy flights
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.02 |
We consider static ad hoc wireless networks comprising significant inhomogeneities in the node spatial distribution over the area and analyze the scaling laws of their transport capacity as the number of nodes increases. In particular, we consider nodes placed according to a shot-noise Cox process (SNCP), which allows to model the clustering behavior usually recognized in large-scale systems. For this class of networks, we propose novel scheduling and routing schemes that approach previously computed upper bounds to the per-flow throughput as the number of nodes tends to infinity.