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 according to the d-harmonic distribution. Kleinberg shows that the greedy routing algorithm by using only local information performs in O(lg2 n) expected number of hops, where n denotes the number of nodes in the network. Martel and Nguyen [17] have found that the expected diameter of Kleinberg’s small-world networks is Θ(lg n). Thus a question arises naturally: Can we improve the routing algorithms to match the diameter of the networks while keeping the amount of information stored on each node as small as possible? Existing approaches for improving the routing performance in the small-world networks include: (1) Increasing the number of long-range links [2, 15]; (2) Exploring more nodes before making routing decisions [14]; (3) Increasing the local awareness for each node [10, 17]. However, all these ap...

• Type: Conference
• Year: 2005
• Where: ISPA
• Authors: Jianyang Zeng, Wen-Jing Hsu, Jiangdian Wang
• Keywords: ISPA 2005, Kleinberg’s Small-world Networks, Routing, Small-world Networks