Opportunistic Content-Based Dissemination in Disconnected Mobile Ad Hoc Networks

Content-based networking fosters a new kind of communication in which information flows towards interested hosts rather than towards specifically set destinations. Supporting this kind of communication in mobile ad hoc networks is still a challenge, though, especially in partially or intermittently connected networks. This paper addresses this problem by combining the concept of content-based communication with that of opportunistic networking. The protocol it describes exploits transient contacts between mobile hosts that exchange messages according to their respective interest profiles. A message thus disseminates in the network by being stored, carried, and forwarded by those hosts that show some interest for this message. Experimental results as well as simulations confirm that this approach makes it possible to disseminate information efficiently, while minimising the resources implied in this dissemination.

[1]  Chai-Keong Toh.  Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks , 2001 .

[2]  Luiz A. DaSilva,et al.  A service-centric model for wireless sensor networks , 2005, IEEE Journal on Selected Areas in Communications.

[3]  Francesco M. Donini,et al.  Semantic-enhanced Bluetooth discovery protocol for m-commerce applications , 2006, Int. J. Web Grid Serv..

[4]  Alexander L. Wolf,et al.  A routing scheme for content-based networking , 2004, IEEE INFOCOM 2004.

[5]  Nicholas Nethercote,et al.  Valgrind: a framework for heavyweight dynamic binary instrumentation , 2007, PLDI '07.

[6]  Paolo Costa,et al.  Semi-Probabilistic Content-Based Publish-Subscribe , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[7]  Zhensheng Zhang,et al.  Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges , 2006, IEEE Communications Surveys & Tutorials.

[8]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.

[9]  Ian H. Witten,et al.  Data Compression Using Adaptive Coding and Partial String Matching , 1984, IEEE Trans. Commun..

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

[11]  Amir Averbuch,et al.  XML syntax conscious compression , 2006, Data Compression Conference (DCC'06).

[12]  Marco Conti,et al.  Opportunistic networking: data forwarding in disconnected mobile ad hoc networks , 2006, IEEE Communications Magazine.

[13]  Alexander L. Wolf,et al.  Content-Based Networking: A New Communication Infrastructure , 2001, Infrastructure for Mobile and Wireless Systems.

[14]  Lu Yan,et al.  On-demand mobile peer-to-peer Streaming over the JXTA Overlay , 2007, International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies (UBICOMM'07).

[15]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[16]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[17]  Hans-Arno Jacobsen,et al.  Content-based routing in mobile ad hoc networks , 2005, The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services.

[18]  Roberto Beraldi,et al.  Content-based routing in highly dynamic mobile ad hoc networks , 2005, Int. J. Pervasive Comput. Commun..

[19]  Dan Suciu,et al.  XMill: an efficient compressor for XML data , 2000, SIGMOD 2000.

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