Message-passing for wireless scheduling: An experimental study
Name
Shah_Message-passing.pdf
Size
158.35 KB
Format
Adobe PDF
Checksum (MD5)
7c0576b468eb9d0e4339c287ac6c45ab
Author(s)
Giaccone, Paolo
Shah, Devavrat
Date Issued
September 2010
Journal
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
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
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.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ICCCN.2010.5560157
