A dynamic shortest path weighted routing mechanism for MANET based on complex network theory

摘要

In this paper, a dynamic shortest path weighted routing mechanism applying to mobile ad hoc networks is proposed based on the complex network theory. This weight routing mechanism uses node energy and link distance which are the two most important factors affecting the performance of mobile ad hoc networks to structure the weights of edges. The routing process presented by this paper uses a mixed mode based on local search and global information. The simulation results shows that the routing mechanism not only can select the more energy nodes to transmit data effectively, but also can balance the relationship between the length of the path and the transmission cost, disperse transmit load of nodes and lengthen the running time of network.