Abstract
In sensor networks, there are lots of overlapped multicast groups because of many subscribers, associated with their potentially varying specific interests, querying every event to sensors/publishers. And gossip based communication protocols are promising as one of potential solutions providing scalability in P(Publish)/ S(Subscribe) paradigm in sensor networks. Moreover, despite the importance of both guaranteeing message delivery order and supporting overlapped multicast groups in sensor or P2P networks, there exist little research works on development of gossip-based protocols to satisfy all these requirements. In this paper, we present two versions of causally ordered delivery guaranteeing protocols for overlapped multicast groups. The one is based on sensor-broker as delegates and the other is based on local views and delegates representing subscriber subgroups. In the sensor-broker based protocol, sensor-broker might lead to make overlapped multicast networks organized by subscriber’s interests. The message delivery order has been guaranteed consistently and all multicast messages are delivered to overlapped subscribers using gossip based protocols by sensor-broker. Therefore, these features of the sensor-broker based protocol might be significantly scalable rather than those of the protocols by hierarchical membership list of dedicated groups like traditional committee protocols. And the subscriber-delegate based protocol is much stronger rather than fully decentralized protocols guaranteeing causally ordered delivery based on only local views because the message delivery order has been guaranteed consistently by all corresponding members of the groups including delegates. Therefore, this feature of the subscriber-delegate protocol is a hybrid approach improving the inherent scalability of multicast nature by gossip-based technique in all communications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Birman, K., Schiper, A., Stephenson, P.: Lightweight Causal and Atomic Group Multicast. ACM Trans. Comput. Syst. 9(3), 272–314 (1991)
Birman, K., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal Multicast. ACM Trans. Comput. Syst. 17(2), 41–88 (1999)
Eugster, P., Guerraoui, R.: Probabilistic Multicast. In: the 2002 International Conference on Dependable Systems and Networks (DSN 2002), pp. 313–324. IEEE Computer Society Press, Vienna (2002)
Eugster, P., Guerraoui, R., Handurukande, S., Kouznetsov, P., Kermarrec, A.-M.: Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. 21(4), 341–374 (2003)
Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: A scalable and robust communication paradigm for sensor networks. In: The Sixth Annual International Conference on Mobile Computing and Networking (MobiCOM 2000), pp. 56–67. ACM SIGMOBILE, Boston (2000)
Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., Steen, M.: Gossip-based Peer Sampling. ACM Trans. Comput. Syst. 25(3), 1–36 (2007)
Pleisch, S., Birman, K.: SENSTRAC:Scalable Querying of SENSor Networks from Mobile Platforms Using TRACking-Style Queries. Int. J. of Sensor Networks 3, 266–280 (2008)
Peterson, L., Buchholzand, N., Schlichting, R.: Preserving and using context information interprocess communication. ACM Trans. Comput. Syst. 7(3), 217–246 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, C., Ahn, J. (2010). Scalable Multicast Protocols for Overlapped Groups in Broker-Based Sensor Networks. In: Kim, Th., Stoica, A., Chang, RS. (eds) Security-Enriched Urban Computing and Smart Grid. SUComS 2010. Communications in Computer and Information Science, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16444-6_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-16444-6_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16443-9
Online ISBN: 978-3-642-16444-6
eBook Packages: Computer ScienceComputer Science (R0)