Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
Understanding the real-world performance of carrier sense
Proceedings of the 2005 ACM SIGCOMM workshop on Experimental approaches to wireless network design and analysis
Topology control meets SINR: the scheduling complexity of arbitrary topologies
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 12th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Proceedings of the 12th annual international conference on Mobile computing and networking
Throughput analysis of IEEE802.11 multi-hop ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Improving Throughput and Fairness by Reducing Exposed and Hidden Nodes in 802.11 Networks
IEEE Transactions on Mobile Computing
Capacity of large-scale CSMA wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Wireless Link Scheduling With Power Control and SINR Constraints
IEEE Transactions on Information Theory
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?
IEEE Communications Magazine
Capacity of large-scale CSMA wireless networks
IEEE/ACM Transactions on Networking (TON)
Deterministic distributed data aggregation under the SINR model
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Applications of belief propagation in CSMA wireless networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.01 |
This paper proposes and investigates the concept of a safe carrier-sensing range that guarantees interference-safe (also termed hidden-node-free) transmissions in CSMA networks under the cumulative interference model. Compared with the safe carrier-sensing range under the commonly assumed but less realistic pairwise interference model, we show that the safe carrier-sensing range required under the cumulative interference model is larger by a constant multiplicative factor. For example, the factor is 1.4 if the SINR requirement is 10dB and the pathloss exponent is 4. We further show that the concept of a safe carrier-sensing range, although amenable to elegant analytical results, is inherently not compatible with the conventional power-threshold carrier-sensing mechanism (e.g., that used in IEEE 802.11). Specifically, the absolute power sensed by a node in the conventional mechanism does not contain enough information for it to derive its distances from other concurrent transmitter nodes. We show that, fortunately, a carrier-sensing mechanism called Incremental-Power Carrier-Sensing (IPCS) can realize the carrier-sensing range concept in a simple way. Instead of monitoring the absolute detected power, the IPCS mechanism monitors every increment in the detected power. This means that IPCS can separate the detected power of every concurrent transmitter, and map the power profile to the required distance information. Our extensive simulation results indicate that IPCS can boost spatial reuse and network throughput by more than 60% relative to the conventional carrier-sensing mechanism. Last but not least, IPCS not only allows us to implement our safe carrier-sensing range, it also ties up a loose end in many other prior theoretical works that implicitly assume the use of a carrier-sensing range (safe or otherwise) without an explicit design to realize it.