An emerging field of application for IEEE 802.11 are Wireless Sensor Networks (WSNs) in which the network nodes do not have significant power and cost constraints, such as Vehicular WSNs employing the "under construction" standard IEEE 802.11p. In this paper we provide an analytical evaluation of the performance of IEEE 802.11 Distributed Coordination Function (DCF) in a query-based scenario. In such scenario each node transmits a single packet to a gathering center called sink only upon the sink request. Therefore previous analyses with the assumption of data traffic saturation [8] do not apply as in our case the number of nodes competing for the channel as well and the probability of packet collision are time dependent. Our mathematical model allows the evaluation of the probability that a node succeeds when accessing the channel as a function of time, packet length and number of network nodes. We also validate the results obtained with the model through simulation.
An Analytical Model for IEEE802.11 Networks Running Query-Based Applications / E. Giordano; F. Fabbri; R. Verdone. - ELETTRONICO. - (2009), pp. 151-158. (Intervento presentato al convegno 4th ACM International Workshop on Performance Monitoring, Measurement and Evaluation of Heterogeneous Wireless and Wired Networks tenutosi a Tenerife, Canary Islands, Spain nel October 26-30, 2009) [10.1145/1641913.1641935].
An Analytical Model for IEEE802.11 Networks Running Query-Based Applications
GIORDANO, EUGENIO;FABBRI, FLAVIO;VERDONE, ROBERTO
2009
Abstract
An emerging field of application for IEEE 802.11 are Wireless Sensor Networks (WSNs) in which the network nodes do not have significant power and cost constraints, such as Vehicular WSNs employing the "under construction" standard IEEE 802.11p. In this paper we provide an analytical evaluation of the performance of IEEE 802.11 Distributed Coordination Function (DCF) in a query-based scenario. In such scenario each node transmits a single packet to a gathering center called sink only upon the sink request. Therefore previous analyses with the assumption of data traffic saturation [8] do not apply as in our case the number of nodes competing for the channel as well and the probability of packet collision are time dependent. Our mathematical model allows the evaluation of the probability that a node succeeds when accessing the channel as a function of time, packet length and number of network nodes. We also validate the results obtained with the model through simulation.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
