The Community for Technology Leaders
RSS Icon
Issue No.04 - April (2009 vol.8)
pp: 544-557
Andronikos Nedos , Trinity College Dublin, Dubin
Kulpreet Singh , Trinity College Dublin, Dublin
Raymond Cunningham , Trinity College Dublin, Dublin
Siobhán Clarke , Trinity College Dublin, Dublin
Mobile ad hoc networks rely on the opportunistic interaction of autonomous nodes to form networks without the use of infrastructure. Given the radically decentralized nature of such networks, their potential for autonomous communication is significantly improved when the need for a priori consensus among the nodes is kept to a minimum. This paper addresses an issue within the domain of semantic content discovery, namely, its current reliance on the preexisting agreement between the schema of content providers and consumers. We present OntoMobil, a semantic discovery model for ad hoc networks that removes the assumption of a globally known schema and allows nodes to publish information autonomously. The model relies on the randomized dissemination and replication of metadata through a gossip protocol. Given schemas with partial similarities, the randomized metadata dissemination mechanism facilitates eventual semantic agreement and provides a substrate for the scalable discovery of content. A discovery protocol can then utilize the replicated metadata to identify content within a predictable number of hops using semantic queries. A stochastic analysis of the gossip protocol presents the different trade-offs between discoverability and replication. We evaluate the proposed model by comparing OntoMobil against a broadcast-based protocol and demonstrate that semantic discovery with proactive replication provides good scalability properties, resulting in a high discovery ratio with less overhead than a reactive nonreplicated discovery approach.
Mobile ad hoc networks, distributed discovery, probabilistic algorithms, gossip protocols, semantic services.
Andronikos Nedos, Kulpreet Singh, Raymond Cunningham, Siobhán Clarke, "Probabilistic Discovery of Semantically Diverse Content in MANETs", IEEE Transactions on Mobile Computing, vol.8, no. 4, pp. 544-557, April 2009, doi:10.1109/TMC.2008.133
[1] D. Martin, M. Burstein, J. Hobbs, O. Lassila, D. McDermott, S. McIlraith, S. Narayanan, M. Paolucci, B. Parsia, T. Payne, E. Sirin, N. Srinivasan, and K. Sycara, OWL-S: Semantic Markup for Web Services, W3C,, Nov. 2004.
[2] K. Aberer, P. Cudré-Mauroux, A.M. Ouksel, T. Catarci, M.-S. Hacid, A. Illarramendi, V. Kashyap, M. Mecella, E. Mena, E.J. Neuhold, O. De Troyer, T. Risse, M. Scannapieco, F. Saltor, L. De Santis, S. Spaccapietra, S. Staab, and R. Studer, “Emergent Semantics Principles and Issues,” Proc. Ninth Int'l Conf. Database Systems for Advanced Applications (DASFAA '04), pp. 25-38, 2004.
[3] K. Aberer, P. Cudré-Mauroux, and M. Hauswirth, “The Chatty Web: Emergent Semantics through Gossiping,” Proc. 12th Int'l Conf. World Wide Web (WWW '03), pp. 197-206, 2003.
[4] A. Doan, J. Madhavan, P. Domingos, and A. Halevy, “Learning to Map between Ontologies on the Semantic Web,” Proc. 11th Int'l Conf. World Wide Web (WWW '02), pp. 662-673, 2002.
[5] S. Castano, A. Ferrara, and S. Montanelli, “H-MATCH: An Algorithm for Dynamically Matching Ontologies in Peer-Based Systems,” Proc. First Int'l Workshop Semantic Web and Databases (SWDB '03), pp. 231-250, 2003.
[6] K. Sycara, S. Widoff, M. Klusch, and J. Lu, “LARKS: Dynamic Matchmaking among Heterogeneous Software Agents in Cyberspace,” Autonomous Agents and Multi-Agent Systems, vol. 5, no. 2, pp. 173-203, June 2002.
[7] K. Arnold, R. Scheifler, J. Waldo, B. O'Sullivan, and A. Wollrath, Jini Specification. Addison Wesley Longman, 1999.
[8] E. Guttman, C. Perkins, J. Veizades, and M. Day, Service Location Protocol, Version 2. IETF, 1999.
[9] U.C. Kozat and L. Tassiulas, “Service Discovery in Mobile Ad Hoc Networks: An Overall Perspective on Architectural Choices and Network Layer Support Issues,” Ad Hoc Networks, vol. 2, no. 1, pp.23-44, 2004.
[10] F. Sailhan and V. Issarny, “Scalable Service Discovery for MANET,” Proc. Third IEEE Int'l Conf. Pervasive Computing and Comm. (PerCom '05), pp. 235-244, 2005.
[11] V. Lenders, M. May, and B. Plattner, “Service Discovery in Mobile Ad Hoc Networks: A Field Theoretic Approach,” Proc. Int'l Symp. World of Wireless, Mobile and Multimedia Networks (WoWMoM '05), June 2005.
[12] W. Nejdl, B. Wolf, C. Qu, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmér, and T. Risch, “EDUTELLA: A P2P Networking Infrastructure Based on RDF,” Proc. 11th Int'l Conf. World Wide Web (WWW '02), pp. 604-615, 2002.
[13] P. Haase, R. Siebes, and F. van Harmelen, “Peer Selection in Peer-to-Peer Networks with Semantic Topologies,” Proc. First Int'l Conf. Semantics in a Networked World (ICNSW' 04), M. Bouzeghoub, ed., pp. 108-125, June 2004.
[14] A. Loser, S. Staab, and C. Tempich, “Semantic Social Overlay Networks,” IEEE J. Selected Areas in Comm., vol. 25, no. 1, pp. 5-14, 2007.
[15] B.F. Cooper and H. Garcia-Molina, “SIL: A Model for Analyzing Scalable Peer-to-Peer Search Networks,” Computer Networks, vol. 50, no. 13, pp. 2380-2400, 2006.
[16] F. Cuenca-Acuna, C. Peery, R. Martin, and T. Nguyen, “PlanetP: Using Gossiping to Build Content Addressable Peer-to-Peer Information Sharing Communities,” Proc. 12th IEEE Int'l Symp. High Performance Distributed Computing, pp. 236-246, 2003.
[17] D. Chakraborty, A. Joshi, T. Finin, and Y. Yesha, “GSD: A Novel Group Based Service Discovery Protocol for MANETs,” Proc. Fourth IEEE Conf. Mobile and Wireless Comm. Networks (MWCN'02), Sept. 2002.
[18] P.T. Eugster, R. Guerraoui, S.B. Handurukande, P. Kouznetsov, and A.M. Kermarrec, “Lightweight Probabilistic Broadcast,” ACM Trans. Computer Systems, vol. 21, no. 4, pp. 341-374, 2003.
[19] J. Luo, P.Th. Eugster, and J.-P. Hubaux, “PILOT: ProbabilistIc Lightweight grOup communication sysTem for Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 3, no. 2, pp.164-179, 2004.
[20] A.J. Ganesh, A.-M. Kermarrec, and L. Massoulie, “SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication,” Proc. Third Int'l Workshop Networked Group Comm. (NGC '01), Nov. 2001.
[21] A. Nedos, K. Singh, R. Cunningham, and S. Clarke, “A Gossip Protocol to Support Service Discovery with Heterogeneous Ontologies in MANETs,” Proc. Third IEEE Int'l Conf. Wireless and Mobile Computing, Networking and Comm. (WiMob '07), Oct. 2007.
[22] A. Nedos, K. Singh, and S. Clarke, “Mobile Ad Hoc Services: Semantic Service Discovery in Mobile Ad Hoc Networks,” Proc. Fourth Int'l Conf. Service-Oriented Computing (ICSOC '06), A. Dan and W. Lamersdorf, eds., pp. 90-103, reports.07TCD-CS-2007-21.pdf, 2006.
[23] R.D. Yates and D.J. Goodman, Probability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers. John Wiley & Sons, 1999.
[24] T. Kunz, “Multicasting in Mobile Ad-Hoc Networks: Achieving High Packet Delivery Ratios,” Proc. Conf. Centre for Advanced Studies on Collaborative Research (CASCON '03), pp. 156-170, 2003.
[25] S. McCanne and S. Floyd, ns, Network Simulator, 1997.
[26] S. PalChaudhuri, J.-Y.L. Boudec, and M. Vojnovic, “Perfect Simulations for Random Trip Mobility Models,” Proc. 38th Ann. Symp. Simulation (ANSS '05), pp. 72-79, 2005.
[27] Y.-C. Tseng, S.-Y. Ni, Y.-S. Chen, and J.-P. Sheu, “The Broadcast Storm Problem in a Mobile Ad Hoc Network,” Wireless Networks, vol. 8, nos. 2/3, pp. 153-167, 2002.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool