A breadth-first and disjoint multi-path routing algorithm in wireless mesh networks

There are high requirements on the timeliness and accuracy of the data when the wireless mesh network is used for the special scene which couldn´t rely on public communication system, such as the emergency communication at disaster area, military communication and etc. To improve the reliability and robustness of the network communication, a multi-path routing algorithm of the wireless mesh network is put forward to find the shortest path and the second shortest path which disjoint with the shortest between the nodes. The algorithm uses the method that the routing destination node send flood wave of route discovery packets to finish route discovery process. The simulation results showed that this routing algorithm can be used to find the shortest path and the second shortest path which disjoint with the shortest in wireless mesh networks.