A Gossip Protocol to Support Service Discovery with Heterogeneous Ontologies in MANETs

Nedos,; Singh, Varsha; Cunningham,; Clarke, Siobhán

doi:10.1109/wimob.2007.4390847

Cited by 4 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…On receipt of a join request from P2: Continuous Dissemination a. Forward G-SDP [52], G-FDS [24], RDG [14], GSGC [53], NEEM [54], [55], Gravitational Gossip [56], Hierarchical Gossip [27], lpcast [30], Probabilistic Multicast (multicast) [21] b. Polling Anonymous Gossip [57], RDG [14], Probabilistic Multicast (membership) [21] c. Pairwise node i, a SCAMP node n forwards the request to all the nodes in its view. On receipt of a forwarded request, a node j adds node i to its view with probability p, and otherwise forwards i's join request to a random node in its view.…”

Section: Pattern P1: Punctual Disseminationmentioning

confidence: 99%

“…The protocol also contains an optimisation to take into account the underlying topology of the network, by weighting the selection of nodes according to the subnet they belong to. G-SDP [52] . As the vector R p propagates, it gets merged with that of other nodes using a minimum operator, and keeping track of which nodes have contributed to it.…”

Section: Appendix Description Of the Protocols Analysedmentioning

confidence: 99%

See 1 more Smart Citation

GossipKit: A Unified ComponentFramework for Gossip

Taı̈ani

Lin²,

Blair³

2014

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

show abstract

Section: Pattern P1: Punctual Disseminationmentioning

confidence: 99%

Section: Appendix Description Of the Protocols Analysedmentioning

confidence: 99%

GossipKit: A Unified ComponentFramework for Gossip

Taı̈ani

Lin²,

Blair³

2014

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…It has been modified to a distinct protocol, described in more detail in [21], to fit the discovery model of OntoMobil by altering the transmit and receive operations, adding the concept fanout parameter and optimising the OntoMobil gossip for a proactive routing protocol. In particular, what distinguishes the two main gossip operations of transmission and reception from [19] is their operation on a finite set of concepts rather than on application generated messages; the transmission of a randomised selection from the union of the concept and ontology views rather than the transmission of buffered messages until such buffer is empty; and ultimately the provision of randomised replication rather than randomised transmission.…”

Section: Gossip Protocolmentioning

confidence: 99%

“…end if 15: end for 16: //Node view maintenance 17: if GossipM essage.src / ∈ V N j then 18: if |V N j | = Parameter NodeView then 19: Prune V N j by removing a random node id 20: end if 21:…”

mentioning

confidence: 99%

Probabilistic Discovery of Semantically Diverse Content in MANETs

Nedos

Singh

Cunningham

et al. 2009

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-Mobile ad hoc networks rely on the opportunistic interaction of autonomous nodes to form networks without the use of infrastructure. Given the radically decentralised nature of such networks, their potential for autonomous communication is significantly improved when the need for a priori consensus amongst 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 randomised dissemination and replication of metadata through a gossip protocol. Given schemas with partial similarities, the randomised metadata dissemination mechanism facilitates eventual semantic agreement and provides a substrate for the scalable discovery of content. A discovery protocol can then utilise 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 non-replicated discovery approach.

show abstract

“…There are several ways to lower semantic heterogeneity as for example facilitating the emergence of an ontology shared by peers [21] [17], or making peers learn or guess more correspondences between ontology entities as in [1] [9][17] [6]. A good knowledge of correspondences by the peers is obviously necessary.…”

Section: Introductionmentioning

confidence: 99%

An approach to manage semantic heterogeneity in unstructured P2P information retrieval systems

Cerqueus

Cazalens

Lamarre

2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

In unstructured information retrieval P2P systems, semantic heterogeneity comes from the use of different ontologies. Semantic interoperability refers to the ability of peers to communicate with each others. We take into account these notions separately, as raising two different problems. Hence we propose two independent and complementary solutions. The GoOD-TA protocol aims at reducing heterogeneity through ontology-driven topology adaptation. DiQuESh is a top-k algorithm for distributed information retrieval that is intended to ensure interoperability. This distinction enables highlighting their respective benefits on the IR performances and leads to a modular architecture. For our experiments we obtained a set of actively used real-world ontologies through the NCBO BioPortal. We implemented GoOD-TA and DiQuESH in Java and used the PeerSim simulator. We first show that GoOD-TA nicely reduces the semantic heterogeneity related to the system topology, handles the evolution of peers' descriptors, and is suitable for dynamic systems. Then, GoOD-TA and DiQuESh are run simultaneously, with a significant increase of precision and recall. This enables to identify the indirect contribution of heterogeneity reduction obtained with GoOD-TA to improving interoperability.

show abstract

A Gossip Protocol to Support Service Discovery with Heterogeneous Ontologies in MANETs

Abstract: Service discovery is vital in enabling interoperability

Cited by 4 publications

References 19 publications

GossipKit: A Unified ComponentFramework for Gossip

GossipKit: A Unified ComponentFramework for Gossip

Probabilistic Discovery of Semantically Diverse Content in MANETs

An approach to manage semantic heterogeneity in unstructured P2P information retrieval systems

Contact Info

Product

Resources

About