| Bookmark: |
Full-text
| URL: http://arxiv.org/pdf/cs.MA/0604075 |
| Cached: PDF-366K |
| SAVE AS an easy-to-recall long filename: |
| Filename format: author--year--title PDF-366K |
| Filename format: author--year--title--journal|proceedings|...--pages PDF-366K |
Related links
| Source: http://arxiv.org/abs/cs.MA/0604075 |
| Web search: Google Web Search :: Google Scholar |
| Within this site: References (35) |
Abstract
We investigate a prototypical agent-based model, the Naming Game, on random geometric networks. The Naming Game is a minimal model, employing local communications that captures the emergence of shared communication schemes (languages) in a population of autonomous semiotic agents. Implementing the Naming Games on random geometric graphs, local communications being local broadcasts, serves as a model for agreement dynamics in large-scale, autonomously operating wireless sensor networks. Further, it captures essential features of the scaling properties of the agreement process for spatially-embedded autonomous agents. We also present results for the case when a small density of long-range communication links are added on top of the random geometric graph, resulting in a ''small-world''-like network and yielding a significantly reduced time to reach global agreement.BibTex
@inproceedings{lu06namingGames,
author={Qiming Lu and G. Korniss and Boleslaw K. Szymanski},
title={Naming Games in Spatially-Embedded Random Networks},
year={2006},
pages={148--155},
address={Menlo Park, CA},
publisher={AAAI Press},
booktitle={Proc. AAAI Fall Symposium Series, Interaction and Emergent Phenomena in Societies of Agents},
url={http://www.isrl.uiuc.edu/~amag/langev/paper/lu06namingGames.html}
}
| HOME :: Conference List :: Conference Paper | Comments to: junwang4 you-know-at gmail.com | Last update: 2/2/08 |