基于中断概率的多跳混合协作地理路由算法

为了减小无线传感器网络中路由的路径长度,该文提出基于中断概率的多跳混合协作地理路由(MHCGR)算法。首先对不同协作机制的链路进行分析,理论分析表明,在一定中断概率要求下,采用译码放大转发混合协作机制可以进一步扩大传输距离,并推导了每跳协作链路的理想最大协作传输距离和理想中继的位置。在无信标地理路由(BLGR)算法的基础上,MHCGR算法结合节点位置信息为每跳选择最佳的中继节点和转发节点,建立从源节点到目的节点的多跳协作路由。仿真表明,与ENBGCR算法和基于DF协作机制的MPCR算法两种协作地理路由算法相比,MHCGR算法可明显减少路由的跳数,改善路由的整体发射功率。     

无线网络中基于DSDV的最大化吞吐量的协作路由算法

为最大化无线自组织网络的吞吐量,提出一种自适应的协作路由算法。在算法中,协作分集技术与路由选择相结合,通过在路由的每一跳选择最佳的中继节点协作发送节点传输信息来改善网络吞吐量。首先通过目的序列距离矢量路由协议（DSDV）初步建立最短路由路径,在每条链路的发送节点和接收节点根据邻节点表选出公共邻居节点,建立候选中继集合;进一步,每一跳根据链路吞吐量,在候选中继集合中自适应选择最多两个中继来协助发送节点进行传输,并根据选出的中继节点数动态分配节点发射功率。在保证系统发射功率一定的情况下,最大化网络吞吐量。仿真结果表明,在相同的发射功率下,相对于非协作路由DSDV算法,采用固定数量中继的协作路由算法提高了整个网络的吞吐量,而自适应的协作路由算法可进一步提高吞吐量;同时仿真了网络吞吐量与网络规模和节点最大移动速度的变化关系。      

传感器网络簇间通信自适应节能路由优化算法

提出了一种用于无线传感器网络簇间通信的自适应节能路由优化算法。网络中以总体通信能耗最小为首要原则建立端到端之间的路由,并对簇间通信提出了一种优化算法,使得簇首之间相互通信时,可以在直接、中继以及协作3种不同方式中自适应地选择最节能的通信方式。所提出的路由算法可确保源节点与基站通信过程中选择到最优或次优的节能路由,并可降低由于通信覆盖盲区造成的通信中断的概率。仿真结果表明,与其他传感器网络路由算法相比,所提出的路由算法在相同吞吐量和误码率前提下每一轮都消耗更少的能量,并且在不同的节点密度下都可有效地延长网络的生命周期和工作时间。     

一种最小误码率约束的动态地理协作路由算法

为了提高无线多跳通信的可靠性,提出一种联合物理层和网络层设计的动态地理协作路由(DGCR)算法,推导计算了单个协作单元协作中继节点的选择区域,在该区域内选择的协作中继节点可以满足误码率要求.最佳中继节点的位置会根据实际协作中继节点的位置和目的节点的位置动态选取.仿真计算表明,该算法相比非协作路由算法和传统地理协作路由算法具有更好的误码率性能,更适用于多径条件下的应用.     

支持多速率传输的动态Ad hoc路由协议

该文提出了一种支持动态多速率传输的无线Ad hoc网络路由方案,它能够增加网络的吞吐量和减少分组的传输时延。该方案把路由功能分为两个部分:广域路由功能和本地路由功能。本地路由功能是一个独立的子层,负责在广域路由功能选择的中继节点之间适当地增加新转发节点,使最终路由中的每段链路都能使用高速率进行传输,从而减小数据发送过程中总的信道占用时间。该文设计了一种LDSR协议来执行本地路由功能。仿真结果显示了新的路由方案能够有效地利用网络节点的多速率传输能力,获得更好的网络性能。     

OFDM中继系统的中继子载波对选择和功率分配

中继传输能够有效地提高系统功率效率以及传输容量。该文研究宽带OFDM中继系统的最优中继子载波对选择和功率分配。首先分别针对再生中继和非再生中继两种模式,提出中继子载波对的等效信道增益;然后利用匈牙利算法进行中继子载波对选择;最后在选择出的中继子载波对上利用注水法进行功率分配,从而达到最大化传输容量的目的。仿真结果表明,相对于随机中继子载波选择以及平均功率分配,该文算法与其它几种方法相比中继系统容量有较大提高。     

无线网络中基于位置的能量高效协作路由算法

为了降低无线网络中路由的整体发射功率,该文提出了一种基于位置的能量高效协作路由(LBCR)算法。首先分析了协作链路在一定中断概率要求下的发射功率性能,理论分析表明,合适的协作节点可以降低协作链路的发射功率。在自适应转发分群路由(AFCR)算法的基础上,LBCR算法利用节点位置信息为每跳选择合适的中继节点,然后结合多跳协作策略,建立从源节点到目的节点的协作路由。仿真结果表明,与无协作的AFCR算法和基于一跳协作的MPCR算法相比,LBCR算法可以明显改善路由的整体发射功率。     

基于有效带宽保证的路由协议OLSR—BW——无线自组网的路由协议算法及改进研究

无线自组网中无线频率资源严重受限,设计有效地利用无线带宽的路由协议是为多媒体提供服务质量保证（QOS）的重要内容。文中基于优化的链路状态协议（OLSR）及其扩展的最短路径算法,与多点中继技术（MPR）选择算法OLSR-R1及路由计算新量度mhMBW相结合,提出了基于有效带宽保证的路由协议-OLSR-BW,OLSR-SW比纯链路状态路由降低了控制开销,对于保障高速多媒体的连续顺畅传输起到重要的作用。     

基于智能天线和动态虚拟簇的均衡节能路由

为WSN提出了一种能量节省与能耗均衡相结合的路由算法SaDVC-Routing。该算法在辅助中继和智能天线的波束范围内构建虚拟簇,从簇内选择中继加权值最大的节点充当路由中继。根据节点能耗情况和节点间距离,利用波束扩展法对虚拟簇进行动态更新。如果波束宽度超过阈值或者中继节点死亡,则依据加权距离矩阵重新发起路由请求。仿真表明,算法既能有效降低能量消耗,也可以在局部和全局实现能耗均衡。     

广电业务中多路径中继路由技术

广电业务中宽带接入系统的中继技术能够提高系统的覆盖率和频率资源利用率,而中继路由技术是中继技术研究的重要环节.文中提出一种支持多路径的中继路由技术.该技术包括路由发现,维护和管理,和中继的选择机制,能够动态的根据网络的变化选择相应的中继.仿真表明,该多路径的路由选择技术在节省带宽资源和流量控制的基础上,增加了系统的吞吐量,减少了网络时延,提高了网络的性能.     

Joint resource allocation,routing and CAC for uplink OFDMA networks with cooperative relaying

In this paper, we propose a joint resource allocation, routing, and connection admission control (CAC) scheme for uplink transmission in orthogonal frequency division multiple access (OFDMA) relay networks with cooperative relaying. For cooperative relaying, relay station can relay uplink data from mobile station (MS) to base station with cooperation of the MS using transmit diversity. Transmit diversity can be achieved by virtual MISO via distributed space–time coding. The proposed scheme jointly allocates OFDMA resources and selects path for each user with CAC to maximize the upink throughput of cooperative OFDMA relay networks. The basic OFDMA resource unit is considered as a resource element which is one subcarrier over one OFDMA symbol. An efficient multi-choice multi-dimensional knapsack (MMKP) algorithm is presented for the proposed scheme. The proposed MMKP algorithm provides a unified framework which is applicable to OFDMA networks with and without cooperative relaying. We evaluate the performance of the proposed scheme with and without cooperative relaying in a hilly terrain with heavy tree density by using OPNET-based simulation. We show that the cooperative relaying improve the uplink system throughput compared with non-cooperative relaying, and the proposed scheme outperforms the conventional link quality-based scheme in both cooperative and non-cooperative relay networks.     

Nested cooperative encoding protocol for wireless networks with high energy efficiency

Recently, distributed space-time code designs with high cooperative diversity for wireless communication networks, such as ad hoc and sensor networks, have received much attention. Amplify forward and decoding forward are widely used protocols for the cooperative diversity in the wireless communication networks. In both protocols, the information received by relay terminals are "forwarded" to destination or next relay terminals. Since the signals transmitted by relay terminals and those transmitted from the source terminal are correlated, there is information redundancy. To improve the energy efficiency of cooperative networks, we propose an encoding protocol, which is referred to as a nested cooperative encoding protocol. In our proposed protocol, the received signal at each relay terminal is divided into several sub-signals with the nest lattice structure of source information. Each of the sub-signals contains only a partial information with a smaller size of constellation compared to the original information sent by the source terminal. Do a new encoding or modulation by using these sub-signals before transmitting at relay terminals. It is shown that the proposed new protocols can achieve both high cooperative diversity and high energy efficiency.     

Selection Cooperation in Heterogeneous Cooperative Networks

Selection cooperation is an attractive cooperative strategy for wireless networks due to its simplicity and efficiency. In this paper, we consider a heterogeneous cooperative network consisting of different kinds of nodes with low-cost radios where the activities of one kind of nodes are triggered by the other kinds of nodes. This is a common scenario for many networks, such as wireless sensor networks. By exploiting the transmission relationship between heterogeneous nodes, we propose a selection cooperation protocol where inducing nodes can cooperate with the following nodes after their own transmissions for improving the communication reliability of the latter nodes. Through performance analysis, we show an interesting feature that the diversity-multiplexing tradeoff of the proposed protocol does not rely on the best relay selection method and the protocol always achieves the full diversity gain. We further develop an energy-efficient best relay selection method based on power control where the power consumption is minimized without decreasing the full diversity order. Simulation results demonstrate the good performance of the protocol and the remarkable energy reduction of the proposed best relay selection method.     

Cooperative HARQ protocol and diversity analysis of systems with multiple incremental relays

Wireless networks contain an inherent distributed spatial diversity that can be exploited by relays. Relay networks can take advantage of the broadcast-oriented nature of wireless transmission, but require more radio resource to transmit data for their multi-hop traits. Fortunately, incremental relaying technique, which can choose direct or multi-hop transmission adaptively, can efficiently utilize resource. In this article, the incremental transmission with amplify-and-forward (AF) relays is focused on. A practical hybrid-automatic retransmission request (HARQ) protocol is designed, and the related optimal relay selection strategy is proposed. To analyze the cooperative diversity of system with the proposed protocol, the capacity lower bound is deduced. Simulation and analytical results indicate that by adopting the optimal relay selection strategy, the system with the proposed HARQ protocol can achieve an order of cooperative diversity that equals the aggregated number of the relay and source nodes.     

Game‐theoretic modeling and analysis of relay selection in cooperative wireless networks

In this paper, distributed single relay selection in cooperative wireless networks is modeled as a Chinese restaurant game (CRG). Specifically, the CRG is used to model strategic relay selection decisions of source nodes, taking into account negative network externality due to the potential sharing of relay nodes among source nodes. Two cases are studied as follows: (i) perfect relay transmit power (RTP) knowledge and (ii) imperfect RTP knowledge. Under the first case, a distributed relay selection algorithm is proposed and shown to converge to a Nash equilibrium grouping. Under the second case, a reinforcement learning algorithm is proposed and combined with the distributed relay selection algorithm to allow network nodes to select rate‐maximizing relays. Simulation results verify the efficiency of the proposed distributed relay selection algorithm when compared with other relay selection schemes and demonstrate that it yields a network sum‐rate that is comparable with that of centralized relay selection. Copyright © 2014 John Wiley & Sons, Ltd.     

A utility-based capacity optimization framework for achieving cooperative diversity in the hierarchical converged heterogeneous wireless networks

A hierarchical convergence mechanism for the heterogeneous wireless communication system via the heterogeneous cooperative relay node is presented in this paper, in which the techniques of cooperative communication and wireless relay are utilized to improve performances of the individual user and the overall converged networks. In order to evaluate the benefits of the proposal, a utility-based capacity optimization framework for achieving the heterogeneous cooperative diversity gain is proposed. The heterogeneous cooperative capacity, relay selection and power allocation theoretical models are derived individually. The joint optimization model for relay selection and power allocation is presented as well. Owing to the computation complexity, the sub-optimal cooperative relay selection algorithm, the sub-optimal power allocation algorithm and the sub-optimal joint algorithm are determined to approach the maximum overall networks' spectrum efficiency. These proposed algorithms are designed in conformance to guarantee the equivalent transmission rates of the different wireless access networks. The simulation results demonstrate that the utility-based capacity model is available for the heterogeneous cooperative wireless communication system, and the proposed algorithms can improve performances by achieving the cooperative gain and taking full advantage of the cross-layer design. Copyright © 2008 John Wiley & Sons, Ltd.     

A cross-layer protocol for exploiting cooperative diversity in multi-hop wireless ad hoc networks

Cooperative communication has emerged to reap the benefits of spatial diversity. To fully exploit cooperative diversity, we propose a medium access control and routing enabled cross-layer cooperative transmission (MACR-CCT) protocol for improving the performance in multi-hop wireless ad hoc networks (MWAN). Different from previous cooperative protocols that determine a receiver in one hop according to a non-cooperative routing protocol first and then select a cooperative relay, MACR-CCT selects the cooperative relay together with the receiver in one hop to exploit fully cooperative diversity, so that the receiver is selected for higher cooperative gain and closer distance to destination, and the relay is selected to achieve the better throughput performance while considering transmission error. Furthermore, considering that there are multiple source–destination pairs in MWAN, MACR-CCT takes interference mitigation into account to further improve network throughput when selecting the cooperative relay. Besides, we propose a theoretical model to analyze the throughput performance. Finally, we take advantage of simulation results to validate the effectiveness of our analytical model and show that our proposed MACR-CCT protocol can significantly outperform existing packet transmission mechanisms in terms of throughput and delay under the multi-hop multi-flow network scenario.