能量高效的协作路由算法  

Energy-efficient routing algorithm for cooperative networks

作　　者：凌明[1] 张大方[1] 张继[1] 

机构地区：[1]湖南大学信息科学与工程学院,湖南长沙410082

出　　处：《计算机工程与设计》2014年第2期416-419,424,共5页Computer Engineering and Design

摘　　要：提出了一种能量高效的分布式、多跳、多中继协作路由算法。寻找一条由源节点到目的节点最短路径的单径路由,以单径路由上的节点为簇头招募它们的邻居节点作为中继节点,形成虚拟MIMO(multiple-input multiple-output),进行协作传输。在选择中继节点时需要考虑备选中继作为接收端和发送端的信道状况,在确定各跳中继节点个数时提出一种基于簇间物理距离的中继节点个数确定算法CWRN(CWR New),分析了新算法的误码率。仿真实验结果表明,在保持误码率一定的情况下,新算法相比较于CWR算法能够节省能耗6.41%以上。An energy-efficient distributed multi-hop relay cooperative routing algorithm is proposed. The first step of the algo- rithm looks for a ＂one-node-thick＂ path from the source node to the destination one, and then the nodes on the initial path be- come cluster heads, which recruit additional adjacent nodes from their neighborhood and become a virtual M1MO to cooperative transmission. In relay selection, the channel conditions of alternative relay both as the receiving and the sending are considered, and the number of relays is determined by the physical distance of the adjacent cluster head. The bit error rate of the new algo- rithm CRWN is analyed. Experimental results show that in keeping the error rate under a certain conditions the new algorithm can save energy consumption by 6.41% at least compared to the CWR algorithm.

关 键 词：多对单 中继选择 能量高效 分簇 协作路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]