基于接收信噪比和网络寿命的最优中继选择

为了增大网络寿命,降低误符号率,优化无直传链路协作通信系统的性能,本文提出基于接收信噪比和网络寿命的最优中继选择算法。由于网络寿命的问题无法直接求解,将其转化为中继节点剩余能量与目的节点达到接收信噪比门限时发射功率的比值。首先计算各个中继在目的节点的接收信噪比,将大于信噪比门限加入候选中继,然后依次计算候选中继的联合优化函数值并排序,值最大者即为最优中继。理论推导了系统误符号率的上下界,仿真表明理论值与仿真值较为吻合,验证了系统在保证较低误符号率的基础上延长了网络寿命。     

基于矩生成函数的协同中继传输误符号率性能分析

多中继协同分集技术在慢衰落无线环境下可以提供巨大的性能增益。该文从接收端平均误符号率的角度,分析了独立的瑞利衰落信道下,采用放大转发的多中继协同最大比合并检测方案和多节点侦听,单中继转发的机会中继方案的性能;并基于矩生成函数推导出两种方案下M-PSK和M-QAM调制信号平均误符号率的闭合表达式。经蒙特卡罗仿真验证,该表达式在中高信噪比下与仿真的实际结果非常吻合。同时也可以看出机会中继的分集增益与协同侦听的节点数成正比,误符号率性能优于使用最大比合并检测的多中继协同方案。     

Rice衰落信道下选择中继的性能分析与功率分配算法

本文针对无线传感器网络,研究了Rice衰落信道下基于选择中继的两跳译码转发系统的协同中继传输性能与功率分配算法.文中利用概率密度函数推导了选择中继协同传输的中断概率、误符号率的闭式表达式,并给出了高信噪比时的渐近性表达式;然后根据渐近性能进行源与中继节点间的功率优化,进一步提升系统传输性能;最后用蒙特卡洛仿真验证了结果的有效性.仿真结果显示,理论值与仿真结果基本一致,优化功率分配后的传输性能接近于搜索法得到的传输性能,但计算复杂度明显降低.     

快衰落信道条件下无线中继系统波束形成方案

随着设备小型化的发展趋势,天线间距较小,信道具有相关性;且假设发射端处于高速移动状态,无法获得完全信道状态信息,只能根据部分信道状态信息设计发射端波束形成方案。针对发射端和接收端配置多天线的固定增益放大转发无线中继系统,以最大化接收端信噪比为准则,设计了基于部分信道状态信息的波束形成方案,推导了系统中断概率和平均误符号率的闭合表达式,通过仿真验证了性能分析的有效性和所设计方案的优越性。在平均误符号率为10-2、相关系数为0.8时,所提方案比反馈信道状态信息的方案节约1.6 dB的信噪比。     

放大转发中继网络中的一种中继选择方案

提出了一种放大转发网络中的中继选择方案,假设目的节点配置多个天线,源节点和所有中继节点都配置单个天线,方案选择一组中继同时在相同的频带上放大转发接收到的源节点信息以最大化接收信噪比。与只择一个最优中继的方案相比,方案在保持满分集阶数的情况下获得了更高的中断容量和更优的误符号率性能。与只选择一个最优中继的方案相比,在0.000 01的误符号率水平上,少需要发射功率1.6 dB。     

有限字符输入下AF中继系统安全互信息量分析及功率控制策略

本文针对有限字符输入下多中继通信系统,推导了源和中继节点总功率受限条件下的安全互信息量。在已知理想信道状态信息的条件下,给出了一种基于对窃听节点迫零的波束赋形方案,并设计了一种提高安全互信息量的功率控制策略。针对所提功率控制策略,研究了该策略下目的节点和窃听节点的平均误符号率性能,分析表明该策略在高信噪比下存在误码平层。针对误码平层缺陷,本文提出了一种高信噪比下适当增大源节点发射功率的改进方案。改进方案虽然损失了部分安全互信息量,但换来误符号率的明显改善,消除了功率控制方案的误码平层问题。      

分布式双向中继选择算法及用户功率分配

针对放大转发的瑞利双向中继信道的节点选择问题,提出了基于部分信道信息的分布式双向中继选择算法。算法通过计算双向链路的接收信噪比,推导出满足目标接收信噪比的转发阈值,各中继节点根据该阈值决定是否参与转发,从而实现分布式选择。此外,考虑用户总功率受限的情况,在分布式中继选择基础上提出了优化功率分配策略,使双向信道的接收信噪比更加接近。仿真结果表明,分布式中继选择算法与最优多中继算法的系统传输速率相似,计算复杂度大大降低,尤其是在中继数目增大的情况下更加明显。优化功率分配策略能进一步提高系统能量效率,在相同性能下可节省7%左右的功率。     

基于中继协作与选择的有效分集方案

基于多址信道的容量,给出了一种中继选择方案.本方案提出根据中继与信宿间等效并行信道的传输能力完成基于多路数据流的中继选择,并由每个中继独立地根据其本身与信宿间的信道信息完成相应的波束矢量设计.该方案避免了多中继间的信息交互和联合处理,从而降低了系统复杂度.实验仿真证明,这种基于协作的中继选择方案与多中继并行传输方案相比可以获得较好的系统误符号率性能.     

协同通信系统中差分调制在Rayleigh衰落信道中的误码性能分析

根据源-中继-目的节点链路的等效信噪比模型,推导了检测传送和选择检测传送两种协议下目的节点瞬时信噪比的概率密度函数和特征函数,基于此推导了协同DMPSK调制近似误符号率的闭合表达式.推导结果不含积分表达式,方便计算,为系统设计和功率分配提供了理论基础.最后通过仿真验证了推导结果的正确性.     

混合衰落信道下选择中继译码转发的性能分析

蜂窝中继通信中基站到中继以及中继到移动台可以建模成混合衰落信道,即基站到中继的信道通常经历莱斯衰落,中继到移动台的信道通常经历瑞利衰落。该文研究混合衰落信道下协同通信系统中两跳译码转发方式的性能,首先通过分析推导了基于选择最佳中继的中断概率、误符号率以及误符号率的渐近线的闭式表达式,然后基于误符号率的渐近线给出了一种功率优化方法。蒙特卡洛仿真验证了理论公式,仿真结果显示优化功率分配的性能优于平均功率分配的性能。     

基于事件驱动的动态分簇网络的协作传输方法

针对事件驱动的无线传感器网络的传输可靠性问题,该文利用节点间的互助,提出一种基于事件驱动的动态分簇网络的协作传输方法。无事件发生时,各节点按预先形成的静态簇低频传输数据。而一旦有事件发生,能感知事件发生的节点快速组成事件簇,向簇头发送采集的数据,簇头融合数据后发往汇聚节点。为提升传输可靠性,当簇头传输失败时,由最佳中继协作转发数据给汇聚节点。在最佳中继的选择上,考虑到事件的连续移动,以及处于事件前向通道上的节点具有较大的感应值和较好的协作能力等条件,该文提出了基于前向通道的最佳中继选择策略。仿真和实验结果表明,所提协作传输方法能够有效提高传输可靠性。     

能量收集多跳D2D无线传感网络中的中继选择算法

针对无线功率传输技术的能量收集效率有限造成信噪比下降进而引发通信中断率增加的问题,在能量收集多跳D2D(Device to Device)无线传感网络中,提出一种基于改进K-means聚类的中继选择方法。首先,推导得到能量收集下的信噪比因子,使其作为K-means聚类特征。然后,利用最小欧氏距离原则得到距离聚类中心最近的实际节点的位置。最后,根据距离重排序得到中继节点,形成从源节点到目的节点的通信链路。仿真实验结果表明,相比最短路径算法和随机中继协作方案,所提出的改进算法链路信噪比更大,能够减小通信中断率,具有更好的中继性能。     

基于SWIPT-TS的被困用户双向传输时间分配算法

本文针对灾难场景下被困用户因移动终端无法充电而与外界中断通信的问题,提出了一种基于SWIPT能量采集的被困用户中继协作传输方法。该中继系统中被困用户为源节点,周围的邻近用户随机地分布在其与基站之间并且作为其与基站进行通信的中继节点,并采用SWIPT-TS方式为被困用户充电。在被困用户采集的能量和系统下行速率的约束下,建立了系统上行可达速率最大的优化问题,通过分析两跳传输的对偶性以及利用Lambert W函数,提出了一种基于系统上行可达速率最大化的中继选择和时间分配算法。本文所提的算法的解是闭式型,因此复杂度较低。仿真结果表明,本文所提的基于系统上行可达速率最大化的中继选择和时间分配算法不仅可以为被困用户提供能量,还可以提高系统数据传输速率。      

A fixed clustering protocol based on random relay strategy for EHWSN

In Energy Harvesting Wireless Sensor Networks (EHWSN), the communication protocol will directly affect the final performance of the network, so it is necessary to study the communication protocol based on EHWSN. In this paper, for the low-cost fixed clustering problem, a fixed clustering protocol RRCEH is based on random relaying. Our proposed RRCEH abandons the inefficient inter-cluster communication method of the traditional fixed clustering protocol. To coordinate the data upload of the cluster head, RRCEH allocates different random relay vectors to each ring area of the network, and combines all the random relay vectors into a random relay matrix of RRCEH. In each communication round, the cluster head node randomly selects its relay target node to send data according to the probability distribution in the random relay vector in the area. For two different cluster head configuration scenarios, by optimizing the random relay matrix, RRCEH can effectively reduce the network's configuration requirements for cluster head energy harvesting capability, thus reducing the deployment cost of EHWSN.     

Alternate energy harvesting and information relaying in cooperative AF networks

This paper studies an energy harvesting (EH) based cooperative relaying system, where two half-duplex relays operate with EH and alternately amplify and forward source data to the destination. When one relay joins in the cooperative data transmission, the other relay will harvest wireless energy by overhearing the transmissions from both the source and the transmitting relay. Both the time-switching and power-splitting architectures are considered for the EH and data reception at relays. Since the EH can be implicitly performed by each relay through listening the ongoing transmissions, more energy can be harvested for the cooperative data transmission. The outage probability and throughput of the proposed scheme are derived. Simulation results are provided to verify the correctness of our theoretical analysis and show that our scheme can significantly outperform the single-relay system in terms of throughput.     

基于部分中继选择的能量收集双跳网络信息年龄优化

针对传统中继协作网络传感器节点能量受限导致信息传输延迟较高的问题,将短包通信（SPC）和能量收集技术相结合,构建了一种双跳中继无线传感器网络模型。网络中源节点和中继均需从专用能量基站收集射频信号能量以保证信息的持续传输,中继采用半双工解码转发协议将源节点发送的状态更新信息以短包形式传递到目的节点,利用中继选择策略与最大比合并技术提出了基于时效性的最早部分中继选择方案。考虑该网络信息的新鲜度,首先,分析了SPC传输性能,推导了中继和目的节点处的平均包错误率。其次,利用顺序统计量描述了源节点到中继端数据包的重传次数,基于更新过程理论推导了网络的平均信息年龄（AoI）表达式,并采用梯度下降方法优化了影响网络平均AoI的部分参数。最后,仿真分析结果表明,优化中继数量和数据包长度可以有效提高网络信息新鲜度,同时,通过对比优化部分参数得到的最优值与贪婪方法得到的最小化平均AoI理论值,可以验证部分中继协作方案在双跳状态更新网络中的可行性。      

Improving physical layer security via cooperative diversity in energy‐constrained cognitive radio networks with multiple eavesdroppers

In this paper, a scheme that exploits cooperative diversity of multiple relays to provide physical layer security against an eavesdropping attack is concerned. Relay‐based cognitive radio network (CRN) faces issues multiple issues other than the same as faced by conventional wireless communications. If the nodes in a CRN are able to harvest energy and then spend less energy than the total energy available, we can ensure a perpetual lifetime for the network. In this paper, an energy‐constrained CRN is considered where relay nodes are able to harvest energy. A cooperative diversity‐based relay and subchannel‐selection algorithm is proposed, which selects a relay and a subchannel to achieve the maximum secrecy rate while keeping the energy consumed under a certain limit. A transmission power factor is also selected by the algorithm, which ensures long‐term operation of the network. The power allocation problem at the selected relay and at the source also satisfies the maximum‐interference constraint with the primary user (PU). The proposed scheme is compared with a variant of the proposed scheme where the relays are assumed to have an infinite battery capacity (so maximum transmission power is available in every time slot) and is compared with a scheme that uses jamming for physical layer security. The simulation results show that the infinite battery‐capacity scheme outperforms the jamming‐based physical layer security scheme, thus validating that cooperative diversity‐based schemes are suitable to use when channel conditions are better employed, instead of jamming for physical layer security.     

Reliable and Energy Efficient Communication Algorithm in Hierarchical Wireless Sensor Networks

Wireless sensor networks are data centric networks, which transmit gathered data to sink nodes. Considering energy constraints, how to make full use of the limited energy to reliably transmit data as much as possible becomes a main research region in sensor networks. In this paper, we focus on energy consumption and reliability of different communication modes. Single hop communication mode is simple and easy to implement, but the distant cluster members, especially those on the edge of the networks, need to enlarge transmission power. On the other hand multi-hop communication is not constrained by the communication distance. The relay communication mode guarantees data transmission to a remote cluster head. Considering of the reliability and energy consumption, we propose a voting based clustering communication algorithm. And the optimal cluster number is calculated based on the geometry locations. Finally, several experiments have been done to validate the analysis in this paper.     

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.     

基于PSO优化模糊C均值的WSN分簇路由算法

针对无线传感器网络节点能量有限、负载不均衡的问题,提出了一种基于粒子群优化模糊C均值的分簇路由算法POFCA。POFCA分别从成簇阶段和数据传输阶段进行了优化。成簇阶段,首先使用粒子群优化算法优化模糊C均值算法,克服了模糊C均值对初始聚类中心的敏感,并根据节点剩余能量和相对距离动态更新簇首,平衡簇内负载。数据传输阶段,基于距离因子、能量因子和节点负载设计了路径评价函数,并使用猫群优化算法为簇首搜寻最优路由路径,在平衡簇首负载的同时又不会加剧中继节点负载。仿真结果表明,与LEACH和LEACH-improved算法相比,POFCA能有效地平衡网络负载,降低网络能耗,延长网络生命周期。