Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

We consider the problem of distributed scheduling in wireless networks subject to simple collision constraints. We define the efficiency of a distributed scheduling algorithm to be the largest number (fraction) such that the throughput under the distributed scheduling policy is at least equal to the...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on mobile computing Jg. 6; H. 6; S. 595 - 605
Hauptverfasser:	Xinzhou Wu, Srikant, R., Perkins, J.R.
Format:	Magazine Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.06.2007 IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Applied sciences Efficiency Exact sciences and technology Greedy algorithms Interference constraints Lower bounds Multihop wireless networks Networks Policies Regulators resource allocation Resource management Scheduling Scheduling algorithm Spread spectrum communication Stability Studies Switches Switching and signalling Systems, networks and services of telecommunications Telecommunication traffic Telecommunications Telecommunications and information theory Teletraffic Throughput Traffic control Traffic engineering Traffic flow Transmission and modulation (techniques and equipments) Wireless networks Performance evaluation Lower bound Packet switching greedy algorithms Multihop wireless networks Wireless telecommunication Resource allocation Information rate Teletraffic Scheduling Information transmission Multihop network Queueing system Traffic management Distributed algorithm Greedy algorithm Traffic control Resource management
ISSN:	1536-1233, 1558-0660
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!