Information Theory and Reliable Communication
Information Theory and Reliable Communication
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
A Multi-Commodity Flow Approach for Globally Aware Routing in Multi-Hop Wireless Networks
PERCOM '06 Proceedings of the Fourth Annual IEEE International Conference on Pervasive Computing and Communications
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Rate-distortion based link state update
Computer Networks: The International Journal of Computer and Telecommunications Networking
The capacity of wireless networks
IEEE Transactions on Information Theory
A network information theory for wireless communication: scaling laws and optimal operation
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
The effect of information on scheduling performance in multi-hop wireless networks
IEEE Transactions on Wireless Communications
| Hi-index | 0.00 |
Available network information is an important factor in determining network performance. In this paper, we study the basic limits on the amount of network information that should be transmitted in the network to achieve a given level of network performance. From the perspective of information theory, network information is an information source, and the lower bound on network information is the minimum code letters required to encode the source. We propose a general information-theoretic framework, which can be applied to any network, to study the effect of network information on the performance of any network protocol. We also analyze the tradeoff between network performance improvement and network information collection overhead. To illustrate our approach, we use the framework to determine the lower bound on the traffic information for a simple scheduling protocol in wireless networks. The results in this paper may be used to analyze and evaluate network protocols and guide future designs.