Mobility

A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks

Free registration required

Executive Summary

The authors consider clustered wireless networks, where transceivers in a cluster use a Time-slotted Mechanism (TDMA) to access a wireless channel that is shared among several clusters. An approximate expression for the packet-loss probability is derived for networks with one or more mutually interfering clusters in Rayleigh fading environments, and the approximation is shown to be good for relevant scenarios. They then present a scheduling algorithm, based on Lagrangian duality, that exploits the derived packet-loss model in an attempt to minimize the average packet-loss probability in the network.

  • Format: PDF
  • Size: 1556.4 KB