Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networks
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.
Main Authors: | Philippe Jacquet, Amina Meraihi Naimi, Georgios Rodolakis |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2005-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3375/pdf |
Similar Items
-
Randomized Optimization: a Probabilistic Analysis
by: Jean Cardinal, et al.
Published: (2007-01-01) -
Tail Bounds for the Wiener Index of Random Trees
by: Tämur Ali Khan, et al.
Published: (2007-01-01) -
Asymptotics of Riordan arrays
by: Mark C. Wilson
Published: (2005-01-01) -
Non Uniform Random Walks
by: Nisheeth Vishnoi
Published: (2003-01-01) -
Stokes polyhedra for $X$-shaped polyminos
by: Yu. Baryshnikov, et al.
Published: (2012-01-01)