Sciweavers

374 search results - page 7 / 75
» On Communicating Automata with Bounded Channels
Sort
View

Publication
545views
14 years 4 months ago
Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first ...
A. Mitrokotsa, C. Dimitrakakis, P. Peris-Lopez, J....
ICC
2009
IEEE
198views Communications» more  ICC 2009»
14 years 2 months ago
On the Capacity Region of the Gaussian Multiple Access Channel with Noisy Feedback
—We provide a new outer bound on the capacity region of the two-user Gaussian multiple access channel (MAC) with AWGN-corrupted feedback. Our outer bound is based on the idea of ...
Ravi Tandon, Sennur Ulukus
IFIPTCS
2000
13 years 11 months ago
Real-Time Language Recognition by Alternating Cellular Automata
The capabilities of alternating cellular automata (ACA) to accept formal languages are investigated. Several notions of alternation in cellular automata have been proposed. Here we...
Thomas Buchholz, Andreas Klein, Martin Kutrib
WASA
2009
Springer
132views Algorithms» more  WASA 2009»
14 years 2 months ago
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks
Abstract. This paper is motivated by exploring the impact of the number of channels on the achievable communication latency for a specific communication task. We focus on how to u...
Peng-Jun Wan, Zhu Wang, Zhiyuan Wan, Scott C.-H. H...
CORR
2007
Springer
81views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling Laws for Wireless Networks with Fading Channels
—A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels b...
Masoud Ebrahimi, Mohammad Ali Maddah-Ali, Amir K. ...