Resource allocation for FDMA-based regenerative multihop links
ABSTRACT An approximate but explicit fractional bandwidth and power allocation algorithm for orthogonal regenerative frequency-division multiple-access-based multihop communication systems over ergodic flat-fading channels is presented. The exposed algorithm is assessed for a two-hop scenario, where it is shown to operate within 10% of the optimum resource allocation. The achieved end-to-end capacity is up to 45% higher if compared to a trivial allocation strategy with equal resources.
- SourceAvailable from: infoscience.epfl.ch[show abstract] [hide abstract]
ABSTRACT: We investigate the use of multi-antennas at both ends of a point-to-point communication system over the additive Gaussian channel. We consider a system with t transmit antennas and r receive antennas in which the received vector v∈Cτ depends on the transmitted vector u∈Cτ via: v=Hu+w where H∈C r×t is the channel transfer matrix and w is zero-mean complex circular symmetric Gaussian noise. We assume that E[ww]=σ 2Ir. The transmitter is constrained in its total power, i.e., E[uu]⩽Es. We assume that the channel matrix H is known at both ends of the communication system, and that the waveform channel is flat over the bandwidth of interest01/2001;
Article: Ad Hoc Networking[show abstract] [hide abstract]
ABSTRACT: Ad hoc networks are to computing devices what Yahoo Personals are to single people: both help individuals communicate productively with strangers while maintaining security. Under the rules of ad hoc networking--which continue to evolve--your mobile phone can, when placed in proximity to your handheld address book, establish a little network on its own and enable data sharing between the two devices. In Ad Hoc Networking, Charles Perkins has compiled a series of technical papers about networking on the fly from a variety of laboratories and experts. The collection explains the latest thinking on how mobile devices can best discover, identify, and communicate with other devices in the vicinity. In this treatment, ad hoc networking covers a broad swath of situations. An ad hoc network might consist of several home-computing devices, plus a notebook computer that must exist on home and office networks without extra administrative work. Such a network might also need to exist when the people and equipment in normally unrelated military units need to work together in combat. Though the papers in this book are much more descriptive of protocols and algorithms than of their implementations, they aim individually and collectively at commercialization and popularization of mobile devices that make use of ad hoc networking. You'll enjoy this book if you're involved in researching or implementing ad hoc networking capabilities for mobile devices. --David Wall Topics covered: The state-of-the-art in protocols and algorithms to be used in ad hoc networks of mobile devices that move in and out of proximity to one another, to fixed resources like printers, and to Internet connectivity. Routing with Destination-Sequenced Distance Vector (DSDV), Dynamic Source Routing (DSR), Ad hoc On-Demand Distance Vector (AODV), and other resource-discovery and routing protocols; the effects of ad hoc networking on bandwidth consumption; and battery life.
- IEEE Transactions on Information Theory. 01/1992; 38:165-168.