No abstract

No abstract

No 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.

No abstract