Weighted hierarchical backoff algorithm for wireless ad hoc networks
Timucin Ozugur · 2002
This paper covers new backoff algorithms, which decrease collisions on the non-reserved broadcast packets in wireless ad-hoc networks. Control information broadcasts provide the understanding of the local neighborhood topology to achieve some necessary network mechanisms in the ad-hoc networking. However, the exponential backoff algorithm introduces collisions due to non-reservation characteristics of the broadcast messaging. We propose a hierarchical and weighted-hierarchical backoff algorithm to decrease the percentage of collisions. These new algorithms classify the stations in a distributed manner within their local neighborhood. Each classified station uses the some portion of the backoff window size, which is assigned to this hierarchical group of stations. A local neighborhood discovery procedure is also proposed for stations to advertise their number of logical connections within their local neighborhoods. The proposed backoff algorithms use this procedure to advertise the connection values.