Networking together hundreds or thousands of cheap microsensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. These networks require robust wireless communication protocols that are energy efficient and provide low latency. We develop and analyze low-energy adaptive clustering hierarchy (LEACH), a protocol architecture for microsensor networks that combines the ideas of energy-efficient cluster-based routing and media access together with application-specific data aggregation to achieve good performance in terms of system lifetime, latency, and application-perceived quality. LEACH includes a new, distributed cluster formation technique that enables self-organization of large numbers of nodes, algorithms for adapting clusters and rotating cluster head positions to evenly distribute the energy load among all the nodes, and techniques to enable distributed signal processing to save communication resources. Our results show that LEACH can improve system lifetime by an order of magnitude compared with general-purpose multihop approaches.

/pdf/an-application-specific-protocol-architecture-for-wireless-1s7y9fiv40.pdf

An application-specific protocol architecture for wireless microsensor networks

Wireless Communications

We introduce space-time block coding, a new paradigm for communication over Rayleigh fading channels using multiple transmit antennas. Data is encoded using a space-time block code and the encoded data is split into n streams which are simultaneously transmitted using n transmit antennas. The received signal at each receive antenna is a linear superposition of the n transmitted signals perturbed by noise. Maximum-likelihood decoding is achieved in a simple way through decoupling of the signals transmitted from different antennas rather than joint detection. This uses the orthogonal structure of the space-time block code and gives a maximum-likelihood decoding algorithm which is based only on linear processing at the receiver. Space-time block codes are designed to achieve the maximum diversity order for a given number of transmit and receive antennas subject to the constraint of having a simple decoding algorithm. The classical mathematical framework of orthogonal designs is applied to construct space-time block codes. It is shown that space-time block codes constructed in this way only exist for few sporadic values of n. Subsequently, a generalization of orthogonal designs is shown to provide space-time block codes for both real and complex constellations for any number of transmit antennas. These codes achieve the maximum possible transmission rate for any number of transmit antennas using any arbitrary real constellation such as PAM. For an arbitrary complex constellation such as PSK and QAM, space-time block codes are designed that achieve 1/2 of the maximum possible transmission rate for any number of transmit antennas. For the specific cases of two, three, and four transmit antennas, space-time block codes are designed that achieve, respectively, all, 3/4, and 3/4 of maximum possible transmission rate using arbitrary complex constellations. The best tradeoff between the decoding delay and the number of transmit antennas is also computed and it is shown that many of the codes presented here are optimal in this sense as well.

/pdf/space-time-block-codes-from-orthogonal-designs-1oj68nrilr.pdf

Space-time block codes from orthogonal designs

A cellular base station serves a multiplicity of single-antenna terminals over the same time-frequency interval. Time-division duplex operation combined with reverse-link pilots enables the base station to estimate the reciprocal forward- and reverse-link channels. The conjugate-transpose of the channel estimates are used as a linear precoder and combiner respectively on the forward and reverse links. Propagation, unknown to both terminals and base station, comprises fast fading, log-normal shadow fading, and geometric attenuation. In the limit of an infinite number of antennas a complete multi-cellular analysis, which accounts for inter-cellular interference and the overhead and errors associated with channel-state information, yields a number of mathematically exact conclusions and points to a desirable direction towards which cellular wireless could evolve. In particular the effects of uncorrelated noise and fast fading vanish, throughput and the number of terminals are independent of the size of the cells, spectral efficiency is independent of bandwidth, and the required transmitted energy per bit vanishes. The only remaining impairment is inter-cellular interference caused by re-use of the pilot sequences in other cells (pilot contamination) which does not vanish with unlimited number of antennas.

Noncooperative Cellular Wireless with Unlimited Numbers of Base Station Antennas

Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

Convergence of Probability Measures

The phase noise associated with single-mode semiconductor lasers must be accounted for in performance studies of lightwave communication systems. The standard phase noise model is a Brownian-motion stochastic process. Although many analyses of lightwave communication systems have been published, none, to the authors knowledge, has fully adhered to the standard model. The reason is that a proper characterization of filtered lightwave signal had not been achieved. Such a characterization, along with theoretical approaches to obtaining it, is detailed. The authors show, for example, how to generate probability density functions (PDFs) of the magnitude of a filtered laser tone (with special attention to the tail region) and how to analytically represent the characteristic function of the PDF in closed form in the small-phase-noise realm. With the characterization in place, the stage is now set for determining the bit-error rate performance of advanced detection techniques which seek to mitigate the phase noise impairment. >

Characterizing filtered light waves corrupted by phase noise

We quantify the ultimate performance limits of inter-cell coordinatation in a cellular downlink network. The goal is to achieve fairness by maximizing the minimum rate in the network subject to per base power constraints. We first solve the max-min rate problem for a particular zero-forcing dirty paper coding scheme so as to obtain an achievable max-min rate, which serves as a lower bound on the ultimate limit. We then obtain a simple upper bound on the max-min rate of any scheme, and show that the rate achievable by the zero-forcing dirty paper coding scheme is close to this upper bound. We also extend our analysis to coordinated networks with multiple antennas.

http://www.winlab.rutgers.edu/pub/docs/ICC06_NetworkCoord.pdf

On the Maximum Common Rate Achievable in a Coordinated Network

For terrestrial digital radio systems that use Quadrature Amplitude Modulation, the idea of adapting equalizers to multipath distortion, without relying on accurate data estimates, is attractive. Prompt adaptation following a severe fade, when accurate data estimates are unavailable, is useful for reducing outage time. To avoid processing and administrative overhead, the adaptation method should not involve violating the transmitted signal with the insertion of equalizer training signals. We approach this kind of equalization by building on an algorithm of D. Godard (IEEE Transactions on Communications, November 1980)1 that was devised for voiceband polling networks. The method involves a very simple tap update procedure. However, the technique lacks the foundation of the years of analysis and experimentation that underlie least-mean-square adaptation algorithms. The main purpose of this paper is to present new findings, including (1) a proof that the algorithm, thought to require special equalizer initialization, converges regardless of initialization (this offers useful flexibility in digital radio systems, since, after a severe fade, the algorithm could start with any tap misalignment); (2) a preliminary look at convergence speed suggesting the possibility of significant outage reduction; (3) an algorithm that provides phase coherence (the original algorithm requires a follow-on phase-locked loop); and (4) an algorithm for cross-polarization cancellation as well as equalization.

Equalizing without altering or detecting data

The outage probability in an under-addressed optical MIMO system may be reduced by configuring an intra-link optical mode mixer to dynamically change the spatial-mode mixing characteristics of the link on a time scale that is faster than the channel coherence time. Provided that the MIMO system employs an FEC code that has a sufficient error-correcting capacity for correcting the amount of errors corresponding to an average state of the MIMO channel, this relatively fast dynamic change tends to reduce the frequency of events during which the number of errors per FEC-encoded block of data exceeds the error-correcting capacity of the FEC code.

Intra-link spatial-mode mixing in an under-addressed optical mimo system

The bit rate at which a digital wireless communications system communicates data may be significantly increased by using multiple antennas at both the transmitter and receiver and by decomposing the channel into m subchannels that operate in the same frequency band. The system transmits m one dimensional signals and maximizes the minimum signal-to-noise ratio of the receiver detection process.

Gerard J. Foschini

Papers

Characterizing filtered light waves corrupted by phase noise

On the Maximum Common Rate Achievable in a Coordinated Network

Equalizing without altering or detecting data

Intra-link spatial-mode mixing in an under-addressed optical mimo system

Wireless communications system having a space-time architecture employing multi-element antennas at both the transmitter and receiver