shannon bounds for large-scale wireless mac's potential capacity in presence of errors
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.
wireless mac potential capacity protocol shannon entropy distributed queues overhead multiservices markov chains qos