Increasing Network Resiliency by Optimally Assigning Diverse Variants to Routing Nodes.
Andrew NewellDaniel ObenshainThomas TantilloCristina Nita-RotaruYair AmirPublished in: IEEE Trans. Dependable Secur. Comput. (2015)
Keyphrases
- network topologies
- network nodes
- network structure
- wireless ad hoc networks
- intermediate nodes
- link failure
- node density
- ad hoc networks
- network topology
- shortest path
- network layer
- routing protocol
- neighboring nodes
- wireless sensor networks
- mobile nodes
- transmission range
- interconnection networks
- load balance
- malicious nodes
- network communication
- centrality measures
- information networks
- route discovery
- real world networks
- end to end
- origin destination
- routing algorithm
- wireless mesh networks
- social networks
- residual energy
- destination node
- propagation model
- inter domain
- unstructured peer to peer
- sink node
- wireless networks
- hidden nodes
- network connectivity
- fully connected
- network resources
- path length
- multi hop
- complex networks
- network traffic
- mobile ad hoc networks
- aodv routing protocol
- routing overhead
- packet delivery
- communication networks
- network model
- black hole
- routing problem
- query routing
- switched networks
- disaster recovery
- mac protocol