A new adaptive multipath routing algorithm based on game theory for ad hoc networks

摘要

The routing protocol is a key technology in ad hoc networks. Most of these protocols use the flooding mechanism for routing discovery. But the flooding mechanism easily leads to the broadcast storm problem. In addition, the rapidly changing locations of nodes in mobile ad hoc networks leads to dynamic changes in network topology and frequent disconnection of communication links between nodes. To alleviate the broadcast storm problem, we propose an adaptive multipath routing protocol based on game theory (GMAR). GMAR uses game theory to optimize the routing discovery process, which reduces redundant retransmissions, contention, and collisions between neighboring nodes. GMAR also increases link stability by using a multipath mechanism to adapt to dynamic network topology. The simulation results demonstrate that GMAR reduces the average end-to-end delay and the average number of packet losses per node and improves average throughput.