Bloom Filter-Based Ad Hoc Multicast Communication in Cyber-Physical Systems and Computational Materials
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.
Unable to display preview. Download preview PDF.
- 2.Bloom, B.H.: Space/time trade-offs in hash coding with allowable errors. Commun. ACM 422–426 (1970)Google Scholar
- 3.Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and Practice of Bloom Filters for Distributed Systems. IEEE Communications Surveys & Tutorials 14(1) (2012)Google Scholar
- 7.Whitaker, A., Wetherall, D.: Forwarding without Loops in Icarus. In: Proceedings of Open Architectures and Network Programming (OPENARCH), pp. 63–75 (2002)Google Scholar
- 8.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)Google Scholar
- 9.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)Google Scholar
- 10.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)Google Scholar