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.