干扰受限的两跳多接入信道的中断概率分析

在频谱资源重复利用的背景下,干扰受限的两跳多接入信道的中断性能是亟待解决的难题之一.针对目的端干扰受限的情形,本文给出了该信道在放大转发模式下的中断概率闭式解.根据中断事件的定义将中断概率分解为两部分:一部分是中继节点发生中断的概率,另一部分是中继节点未发生中断,但中继节点到目的节点的传输发生了中断的概率.通过对第二部分中断概率进行合理的近似,推导出整个系统中断概率的闭式解,为系统的实际设计提供了理论基础.仿真结果表明,所给出的估计闭式解与蒙特卡洛仿真结果相吻合,验证了此估计解的精确性.     

两跳蜂窝移动系统中继信道分配策略

在频率复用因子为1的两跳固定中继节点的蜂窝移动通信系统中,基于现实移动业务分布的时变性和非均匀性,提出了新的中继信道分配策略。与传统的中继信道分配策略相比,该策略不需要BS之间的协作,也能严格控制相邻小区之间同频RS的干扰距离,降低同信道干扰,在较低的系统复杂度下,实现了无线资源的有效利用。     

Joint relay station deployment and frequency reuse scheme for two-hop cellular networks

To fully exploit the performance benefits of relay station (RS),in the two-hop cellular networks covering hotspots,when the number of RSs is predetermined,both RS deployment and frequency reuse scheme ...     

基于量子纠错码的小型量子网络路由通信协议

在小型量子网络中采用量子隐形传态通信从物理机制上保证通信信息的绝对安全,但是由于量子信道存在噪声,干扰信息的正确性从而产生误码。为保证通信信息的可靠性,本文提出基于量子纠错码的小型量子网络路由通信协议。根据小型量子网络的路由特点构建路由表;依据路由表实现源量子节点到一跳、两跳目的量子节点的量子隐形传态;利用量子纠错码纠正因噪声产生的误码信息;对该协议的安全性进行理论证明。     

两跳MIMO级联中继网络自由度研究

未来移动通信系统的发展和演进涉及的两个基本方面是提高系统的吞吐量和覆盖率,为了实现这两个目标,多输入多输出(MIMO)中继技术成为主流的解决办法。因此模拟现实情况,使用了TDD模式下的由源节点、中继节点、目的节点组成的两跳MIMO级联中继网络模型。采用改进的最大流-最小割定理方法得到中继网络的该模型自由度的上界;采用解码-转发与迫零信号处理得到了该模型自由度的下界。最后得到各对应情况下自由度下界与上界相等的结论,且其自由度均为天线数的函数。     

LTE-A多小区中继网络两跳速率匹配资源分配算法

针对中继网络的两跳特性,提出一种多小区中继网络两跳速率匹配资源分配算法。首先,在第一个子时隙内各小区独立地为小区中所有用户分配子载波,并根据子载波分配结果,建立基于非合作博弈的功率分配模型;然后,由第一跳资源分配结果对第二跳速率匹配,自适应地为中继分配资源以满足边缘用户的速率需求。仿真结果表明,该算法在满足边缘用户速率需求的前提下,进一步提高了中心用户的吞吐量,同时降低了系统的发射功率,从而提升了系统性能。     

无线移动自组网中的两跳邻接表维护机制

针对无线移动自组网中的节点终端掌握拓扑变化的问题,两跳的邻接表能更好地为稳定路径提供基础的支持,为了减少因拓扑改变带来的信标交换而导致报文流量增大,充分利用网络数据广播传输的特性,提出了一种两跳邻接表建立方案,并对其在不同的状态下做了详细的分析。     

Two-Hop Polling: An Access Scheme for Clustered, Multihop Ad hoc Networks

In multiple channel environments, clustering provides a convenient framework for channel access and bandwidth allocation. Many clustering schemes, however, demand that terminals may communicate directly only if they share a common clusterhead. This requirement deactivates otherwise helpful links; those between nodes that belong to different clusters (intercluster links). Links between nodes that belong to different clusters constitute a distributed gateway. In this paper, we evaluate the importance of distributed gateways for two different clustering schemes and propose a novel access scheme for clustered environments using the link-cluster architecture, called two-hop polling (2HP). Two-hop polling manages to utilize intercluster links, leading to better connectivity and throughput.     

两跳高斯线性中继信道：可达码率与最优设计

The relay node with linear relaying transmits the linear combination of its past received signals. The optimization of two-hop relay channel with linear relaying is discussed in this paper. The capacity for the two-hop Gaussian relay channel with linear relaying is derived, which can be formulated as an optimization problem over the relaying matrix and the covariance matrix of the signals transmitted at the source. It is proved that the solution to this optimization problem is equivalent to a “single-letter ”optimization problem. We also show that the solution to this “single-letter ”optimization problem has the same form as the expression of the rate achieved by Time-Sharing Amplify and Forward ( TSAF ). In order to solve this equivalent problem, we proposed an iterative algorithm. Simulation results show that if channel gain of one hop is relatively smaller, the achievable rate with TSAF is closer to the max-flow min-cut capacity bound, but at a lower complexity.