Latency minimized probabilistic CSMA/CA

Authors:
Victor Gau;Jenq-Neng Hwang;Kung-Ming Lan;Hung-I Pai;Jian-Ren Chen;Yi-Yuan Chen
Affiliations:
University of Washington, Seattle, WA, USA;University of Washington, Seattle, WA, USA;Industrial Technology Research Institute, Hsinchu, Taiwan Roc;Industrial Technology Research Institute, Hsinchu, Taiwan Roc;Industrial Technology Research Institute, Hsinchu, Taiwan Roc;Industrial Technology Research Institute, Hsinchu, Taiwan Roc
Venue:
Proceedings of the 6th ACM workshop on Wireless multimedia networking and computing
Year:
2011

Citing 7
Cited 0

Data networks (2nd ed.)

Data networks (2nd ed.)
Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit

IEEE/ACM Transactions on Networking (TON)
Adaptive Optimization of IEEE 802.11 DCF Based on Bayesian Estimation of the Number of Competing Terminals

IEEE Transactions on Mobile Computing
Multimedia Networking: From Theory to Practice

Multimedia Networking: From Theory to Practice
Sift: a MAC protocol for event-driven wireless sensor networks

EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Performance analysis of the IEEE 802.11 distributed coordination function

IEEE Journal on Selected Areas in Communications
Collision-minimizing CSMA and its applications to wireless sensor networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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 larger than the number of messages a node intends to receive and the packet length is a lot longer than the slot time. The proposed Latency Minimized Probabilistic CSMA/CA (LaMP) is a multiple access scheme with constant contention window size built atop standard 802.11 CSMA/CA, to approach the performance of LMPP. To deal with the critical contender estimation problem in LaMP, we also propose an Exponentially Decreased Matching (EDeM) strategy to approximate the number of contenders. Simulation results show that the proposed method consistently outperforms existing methods in latency performance.