We consider distributed medium access control in a wireless network where each link layer user (transmitter) is equipped with multiple transmission options as opposed to the classical binary options of transmitting/idling. In each time slot, a user randomly chooses a transmission option according to a "transmission probability vector". Packets sent by the users are either received or lost depending on whether reliable decoding is supported by the communication channel. We propose a game theoretic model for distributed medium access control where each user adapts its transmission probability vector to maximize a utility function. Condition under which the medium access control game has a unique Nash equilibrium is obtained. Simulation results show that, when multiple transmission options are provided, users in a distributed network tend to converge to channel sharing schemes that are consistent with the well-known information theoretic understandings.
With the fast expansion of communication networks and the increasing dynamic of wireless communication activities, a significant proportion of messages in wireless networks are being transmitted using distributed protocols that feature opportunistic channel access without full user coordination. This challenges the basic assumption of long message transmissions among coordinated users in classical channel coding theory. In this monograph, we introduce channel coding theorems for the distributed communication model where users choose their channel codes individually. We show that, although reliable message recovery is not always guaranteed in distributed communication systems, the notion of fundamental limit still exists, and can indeed be viewed as an extension to its classical correspondence. Due to historical priority of developing wireline networks, network architectures tend to achieve system modularity by compromising communication and energy efficiency. Such a
In distributed communication, each transmitter prepares an ensemble of channel codes. To encode a message, a transmitter chooses a channel code individually without sharing the coding choice with other transmitters or with the receiver. Upon receiving the block of channel output symbols, the receiver either decodes the messages of interest if a pre-determined reliability requirement can be met, or reports collision otherwise. Revised from the distributed channel coding theorems in the literature, distributed capacity of a discrete-time memoryless multiple access channel is defined and derived under the assumption that codeword length can be taken to infinity. An improved achievable error performance bound is presented for the case when codeword length is finite. 1
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.