Philippe Jacquet ; Amina Meraihi Naimi ; Georgios Rodolakis - Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networks

dmtcs:3375 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms - https://doi.org/10.46298/dmtcs.3375
Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networksArticle

Authors: Philippe Jacquet 1,2; Amina Meraihi Naimi 1,2; Georgios Rodolakis 1,2

In this paper we show that the CSMA IEEE 802.11 protocol (Wifi) provides packet access delays asymptotics in power law. This very feature allows us to specify optimal routing via polynomial algorithm while the general case is NP-hard.


Volume: DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: protocol performance,power law,delay routing,mobile ad hoc networks,[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS],[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO],[INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG]

1 Document citing this article

Consultation statistics

This page has been seen 195 times.
This article's PDF has been downloaded 203 times.