A scheduling algorithm for minimizing the packet error probability in clusterized TDMA networks

Authors:
Arash T. Toyserkani;Mats Rydström;Erik G. Ström;Arne Svensson
Affiliations:
Department of Signals and Systems, Chalmers University of Technology, Göteborg, Sweden;Department of Signals and Systems, Chalmers University of Technology, Göteborg, Sweden;Department of Signals and Systems, Chalmers University of Technology, Göteborg, Sweden;Department of Signals and Systems, Chalmers University of Technology, Göteborg, Sweden
Venue:
EURASIP Journal on Wireless Communications and Networking - Special issue on optimization techniques in wireless communications
Year:
2009

Citing 9
Cited 1

Data structures and network algorithms

Data structures and network algorithms
Multicluster, mobile, multimedia radio network

Wireless Networks
A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Error Control Coding, Second Edition

Error Control Coding, Second Edition
A bit-map-assisted energy-efficient MAC scheme for wireless sensor networks

Proceedings of the 3rd international symposium on Information processing in sensor networks
Protocols and Architectures for Wireless Sensor Networks

Protocols and Architectures for Wireless Sensor Networks
Link scheduling in wireless sensor networks: Distributed edge-coloring revisited

Journal of Parallel and Distributed Computing
An application-specific protocol architecture for wireless microsensor networks

IEEE Transactions on Wireless Communications
Opportunistic power scheduling for dynamic multi-server wireless systems

IEEE Transactions on Wireless Communications

An analytical approximation to the block error rate in Nakagami-m non-selective block fading channels

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.