An Information-Theoretic Analysis to Evaluate Joint Time & Space Splitting in Random Access Algorithms
It is known that the average length of a CRP, i.e. Collision Resolution Period, in a random access algorithm is proportional to the mutual information between the packet’s arrival time and the set of all partitions of those arrival times that result in a resolution. Considering an ideal adaptive antenna, we can generalize this result for a two dimensional splitting algorithm in which resolutions of conflict are performed jointly in time and space. As a by-product of this result, the effectiveness of a multi-dimensional splitting algorithm is understood from an information theoretic view point.
KeywordsMutual Information Random Tree Packet Arrival Splitting Algorithm Multiple Access Channel
Unable to display preview. Download preview PDF.
- James L. Massey, “An Information Theoretic Approach to Algorithms,” Proc. NATO Workshop on “The Impact of Processing Techniques on Communications”, pp. 3–22, July 1993.Google Scholar
- Urs Loher, “The Role of Information in Random Accessing,” ISIT97, Ulm, Germany.Google Scholar
- Nicholas Pippenger, Bounds on the performance of Protocols for a Multiple-Access Broadcast Channel,IEEE Trans. on Information Theory, VOL. IT-27, NO. 2, March 1981.Google Scholar
- K. Sayrafian-Pour, A. Ephremides, Can Spatial Separation Increase Throughput of Conflict Resolution Algorithm, July 1997 IEEE International Symposium on Information Theory, Ulm, Germany.Google Scholar
- Thomas M. Cover, Joy A. Thomas, “Elements of Information Theory,” John Wiley, 1991.Google Scholar