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

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

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

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

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

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

水下传感网络中基于链路质量和位置的协作路由

水下传感网络是开发水域环境的有效技术手段。但在水下环境传输数据,信号衰减快,通信链路质量差,降低了数据包传递率。提出基于链路质量和位置的协作(LQLC)路由。LQLC路由引用协作路由思想,利用链路质量和节点能量信息,构建候选转发节点集;再从候选转发节点集中选择具有最优链路质量的节点作为转发节点;最后在候选转发节点集中选择离转发节点最近的节点作为协作节点。仿真结果表明,提出的LQLC路由提高了数据包传递率。     

基于博弈论的QoS协作WSNs路由算法

针对无线传感器网络中各个节点之间通信路由单一、无法充分调动合适的路由节点用于下一跳协作通信而浪费不必要的带宽、时延和能耗,提出一种基于博弈论的QoS协作路由算法(QACR),通过研究各个传感器节点的距离、能耗速度与QoS需求量之间的博弈关系,建立基于QoS需求的博弈模型。将协作通信和路由机制相结合,在博弈模型的理论基础上为中心节点选择一个或者多个中继节点,共同协作将数据包发送至目的地址。仿真验证结果表明,这种方法可以减少节点通信的能量消耗和网络延迟,避免网络由于能耗过快、节点死亡率过高而导致的网络断层或瘫痪,保证网络的可靠性QoS需求。     

卫星光网络中基于DQN的匹配度感知波长路由算法

为了进一步降低卫星光网络的业务阻塞率,提出了一种基于深度Q网络(DQN)的匹配度感知波长路由算法。该算法首先设计了路径波长匹配度因子,用以反映当前路径与下一跳节点之间链路的共同空闲波长情况。随后,算法综合考虑了路径波长匹配度、相邻链路时延以及下一跳节点到目的节点的最短跳数等多个因素,以此为基础来构造奖励函数。在分配波长时,为了后续业务请求在相邻链路上有更多的空闲波长,设计了相邻链路波长匹配度指标,用于描述该路径与其相邻链路之间的空闲波长对齐情况。仿真结果表明,该算法可以降低网络阻塞率和时延,提高波长利用率。     

AF协同通信系统最优多跳中继位置

协作中继能够提供分集增益以提高链路成功发送分组的概率,除传输功率外,中继位置也是影响端到端性能的一个重要参数。为了降低多个协作节点对系统容量的影响,多跳中继是当前协作中继发展的一种新趋势。通过中断概率,得出了吞吐量的理论近似表达式,并进一步研究多跳中继位置对吞吐量的影响。仿真结果表明,多跳中继处于源节点和目的节点的中点...     

跨小区多跳中继协作通信的无线通信能效优化 *

针对蜂窝网中某一基站处于体眠状态时引起各用户的通信中断问题,提出利用中继协作通信实现跨小区多跳通信的迭代中继选择算法.该算法是在有多个中继节点可为目的节点提供协作中继时,将源节点到目的节点的数据传输分为3个连续时隙,选择满足目的节点信噪比最大化的中继,以协作效率为依据删除协作效率最小的中继节点,从而逐次优化中继选择结果.仿真结果表明,该算法在跨小区多跳的通信过程中,能选择出协作效率最高的中继节点,减少协作中继的数量,可以减少中继对能源不必要的消耗,改善小区内中继协作效率,在多跳的过程中节省源节点的发射功率,从而达到能效优化的目的.     

功率控制下基于能耗最小的Ad hoc网络路由选择算法

在节点MAC层发射功率可控情况下，提出了一种基于路径能量消耗最小的路由路径选择算法。该算法根据链路的能量消耗情况来进行路由路径选择，达到节约网络能量的目的。仿真表明．该算法可以动态调整网络路由路径，从而使所选路径的能量消耗达到最小。     

协作OFDM系统中的子载波选择算法

研究了协作正交频分复用系统的中继方案,提出了OFDM协作分集系统中的子载波选择算法,根据子信道信息,在容量准则下,选择可以提高系统容量的子载波,以放大前传的方式转发源节点信息。仿真结果表明,在中继节点功率与源节点功率较低或中继节点靠近源或目的节点时,所有子载波都采用中继传输可降低系统容量;子载波选择算法可以改善系统容量,并且选择合适的中继节点发射功率和中继位置,可以显著提高系统容量,当中继节点位于源与目的节点中点时,系统容量最大。     

Energy-balanced cooperative routing in multihop wireless networks

Cooperative communication (CC) allows multiple nodes to simultaneously transmit the same packet to the receiver so that the combined signal at the receiver can be correctly decoded. Since the CC can reduce the transmission power and extend the transmission coverage, it has been considered in minimum energy routing protocols to reduce the total energy consumption. However, previous research on cooperative routing only focuses on minimizing the total energy consumption from the source node to the destination node, which may lead to the unbalanced energy distribution among nodes. In this paper, we aim to study the impact of cooperative routing on balancing the energy distribution among nodes. By introducing a new routing scheme which carefully selects cooperative relay nodes and assigns their transmission power, our cooperative routing method can balance the remaining energy among neighboring nodes to maximize the lifetime of the network. Simulation results demonstrate that the proposed cooperative routing algorithm significantly balances the energy distribution and prolongs the lifetime of the network.     

Optimized mobile sink based grid coverage-aware sensor deployment and link quality based routing in wireless sensor networks

Mobile sink (MS) has been used in wireless sensor networks (WSN) to increase the network lifetime by changing the location over time. The major quality of service given by WSN is coverage energy consumption (EC) and network lifetime. There are many methods implemented for enhance the coverage hole restoration and reduce the EC. We propose a novel MSCOLER (MS based Coverage Optimization and Link-stability Estimation Routing) protocol for Optimal Coverage restoration and Link stability Estimation. An optimization algorithm is used to optimize the coverage hole and move the redundant node besides the hole. During the routing process, link quality based routing is used to discover the relay nodes with the estimation of link stability to enhance the entire network lifetime and practically make the perfect transmission distance for energy saving. Experimental results demonstrate that proposed protocol can solve the coverage restoration problem, decrease the EC and reduce the network lifetime. The performance is evaluated regarding Average of residual energy (ARE), Receiving packets ratio (RPR), Moving energy consumption (MEC), Network lifetime (NL), Percentage of coverage (%C) and Average Energy Consumption (AEC).     

基于部分协作检测的 MIMO 中继系统

为了降低多输入多输出（MIMO）中继传输系统中中继节点进行信号处理和转发的运算复杂度,提升系统整体性能,在全检测转发（FDF）技术的基础之上,提出了一种基于树的遍历的部分协作检测（CPD）算法,采用本算法的中继节点只转发部分信噪比较高的信息流,不仅降低了中继转发的负担同时还去除了一些经历了深度衰落的信号。仿真结果显示,和国外同类典型研究相比较,中继节点的负担大大降低,同时传输系统的性能有了明显提升。     

Multi-hop routing with cooperative transmission: a cross-layer approach

Cooperative diversity techniques have received a lot of attention recently due to their ability to provide spatial diversity in fading wireless environment without the requirement of implementing multiple antenna on the same device. It increases link reliability, provides higher capacity, reduces transmit power, and extends transmission range for the same level of performance and modulation rate. In this paper, we study the achievable gain of cooperative communications from a wireless cross-layer point of view in multi hop networks. We propose two routing algorithms applicable for wireless ad hoc networks. First, we propose an edge node based on a greedy cooperative routing (ENBGCR) algorithm, where we modify the geographic routing algorithm to incorporate the cooperative transmission and extend the coverage range of the nodes. The main objective of ENBGCR algorithm is to minimize the number of hops that messages transverse to reach their destination. Then the energy-efficient cooperative routing algorithm is proposed to minimize the end-to-end total transmission power subject to end-to-end target data rate. Simulation results for both algorithms show that the proposed strategies have great improvement in terms of delay and power saving respectively for the same quality of service requirement as compared to traditional algorithms.     

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.     

非对称协作通信中的时变功率分配算法

针对反射、散射影响下的非对称无线协作通信网络,提出了一种时变功率分配(Time Variant Power Allocation, TVPA)算法。根据无线协作网络中,各节点之间信道条件实时变化且不对称的特点,在信号传输过程中对信源节点和中继节点的发送信号功率进行优化分配。借助信道编码定理,将系统错误概率最小的非凸优化问题转化为最大化系统容量的凸优化问题来解。与固定功率分配(Fixed Power Allocation, FXPA)算法和平均功率分配(Average Power Allocation, AVPA)算法相比,该算法能充分利用无线信道的时变特性,重新分配功率以降低系统错误概率。在多种网络模型中的仿真结果表明,准静态瑞利衰落信道下,相比于FXPA算法,TVPA算法可获得多达5.5dB的比特错误概率性能增益。随着网络质量的进一步改善,该性能优势也逐步增大。      

基于IEEE802.11 DCF的链路预先修复AODV路由协议

基于无线自组织网络中普遍使用的底层通信协议IEEE802.11 DCF,针对广泛应用于无线自组织网络中的路由协议(AODV),提出了一种链路预先修复算法。该算法首先推算了DCF协议中的不稳定传输范围,然后通过MAC层与路由层的跨层协作,在下一跳节点移动在不稳定传输范围时就事先采取相应的路由修复措施。相对于AODV中采用节点周期性地发送HELLO消息来监测邻居节点变化的方法,该算法更为高效及时。仿真结果表明,该算法能够有效的减小端到端时延,保障了投递率。     

Power control based cooperative opportunistic routing in wireless sensor networks

This paper proposes an approach called PC-CORP (Power Control based Cooperative Opportunistic Routing Protocol) for WSN (Wireless Sensor Networks), providing robustness to the random variations in network connectivity while ensuring better data forwarding efficiency in an energy efficient manner. Based on the realistic radio model, we combine the region-based routing, rendezvous scheme, sleep discipline and cooperative communication together to model data forwarding by cross layer design in WSN. At the same time, a lightweight transmission power control algorithm called PC-AIMD (Power Control Additive Increase Multiplicative Decrease) is introduced to utilize the cooperation of relay nodes to improve the forwarding efficiency performance and increase the robustness of the routing protocol. In the simulation, the performance of PC-COPR is investigated in terms of the adaptation of variations in network connectivity and satisfying the QoS requirements of application.