Queuing analysis of multi-hop CSMA/CA wireless networks handling many traffic flows

  • Authors:
  • Ben Lauwens;Bart Scheers;Antoine Van de Capelle

  • Affiliations:
  • CISS/TELE, Brussels, Belgium;CISS/TELE, Brussels, Belgium;Katholieke Universiteit Leuven, Heverlee, Belgium

  • Venue:
  • Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper a semi-analytical model for the evaluation of the queuing performance in CSMA-CA multi-hop wireless networks with arbitrary topology is proposed. The intrinsic fairness of single-hop wireless networks can be used to model the network as a processor sharing system with multiple queues, one for each node, and a fair scheduling regime. In the multi-hop scenario, the queuing performance depends on the access protocol, the network topology and the traffic profiles on all links. In a previous paper a model is introduced which allows the calculation of the saturation throughput of nodes in multi-hop CSMA-CA networks with RTS/CTS enabled access. A simplified version of the method is used to estimate the resources of the servers in a many-sources large deviations analysis of a queuing system with multiple coupled servers. The queuing performance of wireless networks can be evaluated by mapping the different servers to the nodes in the network. The cumulative complementary distribution function of the buffer occupation of a node for different topologies is calculated by a novel method and compared to the results of an event-driven simulation with the same settings. A good fit between the semi-analytical model and the simulation is obtained.