An admission control algorithm for multi-hop 802.11e based WLANs
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Extending the capacity of ad hoc networks beyond network coding
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Challenges: towards truly scalable ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
Performance analysis of a fluid queue with random service rate in discrete time
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
A simple upper bound on random access transport capacity
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Random access transport capacity
IEEE Transactions on Wireless Communications
An investigation on the nature of wireless scheduling
INFOCOM'10 Proceedings of the 29th conference on Information communications
Partial interference and its performance impact on wireless multiple access networks
EURASIP Journal on Wireless Communications and Networking
Network capacity region and minimum energy function for a delay-tolerant mobile ad hoc network
IEEE/ACM Transactions on Networking (TON)
Symptotics: a framework for analyzing the scalability of real-world wireless networks
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
| Hi-index | 754.84 |
We study the stability and capacity problems in regular wireless networks. In the first part of the paper, we provide a general approach to characterizing the capacity region of arbitrary networks, find an outer bound to the capacity region in terms of the transport capacity, and discuss connections between the capacity formulation and the stability of node buffers. In the second part of the paper, we obtain closed-form expressions for the capacity of Manhattan (two-dimensional grid) and ring networks (circular array of nodes). We also find the optimal (i.e., capacity-achieving) medium access and routing policies. Our objective in analyzing regular networks is to provide insights and design guidelines for general networks. The knowledge of the exact capacity enables us to quantify the loss incurred by suboptimal protocols such as slotted ALOHA medium access and random-walk-based routing. Optimal connectivity and the effects of link fading on network capacity are also investigated.