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

A Dynamic Geographic Cooperative Routing Algorithm with Minimum Symbol Error Rate Constrained

作　　者：李洪烈[1] 杨航[1] 赵冬梅[1] 赵波[1] 田雨[1] 

机构地区：[1]海军航空工程学院青岛校区航空电子工程系,山东青岛266041

出　　处：《电讯技术》2017年第2期167-172,共6页Telecommunication Engineering

摘　　要：为了提高无线多跳通信的可靠性,提出一种联合物理层和网络层设计的动态地理协作路由(DGCR)算法,推导计算了单个协作单元协作中继节点的选择区域,在该区域内选择的协作中继节点可以满足误码率要求。最佳中继节点的位置会根据实际协作中继节点的位置和目的节点的位置动态选取。仿真计算表明,该算法相比非协作路由算法和传统地理协作路由算法具有更好的误码率性能,更适用于多径条件下的应用。In order to improve the symbol error rate （SER） performance of wireless multihop communica- tion, a distributed routing discovery scheme called dynamic geographic cooperative routing（DGCR） is pro- posed ,which considers physical layer and network layer together. This approach calculates the searching zone of cooperative node to guarantee SER performance. Once a cooperative node is chosen, forwarding node is chosen dynamically according to the actual positions of cooperative node and destination node. Simulation results show that this approach outperforms non-cooperative geographic routing and traditional geographic cooperative routing in terms of SER. It is more suitable for multi-path applications.

关 键 词：无线多跳通信 协作通信 最小误码率 动态地理协作路由 

分 类 号：TN919.4[电子电信—通信与信息系统]