A dynamic shortest path weighted routing mechanism for MANET based on complex network theory
2014
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.
Keywords:
- Optimized Link State Routing Protocol
- Link-state routing protocol
- Dynamic Source Routing
- Wireless Routing Protocol
- Computer network
- Ad hoc wireless distribution service
- Equal-cost multi-path routing
- Static routing
- Computer science
- Destination-Sequenced Distance Vector routing
- Distributed computing
- Private Network-to-Network Interface
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
11
References
1
Citations
NaN
KQI