TY - GEN

T1 - Expected message delivery time for small-world networks in the continuum limit

AU - Inaltekin, Hazer

AU - Chiang, Mung

AU - Poor, H. Vincent

N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.

PY - 2008

Y1 - 2008

N2 - Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world networks abound in sociology, biology, neuroscience and physics as well as in human-made networks. This paper analyzes the average delivery time of messages in dense smallworld networks constructed on a plane. Iterative equations for the average message delivery time in these networks are provided for the situation in which nodes employ a simple greedy geographic routing algorithm. It is shown that two network nodes communicate with each other only through their shortrange contacts, and that the average message delivery time rises linearly if the separation between them is small. On the other hand, if their separation increases, the average message delivery time rapidly saturates to a constant value and stays almost the same for all large values of their separation.

AB - Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world networks abound in sociology, biology, neuroscience and physics as well as in human-made networks. This paper analyzes the average delivery time of messages in dense smallworld networks constructed on a plane. Iterative equations for the average message delivery time in these networks are provided for the situation in which nodes employ a simple greedy geographic routing algorithm. It is shown that two network nodes communicate with each other only through their shortrange contacts, and that the average message delivery time rises linearly if the separation between them is small. On the other hand, if their separation increases, the average message delivery time rapidly saturates to a constant value and stays almost the same for all large values of their separation.

UR - http://www.scopus.com/inward/record.url?scp=52349085868&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52349085868&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4595070

DO - 10.1109/ISIT.2008.4595070

M3 - Conference contribution

AN - SCOPUS:52349085868

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 667

EP - 671

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -