Shannon bounds for large-scale wireless MAC's potential capacity in presence of errors

ABSTRACT

The reachable, real, throughput capacity of the various medium access control (MAC) protocols differs considerably. In fact, a wireless MAC protocol's current state information is dispersed at geographically distributed stations, and therefore is inaccessible in principle for the "MAC collective intellect" up to the transmission instant in the common wireless medium. This is due to the fundamental incompleteness of the state information in queues with corresponding throughput waste, including the collisions during distributed access to the wireless medium. Previously, we introduced and investigated the notion of potential MAC capacity as the maximally reachable throughput on the set of possible MAC protocols which was expressed by means of Shannon entropy of the distributed multiple access processes based on the Markov models of the distributed queues. We considered the case of ideal MAC conditions, i.e., a channel without errors, with zero propagation time, and a single service class. In this paper, we focus our efforts on excluding these limiting conditions. We derive the fundamental Shannon bounds of the distributed wireless MAC protocols - the maximally reachable throughput capacity and the minimally reachable overhead of the medium access control protocol in practical conditions of multiservice wireless networks.

REFERENCES

• 1: Markhasin, A.B. 1989. Potential Capacity of the Multiple Access Networks witch Time Division. In Proceedings of the 1st All-Union Conference on the Multiple Access Systems (Minsk, USSR, May 24-26, 1989), 102--105 (in Russian).
• 2: Markhasin, A. 1996. Multi-Access with Dynamic Control of the Traffic and Service Quality in Broadband ATM Networks. Optoelectronics, Instrumentation and Data Processing. No 3 (June 1996), Allerton Press, NY, 92--99.
• 3: Markhasin, A. 2004. QoS-Oriented Medium Access Control Fundamentals for Future All-IP/ATM Satellite Multimedia Personal Communications 4G. In Proceedings of the IEEE International Communication Conference-ICC'2004 (Paris, France, June 20-24, 2004), 3963--3968.
• 4: Markhasin, A., Olariu, S., and Todorova, P. 2004. QoS-Oriented Medium Access Control for All-IP/ATM Mobile Commerce Applications. In Mobile Commerce Applications, chapter 14. Dr. Shi Nan Si, Ed. Hershey: Idea Group Publishing, 303--331.
• 5: Abramson, N. 1970. The Aloha System -- Another Alternative for Computer Communications. In Proceedings of the AFIPS Conference, 37, 1970, 281--285.
• 6: Lawrence G. Roberts, ALOHA packet system with and without slots and capture, ACM SIGCOMM Computer Communication Review, v.5 n.2, p.28-42, April 1975 [doi>10.1145/1024916.1024920]
• 7: Kleinrock, L., and Tobagi, F.A. 1975. Packet Switching in Radio Channels. Part 1. Carrier Sense Multiple-Access Methods and their Throughput-Delay Characteristics, IEEE Transaction on Communications, COM-23, 12 (Dec. 1975), 1400--1416.
• 8: Markhasin, A.B. 1969. About the Packet Loss Problem by Burst Data Transmission in the Enterprise Control Systems. In Reports of the Scientific-Technical Conference on Design and Implementation of the Electronic Control Systems for Discrete Technology Enterprises. Section 8: Technical Facilities (Novosibirsk, USSR, 1969), 27--31 (in Russian).
• 9: Rubun, I. 1979. Access-Control Disciplines for Multi-Access Communication Channels: Reservation and TDMA Schemes. IEEE Transactions on Information Theory, IT-25, 5 (May 1979), 516--536.
• 10: Tobagi, F.A. 1980. Multi-Access Protocols in Packet Communications Systems, IEEE Transaction on Communications, COM-28, 4 (April 1980), 468 -- 488.
• 11: Markhasin, A.B. 1984. Architecture of Packet Radio Networks, Novosibirsk: Science Publishing, 1984, 144 p. (in Russian).
• 12: Gumalla, A.C.V., and Limb, J.O. 2000 Wireless Medium Access Control Protocols. IEEE Communications Surveys, 2--15. DOI= http://www.comsoc.org/pubs/surveys
• 13: Mikhailov, V.A., and Tsybakov, B.S. 1984. The Supremum of the Throughput for the Random Multiple Access Systems, Information Problems of the Information Transmitting, 17, 1 (Febr. 1984), 90--95 (in Russian).
• 14: Robert M. Metcalfe , David R. Boggs, Ethernet: distributed packet switching for local computer networks, Communications of the ACM, v.19 n.7, p.395-404, July 1976 [doi>10.1145/360248.360253]
• 15: Markhasin, A.B. 2001. Advanced Cost-Effective Long-Delay Broadband ATM Medium Access Control Technology and Multifunctional Architecture. In Proceedings of the IEEE International Communication Conference-ICC'2001 (Helsinki, Finland, June 11-14, 2001), 1914--1918.
• 16: A. B. Markhasin, Flexible integrated service radio networks: architecture and dynamic control of structure, functions and delivery, Automatic Control and Computer Sciences, v.22 n.3, p.12-19, June 1988
• 17: Leonard Kleinrock, Theory, Volume 1, Queueing Systems, Wiley-Interscience, 1975
• 18: Gao, P. , Wittevrongel, S. ,and Bruneel, H., 2002. Discrete-Time Multiserver Queues with Geometric Service Times, Gent: Ghent University, SMACS Research Group, 2002, 1--30, DOE= https://archive.ugent.be/retrieve/1340/gao.pdf
• 19: Riordan, J. 1962. Stochastic Service Systems, N.-Y.: J Wiley, 1962.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design
          Subjects: Distributed networks

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.5 Local and Wide-Area Networks
          Subjects: Access schemes; Buses

  H. Information Systems
  H.1 MODELS AND PRINCIPLES
      H.1.1 Systems and Information Theory
          Subjects: Value of information

General Terms:
Algorithms, Design, Management, Performance, Theory

Keywords:
MAC, QoS, distributed queues, markov chains, multiservices, overhead, potential capacity, protocol, shannon entropy, wireless