Hashing Backoff: A Collision-Free Wireless Access Method

  • Authors:
  • Paul Starzetz;Martin Heusse;Franck Rousseau;Andrzej Duda

  • Affiliations:
  • Grenoble Informatics Laboratory (LIG), Saint Martin d'Hères Cedex, France 38402;Grenoble Informatics Laboratory (LIG), Saint Martin d'Hères Cedex, France 38402;Grenoble Informatics Laboratory (LIG), Saint Martin d'Hères Cedex, France 38402;Grenoble Informatics Laboratory (LIG), Saint Martin d'Hères Cedex, France 38402

  • Venue:
  • NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose Hashing Backoff , an access method in which stations select backoff values by means of asymptotically orthogonal hashing functions, so that contending stations converge to a collision-free state. This solution is a half-way between TDMA, CDMA, and random access. Our simulations show that it presents significant improvement over Idle Sense , the access method with much better performance that the standard 802.11 DCF. The fact that the proposed method focuses on reducing collisions makes it particularly interesting for some specific applications such as sensor networks in which eliminating collisions leads to energy savings.