Results 201 to 210 of about 16,777,617 (240)

Adversarial queuing on the multiple-access channel

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, 2006
We study deterministic broadcasting on multiple access channels when packets are injected continuously. The quality of service is considered in the framework of adversarial queuing. An adversary is determined by injection rate and burstiness, the latter denoting the number of packets that can be injected simultaneously in a round.
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki   +2 more
openaire   +2 more sources

Cognitive access algorithms for multiple access channels

2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2013
This paper considers a multiple access fading channel where each terminal has a different belief about the channel states and adapts its transmission policy to the belief. In this setting, frequency division multiple access (FDMA) and channel aware random access (RA) are two special cases.
Yichuan Hu, Alejandro Ribeiro
openaire   +2 more sources

Compositional Restricted Multiple Access Channel

Problems of Information Transmission, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. E. Egorova, V. S. Potapova
openaire   +2 more sources

Computation Over Multiple-Access Channels

IEEE Transactions on Information Theory, 2007
The problem of reliably reconstructing a function of sources over a multiple-access channel (MAC) is considered. It is shown that there is no source-channel separation theorem even when the individual sources are independent. Joint source-channel strategies are developed that are optimal when the structure of the channel probability transition matrix ...
Bobak Nazer, Michael Gastpar
openaire   +2 more sources

On multiple access channels with feedback

IEEE Trans. Inf. Theory, 1984
Summary: For the binary erasure multiple access channel, \textit{E. C. van der Meulen} [ibid. IT-23, 1-37 (1977; Zbl 0355.94035)] showed in his survey paper that the symmetrical rate pair (0.79113, 0.79113) is achievable in the case of feedback. Here we prove that this rate point is on the boundary of the feedback capacity region. Subsequently we apply
openaire   +2 more sources

A hybrid access method in a multiple access channel

Performance Evaluation, 1986
Abstract This paper considers a multiple-access communication channel with an infinite number of users. We show that if a controlled slotted Aloha protocol is used, then messages with variable length will have a negative impact on the average message delay.
openaire   +1 more source

Decoding for multiple-access channels

2005
We discuss some results in coding and decoding for multiple-access channels. A new approach to choosing codes and users' energies for that channel is described. For the case when a bit error probability and a decoding complexity are fixed we construct a region of achievable code rates.
openaire   +2 more sources

Mismatched decoding and the multiple-access channel

IEEE Transactions on Information Theory, 1996
An achievable region is derived for the multiple-access channel under decoding mismatch conditions. It is shown that achievable rates higher than the random coding capacity of the single-user mismatched channel can sometimes be demonstrated by treating the single-user channel as a multiple-access channel. Refining these ideas we derive a lower bound on
openaire   +2 more sources

The Cost of Synchronizing Multiple-Access Channels

Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015
Multiple access channel is a communication model in which many users, also called stations, could exchange information. Since it offers limited capacity, some information sent through it might be lost due to signal interference (collision). Therefore, successful message delivery to a station requires breaking symmetry on the channel.
Tomasz Jurdzinski, Grzegorz Stachowiak
openaire   +1 more source

Multiple-Access Channels With Confidential Messages

IEEE Transactions on Information Theory, 2008
A discrete memoryless multiple-access channel (MAC) with confidential messages is studied, where two users attempt to transmit common information to a destination and each user also has private (confidential) information intended for the destination. This channel generalizes the classical MAC model in that each user also receives channel outputs, and ...
Yingbin Liang, H. Vincent Poor
openaire   +2 more sources