Research on Routing Algorithm for Mobile Ad Hoc Networks Based on Node Degree Theory
| Autor: | Jun-quan Song |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Routing protocol
Backpressure routing Dynamic Source Routing Computer science Wireless ad hoc network Distributed computing Routing table Wireless Routing Protocol Geographic routing Network topology law.invention Relay law Computer Science::Networking and Internet Architecture Destination-Sequenced Distance Vector routing Triangular routing Static routing Adaptive quality of service multi-hop routing Network packet business.industry Wireless network ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Policy-based routing Mobile ad hoc network Ad hoc wireless distribution service Optimized Link State Routing Protocol Link-state routing protocol Multipath routing Hazy Sighted Link State Routing Protocol business Computer network |
| Zdroj: | 2011 7th International Conference on Wireless Communications, Networking and Mobile Computing. |
| DOI: | 10.1109/wicom.2011.6040300 |
| Popis: | an Ad hoc network is recently a hot spot in wireless network researching domain. The design of routing algorithm, which is as the core layer technology in Ad Hoc networks, has drawn great concern. After analyzing the drawbacks of the existing algorithms, this paper puts forward a routing algorithm based on the node degree. This paper explains the principle of the node degree algorithm; we select nodes with high probability to forward data packets in the process of routing searching. Results of simulation show: number of relay nodes is reduced significantly in the process of routing setup. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|