Abstract
This article presents an efficient ad hoc multicast communication protocol for next-generation cyber-physical systems and computational materials. Communication with such systems would be gestural, and when cells within such materials detect a motion, they would share that information with each other. We want to achieve efficient communication among only the group of nodes that sense a particular (gestural) event. Our approach is to employ a Bloom filter-based approach to label the multicast group with an approximate error-resilient multicast tag that captures the temporal and spatial characteristics of the sensor group. A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set. We describe our Bloom filter-based multicast communication (BMC) protocol, and report simulation results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kim, K.D., Kumar, P.R.: Cyber–Physical Systems: A Perspective at the Centennial. Proceedings of the IEEE 100, 1287–1308 (2012)
Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 422–426 (1970)
Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and Practice of Bloom Filters for Distributed Systems. IEEE Communications Surveys & Tutorials 14(1) (2012)
Broder, A., Mitzenmacher, M.: Network applications of bloom filter: a survey. Internet Mathematics 1(4), 485–509 (2003)
Särelä, M., Esteve Rothenberg, C., Zahemszky, A., Nikander, P., Ott, J.: BloomCasting: Security in Bloom Filter Based Multicast. In: Aura, T., Järvinen, K., Nyberg, K. (eds.) NordSec 2010. LNCS, vol. 7127, pp. 1–16. Springer, Heidelberg (2012)
Deng, F., Rafiei, D.: Approximately detecting duplicates for streaming data using stable Bloom filters. In: SIGMOD 2006: Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, pp. 25–36. ACM, New York (2006)
Whitaker, A., Wetherall, D.: Forwarding without Loops in Icarus. In: Proceedings of Open Architectures and Network Programming (OPENARCH), pp. 63–75 (2002)
Dong, Y., Wing Chim, T., Li, V.O.K., Yiu, S.M., Hui, C.K.: ARMR: Anonymous routing protocol with multiple routes for communications in mobile ad hoc networks. Ad Hoc Network, 1536–1550 (2006)
Li, D., Cui, H., Huy, Y.: Xia, Y., Wang, X.: Scalable data center multicast using multi-class Bloom Filter. In: 19th IEEE International Conference on Network Protocols (ICNP), pp. 266 – 275 (2011)
Särelä, M., Rothenberg, C.E., Aura, T., Zahemszky, A., Nikander, P., Ott, J.: Forwarding Anomalies in Bloom Filter Based Multicast. Technical report, Aalto University (2010)
Grönvall, B.: Scalable multicast forwarding. SIGCOMM Comput. Commun. Rev. 32(1), 68–68 (2002)
Castelluccia, C., Mutaf, P.: Hash-Based Dynamic Source Routing. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol. 3042, pp. 1012–1023. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hosseinmardi, H., Correll, N., Han, R. (2012). Bloom Filter-Based Ad Hoc Multicast Communication in Cyber-Physical Systems and Computational Materials. In: Wang, X., Zheng, R., Jing, T., Xing, K. (eds) Wireless Algorithms, Systems, and Applications. WASA 2012. Lecture Notes in Computer Science, vol 7405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31869-6_52
Download citation
DOI: https://doi.org/10.1007/978-3-642-31869-6_52
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31868-9
Online ISBN: 978-3-642-31869-6
eBook Packages: Computer ScienceComputer Science (R0)