Hashing Backoff: a Collision-Free Wireless Access Method

@inproceedings{starzetz-networking2009,
	author = {Starzetz, Paul and Heusse, Martin and Rousseau, Franck and Duda, Andrzej},
	title = {{Hashing Backoff: a Collision-Free Wireless Access Method}},
	booktitle = {Proceedings of IFIP Networking 2009},
	publisher = {Springer Berlin / Heidelberg},
	issn = {0302-9743 (Print) 1611-3349 (Online)},
	isbn = {978-3-642-01398-0},
	doi = {10.1007/978-3-642-01399-7_34},
	address = {Aachen, Germany},
	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.},
	pages = {429--441},
	volume = 5550,
	series = {Lecture Notes in Computer Science},
	month = May # {~11--15},
	year = 2009,
	subject_collection = {Computer Science}
}