An Ad hoc cooperative routing algorithm based on symmetric link selection

Routing problems based on cooperative transmission for multi-hop wireless Ad hoc network have been studied in this paper. Inspired by Multipoint Relay computation, a cooperative routing algorithm is proposed in Ad hoc network, which select cooperative neighbors for cooperative transmission by checking whether the links between the node and its neighbors are symmetric or not. The performances of the proposed cooperative routing algorithm and the non-cooperative routing algorithm are compared. The simulation results show that the cooperative routing algorithm´s capability parameters, like deliver ratio, are better than the non-cooperative routing algorithm. Furthermore, we try to find the optimal number of cooperative nodes at each cooperative transmission stage.