Name
Abstract | ||
|---|---|---|
This paper considers the keyword lookup problem, which is essential for enabling keyword-based information sharing applications, such as file sharing, in Mobile Ad hoc Networks (MANET). In keyword-based information sharing applications, a data item is described by an index pair (key; value). To publish the data item, the corresponding index pair is inserted into the network. A node looking for a data item can now query the network using keywords (key) to obtain the reference of the data item (value).While a number of data dissemination protocols have been proposed for MANETs, our problem is unique in that we focus on finding a decentralized keyword lookup solution by utilizing location information of participating nodes. Our solution embeds a virtual grid structure on the geographic area, and relies upon two foundations: a geographic hash function, and an underlying geographic routing protocol. An index pair is hashed to a virtual square grid using the geographic hash function. Insertion and lookup messages are routed by the geographic routing protocol. Using analytical and simulation-based evaluations, we show that the system is able to answer keyword lookup queries with high success rate, requires reasonable communication overhead, and handles network dynamics well under pragmatic assumptions. |
Year | Venue | Keywords |
|---|---|---|
2005 | ICWN '05: Proceedings of the 2005 International Conference on Wireless Networks | keyword lookup, mobile ad hoc networks, geographic hashing, geographic routing, location-based services |
Field | DocType | Citations |
Mobile ad hoc network,Computer science,Location-based service,Computer network,Geographic routing,Distributed computing | Conference | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tai T. Do | 1 | 320 | 18.00 |
| Kien A Hua | 2 | 2870 | 425.79 |
| Yao Hua Ho | 3 | 84 | 13.79 |