DocumentCode :
1859090
Title :
Message-Passing for Wireless Scheduling: An Experimental Study
Author :
Giaccone, Paolo ; Shah, Devavrat
Author_Institution :
Dipt. di Elettron., Politec. di Torino, Torino, Italy
fYear :
2010
fDate :
2-5 Aug. 2010
Firstpage :
1
Lastpage :
6
Abstract :
In the recent years, message-passing paradigm has emerged as a canonical algorithmic solution to solve networkwide problems by means of minimal local information exchange, across variety of disciplines. The primary purpose of this work is to understand tradeoffs offered between network performance and protocol overhead by a class of message-passing algorithms - belief propagation and its variants. Through an extensive simulation study, for prototypical network topological models, we find that such class can lead to wireless network scheduling algorithms under which each node exchanges exactly one message per time-slot and achieve reasonably high performance. This algorithm utilizes the "continuity" of network state to achieve high performance in presence of minimal information exchange.
Keywords :
message passing; protocols; radio networks; scheduling; telecommunication network topology; belief propagation; canonical algorithmic solution; local information exchange; message passing; network performance; network state continuity; protocol overhead; prototypical network topological models; wireless network scheduling algorithms; Algorithm design and analysis; Approximation algorithms; Belief propagation; Interference; Noise measurement; Throughput; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Communications and Networks (ICCCN), 2010 Proceedings of 19th International Conference on
Conference_Location :
Zurich
ISSN :
1095-2055
Print_ISBN :
978-1-4244-7114-0
Type :
conf
DOI :
10.1109/ICCCN.2010.5560157
Filename :
5560157
Link To Document :
بازگشت