Proceedings of the 6th ACM Workshop on Wireless Multimedia Networking and Computing 2011
DOI: 10.1145/2069117.2069121
|View full text |Cite
|
Sign up to set email alerts
|

Latency minimized probabilistic CSMA/CA

Abstract: In this paper, we investigate and propose a latency minimized CSMA variation to enhance the performance of event-driven wireless ad hoc network applications. By first analyzing latency performance based on p-Persistence CSMA, we show that the optimal transmission probability for latency minimized p-Persistent CSMA (LMPP) in an event-driven scenario equals to the optimal transmission probability for throughput maximization in a saturated wireless local area network when the number of competing nodes is much lar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…EDeM and LaMP also outperform Sift [92]. It also shows that when n is getting closer to N the performance of LaMP becomes better and better.…”
Section: Performance Of Edemmentioning
confidence: 80%
See 3 more Smart Citations
“…EDeM and LaMP also outperform Sift [92]. It also shows that when n is getting closer to N the performance of LaMP becomes better and better.…”
Section: Performance Of Edemmentioning
confidence: 80%
“…To minimize the latency, we perform dL p ðnÞ dp ¼ 0 and derive the optimal transmission probability p*(n) under n active contenders [92]:…”
Section: Latency Minimized P-persistent Csma (Lmpp)mentioning
confidence: 99%
See 2 more Smart Citations
“…If a carrier is detected, the node waits for the current transmission to finish before starting a new one. Multiple nodes may send and receive on the same media in turn using CSMA [31][32][33][34][35].…”
Section: Related Workmentioning
confidence: 99%