Optimal Distributed Scheduling under Time-Varying Conditions: A Fast-CSMA Algorithm with Applications

Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these algorithms are not well-suited for time-varying environments (i.e....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on wireless communications Jg. 12; H. 7; S. 3278 - 3288
Hauptverfasser:	Bin Li, Eryilmaz, A.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.07.2013 Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithm design and analysis Algorithms Applied sciences Channels CSMA deadline-constrained scheduling Detection, estimation, filtering, equalization, prediction distributed algorithm Exact sciences and technology Fading Information, signal and communications theory Markov analysis Markov processes Multiaccess communication Networks Organization and planning of networks (techniques and equipments) Policies Schedules Scheduling Signal and communications theory Signal, noise Studies Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Traffic engineering Traffic flow Transmission and modulation (techniques and equipments) Wireless communication wireless fading Wireless networks Parameter estimation Wireless telecommunication Network architecture Information rate Time variation Optimal design Convergence speed Markov chain Topological structure Carrier sense multiple access Channel estimation Convergence rate Delay time Optimal planning CSMA Fast algorithm Fading channels Fading wireless fading Time variable channel Scheduling Steady state Information transmission distributed algorithm Telecommunication channels Wireless network deadline-constrained scheduling
ISSN:	1536-1276, 1558-2248
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!