Worst-case performance of rendezvous networks in the presence of adversarial nodes.
Hyongju ParkSeth HutchinsonPublished in: IROS (2013)
Keyphrases
- worst case
- network structure
- real world networks
- information networks
- social networks
- network size
- network topologies
- upper bound
- neighboring nodes
- missing links
- complex networks
- average case
- overlapping communities
- wireless ad hoc networks
- small world
- heterogeneous networks
- scale free networks
- network analysis
- greedy algorithm
- error bounds
- multi agent
- edge weights
- shortest path
- lower bound
- cohesive subgroups
- mobile nodes
- sparsely connected
- terrorist networks
- np hard
- average degree
- energy consumption
- heterogeneous social networks
- end to end
- fully connected
- directed graph
- neural network