A routing protocol for finding two node-disjoint paths in computer networks.
Kenji IshidaYoshiaki KakudaTohru KikunoPublished in: ICNP (1995)
Keyphrases
- computer networks
- routing protocol
- disjoint paths
- data transmission
- network layer
- intermediate nodes
- source node
- ad hoc networks
- network nodes
- mobile ad hoc networks
- directed graph
- mobile nodes
- wireless sensor networks
- routing algorithm
- approximation algorithms
- network traffic
- network security
- energy aware
- network topology
- aodv routing protocol
- cluster head
- communication networks
- intrusion detection system
- energy consumption
- network management
- multi hop
- undirected graph
- computer systems
- adhoc network
- sensor networks
- energy efficiency
- end to end delay
- link failure
- worst case
- data mining
- data transfer
- mobile networks
- network resources
- tcp ip
- base station
- physical layer
- sensor nodes
- random walk
- cooperative