Hashing Backoff: a Collision-Free Wireless Access Method

Paul Starzetz Martin Heusse 1 Franck Rousseau 1 Andrzej Duda 1
1 Drakkar
LIG - Laboratoire d'Informatique de Grenoble
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.
Type de document :
Communication dans un congrès
Proceedings of IFIP Networking 2009, 2009, Aachen, Germany. Springer Berlin / Heidelberg, 5550, pp.429--441, 2009, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/hal-01073337
Contributeur : Gilles Berger Sabbatel <>
Soumis le : jeudi 9 octobre 2014 - 15:15:28
Dernière modification le : jeudi 18 août 2016 - 01:07:42

Identifiants

  • HAL Id : hal-01073337, version 1

Collections

Citation

Paul Starzetz, Martin Heusse, Franck Rousseau, Andrzej Duda. Hashing Backoff: a Collision-Free Wireless Access Method. Proceedings of IFIP Networking 2009, 2009, Aachen, Germany. Springer Berlin / Heidelberg, 5550, pp.429--441, 2009, Lecture Notes in Computer Science. 〈hal-01073337〉

Partager

Métriques

Consultations de la notice

240