Abstract | ||
---|---|---|
This paper evaluates the performance of a context discovery protocol using attenuated Bloom filters while nodes appear, disappear, and are temporary unreachable in ad-hoc networks through analytical analysis. Further we verified obtained results with Simulation analysis. The analytical results are most accurate when node density is high. Further, we discover that adding a node generates less traffic than removing a node in our protocol. Some proposals are given to reduce the traffic generated by propagating Updates due to removing a node. |
Year | DOI | Venue |
---|---|---|
2008 | 10.1007/978-0-387-84839-6_32 | WIRELESS AND MOBILE NETWORKING |
Keywords | Field | DocType |
ad hoc network,bloom filter | Bloom filter,Computer science,Packet loss,Computer network,Hash function,Wireless ad hoc network,Distributed computing | Conference |
Volume | ISSN | Citations |
284 | 1571-5736 | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Fei Liu | 1 | 0 | 0.34 |
Geert J. Heijenk | 2 | 547 | 29.33 |