Results 1 - 10
of
20,292
Wireless Communications
, 2005
"... Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University ..."
Abstract
-
Cited by 1129 (32 self)
- Add to MetaCart
Copyright c ○ 2005 by Cambridge University Press. This material is in copyright. Subject to statutory exception and to the provisions of relevant collective licensing agreements, no reproduction of any part may take place without the written permission of Cambridge University
Defining Virtual Reality: Dimensions Determining Telepresence
- JOURNAL OF COMMUNICATION
, 1992
"... Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variable-based definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of "presen ..."
Abstract
-
Cited by 534 (0 self)
- Add to MetaCart
Virtual reality (VR) is typically defined in terms of technological hardware. This paper attempts to cast a new, variable-based definition of virtual reality that can be used to classify virtual reality in relation to other media. The defintion of virtual reality is based on concepts of "
The Macroscopic Behavior of the TCP Congestion Avoidance Algorithm
, 1997
"... In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts and alw ..."
Abstract
-
Cited by 648 (18 self)
- Add to MetaCart
In this paper, we analyze a performance model for the TCP Congestion Avoidance algorithm. The model predicts the bandwidth of a sustained TCP connection subjected to light to moderate packet losses, such as loss caused by network congestion. It assumes that TCP avoids retransmission timeouts and always has sufficient receiver window and sender data. The model predicts the Congestion Avoidance performance of nearly all TCP implementations under restricted conditions and of TCP with SelectiveAcknowledgements over a much wider range of Internet conditions. We verify
Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding
- IEEE TRANS. ON INFORMATION THEORY
, 1999
"... We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing information-embedding rate, mini ..."
Abstract
-
Cited by 495 (15 self)
- Add to MetaCart
We consider the problem of embedding one signal (e.g., a digital watermark), within another "host" signal to form a third, "composite" signal. The embedding is designed to achieve efficient tradeoffs among the three conflicting goals of maximizing information-embedding rate, minimizing distortion between the host signal and composite signal, and maximizing the robustness of the embedding. We introduce new classes of embedding methods, termed quantization index modulation (QIM) and distortion-compensated QIM (DC-QIM), and develop convenient realizations in the form of what we refer to as dither modulation. Using deterministic models to evaluate digital watermarking methods, we show that QIM is "provably good" against arbitrary bounded and fully informed attacks, which arise in several copyright applications, and in particular, it achieves provably better rate distortion--robustness tradeoffs than currently popular spread-spectrum and low-bit(s) modulation methods. Furthermore, we show that for some important classes of probabilistic models, DC-QIM is optimal (capacity-achieving) and regular QIM is near-optimal. These include both additive white Gaussian noise (AWGN) channels, which may be good models for hybrid transmission applications such as digital audio broadcasting, and mean-square-error-constrained attack channels that model private-key watermarking applications.
Efficient Uncoordinated FHSS Anti-jamming Communication
- ACM MOBIHOC
, 2009
"... We address the problem of jamming-resistant communication in scenarios in which the communicating parties do not share secret keys. This includes scenarios where the communicating parties are not known in advance or where not all parties can be trusted (e.g., jamming-resistant key establishment or a ..."
Abstract
-
Cited by 47 (1 self)
- Add to MetaCart
been proposed that introduces Uncoordinated Frequency Hopping (UFH), a new spread-spectrum anti-jamming technique that does not rely on secret keys. In this work, we investigate the efficiency of UFH-based communication: we identify optimal strategies for the UFH frequency channel selection and we
AN EM APPROACH TO MULTIPLE-ACCESS INTERFERENCE MITIGATION IN ASYNCHRONOUS SLOW FHSS SYSTEMS
"... In this paper, we apply the EM algorithm for mitigation of multi-access interference (MAI) in asynchronous slow frequency-hop spread spectrum (FHSS) systems that employ binary frequency-shift keying (BFSK) modulation. MAI occurs if the hopping patterns of the users are not orthogonal. We show that w ..."
Abstract
- Add to MetaCart
In this paper, we apply the EM algorithm for mitigation of multi-access interference (MAI) in asynchronous slow frequency-hop spread spectrum (FHSS) systems that employ binary frequency-shift keying (BFSK) modulation. MAI occurs if the hopping patterns of the users are not orthogonal. We show
Results 1 - 10
of
20,292