Context-Addressable Messaging Service with Ontology-Driven Addresses

Domaszewicz, J.; Koziuk, Michal; Schoeneich, Radosław Olgierd

doi:10.1007/978-3-540-88873-4_37

Cited by 4 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This was the subject of our previous work. 3,4,32 Our PCCM model is defined a priori. The more accurate model will result in the better performance.…”

Section: Discussionmentioning

confidence: 99%

“…Each address is constructed by combining of class, relations, and individuals. The rules of context-based address construction and resolving were presented in our previous works by Domaszewicz et al 3 and Koziuk et al 4 In our work, the routing is done by handling classes. The classes are equivalent of all elementary concepts, and these are structured in the predefined model.…”

Section: Introductionmentioning

confidence: 99%

“…Recently, many works, especially in sensor networks area, have been focused on descriptive-based methods of nodes addressing. 3,4 The idea of this addressing style is to describe dynamically addressees by expressing their properties in a descriptive way. It can characterize not only node attributes but also a whole environment.…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Routing for context-addressable messages using Predefined Concept Connection Map in delay tolerant network

Schoeneich

2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

This article presents methods of nodes discovery and message routing for a context-based addressing in Delay and Disruptive Tolerant Networks. The context-based addressing is the novel way of descriptive addressing that is based on ontology model. The context-based addressing enables description of each node by a set of concepts. The main idea of this article is to present the method of the addressees discovery that uses specialized graph composed of concepts. It is called Predefined Concept Connection Map. The Predefined Concept Connection Map describes physical communication abilities between context-based addressed nodes. In this article, ns-2 simulations are presented. They are based on specially designed simulation model which supports context-based address assigned for each Delay and Disruptive Tolerant Network node.

show abstract

“…This was the subject of our previous work. 3,4,32 Our PCCM model is defined a priori. The more accurate model will result in the better performance.…”

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Routing for context-addressable messages using Predefined Concept Connection Map in delay tolerant network

Schoeneich

2016

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

show abstract

“…Pub/Sub Model FlavourCast [7] Yes No context-based No Siena [8] Yes Yes filter-based Yes Semantic Internetworking [9] Yes Yes semantic-based No Kyra [10] Yes No filter-based Yes Concept Based [11] Yes Yes concept-based No Ontology based CAM [12] Yes Yes class-deterministic No incorporate a domain model in the form of an ontology and (b) we use ontology-driven, runtime defined classes as addresses.…”

Section: Related Work and Motivationmentioning

confidence: 99%

Distributed semantic algorithm for power constrained publish/subscribe routing

Ashraf

Goratti

Haapola

et al. 2010

2010 Sixth International Conference on Intelligent Sensors, Sensor Networks and Information Processing

View full text Add to dashboard Cite

In this paper, context awareness is exploited by defining semantic relations among sensor nodes. Data is routed in a multi-hop network after the establishment of semantic based communication links between sensors. Minimizing the energy consumption is a critical issue in resource constrained sensor networks. Context awareness introduces a new level of intelligence that can be exploited in order to improve the efficiency of communication networks. The semantic routing proposed here is achieved in a completely distributed fashion. Distributed routing has been found to be effective for achieving scalable information dissemination in publish/subscribe communication systems. In this paper a novel method is proposed for designing sensor network ontology and for routing information through the network by using a distributed minimum semantic spanning tree approach. The results demonstrate that it is possible to take advantage of semantics to reduce network load in terms of data dissemination.

show abstract