Abstract

This paper presents an analytical model to compute the average service time and jitter experienced by a data packet when transmitted in a saturated IEEE 802.11 ad hoc network. In contrast to traditional work in the literature, in which a distribution is usually _tted or assumed, we use a bottom-up approach and build the _rst two moments of the service time based on the IEEE 802.11 DCF binary exponential backoff algorithm and the events underneath its operation. Our model is general enough to be applied to any type of IEEE 802.11 wireless ad hoc network where the channel state probabilities driving a node's backoff operation are known. We apply our model to saturated single-hop ad hoc networks under ideal channel conditions. We validate our model through extensive simulations and conduct a performance evaluation of a node's average service time and jitter for both direct sequence and frequency-hopping spread spectrum physical layers as speci_ed by the IEEE 802.11 b standard.

Highlights

  • During the past few years we have witnessed an evergrowing interest in wireless technologies and their application to portable devices

  • In the IEEE 802.1 I, the main mechanism to access the medium is the distributed coordination function (DCF), which is a random access scheme based on the carrier sense multiple access with collision avoidance (CSMA/CA)

  • The majority of the work on analyzing the performance of IEEE 802.1 I DCF has concentrated on its throughput [2, 3, 4, II] and not much attention has been given to analyzing its delay

Read more

Summary

INTRODUCTION

During the past few years we have witnessed an evergrowing interest in wireless technologies and their application to portable devices. We apply our model to saturated, single­ hop ad hoc networks with ideal channel conditions, operating under the four-way handshake mechanism of the DCF For this case, the channel state probabilities we obtain are based on the work by Bianchi [2], which provides a set of nonlinear equations that relates a packet's collision probability with its transmission probability (in steadystate). The reason for our approximation is twofold: ease of computation and the need to better understand the impact of system parameters on Revista da Sociedade Brasileira de Telecomunicac;oes Volume 19, Numero 3, Dezembro de 2004 channel and system probabilities (something that is not so clear under a nonlinear system of equations) We validate both our model and thelinearized system through extensive simulations and conduct a performance evaluation of a node's average service time and jitter for the direc~ sequence spread spectrum (DSSS) and frequency­ hoppmg spread spectrum (FHSS) physical layers under the same scenario.

THE DISTRIBUTED COORDINATION FUNCTION
ANALVTICAL MODEL
SERVICE TIME CHARACTERIZATION
CHANNEL PROBABILITIES
MODEL VALIDATION
PERFORMANCE EVALUATION
CONCLUSIONS
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call