### Abstract

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.

Original language | English (US) |
---|---|

Title of host publication | Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 |

Pages | 667-671 |

Number of pages | 5 |

DOIs | |

State | Published - Sep 29 2008 |

Event | 2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada Duration: Jul 6 2008 → Jul 11 2008 |

### Publication series

Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|

ISSN (Print) | 2157-8101 |

### Other

Other | 2008 IEEE International Symposium on Information Theory, ISIT 2008 |
---|---|

Country | Canada |

City | Toronto, ON |

Period | 7/6/08 → 7/11/08 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Expected message delivery time for small-world networks in the continuum limit'. Together they form a unique fingerprint.

## Cite this

*Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008*(pp. 667-671). [4595070] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4595070