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

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

Cooperative Routing Algorithm based on DSDV to Maximize the Throughput for Wireless Networks

Abstract: In order to maximize the throughput of Ad Hoc networks, an adaptive cooperative routing algorithm is proposed. In this algorithm, cooperative diversity technology is combined with routing selection and best relays are selected to help the sender transmit message in each hop, which improves the network's throughput. First of all, a shortest-path route is established by destination sequenced distance vector (DSDV). According to the neighboring node table, the common neighboring nodes of the sender and receiver in each link are selected to establish relay set. Then, according to the link throughput, at most two relays are selected from relay set adaptively hop by hop to help the transmission and the transmission power of sender and relays are adjusted dynamically according to the number of selected relays. The proposed algorithm has the maximum network throughput while guaranteeing certain system transmission power. Simulation results show that with the same transmission power, the cooperative routing algorithms with fixed relays can improve the network throughput compared with the non-cooperative DSDV routing and the adaptive cooperative routing algorithm can achieve greater improvement of network throughput. In addition, the network throughput with different network sizes and the maximum mobility rate of nodes is simulated.