Name
Abstract | ||
|---|---|---|
On demand routing protocols that exploit local caches have received a lot of attention lately in wireless ad-hoc networking. In this paper, we specifically address cache management, an issue that has been a main source of criticism for the applicability of such protocols. In particular, we tackle the problem of accessing the cache content efficiently. To this end, we propose summarizing the cache content so that we achieve efficient lookups. This not only saves both the restrictive resources of the wireless devices such as computational power and energy but also improves the overall protocol performance. We use Bloom filters as summaries. Our experimental results using the ns simulator show that both resource savings and performance improvements are attained when such filters are integrated within the DSR protocol which is one the most widely used instance of an on demand protocol. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/PIMRC.2005.1651679 | Personal, Indoor and Mobile Radio Communications, 2005. PIMRC 2005. IEEE 16th International Symposium |
Keywords | Field | DocType |
ad hoc networks,cache storage,filters,routing protocols,telecommunication network management,Bloom filters,DSR protocol,address cache management,cache content,cache lookups,ns simulator,on demand routing protocols,wireless ad-hoc networking,wireless ad-hoc routing | Bloom filter,Cache invalidation,Wireless,Cache,Computer science,Computer network,Real-time computing,Cache algorithms,Wireless ad hoc network,Distributed computing,Routing protocol,On Demand Routing | Conference |
Volume | ISBN | Citations |
3 | 9783800729098 | 9 |
PageRank | References | Authors |
0.58 | 9 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Evangelos Papapetrou | 1 | 54 | 7.26 |
| evaggelia pitoura | 2 | 1968 | 321.56 |
| Kostas Lillis | 3 | 9 | 0.58 |