Showing papers in "IEEE Journal on Selected Areas in Communications in 1999"

Multiuser OFDM with adaptive subcarrier, bit, and power allocation

Abstract: Multiuser orthogonal frequency division multiplexing (OFDM) with adaptive multiuser subcarrier allocation and adaptive modulation is considered. Assuming knowledge of the instantaneous channel gains for all users, we propose a multiuser OFDM subcarrier, bit, and power allocation algorithm to minimize the total transmit power. This is done by assigning each user a set of subcarriers and by determining the number of bits and the transmit power level for each subcarrier. We obtain the performance of our proposed algorithm in a multiuser frequency selective fading environment for various time delay spread values and various numbers of users. The results show that our proposed algorithm outperforms multiuser OFDM systems with static time-division multiple access (TDMA) or frequency-division multiple access (FDMA) techniques which employ fixed and predetermined time-slot or subcarrier allocation schemes. We have also quantified the improvement in terms of the overall required transmit power, the bit-error rate (BER), or the area of coverage for a given outage probability.

Analog-to-digital converter survey and analysis

Abstract: Analog-to-digital converters (ADCs) are ubiquitous, critical components of software radio and other signal processing systems. This paper surveys the state-of-the-art of ADCs, including experimental converters and commercially available parts. The distribution of resolution versus sampling rate provides insight into ADC performance limitations. At sampling rates below 2 million samples per second (Gs/s), resolution appears to be limited by thermal noise. At sampling rates ranging from /spl sim/2 Ms/s to /spl sim/4 giga samples per second (Gs/s), resolution falls off by /spl sim/1 bit for every doubling of the sampling rate. This behavior may be attributed to uncertainty in the sampling instant due to aperture jitter. For ADCs operating at multi-Gs/s rates, the speed of the device technology is also a limiting factor due to comparator ambiguity. Many ADC architectures and integrated circuit technologies have been proposed and implemented to push back these limits. The trend toward single-chip ADCs brings lower power dissipation. However, technological progress as measured by the product of the ADC resolution (bits) times the sampling rate is slow. Average improvement is only /spl sim/1.5 bits for any given sampling frequency over the last six-eight years.

Minimum energy mobile wireless networks

Abstract: We describe a distributed position-based network protocol optimized for minimum energy consumption in mobile wireless networks that support peer-to-peer communications. Given any number of randomly deployed nodes over an area, we illustrate that a simple local optimization scheme executed at each node guarantees strong connectivity of the entire network and attains the global minimum energy solution for stationary networks. Due to its localized nature, this protocol proves to be self-reconfiguring and stays close to the minimum energy solution when applied to mobile networks. Simulation results are used to verify the performance of the protocol.

Simplified processing for high spectral efficiency wireless communication employing multi-element arrays

Abstract: We investigate robust wireless communication in high-scattering propagation environments using multi-element antenna arrays (MEAs) at both transmit and receive sites. A simplified, but highly spectrally efficient space-time communication processing method is presented. The user's bit stream is mapped to a vector of independently modulated equal bit-rate signal components that are simultaneously transmitted in the same band. A detection algorithm similar to multiuser detection is employed to detect the signal components in white Gaussian noise (WGN). For a large number of antennas, a more efficient architecture can offer no more than about 40% more capacity than the simple architecture presented. A testbed that is now being completed operates at 1.9 GHz with up to 16 quadrature amplitude modulation (QAM) transmitters and 16 receive antennas. Under ideal operation at 18 dB signal-to-noise ratio (SNR), using 12 transmit antennas and 16 receive antennas (even with uncoded communication), the theoretical spectral efficiency is 36 bit/s/Hz, whereas the Shannon capacity is 71.1 bit/s/Hz. The 36 bits per vector symbol, which corresponds to over 200 billion constellation points, assumes a 5% block error rate (BLER) for 100 vector symbol bursts.

An empirically based path loss model for wireless channels in suburban environments

Abstract: We present a statistical path loss model derived from 1.9 GHz experimental data collected across the United States in 95 existing macrocells. The model is for suburban areas, and it distinguishes between different terrain categories. Moreover, it applies to distances and base antenna heights not well-covered by existing models. The characterization used is a linear curve fitting the decibel path loss to the decibel-distance, with a Gaussian random variation about that curve due to shadow fading. The slope of the linear curve (corresponding to the path loss exponent, /spl gamma/) is shown to be a random variate from one macrocell to another, as is the standard deviation /spl sigma/ of the shadow fading. These two parameters are statistically modeled, with the dependencies on base antenna height and terrain category made explicit. The resulting path loss model applies to base antenna heights from 10 to 80 m, base-to-terminal distances from 0.1 to 8 km, and three distinct terrain categories.

Channel parameter estimation in mobile radio environments using the SAGE algorithm

Abstract: This study investigates the application potential of the SAGE (space-alternating generalized expectation-maximization) algorithm to jointly estimate the relative delay, incidence azimuth, Doppler frequency, and complex amplitude of impinging waves in mobile radio environments The performance, ie, high-resolution ability, accuracy, and convergence rate of the scheme, is assessed in synthetic and real macro- and pico-cellular channels The results indicate that the scheme overcomes the resolution limitation inherent to classical techniques like the Fourier or beam-forming methods In particular, it is shown that waves which exhibit an arbitrarily small difference in azimuth can be easily separated as long as their delays or Doppler frequencies differ by a fraction of the intrinsic resolution of the measurement equipment Two waves are claimed to be separated when the mean-squared estimation errors (MSEEs) of the estimates of their parameters are close to the corresponding Cramer-Rao lower bounds (CRLBs) derived in a scenario where only a single wave is impinging The adverb easily means that the MSEEs rapidly approach the CLRBs, ie, within less than 20 iteration cycles Convergence of the log-likelihood sequence is achieved after approximately ten iteration cycles when the scheme is applied in real channels In this use, the estimated dominant waves can be related to a scatterer/reflector in the propagation environment The investigations demonstrate that the SAGE algorithm is a powerful high-resolution tool that can be successfully applied for parameter extraction from extensive channel measurement data, especially for the purpose of channel modeling

Channel estimation for OFDM systems with transmitter diversity in mobile wireless channels

Abstract: Transmitter diversity is an effective technique to improve wireless communication performance. In this paper, we investigate transmitter diversity using space-time coding for orthogonal frequency division multiplexing (OFDM) systems in high-speed wireless data applications. We develop channel parameter estimation approaches, which are crucial for the decoding of the space-time codes, and we derive the MSE bounds of the estimators. The overall receiver performance using such a transmitter diversity scheme is demonstrated by extensive computer simulations. For an OFDM system with two transmitter antennas and two receiver antennas with transmission efficiency as high as 1.475 bits/s/Hz, the required signal-to-noise ratio is only about 7 dB for a 1% bit error rate and 9 dB for a 10% word error rate assuming channels with two-ray, typical urban, and hilly terrain delay profiles, and a 40-Hz Doppler frequency. In summary, with the proposed channel estimator, combining OPDM with transmitter diversity using space-time coding is a promising technique for highly efficient data transmission over mobile wireless channels.

Distributed quality-of-service routing in ad hoc networks

Abstract: In an ad hoc network, all communication is done over wireless media, typically by radio through the air, without the help of wired base stations. Since direct communication is allowed only between adjacent nodes, distant nodes communicate over multiple hops. The quality-of-service (QoS) routing in an ad hoc network is difficult because the network topology may change constantly, and the available state information for routing is inherently imprecise. In this paper, we propose a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment. The proposed algorithms work with imprecise state information. Multiple paths are searched in parallel to find the most qualified one. Fault-tolerance techniques are brought in for the maintenance of the routing paths when the nodes move, join, or leave the network. Our algorithms consider not only the QoS requirement, but also the cost optimality of the routing path to improve the overall network performance. Extensive simulations show that high call admission ratio and low-cost paths are achieved with modest routing overhead. The algorithms can tolerate a high degree of information imprecision.

Scalable routing strategies for ad hoc wireless networks

Abstract: We consider a large population of mobile stations that are interconnected by a multihop wireless network. The applications of this wireless infrastructure range from ad hoc networking (e.g., collaborative, distributed computing) to disaster recovery (e.g., fire, flood, earthquake), law enforcement (e.g., crowd control, search-and-rescue), and military (automated battlefield). Key characteristics of this system are the large number of users, their mobility, and the need to operate without the support of a fixed (wired or wireless) infrastructure. The last feature sets this system apart from existing cellular systems and in fact makes its design much more challenging. In this environment, we investigate routing strategies that scale well to large populations and can handle mobility. In addition, we address the need to support multimedia communications, with low latency requirements for interactive traffic and quality-of-service (QoS) support for real-time streams (voice/video). In the wireless routing area, several schemes have already been proposed and implemented (e.g., hierarchical routing, on-demand routing, etc.). We introduce two new schemes-fisheye state routing (FSR) and hierarchical state routing (HSR)-which offer some competitive advantages over the existing schemes. We compare the performance of existing and proposed schemes via simulation.

A mobility-based framework for adaptive clustering in wireless ad hoc networks

Abstract: This paper presents a novel framework for dynamically organizing mobile nodes in wireless ad hoc networks into clusters in which the probability of path availability can be bounded. The purpose of the (/spl alpha/, t) cluster is to help minimize the far-reaching effects of topological changes while balancing the need to support more optimal routing. A mobility model for ad hoc networks is developed and is used to derive expressions for the probability of path availability as a function of time. It is shown how this model provides the basis for dynamically grouping nodes into clusters using an efficient distributed clustering algorithm. Since the criteria for cluster organization depends directly upon path availability, the structure of the cluster topology is adaptive with respect to node mobility. Consequently, this framework supports an adaptive hybrid routing architecture that can be more responsive and effective when mobility rates are low and more efficient when mobility rates are high.

CEDAR: a core-extraction distributed ad hoc routing algorithm

Abstract: We present CEDAR, a core-extraction distributed ad hoc routing algorithm for quality-of-service (QoS) routing in ad hoc network environments, CEDAR has three key components: (a) the establishment and maintenance of a self-organizing routing infrastructure called the core for performing route computations; (b) the propagation of the link-state of high bandwidth and stable links in the core through increase/decrease waves; and (c) a QoS-route computation algorithm that is executed at the core nodes using only locally available state. The performance evaluations show that CEDAR is a robust and adaptive QoS routing algorithm that reacts quickly and effectively to the dynamics of the network while still approximating the performance of link-state routing for stable networks.

The core-assisted mesh protocol

Abstract: The core-assisted mesh protocol (CAMP) is introduced for multicast routing in ad hoc networks. CAMP generalizes the notion of core-based trees introduced for internet multicasting into multicast meshes that have much richer connectivity than trees. A shared multicast mesh is defined for each multicast group; the main goal of using such meshes is to maintain the connectivity of multicast groups even while network routers move frequently, CAMP consists of the maintenance of multicast meshes and loop-free packet forwarding over such meshes. Within the multicast mesh of a group, packets from any source in the group are forwarded along the reverse shortest path to the source, just as in traditional multicast protocols based on source-based trees. CAMP guarantees that within a finite time, every receiver of a multicast group has a reverse shortest path to each source of the multicast group. Multicast packets for a group are forwarded along the shortest paths front sources to receivers defined within the group's mesh. CAMP uses cores only to limit the traffic needed for a router to join a multicast group; the failure of cores does not stop packet forwarding or the process of maintaining the multicast meshes.

Determining the optimal configuration for the zone routing protocol

Abstract: The zone routing protocol (ZRP) is a hybrid routing protocol that proactively maintains routes within a local region of the network (which we refer to as the routing zone). Knowledge of this routing zone topology is leveraged by the ZRP to improve the efficiency of a reactive route query/reply mechanism. The ZRP can be configured for a particular network through adjustment of a single parameter, the routing zone radius. We address the issue of configuring the ZRP to provide the best performance for a particular network at any time. Previous work has demonstrated that an optimally configured ZRP operates at least as efficiently as traditional reactive flood-search or proactive distance vector/link state routing protocols (and in many cases, much more efficiently). Adaptation of the ZIP to changing network conditions requires both an understanding of how the ZRP reacts to changes in network behavior and a mechanism to allow individual nodes to identify these changes given only limited knowledge of the network behavior. We demonstrate the effects of relative node velocity, node density, network span, and user data activity on the performance of the ZRP. We then introduce two different schemes ("min searching" and "traffic adaptive") that allow individual nodes to identify and appropriately react to changes in network configuration, based only on information derived from the amount of received ZRP traffic. Through test-bed simulation, we demonstrate that these radius estimation techniques can allow the ZRP to operate within 2% of the control traffic resulting from perfect radius estimation.

A peer-to-peer zone-based two-level link state routing for mobile ad hoc networks

Abstract: A new global positioning system (GPS)-based routing protocol for ad hoc networks, called zone-based hierarchical link state (ZHLS) routing protocol, is proposed. In this protocol, the network is divided into nonoverlapping zones. Each node only knows the node connectivity within its zone and the zone connectivity of the whole network. The link state routing is performed on two levels: focal node and global zone levels. Unlike other hierarchical protocols, there is no cluster head in this protocol. The zone level topological information is distributed to all nodes. This "peer-to-peer" manner mitigates traffic bottleneck, avoids single point of failure, and simplifies mobility management. Since only zone ID and node ID of a destination are needed for routing, the route from a source to a destination is adaptable to changing topology. The zone ID of the destination is found by sending one location request to every zone. Simulation results show that our location search scheme generates less overhead than the schemes based on flooding. The results also confirm that the communication overhead for creating and maintaining the topology in the proposed protocol is smaller than that in the flat LSR protocol. This new routing protocol provides a flexible, efficient, and effective approach to accommodate the changing topology in a wireless network environment.

QoS routing in ad hoc wireless networks

Abstract: The emergence of nomadic applications have generated much interest in wireless network infrastructures that support real-time communications. We propose a bandwidth routing protocol for quality-of-service (QoS) support in a multihop mobile network. The QoS routing feature is important for a mobile network to interconnect wired networks with QoS support (e.g., ATM, Internet, etc.). The QoS routing protocol can also work in a stand-alone multihop mobile network for real-time applications. This QoS routing protocol contains end-to-end bandwidth calculation and bandwidth allocation. Under such a routing protocol, the source (or the ATM gateway) is informed of the bandwidth and QoS available to any destination in the mobile network. This knowledge enables the establishment of QoS connections within the mobile network and the efficient support of real-time applications. In addition, it enables more efficient call admission control. In the case of ATM interconnection, the bandwidth information can be used to carry out intelligent handoff between ATM gateways and/or to extend the ATM virtual circuit (VC) service to the mobile network with possible renegotiation of QoS parameters at the gateway. We examine the system performance in various QoS traffic flows and mobility environments via simulation. Simulation results suggest distinct performance advantages of our protocol that calculates the bandwidth information. It is particularly useful in call admission control. Furthermore, "standby" routing enhances the performance in the mobile environment. Simulation experiments show this improvement.

Quality-of-service in ad hoc carrier sense multiple access wireless networks

Abstract: Carrier sense multiple access (CSMA) is one of the most pervasive medium access control (MAC) schemes in ad hoc, wireless networks. However, CSMA and its current variants do not provide quality-of-service (QoS) guarantees for real-time traffic support. This paper presents and studies black-burst (BB) contention, which is a distributed MAC scheme that provides QoS real-time access to ad hoc CSMA wireless networks. With this scheme, real-time nodes contend for access to the channel with pulses of energy-so called BBs-the durations of which are a function of the delay incurred by the nodes until the channel became idle. It is shown that real-time packets are not subject to collisions and that they have access priority over data packets. When operated in an ad hoc wireless LAN, BB contention further guarantees bounded and typically very small real-time delays. The performance of the network can approach that attained under ideal time division multiplexing (TDM) via a distributed algorithm that groups real-time packet transmissions into chains. A general analysis of BB contention is given, contemplating several modes of operation. The analysis provides conditions for the scheme to be stable. Its results are complemented with simulations that evaluate the performance of an ad hoc wireless LAN with a mixed population of data and real-time nodes.

IP-address lookup using LC-tries

Abstract: There has been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest is primarily motivated by the goal of building multigigabit routers for the Internet, without having to rely on multilayer switching techniques. We address this problem by using an LC-trie, a trie structure with combined path and level compression. This data structure enables us to build efficient, compact, and easily searchable implementations of an IP-routing table. The structure can store both unicast and multicast addresses with the same average search times. The search depth increases as /spl Theta/(log log n) with the number of entries in the table for a large class of distributions, and it is independent of the length of the addresses. A node in the trie can be coded with four bytes. Only the size of the base vector, which contains the search strings, grows linearly with the length of the addresses when extended from 4 to 16 bytes, as mandated by the shift from IP version 4 to IP version 6. We present the basic structure as well as an adaptive version that roughly doubles the number of lookups/s. More general classifications of packets that are needed for link sharing, quality-of-service provisioning, and multicast and multipath routing are also discussed. Our experimental results compare favorably with those reported previously in the research literature.

The VersaKey framework: versatile group key management

Abstract: Middleware supporting secure applications in a distributed environment faces several challenges. Scalable security in the context of multicasting or broadcasting is especially hard when privacy and authenticity is to be assured to highly dynamic groups where the application allows participants to join and leave at any time. Unicast security is well-known and has widely advanced into production state. But proposals for multicast security solutions that have been published so far are complex, often require trust in network components, or are inefficient. In this paper, we propose a framework of new approaches for achieving scalable security in IP multicasting. Our solutions assure that newly joining members are not able to understand past group traffic and that leaving members may not follow future communication. For versatility, our framework supports a range of closely related schemes for key management, ranging from tightly centralized to fully distributed, and even allows switching between these schemes on-the-fly with low overhead. Operations have low complexity [O(log N) for joins or leaves], thus granting scalability even for very large groups. We also present a novel concurrency-enabling scheme, which was devised for fully distributed key management. In this paper, we discuss the requirements for secure multicasting, present our flexible system, and evaluate its properties based on the existing prototype implementation.

A time and frequency synchronization scheme for multiuser OFDM

Abstract: We present a multiuser synchronization scheme for tracking the mobile's uplink time and frequency offsets. It uses the redundancy introduced by the cyclic prefix and does not need additional pilots. We show performance results of an orthogonal frequency division multiplexing (OFDM)-based radio interface based on the universal mobile telecommunication system (UMTS) parameters. For a UMTS-typical mobile channel environment, the performance of a coherent system employing the scheme is virtually indistinguishable from the performance of a perfectly synchronized system. In a differentially modulated system, synchronization errors decrease the system performance by about 0.7 dB compared to a perfectly synchronized system.

Matching output queueing with a combined input/output-queued switch

Abstract: The Internet is facing two problems simultaneously: there is a need for a faster switching/routing infrastructure and a need to introduce guaranteed qualities-of-service (QoS). Each problem can be solved independently: switches and routers can be made faster by using input-queued crossbars instead of shared memory systems; QoS can be provided using weighted-fair queueing (WFQ)-based packet scheduling. Until now, however, the two solutions have been mutually exclusive-all of the work on WFQ-based scheduling algorithms has required that switches/routers use output-queueing or centralized shared memory. This paper demonstrates that a combined input/output-queueing (CIOQ) switch running twice as fast as an input-queued switch can provide precise emulation of a broad class of packet-scheduling algorithms, including WFQ and strict priorities. More precisely, we show that for an N/spl times/N switch, a "speedup" of 2-1/N is necessary, and a speedup of two is sufficient for this exact emulation. Perhaps most interestingly, this result holds for all traffic arrival patterns. On its own, the result is primarily a theoretical observation; it shows that it is possible to emulate purely OQ switches with CIOQ switches running at approximately twice the line rate. To make the result more practical, we introduce several scheduling algorithms that with a speedup of two can emulate an OQ switch. We focus our attention on the simplest of these algorithms, critical cells first (CCF), and consider its running time and implementation complexity. We conclude that additional techniques are required to make the scheduling algorithms implementable at a high speed and propose two specific strategies.

A control-based middleware framework for quality-of-service adaptations

Abstract: In heterogeneous environments with performance variations present, multiple applications compete for and share a limited amount of system resources and suffer from variations in resource availability. These complex applications are desired to adapt themselves and to adjust their resource demands dynamically. On one hand, current adaptation mechanisms built within an application cannot preserve global properties such as fairness; on the other hand, adaptive resource management mechanisms built within the operating system are not aware of data semantics in the application. In this paper, we present a novel middleware control framework to enhance the effectiveness of quality-of-service (QoS) adaptation decisions by dynamic control and reconfiguration of internal parameters and functionalities of a distributed multimedia application. Our objective is to satisfy both system-wide properties (such as fairness among concurrent applications) and application-specific requirements (such as preserving the critical performance criteria). The framework is modeled by the task control model and the fuzzy control model, based on rigorous results from the control theory, and verified by the controllability and adaptivity of a distributed visual tracking application. The results show validation of the framework, i.e., critical application quality parameters can be preserved via controlled adaptation.

Software radio architecture: a mathematical perspective

Abstract: As the software radio makes its transition from research to practice, it becomes increasingly important to establish provable properties of the software radio architecture on which product developers and service providers can base technology insertion decisions. Establishing provable properties requires a mathematical perspective on the software radio architecture. This paper contributes to that perspective by critically reviewing the fundamental concept of the software radio, using mathematical models to characterize this rapidly emerging technology in the context of similar technologies like programmable digital radios. The software radio delivers dynamically defined services through programmable processing capacity that has the mathematical structure of the Turing machine. The bounded recursive functions, a subset of the total recursive functions, are shown to be the largest class of Turing-computable functions for which software radios exhibit provable stability in plug-and-play scenarios. Understanding the topological properties of the software radio architecture promotes plug-and-play applications and cost-effective reuse. Analysis of these topological properties yields a layered distributed virtual machine reference model and a set of architecture design principles for the software radio. These criteria may be useful in defining interfaces among hardware, middleware, and higher level software components that are needed for cost-effective software reuse.

The effects of on-demand behavior in routing protocols for multihop wireless ad hoc networks

Abstract: A number of different routing protocols proposed for use in multihop wireless ad hoc networks are based in whole or in part on what can be described as on-demand behavior. By on-demand behavior, we mean approaches based only on reaction to the offered traffic being handled by the routing protocol. In this paper, we analyze the use of on-demand behavior in such protocols, focusing on its effect on the routing protocol's forwarding latency, overhead cost, and route caching correctness, drawing examples from detailed simulation of the dynamic source routing (DSR) protocol. We study the protocol's behavior and the changes introduced by variations on some of the mechanisms that make up the protocol, examining which mechanisms have the greatest impact and exploring the tradeoffs that exist between them.

Angle and time of arrival statistics for circular and elliptical scattering models

Abstract: With the introduction of antenna array systems into wireless communication networks comes the need to better understand the spatial characteristics of the channel. Scattering models provide both angle of arrival (AOA) and time of arrival (TOA) statistics of the channel. A number of different scattering models have been proposed in the literature including elliptical and circular models. These models assume that scatterers lie within an elliptical and circular region in space, respectively. In this paper, the joint TOA/AOA, the marginal TOA, and the marginal AOA probability density functions (PDFs) are derived for the elliptical and circular scattering models. These PDFs provide insight into the properties of the spatial wireless channel.

Transport protocols for Internet-compatible satellite networks

Abstract: We address the question of how well end-to-end transport connections perform in a satellite environment composed of one or more satellites in geostationary orbit (GEO) or low-altitude Earth orbit (LEO), in which the connection may traverse a portion of the wired Internet. We first summarize the various ways in which latency and asymmetry can impair the performance of the Internet's transmission control protocol (TCP), and discuss extensions to standard TCP that alleviate some of these performance problems. Through analysis, simulation, and experiments, we quantify the performance of state-of-the-art TCP implementations in a satellite environment. A key part of the experimental method is the use of traffic models empirically derived from Internet traffic traces. We identify those TCP implementations that can be expected to perform reasonably well, and those that can suffer serious performance degradation. An important result is that, even with the best satellite-optimized TCP implementations, moderate levels of congestion in the wide-area Internet can seriously degrade performance for satellite connections. For scenarios in which TCP performance is poor, we investigate the potential improvement of using a satellite gateway, proxy, or Web cache to "split" transport connections in a manner transparent to end users. Finally, we describe a new transport protocol for use internally within a satellite network or as part of a split connection. This protocol, which we call the satellite transport protocol (STP), is optimized for challenging network impairments such as high latency, asymmetry, and high error rates. Among its chief benefits are up to an order of magnitude reduction in the bandwidth used in the reverse path, as compared to standard TCP, when conducting large file transfers. This is a particularly important attribute for the kind of asymmetric connectivity likely to dominate satellite-based Internet access.

Transmitter diversity for OFDM systems and its impact on high-rate data wireless networks

Abstract: Transmitter diversity and down-link beamforming can be used in high-rate data wireless networks with orthogonal frequency division multiplexing (OFDM) for capacity improvement. We compare the performance of delay, permutation and space-time coding transmitter diversity for high-rate packet data wireless networks using OFDM modulation. For these systems, relatively high block error rates, such as 10%, are acceptable assuming the use of effective automatic retransmission request (ARQ). As an alternative, we also consider using the same number of transmitter antennas for down-link beamforming as we consider for transmitter diversity. The investigation indicates that delay transmitter diversity with quaternary phase-shift keying (QPSK) modulation and adaptive antenna arrays provides a good quality of service (QoS) with low retransmission probability, while space-time coding transmitter diversity provides high peak data rates. Down-link beamforming together with adaptive antenna arrays, however, provides a higher capacity than transmitter diversity for typical mobile environments.

ANMP: ad hoc network management protocol

Abstract: We present a protocol for managing mobile wireless ad hoc networks. The protocol uses hierarchical clustering of nodes to reduce the number of messages exchanged between the manager and the agents (mobiles). Clustering also enables the network to keep track of mobiles as they roam. The ad hoc network management protocol (ANMP) is fully compatible with simple management protocol, version 3 (SNMPv3) and uses the same protocol data units (PDUs) for data collection. The protocol also implements sophisticated security mechanisms that can be fine-tuned to meet specific requirements. Finally, we have implemented the protocol along with a graphical user interface that allows a manager to change the view or specify management parameters on the fly.

Channel quality estimation and rate adaptation for cellular mobile radio

Abstract: We propose a technique to measure channel quality in terms of signal-to-interference plus noise ratio (SINR) for the transmission of signals over fading channels The Euclidean distance (ED) metric, associated with the decoded information sequence or a suitable modification thereof, is used as a channel quality measure Simulations show that the filtered or averaged metric is a reliable channel quality measure which remains consistent across different coded modulation schemes and at different mobile speeds The average scaled ED metric can be mapped to the SINR per symbol We propose the use of this SINR estimate for data rate adaptation, in addition to mobile assisted handoff (MAHO) and power control We particularly focus on data rate adaptation and propose a set of coded modulation schemes which utilize the SINR estimate to adapt between modulations, thus improving the data throughput Simulation results show that the proposed metric works well across the entire range of Dopplers to provide near-optimal rate adaptation to average SINR This method of adaptation averages out short-term variations due to Rayleigh fading and adapts to the long-term effects such as shadowing At low Dopplers, the metric can track Rayleigh fading and match the rate to a short-term average of the SINR, thus further increasing throughput

Trellis-coded modulation with bit interleaving and iterative decoding

Abstract: This paper considers bit-interleaved coded modulation (BICM) for bandwidth-efficient transmission using software radios. A simple iterative decoding (ID) method with hard-decision feedback is suggested to achieve better performance. The paper shows that convolutional codes with good Hamming-distance property can provide both high diversity order and large free Euclidean distance for BICM-ID. The method offers a common framework for coded modulation over channels with a variety of fading statistics. In addition, BICM-ID allows an efficient combination of punctured convolutional codes and multiphase/level modulation, and therefore provides a simple mechanism for variable-rate transmission.

Rate control for robust video transmission over burst-error wireless channels

Abstract: We study the problem of rate control for transmission of video over burst-error wireless channels, i.e., channels such that errors tend to occur in clusters during fading periods. In particular we consider a scenario consisting of packet based transmission with automatic repeat request (ARQ) error control and a back channel. We start by showing how the delay constraints in real time video transmission can be translated into rate constraints at the encoder, where the applicable rate constraints at a given time depend on future channel rates. With the acknowledgments received through the back channel we have an estimate of the current channel state. This information, combined with an a priori model of the channel, allows us to statistically model the future channel rates. Thus the rate constraints at the encoder can be expressed in terms of the expected channel behavior. We can then formalize a rate distortion optimization problem, namely, that of assigning quantizers to each of the video blocks stored in the encoder buffer such that the quality of the received video is maximized. This requires that the rate constraints be included in the optimization, since violating a rate constraint is equivalent to violating a delay constraint and thus results in losing a video block. We formalize two possible approaches. The first one seeks to minimize the distortion for the expected rate constraints given the channel model and current observation. The second approach seeks to allocate bits so as to minimize the expected distortion for the given model. We use both dynamic programming and Lagrangian optimization approaches to solve these problems. Our simulation results demonstrate that both the video distortion at the decoder and packet loss rate can be significantly reduced when incorporating the channel information provided by the feedback channel and the a priori model into the rate control algorithm.