Abstract
Large-scale wireless ad-hoc networks are formed automatically and allow nodes to communicate over greater distances. Every node acts as a router forming a complex network, which is simplified by the use of geodesic routing. However, a method to discover a node.s location is needed for geodesic routing. In this paper we propose two algorithms which could support location servers in ad-hoc networks and examine their performance.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 6th International Network Conference, INC 2006 |
| Editors | Paul S. Dowland, Steven M. Furnell |
| Publisher | University of Plymouth |
| Pages | 105-112 |
| Number of pages | 8 |
| ISBN (Electronic) | 1841021571, 9781841021577 |
| Publication status | Published - 11 Jul 2006 |
| Event | 6th International Network Conference - Plymouth, United Kingdom Duration: 11 Jul 2006 → 14 Jul 2006 |
Conference
| Conference | 6th International Network Conference |
|---|---|
| Abbreviated title | INC 2006 |
| Country/Territory | United Kingdom |
| City | Plymouth |
| Period | 11/07/06 → 14/07/06 |
Keywords
- Ad-hoc networks
- Atomic memory
- Geographically static data storage
- Location servers
- Quorum systems
Fingerprint
Dive into the research topics of 'Quorum-based geographically static data storage in Ad-hoc networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver