Performance of binary exponential backoff CSMA in WiFi and optimal routing in mobile ad hoc networks

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.

Bibliographic Details
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:
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]
Online Access:https://dmtcs.episciences.org/3375/pdf

Similar Items

Similar Items