Randomized Broadcast Channel Access Algorithms for Ad Hoc Networks

Authors:
Zhijun Cai;Mi Lu;Xiaodong Wang
Affiliations:
-;-;-
Venue:
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Year:
2002

Citing 0
Cited 4

Characterization of hello message exchange for estimating distribution of network residual energy

Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
COMIC: intelligent contention window control for distributed medium access

IEEE Communications Letters
Sift: a MAC protocol for event-driven wireless sensor networks

EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Carrier sense multiple access with improvised collision avoidance and short-term fairness

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of broadcast channel access in single-hop and multihop ad hoc networks is considered. Two novel randomized and distributed channel access algorithms are developed and analyzed for single-hop and multihop networks, respectively. These algorithms are designed based on maximizing the worst-case channel efficiency, by optimizing some key parameters, including the backoff probability distribution and the slot length. The proposed algorithm for single-hop networks offers significantly higher throughput than the CSMA methods when the traffic load is heavy, while still achieving good performance when the load is light or medium. The proposed algorithm for multihop networks can flexibly adapt to the traffic load, and offers much better throughput performance than the existing broadcastscheduling algorithms in light or medium load.