Fig 1 - uploaded by Chiao-En Chen
Content may be subject to copyright.
A broadcasting network with heterogeneous users, where the single-antenna (weak) users cooperate in groups to receive the high-rate data broadcasted from the base station.  

A broadcasting network with heterogeneous users, where the single-antenna (weak) users cooperate in groups to receive the high-rate data broadcasted from the base station.  

Contexts in source publication

Context 1
... this paper, we propose to improve the QoS of multiple single-antenna users in a MIMO broadcasting network through various user cooperation strategies. The considered network is shown in Fig. 1, where there is one multiantenna BS broadcasting the multimedia service and several multiantenna (strong) users and single-antenna (weak) users receiving the service. The considered network presents two distinct features. First, it reflects a real network comprised of heterogeneous users equipped possibly with different numbers of ...
Context 2
... shown previously in Fig. 1, the considered broadcasting network is comprised of a multiantenna BS and several multiantenna and single-antenna users ("heterogeneous users"). While the multiantenna users can exploit a wealth of existing SM techniques to achieve reliable high-rate communication, the lack of sufficient number of antennas presents a challenge to ...
Context 3
... scheme and then the DF scheme. Note that the CSI acquisition and cooperation overhead are not accounted for in this comparison. In fact, the AF scheme has the largest CSI acquisition and cooperation overhead while the DF scheme has the minimum. This suggests that there exists a tradeoff between the cooperation overhead and the system performance. Fig. 10 compares the SER performance of AF cooperation schemes by taking into account the channel estimation errors. In the simulation, for N P = 4, the pilot matrix P is chosen as a 4 × 4 DFT matrix, which is an orthogonal matrix with a constant ...
Context 4
... N P = 8 and N P = 16, the 4 × 4 DFT matrix is concatenated two and four times, respectively, to form the pilot matrix. As seen in can significantly improve the performance (e.g., N P = 4 with one iteration outperforms N P = 16 with no iteration). Fig. 11 shows the mean squared error (MSE) of the proposed channel estimation. It is seen that the proposed iterative mechanism significantly reduces the MSE and converges after only 2-3 iterations. This verifies that the proposed iterative algorithm can provide accurate overall channel estimates for AF cooperation systems with the aid of very ...

Similar publications

Article
Full-text available
Quadrature space shift keying (QSSK) modulation in cooperative communication, combined with cooperative relaying, improves the reliability in communication and enhances the overall spectral efficiency. Here, QSSK scheme is analyzed for complete uplink and downlink transmission system between a base station and a connected device for Internet-of-Thi...
Conference Paper
Full-text available
In this paper we present a robust detection scheme for cooperative spectrum sensing in cognitive radio (CR) networks with channel uncertainties. We consider a soft-decision scenario at the fusion center for primary user detection, based on the sensed test statistics submitted by the cooperating secondary users. The scheme presented models the chann...
Conference Paper
Full-text available
We consider a wireless communication scenario with íµí°¾ source-destination pairs communicating through several half-duplex amplify-and-forward relays. We design the relay beamforming matrices by minimizing the total power transmit-ted from all the relays subject to quality of service constraints on the received signal to interference-plus-noise ra...
Conference Paper
Full-text available
We study and analyze coverage region in MIMO communication systems for a multiple-relay network with decode-and-forward (DF) strategy at the relays. Assuming that there is a line-of-sight (LOS) propagation environment for source-relay channels and channel state information is available at receivers (CSIR), we consider the objective of maximizing co...
Article
Full-text available
Network lifetime is one of the serious issues of energy-starved Wireless Sensor Networks (WSNs). In this paper, an Extended Lifetime with Minimum Energy Consumption (ELMEC) scheme is proposed for reducing energy consumption of cooperative communication in WSN and to increase the network lifetime. The transmission distance, number of cooperating nod...

Citations

Conference Paper
according to Internet of vehicles alliance division strategy, aiming at Cooperative communication [1] among Road Side Unit (RSU)[2]in the one-way road environment cannot explore the ability to share information of moving vehicle in opposite direction, which reduces the limitation of cooperative communication data transmission capacity. This paper proposes a kind of shared relay vehicle selection strategy to realize the cooperative information transmission among road side units on the one-way road, this strategy though the vehicle to the rear to share information and use geometric coverage theory to select shared relay vehicle, which can effectively reduce the number of repeat forward shared information and data redundancy in the network and improve the capabilities to share information of road side unit. Through a large number of experiments verify the rationality and effectiveness of the strategy.
Article
In this paper, a geometry based decoder with low decoding complexity and exact maximum-likelihood (ML) performance is proposed for underdetermined multiple-input multiple-output (MIMO) systems. In the proposed decoder, an underdetermined MIMO system can be divided into a multiple-input single-output (MISO) sub-system and a regular MIMO sub-system in which numbers of transmit and receive antennas are equal. An efficient slab search algorithm (ESSA) is adopted to efficiently obtain valid candidate points in the MISO sub-system. By adopting ESSA in the MISO sub-system and sphere decoding algorithm (SDA) in the MIMO sub-system, ML solution of underdetermined MIMO system can be obtained with low computational complexity. To further reduce the computational complexity, a near-ML SDA is proposed to more efficiently find the candidate points in the MIMO sub-system. In addition, an optimal preprocessing technique is proposed from the geometrical perspective and the comprehensive analysis on the complexity reduction is also provided. Simulation results indicate that the proposed approach significantly reduces the complexity as compared to existing ML decoders, particularly for systems with large number of antennas and/or high-order constellations.
Article
Systems that broadcast/multicast over cellular networks have recently been intensively investigated. When compared to conventional terrestrial or satellite broadcasting systems, the Quality of Service (QoS) experienced by edge users is an important issue due to the inevitable inter-cell interference (ICI) that occurs within multi-cell environments. In order to resolve this issue, we have developed cooperative sub-band allocation (CSA) and CSA-joint transmission (CSA-JT) techniques that operate as a function of defined visual importance levels assigned to multi-layer videos, where the number of service users is limited over the macro/micro cell environment. To ensure that an acceptable level of video quality is delivered to edge users, an adaptive sub-band allocation scheme for layered video is designed to enhance the overall experience for all users based on maintaining program fairness. In a multiple-input/multiple-output (MIMO) orthogonal frequency-division multiplexing (OFDM) system, CSA can effectively mitigate ICI at the cell border via base station (BS) cooperation. Moreover, CSA-JT can improve the QoS for cell border users via joint transmission among the cooperating BSs. In order to achieve the delivery of optimal visual quality, an optimization problem is formulated that seeks to maximize the sum experience of the multicast users. A dual decomposition technique is applied in order to reduce the computational complexity of the system. Simulation results show that the CSA and CSA-JT algorithms exhibit a remarkable reduction of outage probability.