Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
Scaling laws for ad hoc wireless networks: an information theoretic approach
Foundations and Trends® in Networking
Throughput analysis of IEEE802.11 multi-hop ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks
IEEE Transactions on Mobile Computing
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Capacity of large-scale CSMA wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
On the fairness of large CSMA networks
IEEE Journal on Selected Areas in Communications - Special issue on stochastic geometry and random graphs for the analysis and designof wireless networks
The capacity of wireless networks: information-theoretic and physical limits
IEEE Transactions on Information Theory
Markov approximation for combinatorial network optimization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Green wave: latency and capacity-efficient sleep scheduling for wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Effective carrier sensing in CSMA networks under cumulative interference
INFOCOM'10 Proceedings of the 29th conference on Information communications
Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks
IEEE Transactions on Mobile Computing
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
The capacity of wireless networks
IEEE Transactions on Information Theory
An Aloha protocol for multihop mobile wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Rethinking information theory for mobile ad hoc networks
IEEE Communications Magazine
| Hi-index | 0.00 |
In the literature, asymptotic studies of multihop wireless network capacity often consider only centralized and deterministic time-division multiple-access (TDMA) coordination schemes. There have been fewer studies of the asymptotic capacity of large-scale wireless networks based on carrier-sensing multiple access (CSMA), which schedules transmissions in a distributed and random manner. With the rapid and widespread adoption of CSMA technology, a critical question is whether CSMA networks can be as scalable as TDMA networks. To answer this question and explore the capacity of CSMA networks, we first formulate the models of CSMA protocols to take into account the unique CSMA characteristics not captured by existing interference models in the literature. These CSMA models determine the feasible states, and consequently the capacity of CSMA networks. We then study the throughput efficiency of CSMA scheduling as compared to TDMA. Finally, we tune the CSMA parameters so as to maximize the throughput to the optimal order. As a result, we show that CSMA can achieve throughput as Ω(1/√n), the same order as optimal centralized TDMA, on uniform random networks. Our CSMA scheme makes use of an efficient backbone-peripheral routing scheme and a careful design of dual carrier-sensing and dual channel scheme. We also address implementation issues of our CSMA scheme.