Randomized broadcast channel access algorithms for ad hoc networks Conference Paper

abstract

• 2002 IEEE. 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 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 broadcast scheduling algorithms in light or medium load.

name of conference

• Proceedings International Conference on Parallel Processing

authors

• Lu, Mi

published proceedings

• 2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDING

author list (cited authors)

• Cai, Z. J., Lu, M., & Wang, X. D.

citation count

• 6

complete list of authors

• Cai, ZJ||Lu, M||Wang, XD

publication date

• January 2002

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings of the International Conference on Parallel Processing  Journal

keywords

• 40 Engineering
• 4006 Communications Engineering
• 46 Information And Computing Sciences
• 4606 Distributed Computing And Systems Software

Digital Object Identifier (DOI)

• 10.1109/ICPP.2002.1040869

International Standard Book Number (ISBN) 10

• 0-7695-1677-7

start page

• 151

end page

• 158

volume

• 2002-January

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Ficpp.2002.1040869