Wireless Communications

This paper presents a secure (tamper-resistant) algorithm for watermarking images, and a methodology for digital watermarking that may be generalized to audio, video, and multimedia data. We advocate that a watermark should be constructed as an independent and identically distributed (i.i.d.) Gaussian random vector that is imperceptibly inserted in a spread-spectrum-like fashion into the perceptually most significant spectral components of the data. We argue that insertion of a watermark under this regime makes the watermark robust to signal processing operations (such as lossy compression, filtering, digital-analog and analog-digital conversion, requantization, etc.), and common geometric transformations (such as cropping, scaling, translation, and rotation) provided that the original image is available and that it can be successfully registered against the transformed watermarked image. In these cases, the watermark detector unambiguously identifies the owner. Further, the use of Gaussian noise, ensures strong resilience to multiple-document, or collusional, attacks. Experimental results are provided to support these claims, along with an exposition of pending open problems.

http://dns2.asia.edu.tw/~ysho/YSHO-English/2000%20Engineering/PDF/IEE%20Tra%20Ima%20Pro6,%201673.pdf

Secure spread spectrum watermarking for multimedia

It is shown that, particularly for terrestrial cellular telephony, the interference-suppression feature of CDMA (code division multiple access) can result in a many-fold increase in capacity over analog and even over competing digital techniques. A single-cell system, such as a hubbed satellite network, is addressed, and the basic expression for capacity is developed. The corresponding expressions for a multiple-cell system are derived. and the distribution on the number of users supportable per cell is determined. It is concluded that properly augmented and power-controlled multiple-cell CDMA promises a quantum increase in current cellular capacity. >

On the capacity of a cellular CDMA system

Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. Military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in the design of these networks is their vulnerability to security attacks. In this article, we study the threats on ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks-multiple routes between nodes-to defend routing against denial-of-service attacks. We also use replication and new cryptographic schemes, such as threshold cryptography, to build a highly secure and highly available key management service, which terms the core of our security framework.

/pdf/securing-ad-hoc-networks-3hudjv4io2.pdf

Securing ad hoc networks

Praise for the Third Edition: "This is one of the best books available. Its excellent organizational structure allows quick reference to specific models and its clear presentation . . . solidifies the understanding of the concepts being presented."IIE Transactions on Operations EngineeringThoroughly revised and expanded to reflect the latest developments in the field, Fundamentals of Queueing Theory, Fourth Edition continues to present the basic statistical principles that are necessary to analyze the probabilistic nature of queues. Rather than presenting a narrow focus on the subject, this update illustrates the wide-reaching, fundamental concepts in queueing theory and its applications to diverse areas such as computer science, engineering, business, and operations research.This update takes a numerical approach to understanding and making probable estimations relating to queues, with a comprehensive outline of simple and more advanced queueing models. Newly featured topics of the Fourth Edition include:Retrial queuesApproximations for queueing networksNumerical inversion of transformsDetermining the appropriate number of servers to balance quality and cost of serviceEach chapter provides a self-contained presentation of key concepts and formulae, allowing readers to work with each section independently, while a summary table at the end of the book outlines the types of queues that have been discussed and their results. In addition, two new appendices have been added, discussing transforms and generating functions as well as the fundamentals of differential and difference equations. New examples are now included along with problems that incorporate QtsPlus software, which is freely available via the book's related Web site.With its accessible style and wealth of real-world examples, Fundamentals of Queueing Theory, Fourth Edition is an ideal book for courses on queueing theory at the upper-undergraduate and graduate levels. It is also a valuable resource for researchers and practitioners who analyze congestion in the fields of telecommunications, transportation, aviation, and management science.

Fundamentals of Queueing Theory

Spread-Spectrum Communications

This paper introduces a hybrid forward-error correction/automatic repeat-request (ARQ) system that employs rate compatible punctured turbo (RCPT) codes to achieve enhanced throughput performance over a nonstationary Gaussian channel. The proposed RCPT-ARQ system combines the performance of turbo codes with the frugal use of incremental redundancy inherent in the rate compatible punctured convolutional codes of Hagenauer (1988). Moreover, this paper introduces the notion of puncturing the systematic code symbols of a turbo code to maximize throughput at signal-to-noise ratios (SNRs) of interest. The resulting system provides both an efficient family of achievable code rates at middle to high SNR and powerful low-rate error correction capability at low SNR.

On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes

Several methods of diversity combining for a Rayleigh-faded channel are evaluated and compared. The methods considered are, for coherent reception, maximal ratio combining (MRC), selection combining (SC), and a generalization of SC, whereby the two (three) signals with the two (three) largest amplitudes are coherently combined. We will call this method second (third) order SC, and denote it SC2 (SC3). Similar techniques are also investigated for noncoherent reception, with equal gain combining (EGC) replacing MRC, and noncoherent versions of SC2 and SC3. Numerical results indicate that SC2 and SC3 significantly enhances the bit-error rate (BER) performance relative to that achievable with SC, and under certain conditions approaches the performance achieved by MRC or EGG. The performance enhancement of SC2 and SC3 is especially noticable for noncoherent reception, where EGC is seen to provide the best performance only for low BER values. In fact, when the BER is 10/sup -3/ or greater, SC2 and SC3 performed comparably to EGG, and in some cases performed better than EGC.

Comparison of diversity combining techniques for Rayleigh-fading channels

Transmission of data blocks on a fading mobile radio channel is considered. The binary process of the success and failure of the data blocks is investigated, and the accuracy of a Markov approximation is studied. It is shown through analysis and simulation that a first-order Markov process is a good approximation. Data-link performance of ARQ protocols is considered as an example of application.

On the accuracy of a first-order Markov model for data transmission on fading channels

The coherent reception of direct sequence-code division multiple access (DS-CDMA) signals in a multipath fading channel is considered. The channel model assumes independent paths with Nakagami fading statistics; this model includes the Rayleigh channel os a special case and is a reasonable model for a frequency-selective fading channel. The bit error rate (BER) performance of a RAKE receiver under various multipath fading conditions is derived and evaluated. The results indicate that over 50 users may access the channel (assuming 127 chips per bit) simultaneously under typical fading conditions, and can achieve an uncoded BER of 0.01 with an average received signal-to-noise ratio per bit of 10 dB. >

L.B. Milstein

Papers

Spread-Spectrum Communications

On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes

Comparison of diversity combining techniques for Rayleigh-fading channels

On the accuracy of a first-order Markov model for data transmission on fading channels

Coherent DS-CDMA performance in Nakagami multipath fading