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

Intercell interference limits the capacity of wireless networks. To mitigate this interference we explore coherently coordinated transmission (CCT) from multiple base stations to each user. To treat users fairly, we explore equal rate (ER) networks. We evaluate the downlink network efficiency of CCT as compared to serving each user with single base transmission (SBT) with a separate base uniquely assigned to each user. Efficiency of ER networks is measured as total network throughput relative to the number of network antennas at 10% user outage. Efficiency is compared relative to the baseline of single base transmission with power control, (ER-SBT), where base antenna transmissions are not coordinated and apart from power control and the assignment of 10% of the users to outage, nothing is done to mitigate interference. We control the transmit power of ER systems to maximise the common rate for ER-SBT, ER-CCT based on zero forcing, and ER-CCT employing dirty paper coding. We do so for (no. of transmit antennas per base, no. of receive antennas per user) equal to (1,1), (2,2) and (4,4). We observe that CCT mutes intercell interference enough, so that enormous spectral efficiency improvement associated with using multiple antennas in isolated communication links occurs as well for the base-to-user links in a cellular network.

Coordinating multiple antenna cellular networks to achieve enormous spectral efficiency

The capacity of multiple input, multiple output (MIMO) wireless channels is computed for Ricean channels. The novelty is a geometrical (ray-tracing) interpretation of the MIMO channel capacity formula to find array geometries which greatly enhance channel capacity compared to single input-single output (SISO) systems.

/pdf/on-the-capacity-formula-for-multiple-input-multiple-output-2qamz3o5vj.pdf

On the capacity formula for multiple input-multiple output wireless channels: a geometric interpretation

A considerable amount of literature exists on the problem of selecting an efficient set of N digital signals with in-phase and quadrature components for use in a suppressed carrier data transmission system. However, the signal constellation which minimizes the probability of error in Gaussian noise, under an average power constraint, has not been determined when the number of signals is greater than two. In this paper an asymptotic (large signal-to-noise ratio) expression, of the minimum distance type, is derived for the error rate. Using this expression, a gradient-search procedure, which is initiated from several randomly chosen N -point arrays, converges in each case to a locally optimum constellation. The algorithm incorporates a radial contraction technique to meet the average signal power constraint. The best solutions are described for several values of N and compared with well-known signal formats. As an example, the best locally optimum 16-point constellation shows an advantage of about 0.5 dB in signal-signal-to-noise ratio over quadrature amplitude modulation. The locally optimum constellations are the vertices of a trellis of (almost) equilateral triangles. As N \rightarrow \infty , it is rigorously proved in the Appendix that the optimum constellations tend toward an equilateral structure, and become uniformly distributed in a circle.

Optimization of Two-Dimensional Signal Constellations in the Presence of Gaussian Noise

Previous information theory results have demonstrated the enormous capacity potential of wireless communication systems with multiple transmit and receive antennas. To exploit this potential, a number of space-time architectures have been proposed which transmit parallel data streams, simultaneously and on the same frequency, in a multiple-input multiple-output fashion. With sufficient multipath propagation, these different streams can be separated at the receiver. Mostly, these space-time schemes have been studied only in the presence of spatially white noise. We present an architecture that is optimal, in the sense of maximum link spectral efficiency, in the presence of spatially colored interference. We evaluate this new architecture and compare it, under various propagation conditions, to other adaptive-antenna techniques with equal number of antennas.

Link-optimal space-time processing with multiple transmit and receive antennas

Multi-element system capacities are usually thought of as limited only by correlations between elements. It is shown that degenerate channels, called 'keyholes', may arise under realistic assumptions which have zero correlation between the entries of the channel matrix H and yet only a single degree of freedom.

Gerard J. Foschini

Papers

Coordinating multiple antenna cellular networks to achieve enormous spectral efficiency

On the capacity formula for multiple input-multiple output wireless channels: a geometric interpretation

Optimization of Two-Dimensional Signal Constellations in the Presence of Gaussian Noise

Link-optimal space-time processing with multiple transmit and receive antennas

Capacities of multi-element transmit and receive antennas: Correlations and keyholes