Computer Science – Information Theory
Scientific paper
2008-04-26
Computer Science
Information Theory
Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada, July 6 - 11, 2008
Scientific paper
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 small-world 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 short-range 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.
Chiang Mung
Inaltekin Hazer
Poor Harold Vincent
No associations
LandOfFree
Expected Message Delivery Time for Small-world Networks in the Continuum Limit does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Expected Message Delivery Time for Small-world Networks in the Continuum Limit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Expected Message Delivery Time for Small-world Networks in the Continuum Limit will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-114277