Results 211 to 220 of about 1,424,429 (250)
Some of the next articles are maybe not open access.
Channel-hopping multiple access
2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record, 2002The medium-access control (MAC) protocols for wireless networks proposed or implemented to date based on collision-avoidance handshakes between the sender and receiver either require carrier sensing or the assignment of unique codes to nodes to ensure that intended receivers hear data packets without interference from hidden sources.
A. Tzamaloukas, J.J. Garcia-Luna-Aceves
openaire +1 more source
Channel configuration of multiple-access channel
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 2004This paper investigates the channel configuration of multiple-access channel (MAC) by decomposing the MAC into finite subMAC and also proves that there exists an input probability that achieves boundary of a capacity region and the total capacity of the original MAC.
Y. Watanabe, K. Kamoi
openaire +1 more source
Multiple Access Covert Channels
2005Abstract : In this paper we consider the situation of multiple malicious transmitters attempting to covertly communicate with a single receiver, We show how the situation of non-collaborating transmitters can be modeled by multiple access channels. The simpler situation of collaborating transmitters is used as a bounding result.
Richard E. Newman, Ira S. Moskowitz
openaire +1 more source
1998
In the preceding three chapters, we develop and apply the compressed-error-cancellation framework to the single-user case, i.e., the situation in which a single transmitter must send data to a single receiver. But often in practice, multiple transmitters must simultaneously send data to multiple receivers.
openaire +1 more source
In the preceding three chapters, we develop and apply the compressed-error-cancellation framework to the single-user case, i.e., the situation in which a single transmitter must send data to a single receiver. But often in practice, multiple transmitters must simultaneously send data to multiple receivers.
openaire +1 more source
Computation Over Multiple-Access Channels
IEEE Transactions on Information Theory, 2007The 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 ...
B.. Nazer, M.. Gastpar
openaire +1 more source
The Interference-Multiple-Access Channel
2009 IEEE International Conference on Communications, 2009We introduce the interference-multiple-access channel, which is a discrete memoryless channel with two transmitters and two receivers, similar to the interference channel. One receiver is required to decode the information encoded at one transmitter, the other receiver is required to decode the messages from both transmitters. We provide an inner bound
E. Perron, S. Diggavi, E. Telatar
openaire +1 more source
The mismatched multiple-access channel: General alphabets
2013 IEEE International Symposium on Information Theory, 2013This paper considers channel coding for the memoryless multiple-access channel with a given (possibly suboptimal) decoding rule. Non-asymptotic bounds on the error probability are given, and a cost-constrained random-coding ensemble is used to obtain an achievable error exponent. The achievable rate region recovered by the error exponent coincides with
Scarlett, Jonathan +2 more
openaire +1 more source
Relaying selection based multiple access relay channel
2016 24th Signal Processing and Communication Application Conference (SIU), 2016Relay selection in case of fast cascade Rayleigh fading channels has been examined in multiple access relay channel structure which is one of the high spectral efficiency network coding applications. Error performance analysis of MARC system has been made for noncoherent binary frequency shift keying (BFSK) and it has been shown that the proposed ...
Karabulut, Muhammet Ali +2 more
openaire +3 more sources
Delay‐universal codes for multiple access channels
Transactions on Emerging Telecommunications Technologies, 2015AbstractIn this paper, we propose delay‐universal or ‘anytime’ code design for multiple access channels. The anytime characteristics of the proposed coding scheme are investigated asymptotically over two different multiple access channels. For the simplest multiple access channel, we derive the analytical delay‐exponent of the proposed code by using ...
Md. Noor‐A‐Rahim +2 more
openaire +2 more sources
Adversarial queuing on the multiple-access channel
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, 2006We 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 +2 more
openaire +1 more source