• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

Fundamentals of Wireless Communication (2005)

by D Tse, P Viswanath
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 1,528
Next 10 →

A simple cooperative diversity method based on network path selection

by Aggelos Bletsas, Ashish Khisti, David P. Reed, Andrew Lippman - IEEE J. SELECT. AREAS COMMUN , 2006
"... Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investi ..."
Abstract - Cited by 452 (14 self) - Add to MetaCart
Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space–time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of available relays and then uses this “best ” relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space–time coding for relay nodes is required, such as those proposed by Laneman and Wornell (2003). The simplicity of the technique allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability, and efficiency in future 4G wireless systems.

Embracing wireless interference: Analog network coding

by Sachin Katti, Shyamnath Gollakota, Dina Katabi - in ACM SIGCOMM , 2007
"... Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite approach; it encourages strategically picked senders to interfere. Instead of forwarding packets, r ..."
Abstract - Cited by 358 (10 self) - Add to MetaCart
Traditionally, interference is considered harmful. Wireless networks strive to avoid scheduling multiple transmissions at the same time in order to prevent interference. This paper adopts the opposite approach; it encourages strategically picked senders to interfere. Instead of forwarding packets, routers forward the interfering signals. The destination leverages network-level information to cancel the interference and recover the signal destined to it. The result is analog network coding because it mixes signals not bits. So, what if wireless routers forward signals instead of packets? Theoretically, such an approach doubles the capacity of the canonical relay network. Surprisingly, it is also practical. We implement our design using software radios and show that it achieves significantly higher throughput than both traditional wireless routing and prior work on wireless network coding. 1.
(Show Context)

Citation Context

...e practicality of our approach. (b) Addressing Interference: Typically, wireless networks try to avoid interference by probing the medium for idleness [28], scheduling senders in different time slots =-=[26]-=-, or using small control packets called RTS-CTS [3]. Our work allows correct reception despite interference. Multiple access techniques like CDMA [22], FDMA [26], and spatial reuse [26] allow multiple...

Cooperative sensing among cognitive radios

by Shridhar Mubaraq Mishra, Anant Sahai, Robert W. Brodersen - In Proc. of the IEEE International Conference on Communications (ICC , 2006
"... Abstract — Cognitive Radios have been advanced as a technology for the opportunistic use of under-utilized spectrum since they are able to sense the spectrum and use frequency bands if no Primary user is detected. However, the required sensitivity is very demanding since any individual Radio might f ..."
Abstract - Cited by 289 (15 self) - Add to MetaCart
Abstract — Cognitive Radios have been advanced as a technology for the opportunistic use of under-utilized spectrum since they are able to sense the spectrum and use frequency bands if no Primary user is detected. However, the required sensitivity is very demanding since any individual Radio might face a deep fade. We propose light-weight cooperation in sensing based on hard decisions to mitigate the sensitivity requirements on individual radios. We show that the “link budget ” that system designers have to reserve for fading is a significant function of the required probability of detection. Even a few cooperating users (∼10-20) facing independent fades are enough to achieve practical threshold levels by drastically reducing the individual detection requirements. Hard decisions perform almost as well as soft decisions in achieving these gains. Shadowing correlation limits these gains and hence a few independent users perform better than many correlated users. Unfortunately, cooperative gain is very sensitive to adversarial/failing Cognitive Radios. Radios that fail in a known way (always report the presence/absence of a Primary user) can be compensated for by censoring them. On the other hand, radios that fail in unknown ways or may be malicious, introduce a bound on achievable sensitivity reductions. As a rule of thumb, if we believe that 1
(Show Context)

Citation Context

...ivation for Cooperative Sensing The two major sources of degraded signals are multipath and shadowing. For a given frequency, multipath varies significantly with a displacement of λ 4 as discussed in =-=[7]-=- (where λ is the wavelength). In the absence of multiple antennas, multiple radios can act as a proxy for displacement or movement. The presence of multiple radios helps to reduce the effects of sever...

Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks

by Ayfer Özgür, Olivier Lévêque, David Tse , 2007
"... n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r −α as well as a random phase. We identify the scaling laws of the information theoretic capacity of the ne ..."
Abstract - Cited by 263 (18 self) - Add to MetaCart
n source and destination pairs randomly located in an area want to communicate with each other. Signals transmitted from one user to another at distance r apart are subject to a power loss of r −α as well as a random phase. We identify the scaling laws of the information theoretic capacity of the network. In the case of dense networks, where the area is fixed and the density of nodes increasing, we show that the total capacity of the network scales linearly with n. This improves on the best known achievability result of n 2/3 of [1]. In the case of extended networks, where the density of nodes is fixed and the area increasing linearly with n, we show that this capacity scales as n 2−α/2 for 2 ≤ α < 3 and n for α ≥ 3. The best known earlier result [2] identified the scaling law for α> 4. Thus, much better scaling than multihop can be achieved in dense networks, as well as in extended networks with low attenuation. The performance gain is achieved by intelligent node cooperation and distributed MIMO communication. The key ingredient is a hierarchical and digital architecture for nodal exchange of information for realizing the cooperation.

Scaling up MIMO: Opportunities and challenges with very large arrays

by Fredrik Rusek, Daniel Persson, Buon Kiong Lau, Erik G. Larsson, Thomas L. Marzetta, Ove Edfors, Fredrik Tufvesson , 2011
"... ..."
Abstract - Cited by 220 (23 self) - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

...n more impressive, because such systems offer the possibility to transmit simultaneously to several users and the flexibility to select what users to schedule for reception at any given point in time =-=[2]-=-. The price to pay for MIMO is increased complexity of the hardware (number of RF chains) and the complexity and energy consumption of the signal processing at both ends. For point-to-point links, com...

Cognitive Radio: An Information-Theoretic Perspective

by Aleksandar Jovičić, Pramod Viswanath , 2009
"... We consider a communication scenario in which the primary and the cognitive radios wish to communicate to different receivers, subject to mutual interference. In the model that we use, the cognitive radio has non-causal knowledge of the primary radio’s codeword. We characterize the largest rate at w ..."
Abstract - Cited by 183 (1 self) - Add to MetaCart
We consider a communication scenario in which the primary and the cognitive radios wish to communicate to different receivers, subject to mutual interference. In the model that we use, the cognitive radio has non-causal knowledge of the primary radio’s codeword. We characterize the largest rate at which the cognitive radio can reliably communicate under the constraint that (i) no rate degradation is created for the primary user, and (ii) the primary receiver uses a single-user decoder just as it would in the absence of the cognitive radio. The result holds in a “low interference ” regime in which the cognitive radio is closer to its receiver than to the primary receiver. In this regime, our results are subsumed by the results derived in a concurrent and independent work [24]. We also demonstrate that, in a “high interference ” regime, multi-user decoding at the primary receiver is optimal from the standpoint of maximal jointly achievable rates for the primary and cognitive users.

Wireless information-theoretic security - part I: Theoretical aspects

by Matthieu Bloch, João Barros, Miguel R. D. Rodrigues, Steven W. Mclaughlin - IEEE Trans. on Information Theory , 2006
"... In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissi ..."
Abstract - Cited by 162 (12 self) - Add to MetaCart
In this two-part paper, we consider the transmission of confidential data over wireless wiretap channels. The first part presents an information-theoretic problem formulation in which two legitimate partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through another independent quasi-static fading channel. We define the secrecy capacity in terms of outage probability and provide a complete characterization of the maximum transmission rate at which the eavesdropper is unable to decode any information. In sharp contrast with known results for Gaussian wiretap channels (without feedback), our contribution shows that in the presence of fading information-theoretic security is achievable even when the eavesdropper has a better average signal-to-noise ratio (SNR) than the legitimate receiver — fading thus turns out to be a friend and not a foe. The issue of imperfect channel state information is also addressed. Practical schemes for wireless information-theoretic security are presented in Part II, which in some cases comes close to the secrecy capacity limits given in this paper.

Zigzag decoding: Combating hidden terminals in wireless networks

by Shyamnath Gollakota, Dina Katabi , 2008
"... This paper presents ZigZag, an 802.11 receiver design that combats hidden terminals. ZigZag’s core contribution is a new form of interference cancellation that exploits asynchrony across successive collisions. Specifically, 802.11 retransmissions, in the case of hidden terminals, cause successive co ..."
Abstract - Cited by 158 (10 self) - Add to MetaCart
This paper presents ZigZag, an 802.11 receiver design that combats hidden terminals. ZigZag’s core contribution is a new form of interference cancellation that exploits asynchrony across successive collisions. Specifically, 802.11 retransmissions, in the case of hidden terminals, cause successive collisions. These collisions have different interference-free stretches at their start, which ZigZag exploits to bootstrap its decoding. ZigZag makes no changes to the 802.11 MAC and introduces no overhead when there are no collisions. But, when senders collide, ZigZag attains the same throughput as if the colliding packets were a priori scheduled in separate time slots. We build a prototype of ZigZag in GNU Radio. In a testbed of 14 USRP nodes, ZigZag reduces the average packet loss rate at hidden terminals from 72.6% to about 0.7%.
(Show Context)

Citation Context

...oceed until both packets are fully decoded. ZigZag’s key contribution is a novel approach to resolving interference, different from prior work on interference cancellation [31, 16] and joint decoding =-=[29]-=-. Basic results on the capacity of the multiuser channel show that if the two hidden terminals transmit at the rate supported by the medium in the absence of interference, i.e., rate R in Fig. 3, the ...

High-Resolution Radar via Compressed Sensing

by Matthew A. Herman, Thomas Strohmer , 2008
"... A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N ×N grid. Assuming the number of targets K is small (i.e., K ≪ N 2), then we can transmit a sufficiently “incoherent ” pulse and employ the techniques of compressed sensing to reconstruct the ta ..."
Abstract - Cited by 153 (9 self) - Add to MetaCart
A stylized compressed sensing radar is proposed in which the time-frequency plane is discretized into an N ×N grid. Assuming the number of targets K is small (i.e., K ≪ N 2), then we can transmit a sufficiently “incoherent ” pulse and employ the techniques of compressed sensing to reconstruct the target scene. A theoretical upper bound on the sparsity K is presented. Numerical simulations verify that even better performance can be achieved in practice. This novel compressed sensing approach offers great potential for better resolution over classical radar.

Transmitter Optimization for the Multi-Antenna Downlink with Per-Antenna Power Constraints

by Wei Yu, Tian Lan - IEEE TRANSACTIONS ON SIGNAL PROCESSING , 2007
"... This paper considers the transmitter optimization problem for a multiuser downlink channel with multiple transmit antennas at the base-station. In contrast to the conventional sum-power constraint on the transmit antennas, this paper adopts a more realistic per-antenna power constraint, because in ..."
Abstract - Cited by 135 (7 self) - Add to MetaCart
This paper considers the transmitter optimization problem for a multiuser downlink channel with multiple transmit antennas at the base-station. In contrast to the conventional sum-power constraint on the transmit antennas, this paper adopts a more realistic per-antenna power constraint, because in practical implementations each antenna is equipped with its own power amplifier and is limited individually by the linearity of the amplifier. Assuming perfect channel knowledge at the transmitter, this paper investigates two different transmission schemes under the per-antenna power constraint: a minimum-power beamforming design for downlink channels with a single antenna at each remote user and a capacity-achieving transmitter design for downlink channels with multiple antennas at each remote user. It is shown that in both cases, the per-antenna downlink transmitter optimization problem may be transformed into a dual uplink problem with an uncertain noise. This generalizes previous uplink–downlink duality results and transforms the per-antenna transmitter optimization problem into an equivalent minimax optimization problem. Further, it is shown that various notions of uplink–downlink duality may be unified under a Lagrangian duality framework. This new interpretation of duality gives rise to efficient numerical optimization techniques for solving the downlink per-antenna transmitter optimization problem.
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University