TY - GEN
T1 - A bloom filter-based algorithm for routing in intermittently connected mobile networks
AU - Sanchez-Hernandez, Jairo
AU - Garcia-Diaz, Jesus
AU - Menchaca-Mendez, Rolando
AU - Rivero-Angeles, Mario E.
AU - Menchaca-Mendez, Ricardo
AU - Garcia-Luna-Aceves, J. J.
N1 - Publisher Copyright:
© 2015 ACM.
PY - 2015/11/2
Y1 - 2015/11/2
N2 - In this paper, we present a new protocol for routing in intermittently connected mobile networks that, by periodically exchanging constant-size Counting Bloom filters, assigns to every node in the network probabilities of reaching any destination. The gradients defined by these probabilities are further used to forward data packets towards any node in the network. The proposed protocol is based on two novel operations defined over the Bloom filters, namely, the unary degradation operation that models the loss of topological information as it gets stale or as it is propagated away from the place where it was generated; and the binary addition operation that is used to acquire topological information from other nodes. These two operations are used to implement a probabilistic form of soft state that is defined in terms of the content of the Counting Bloom filters. We present a series of experimental results based on extensive detailed simulations that show that the proposed protocol outperforms the Epidemic routing protocol by delivering more data packets with less delay, while inducing less total overhead in both MANET and VANET scenarios.
AB - In this paper, we present a new protocol for routing in intermittently connected mobile networks that, by periodically exchanging constant-size Counting Bloom filters, assigns to every node in the network probabilities of reaching any destination. The gradients defined by these probabilities are further used to forward data packets towards any node in the network. The proposed protocol is based on two novel operations defined over the Bloom filters, namely, the unary degradation operation that models the loss of topological information as it gets stale or as it is propagated away from the place where it was generated; and the binary addition operation that is used to acquire topological information from other nodes. These two operations are used to implement a probabilistic form of soft state that is defined in terms of the content of the Counting Bloom filters. We present a series of experimental results based on extensive detailed simulations that show that the proposed protocol outperforms the Epidemic routing protocol by delivering more data packets with less delay, while inducing less total overhead in both MANET and VANET scenarios.
KW - Bloom filters
KW - Delay tolerant network
KW - MANET
KW - Routing
KW - VANET
UR - http://www.scopus.com/inward/record.url?scp=84949498139&partnerID=8YFLogxK
U2 - 10.1145/2811587.2811609
DO - 10.1145/2811587.2811609
M3 - Contribución a la conferencia
AN - SCOPUS:84949498139
T3 - MSWiM 2015 - Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems
SP - 319
EP - 326
BT - MSWiM 2015 - Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems
PB - Association for Computing Machinery, Inc
T2 - 18th ACM International Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems, MSWiM 2015
Y2 - 2 November 2015 through 6 November 2015
ER -