A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks
Journal article, 2009

We 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. We 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. Computer simulations of the proposed scheduling algorithm show that a significant increase in network throughput can be achieved compared to uncoordinated scheduling. Empirical trials also indicate that the proposed optimization algorithm almost always converges to an optimal schedule with a reasonable number of iterations. Thus, the proposed algorithm can also be used for bench-marking suboptimal scheduling algorithms.

TDMA networks

packet error probability

scheduling

Author

Arash Tahmasebi Toyserkani

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Mats Rydström

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Erik Ström

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Arne Svensson

Chalmers, Signals and Systems, Communication and Antenna Systems, Communication Systems

Eurasip Journal on Wireless Communications and Networking

1687-1472 (ISSN) 1687-1499 (eISSN)

Vol. 2009 Article ID 804621 1-10

Subject Categories

Telecommunications

Signal Processing

DOI

10.1155/2009/804621

More information

Created

10/7/2017