Information-Theoretic Bounds for Performance of Resource-Constrained Communication Systems

Resource-constrained systems are prevalent in communications. Such a system is composed of many components but only some of them can be allocated with resources such as time slots. According to the amount of information about the system, algorithms are employed to allocate resources and the overall system performance depends on the result of resource allocation. We do not always have complete information, and thus, the system performance may not be satisfactory. In this work, we propose a general model for the resource-constrained communication systems. We draw the relationship between system information and performance and derive the performance bounds for the optimal algorithm for the system. This gives the expected performance corresponding to the available information, and we can determine if we should put more efforts to collect more accurate information before actually constructing an algorithm for the system. Several examples of applications in communications to the model are also given.

[1]  Satosi Watanabe,et al.  Pattern recognition as a quest for minimum entropy , 1981, Pattern Recognit..

[2]  Neri Merhav,et al.  Relations between entropy and error probability , 1994, IEEE Trans. Inf. Theory.

[3]  Partha Dutta,et al.  A Classification Framework for Scheduling Algorithms in Wireless Mesh Networks , 2013, IEEE Communications Surveys & Tutorials.

[4]  Hamid Sharif,et al.  A Survey of Energy-Efficient Compression and Communication Techniques for Multimedia in Resource Constrained Systems , 2013, IEEE Communications Surveys & Tutorials.

[5]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  Yanhui Geng,et al.  Performance Bounds of Opportunistic Scheduling in Wireless Networks , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[8]  Victor O. K. Li,et al.  Power-Controlled Cognitive Radio Spectrum Allocation with Chemical Reaction Optimization , 2013, IEEE Transactions on Wireless Communications.

[9]  C.-C. Jay Kuo,et al.  Cooperative Communications in Resource-Constrained Wireless Networks , 2007, IEEE Signal Processing Magazine.

[10]  Gerhard Fohler,et al.  Quality aware MPEG-2 stream adaptation in resource constrained systems , 2004, Proceedings. 16th Euromicro Conference on Real-Time Systems, 2004. ECRTS 2004..

[11]  George Baciu,et al.  The MinMax information measure , 1995 .

[12]  Victor C. M. Leung,et al.  Optimal and Approximate Mobility-Assisted Opportunistic Scheduling in Cellular Networks , 2006, IEEE Transactions on Mobile Computing.

[13]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[14]  John Skilling,et al.  Maximum entropy method in image processing , 1984 .

[15]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[16]  Xinbing Wang,et al.  Throughput Maximization for OFDMA Cooperative Relaying Networks with Fair Subchannel Allocation , 2009, 2009 IEEE Wireless Communications and Networking Conference.

[17]  Yanhui Geng,et al.  An information-theoretic model for resource-constrained systems , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[18]  Hermann Ney,et al.  Maximum entropy language modeling and the smoothing problem , 2000, IEEE Trans. Speech Audio Process..

[19]  Eli Upfal,et al.  Entropy-based bounds for online algorithms , 2007, ACM Trans. Algorithms.

[20]  Lin Yuan,et al.  Minimum entropy and information measure , 1998, IEEE Trans. Syst. Man Cybern. Part C.