A novel routing algorithm based on dynamic clustering for LEO satellite networks
2011
The performance of satellite networks largely depends on their routing algorithm. Existing routing algorithms for satellite networks usually are not quite adaptive or have the disadvantage of a large consumption in both computation and storage resources. In this paper, we propose a novel routing algorithm based on dynamic clustering for LEO satellite networks. By dynamic forming cluster of the satellite network, the routing algorithm is both adaptive, computational effective and need much less storage space. Simulation results show that our routing algorithm performs better and are more robust when the network topology changes.
Keywords:
- Computer network
- Link-state routing protocol
- Hazy Sighted Link State Routing Protocol
- Dynamic Source Routing
- Wireless Routing Protocol
- Multipath routing
- Static routing
- Computer science
- Equal-cost multi-path routing
- Destination-Sequenced Distance Vector routing
- Distributed computing
- Algorithm
- Hierarchical routing
- Real-time computing
- Policy-based routing
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
16
References
3
Citations
NaN
KQI