We develop a new kind of fully distributed random backoff algorithm which completely removes collisions in a single channel carrier-sense multiple access based network without any assistance from a centralized coordination function. Based on carefully chosen design objectives, three principles are established to contribute to the design of the zero-collision achieving random backoff algorithm, which is dubbed as ZeroCollision. To find non-colliding access slots, a station learns from its past transmission history and from neighbors' activities. By building sufficient statistics for its access decision, the station is guaranteed to avoid collisions.
By preventing collisions, the network performance is enhanced in terms of primary performance metrics such as throughput and transmission delay in comparison to the generic exponential backoff algorithm. We also analyze the VoIP capacity on top of the IEEE 802.11b PHY/MAC and show that the ZeroCollision algorithm supports maximally 54 users which is approximately 400 percent larger than the exponential backoff algorithm.
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).