Message-passing for wireless scheduling: An experimental study
Author(s)
Giaccone, Paolo; Shah, Devavrat
DownloadShah_Message-passing.pdf (158.3Kb)
PUBLISHER_POLICY
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2010-09Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Proceedings of 19th International Conference on Computer Communications and Networks 2010 (ICCCN)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Giaccone, Paolo, and Devavrat Shah. “Message-Passing for Wireless Scheduling: An Experimental Study.” Proceedings of 19th International Conference on Computer Communications and Networks 2010 (ICCCN). 1–6. © Copyright 2010 IEEE
Version: Final published version
ISBN
978-1-4244-7114-0
ISSN
1095-2055