Greedy routing in small-world networks with power-law degrees.
Pierre FraigniaudGeorge GiakkoupisPublished in: Distributed Comput. (2014)
Keyphrases
- small world networks
- power law
- small world
- scale free
- clustering coefficient
- network topology
- average degree
- scale free networks
- search algorithm
- path length
- degree distribution
- routing protocol
- power law distribution
- ad hoc networks
- random graphs
- network topologies
- shortest path
- social networks
- numerical simulations
- wireless sensor networks