Scalable upper bounding models for wireless networks
Name
Scalable-Upper-Bounding.pdf
Size
138.51 KB
Format
Adobe PDF
Checksum (MD5)
a97787ff6fa3d23f170f7942982d9c49
Author(s)
Du, Jinfeng
Medard, Muriel
Xiao, Ming
Skoglund, Mikael
Date Issued
June 2014
Journal
Proceedings of the 2014 IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Du, Jinfeng, Muriel Medard, Ming Xiao, and Mikael Skoglund. “Scalable Upper Bounding Models for Wireless Networks.” 2014 IEEE International Symposium on Information Theory (June 2014).
Version
Author's final manuscript
Abstract
The framework of network equivalence theory developed by Koetter et al. introduces a notion of channel emulation to construct noiseless networks as upper/lower bounding models for the original noisy network. This paper presents scalable upper bounding models for wireless networks, by firstly extending the “one-shot” bounding models developed by Calmon et al. and then integrating them with network equivalence tools. A channel decoupling method is proposed to decompose wireless networks into decoupled multiple-access channels (MACs) and broadcast channels (BCs). The main advantages of the proposed method is its simplicity and the fact that it can be extended easily to large networks with a complexity that grows linearly with the number of nodes. It is demonstrated that the resulting upper bounds can approach the capacity in some setups.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2014.6874831
