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. © IFIP International Federation for Information Processing 2009.
CITATION STYLE
Starzetz, P., Heusse, M., Rousseau, F., & Duda, A. (2009). Hashing backoff: A collision-free wireless access method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5550 LNCS, pp. 429–441). https://doi.org/10.1007/978-3-642-01399-7_34
Mendeley helps you to discover research relevant for your work.