A dynamic geographic cooperative routing algorithm (DGCR)based on cooperative relay node selection was proposed to reduce the symbol error rate (SER)for cooperative routing in wireless multihop networks.With theoretical analysis regarding to SER in single hop,an equation of the envelope of the area containing the best cooperative relay's position was established and the area was divided into co-located annulus with same SER performance.Considering the SER performance and geographic location of the candidate cooperative relay node,the relay-selection contention timer used by distributed contention was designed to select proper cooperative relay node.The location of the forwarder was determined by considering the cooperative relay node and routing destination node.Simulation results show that DGCR algorithm can get the transmit diversity gain and outperforms non-cooperative geographic routing and traditional geographic cooperative routing in terms of symbol error rate.%为提升无线多跳网络的误码率性能,提出一种基于协作中继点选择的动态地理协作路由(DGCR)算法.推导最佳协作中继节点区域包络的曲线方程,将该区域划分为具有相同误码率性能的同心圆环,结合考虑误码率性能和协作中继节点的地理位置,设计用于协作中继选择的分布式竞争机制的离散函数,优先进行协作中继节点的选择,根据协作节点位置和目的节点位置动态地选取最佳中继节点.与非协作地理路由算法和传统的地理协作路由算法相比,仿真结果表明,DGCR算法能更加有效地利用空间分集特性,实现更大幅度的误码率性能提升.
展开▼
