CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

Arash Tahmasebi Toyserkani (Institutionen för signaler och system, Kommunikationssystem) ; Mats Rydström (Institutionen för signaler och system, Kommunikationssystem) ; Erik G. Ström (Institutionen för signaler och system, Kommunikationssystem) ; Arne Svensson (Institutionen för signaler och system, Kommunikationssystem)
EURASIP Journal on Wireless Communications and Networking (1687-1472). Vol. 2009 (2009), Article ID 804621, p. 1-10.
[Artikel, refereegranskad vetenskaplig]

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.

Nyckelord: scheduling, TDMA networks, packet error probability



Denna post skapades 2009-10-20. Senast ändrad 2014-09-29.
CPL Pubid: 100303

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)