Study on Quantize-and-Forward Relaying with Interference Alignment for Relay Networks

2013 ◽  
Vol 846-847 ◽  
pp. 629-634
Author(s):  
Ding Cheng Yang ◽  
Lin Xiao ◽  
Tian Kui Zhang ◽  
Wei Wang
Keyword(s):  
Wireless Networks ◽  
Interference Alignment ◽  
Relay Networks ◽  
Data Rate ◽  
Promising Method ◽  
Interference Channels ◽  
Transmitted Power ◽  
Channel Interference ◽  
Sum Rate ◽  
Simulation Results

Relaying is one of the key technological enhancements for the data rate and coverage requirements of wireless networks. The interference alignment (IA) is a promising method for co-channel interference in wireless networks. In this paper, we investigate the quantize-and-forward (QF) relaying strategy with IA in the relay networks. The multi-user transmission aided by the relay is a common case in the wireless networks and can be modeled as multi-user relaying interference channels. We design a method for QF relaying strategy at the relay and propose precoding of IA to process the interference at each user. Then we derive the sum rate of the system and simulate it with the varying transmitted power and the distance between the user and the relay. The simulation results show that, the sum rate of designed QF relaying with IA has a better performance than those of the existing methods or processed algorithms.

Analysis of Capacity Bound on Two-User Transmitter Preprocessing Weak Interference MIMO Channels

2013 ◽  
Vol 694-697 ◽  
pp. 2564-2567
Author(s):  
Mang Liao ◽  
Meng Xing Wang ◽  
Ling Xu Jin
Keyword(s):  
Information Theory ◽  
Open Problem ◽  
Interference Channels ◽  
Capacity Region ◽  
Mimo Channels ◽  
Sum Rate ◽  
Simulation Results ◽  
Capacity Bound ◽  
Weak Interference

In information theory (IT), it is an open problem for thirty years to establish an entire capacity bound of two-user Gaussian weak interference network. Under the assumption that channel situation information (CSI) is known at transmitter, we analyze the effects of three methods of transmitter preprocessing on performance of weak interference MIMO channels. Due to treat weak interference as noise, the bounds on the capacity region of two-user Gaussian weak interference channels (ICs) with the three transmitter preprocessing methods are derived. Compared with the performance without transmitter preprocessing, the sum rate in our system is larger. Finally the simulation results are proposed to be consistent with the theorem.

MINIMUM CONNECTED r-HOP k-DOMINATING SET IN WIRELESS NETWORKS

2009 ◽  
Vol 01 (01) ◽  
pp. 45-57 ◽  
Author(s):  
DEYING LI ◽  
LIN LIU ◽  
HUIQIANG YANG
Keyword(s):  
Wireless Networks ◽  
Undirected Graph ◽  
Dominating Set ◽  
Approximation Ratio ◽  
Dominating Set Problem ◽  
Simulation Results

In this paper, we study the connected r-hop k-dominating set problem in wireless networks. We propose two algorithms for the problem. We prove that algorithm I for UDG has (2r + 1)3 approximate ratio for k ≤ (2r + 1)2 and (2r + 1)((2r + 1)2 + 1)-approximate ratio for k > (2r + 1)2. And algorithm II for any undirected graph has (2r + 1) ln (Δr) approximation ratio, where Δr is the largest cardinality among all r-hop neighborhoods in the network. The simulation results show that our algorithms are efficient.

Sign in / Sign up

Export Citation Format

Share Document