Demand-driven publish/subscribe in mobile environments

We propose a novel routing protocol, Self-Balancing Supply/Demand (SBSD), for Publish/Subscribe in mobile ad hoc environments. SBSD is a controlled flooding that reduces network congestion by constraining how far subscriptions replicate and how many times nodes broadcast them. SBSD ranks subscriptions by a utility function. This function matches the supply of publications with the recent demand for them; more popular subscriptions are replicated farther and their replicas are retained longer. SBSD is therefore demand-driven, as more popular subscriptions are more likely to receive their matching publications and receive them sooner. We show that SBSD is scalable; routing distance is independent of network size. SBSD’s performance is examined under random mobility, under challenging conditions including high node mobility and broadcast failure rates.

[1]  Nitin H. Vaidya,et al.  Location‐Aided Routing (LAR) in mobile ad hoc networks , 2000, Wirel. Networks.

[2]  Felix C. Freiling,et al.  Supporting Mobility in Content-Based Publish/Subscribe Middleware , 2003, Middleware.

[3]  David S. Rosenblum,et al.  Achieving scalability and expressiveness in an Internet-scale event notification service , 2000, PODC '00.

[4]  Jeffrey O. Kephart,et al.  Directed-graph epidemiological models of computer viruses , 1991, Proceedings. 1991 IEEE Computer Society Symposium on Research in Security and Privacy.

[5]  Chenyang Lu,et al.  Design and Analysis of Spatiotemporal Multicast Protocols for Wireless Sensor Networks , 2004, Telecommun. Syst..

[6]  Ling Liu,et al.  A SpatioTemporal Placement Model for Caching Location Dependent Queries , 2007, 2007 Fourth Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services (MobiQuitous).

[7]  Anne-Marie Kermarrec,et al.  The many faces of publish/subscribe , 2003, CSUR.

[8]  Srinivasan Keshav,et al.  Gossip‐based search selection in hybrid peer‐to‐peer networks , 2008, IPTPS.

[9]  Hans-Arno Jacobsen,et al.  Using publish/subscribe middleware for mobile systems , 2002, MOCO.

[10]  Louise E. Moser,et al.  An analysis of the optimum node density for ad hoc mobile networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[11]  Panagiotis Papadimitratos,et al.  Secure Routing for Mobile Ad Hoc Networks , 2002 .

[12]  Patrick Th. Eugster,et al.  Route driven gossip: probabilistic reliable multicast in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[13]  N. Asokan,et al.  Securing ad hoc routing protocols , 2002, WiSE '02.

[14]  Jérôme Haerri,et al.  On meaningful parameters for routing in VANETs urban environments under realistic mobility patterns , 2006 .

[15]  Karsten Schwan,et al.  Opportunistic Overlays: Efficient Content Delivery in Mobile Ad Hoc Networks , 2005, Middleware.

[16]  Yanlei Diao,et al.  Towards an Internet-Scale XML Dissemination Service , 2004, VLDB.

[17]  Vikram Srinivasan,et al.  PeopleNet: engineering a wireless virtual social network , 2005, MobiCom '05.

[18]  Herbert W. Hethcote,et al.  The Mathematics of Infectious Diseases , 2000, SIAM Rev..

[19]  Paul J.M. Havinga,et al.  R-TDMA: A Dynamic Multiple Access Protocol Using Bandwidth on Demand and Priorities , 1997 .

[20]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[21]  Robbert van Renesse,et al.  JiST: an efficient approach to simulation using virtual machines , 2005, Softw. Pract. Exp..

[22]  Paolo Costa,et al.  Publish-subscribe on sensor networks: a semi-probabilistic approach , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[23]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[24]  Duc A. Tran,et al.  Congestion Adaptive Routing in Mobile Ad Hoc Networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[25]  Karl Aberer,et al.  Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks , 2004, ICSNW.

[26]  Vladimir Zadorozhny,et al.  Grid-Based Access Scheduling for Mobile Data Intensive Sensor Networks , 2008, The Ninth International Conference on Mobile Data Management (mdm 2008).

[27]  Anne-Marie Kermarrec,et al.  Epidemic information dissemination in distributed systems , 2004, Computer.

[28]  Roberto Beraldi,et al.  Structure-less content-based routing in mobile ad hoc networks , 2005, ICPS '05. Proceedings. International Conference on Pervasive Services, 2005..

[29]  Ming Zhong,et al.  Non-uniform random membership management in peer-to-peer networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[30]  L. Feeney.  A Taxonomy for Routing Protocols in Mobile Ad Hoc Networks , 1999 .

[31]  David S. Rosenblum,et al.  Design and evaluation of a wide-area event notification service , 2001, TOCS.

[32]  Timothy W. Finin,et al.  Toward Distributed service discovery in pervasive computing environments , 2006, IEEE Transactions on Mobile Computing.

[33]  Sasu Tarkoma,et al.  Distributed event routing in publish/subscribe communication systems , 2009 .

[34]  Michele Zorzi,et al.  A comparison of CDMA, TDMA and slotted Aloha multiple access schemes in cellular mobile radio systems , 1994, 5th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Wireless Networks - Catching the Mobile Future..

[35]  Aris M. Ouksel,et al.  An efficient demand-driven and density-controlled publish/subscribe protocol for mobile environments , 2007, DEBS '07.

[36]  Aris M. Ouksel,et al.  Dynamic Subscription Permission: Extending the Depth of Demand-Controlled Flooding , 2008, 2008 IEEE Asia-Pacific Services Computing Conference.

[37]  Karl Aberer,et al.  Efficient Probabilistic Subsumption Checking for Content-Based Publish/Subscribe Systems , 2006, Middleware.

[38]  Michel R. V. Chaudron,et al.  A dynamic upgrade mechanism based on publish/subscribe interaction , 2002, Proceedings 26th Annual International Computer Software and Applications.

[39]  Stanley B. Zdonik,et al.  A framework for scalable dissemination-based systems , 1997, OOPSLA '97.

[40]  Vinny Cahill,et al.  STEAM: event-based middleware for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems Workshops.

[41]  Jean-Pierre Hubaux,et al.  The quest for security in mobile ad hoc networks , 2001, MobiHoc '01.

[42]  Yan Luo,et al.  A Spatio-Temporal Approach to Selective Data Dissemination in Mobile Peer-to-Peer Networks , 2007, 2007 Third International Conference on Wireless and Mobile Communications (ICWMC'07).

[43]  Abdelhamid Mellouk,et al.  Optimizations and Performance Study of the Dynamic Source Routing Protocol , 2007, International Conference on Networking and Services (ICNS '07).

[44]  Patrick Th. Eugster,et al.  Probabilistic reliable multicast in ad hoc networks , 2004, Ad Hoc Networks.

[45]  Hector Garcia-Molina,et al.  Publish/Subscribe in a Mobile Environment , 2001, MobiDe '01.

[46]  Alexander L. Wolf,et al.  Design and Evaluation of a Support Service for Mobile, Wireless Publish/Subscribe Applications , 2003, IEEE Trans. Software Eng..

[47]  Thomas R. Gross,et al.  Scalability of routing methods in ad hoc networks , 2005, Perform. Evaluation.

[48]  Ian F. Akyildiz,et al.  A survey on wireless mesh networks , 2005, IEEE Communications Magazine.