Capacity bounds for ad hoc and hybrid wireless networks
ACM SIGCOMM Computer Communication Review
Determining the end-to-end throughput capacity in multi-hop networks: methodology and applications
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
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
Back-of-the-envelope computation of throughput distributions in CSMA wireless networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
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
Rethinking information theory for mobile ad hoc networks
IEEE Communications Magazine
Markov approximation for combinatorial network optimization
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
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Multicast throughput for large scale cognitive networks
Wireless Networks
On the performance of TCP over throughput-optimal CSMA
Proceedings of the Nineteenth International Workshop on Quality of Service
Analytical modelling in 802.11 ad hoc networks
Computer Communications
Capacity of large-scale CSMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Capacity scaling of general cognitive networks
IEEE/ACM Transactions on Networking (TON)
Throughput analysis of multiple channel based wireless sensor networks
Wireless Networks
Cell-based snapshot and continuous data collection in wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Continuous data aggregation and capacity in probabilistic wireless sensor networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In the literature, asymptotic studies of multi-hop wireless network capacity often consider only centralized and deterministic TDMA (time-division multi-access) coordination schemes. There have been fewer studies of the asymptotic capacity of large-scale wireless networks based on CSMA (carrier-sensing multi-access), which schedules transmissions in a distributed and random manner. With the rapid and widespread adoption of CSMA technology, a critical question is that 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. %and are functions of various CSMA parameters. 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 practical implementation issues of our capacity-optimal CSMA scheme.