Sciweavers

1204 search results - page 1 / 241
» Optimal Routing in a Small-World Network
Sort
View
ISPA
2005
Springer
13 years 9 months ago
Near Optimal Routing in a Small-World Network with Augmented Local Awareness
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
PDCAT
2005
Springer
13 years 9 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
IPTPS
2004
Springer
13 years 9 months ago
Know Thy Neighbor's Neighbor: Better Routing for Skip-Graphs and Small Worlds
We investigate an approach for routing in p2p networks called neighbor-of-neighbor greedy. We show that this approach may reduce significantly the number of hops used, when routi...
Moni Naor, Udi Wieder
ESA
2007
Springer
92views Algorithms» more  ESA 2007»
13 years 10 months ago
Small Worlds as Navigable Augmented Networks: Model, Analysis, and Validation
Abstract. The small world phenomenon, a.k.a. the six degree of separation between individuals, was identified by Stanley Milgram at the end of the 60s. Milgram experiment demonstr...
Pierre Fraigniaud
GLOBECOM
2006
IEEE
13 years 10 months ago
Position-based Routing using Virtual Small World in MANETs
— Routing is the foremost issue in mobile ad hoc networks (MANETs), In a wireless environment characterized by small bandwidth and limited computation resources, positionbased ro...
Cong Liu, Jie Wu