27105771
A Novel Evaluation Method for the Downlink Capacity of Distributed Antenna Systems
This letter focuses on the simplified capacity evaluation for the downlink of a distributed antenna system (DAS) with random antenna layout. Based on system scale-up, we derive a good approximation of the downlink capacity by developing the results from random matrix theory. We also propose an iterative method to calculate the unknown parameters in the approximated expression of the downlink capacity. The approximation is illustrated to be quite accurate and the iterative method is shown to be quite efficient by Monte Carlo simulations.
26833953
MIMO Broadcast Transmission Strategy over Fast Time-Varying Channels
In time-varying channels, the channel state information available at the transmitter (CSIT) is outdated due to inherent time delay between the uplink channel estimation and the downlink data transmission in TDD systems. In this letter, we propose an iterative precoding method and a linear decoding method which are both based on minimum mean-squared error (MMSE) criteria to mitigate the interference among data streams and users created by outdated CSIT for multiuser MIMO downlink systems. Analysis and simulation results show that the proposed method can effectively reduce the impairment of the outdated CSIT and improve the system capacity.
15631426
On the Performance Analysis of Network-Coded Cooperation in Wireless Networks
In this letter, a network-coded cooperation scheme with dynamic coding mechanism (DC-NCC) is proposed. In DC-NCC, the relay dynamically adapts forming the network-coded data based on the observed instantaneous source-to-relay channel quality, and then forwards the network-coded data towards corresponding destinations. Under the assumption (denoted as A) that each destination can reliably overhear the data from other sources, the diversity-multiplexing tradeoff of DC-NCC is proved to outperform that of conventional cooperation (CC), This verifies that DC-NCC outperforms CC in bandwidth efficiency. Moreover, DC-NCC offers reduced system outage probability and single-pair outage probability compared with CC, and achieves the same full diversity order as CC at high signal-to-noise ratio (SNR). Numerical results also show that with dynamic coding, DC-NCC avoids unnecessary error propagation which can be caused by coding those erroneous data into network-coded data. Finally the performance of DC-NCC is discussed in case the assumption A is removed. For a wireless network composed of N source-destination (s-d) pairs and a single relay node, although there is a certain outage probability increase for each s-d pair, DC-NCC still achieves a diversity-multiplexing tradeoff superior to CC.
1953436
Capacity bound of mimo systems with mpsk modulation and superimposed pilots
The enormous capacity potential of multiple-input multiple-output (MIMO) is based on some unrealistic assumptions, such as the complete channel state information (CCSI) at the receiver and Gaussian distributed data. In this paper, in frequency-flat Rayleigh fading environment, we investigate the ergodic capacity of MIMO systems with M-ary phase-shift keying (MPSK) modulation and superimposed pilots for channel estimation. With linear minimum mean square error (LMMSE) channel estimation, the optimal pilots design is presented. For the mathematical tractability, we also derive an easy-computing closed-form lower bound of the channel capacity. Furthermore, the optimal power allocation between the data and pilots is investigated by numerical optimization. It is shown that more power should be devoted to the data in low SNR environments and to the pilots in high SNR environments.
2080159
The Impacts of Radio Channels and Node Mobility on Link Statistics in Mobile Ad Hoc Networks
Understanding link statistics in mobile ad hoc networks (MANETs) is essential to design adaptive routing protocols and achieve desired network performance. While much attention has been given to the node mobility impacts, little has been done to investigate the influence of dynamic channel fadings and the joint effects of the interactions among radio channels, transmission range, node mobility and node-pair distance on link statistics. In this paper, we investigate the link stability and availability by using a distance transition probability matrix of a relative distance between two nodes. Our analysis takes the node effective transmission range Re into account. The relative node movement is based on the Semi-Markov Smooth (SMS) mobility model [1] which captures the smooth node speed (V) transition and the radio channel variations in a small time- scale. We show that the PDF of link lifetime in MANETs can be effectively approximated by the exponential distribution characterized by the parameter V/Re. Moreover, we And that the impacting factors on residual link lifetime are in the decreasing order of node speed, transmission range, node-pair distance. The analytical results are validated by extensive simulations.
3677775
Relaying Schemes for MIMO Broadcast Channels: Coexistence of Direct-Link and Relay-Link Users
The combination of relay and Multiple-Input Multiple-Output (MIMO) techniques can significantly benefit the signal transmission in cellular networks. In this work, we propose a novel relaying scheme for the relay assisted MIMO broadcast channel including user classification and precoding. The users are firstly classified as Direct Link (DL) users and Relay Link (RL) users according to their channel conditions. After classification, both DL and RL users may coexist in the system, and Zero-Forcing (ZF) precoding is employed at both the BS and the relay for interference cancellation. Analysis and simulation results show that the proposed relaying scheme can effectively combat the large scale fading of the channels and provide significant performance gain compared with the conventional MIMO relaying schemes without user classification.
6353584
A CoS-enabled Request Scheduling Policy
As a lightweight SLA between service providers and consumers, class of service (CoS) can avoid the runtime overhead brought by multiple negotiation of service agreements. This is especially important in grid environment where lots of transient services exist. We bring CoS into grid environment and propose a QoS-enabled framework named CQEF for grid service. In this paper, we present a CoSenabled request scheduling policy for CoS deployment in CQEF. According to this policy, incoming requests can be identified and classified based on the CoS information attached to them and subsequently be assigned to different waiting queues with different priorities. Besides, queuing scheduling algorithm is used to achieve the CoS enabling purpose. A prototype has been developed over the Globus platform. The test results show that, by using this policy, service providers are able to offer differentiated services for different CoS and QoS of premium CoSs will be guaranteed preferentially.
19156667
Double-orthogonal coded space-time-frequency spreading CDMA scheme
In this paper, we propose double-orthogonal coded space-time-frequency spreading code-division multiple-access (DOC-STFS-CDMA) scheme for the downlink orthogonal frequency-division multiplexing (OFDM) systems employing multiple transmit and receive antennas. First, we introduce the so-called STFS-CDMA and the corresponding minimum mean-square error (MMSE) detection algorithms for three scenarios with different user information. Then, we propose a new class of spreading codes, called double-orthogonal code (DOC), to match the MMSE detection algorithms for STFS-CDMA system. With the special double orthogonality, DOC can effectively exploit space, time, and frequency diversity to enhance the performance of MMSE detectors, and provide the well-balanced signal-to-interference-and-noise ratio to different users. Finally, the performance gain of the proposed scheme over conventional schemes is shown by computer simulation.
694816
Distributed file system support for virtual machines in grid computing
This paper presents a data management solution which allows fast virtual machine (VM) instantiation and efficient run-time execution to support VMs as execution environments in grid computing. It is based on novel distributed file system virtualization techniques and is unique in that: 1) it provides on-demand access to VM state for unmodified VM monitors; 2) it supports user-level and write-back disk caches, per-application caching policies and middleware-driven consistency models; and 3) it supports the use of meta-data associated with files to expedite data transfers. The paper reports on its performance in a WAN setup using VMware-based VMs. Results show that the solution delivers performance over 30% better than native NFS and can bring application-perceived overheads below 10% relatively to a local disk setup. The solution also allows a VM with 1.6GB virtual disk and 320MB virtual memory to be cloned within 160 seconds when it is first instantiated (and within 25 seconds for subsequent clones).
9333650
Cooperative Autonomic Management in Dynamic Distributed Systems
The centralized management of large distributed systems is often impractical, particularly when the both the topology and status of the system change dynamically. This paper proposes an approach to application-centric self-management in large distributed systems consisting of a collection of autonomic components that join and leave the system dynamically. Cooperative autonomic components self-organize into a dynamically created overlay network. Through local information sharing with neighbors, each component gains access to global information as needed for optimizing performance of applications. The approach has been validated and evaluated by developing a decentralized autonomic system consisting of multiple autonomic application managers previously developed for the In-VIGO grid-computing system. Using analytical results from complex random network and measurements done in a prototype system, we demonstrate the robustness, self-organization and adaptability of our approach, both theoretically and experimentally.
9640803
Distributed File System Virtualization Techniques Supporting On-Demand Virtual Machine Environments for Grid Computing
This paper presents a data management solution which allows fast Virtual Machine (VM) instantiation and efficient run-time execution to support VMs as execution environments in Grid computing. It is based on novel distributed file system virtualization techniques and is unique in that: (1) it provides on-demand cross-domain access to VM state for unmodified VM monitors; (2) it enables private file system channels for VM instantiation by secure tunneling and session-key based authentication; (3) it supports user-level and write-back disk caches, per-application caching policies and middleware-driven consistency models; and (4) it leverages application-specific meta-data associated with files to expedite data transfers. The paper reports on its performance in wide-area setups using VMware-based VMs. Results show that the solution delivers performance over 30% better than native NFS and with warm caches it can bring the application-perceived overheads below 10% compared to a local-disk setup. The solution also allows a VM with 1.6 GB virtual disk and 320 MB virtual memory to be cloned within 160 seconds for the first clone and within 25 seconds for subsequent clones.