Archival storage of sensor data is necessary for applications that query, mine, and analyze such data for interesting features and trends. We argue that existing storage systems are designed primarily for flat hierarc...
详细信息
We present a framework for modelling and simulating the distributed wireless sensor network. We modelled the object detection and tracking scenario using acoustic sensors and developed a simulator for simulating it. K...
详细信息
New fast moving markets demand flexible, adaptable production facilities to allow manufacturing companies a fast reaction on consumer needs. Reconfigurable manufacturing systems provide a solution for these problems. ...
详细信息
In this paper, we present a novel Internet-Scale Service directory based on the CHOrddistributed Hash Table data structure. Our directory allows the distributed maintenance of a semantic index of services and aim at ...
详细信息
We present in this paper an accurate and simple topology circuit dedicated to measure very small percentage of differential capacitance variations. The proposed circuit is based on a charge-based capacitance measureme...
详细信息
We consider configuration of wireless sensor networks, where certain functions must be automatically assigned to sensor nodes, such that the properties of a sensor node (e.g., remaining energy, network neighbors) matc...
详细信息
Content-based resource description is the key to find appropriate information sources that are most likely to contain the relevant documents for a given user query. However, semantic heterogeneity makes it difficult t...
详细信息
ISBN:
(纸本)0769523161
Content-based resource description is the key to find appropriate information sources that are most likely to contain the relevant documents for a given user query. However, semantic heterogeneity makes it difficult to acquire accurate and meaningful resource descriptions from distributed, heterogeneous information sources. To address this problem, we describe an ontology-based approach which uses domain-specific ontologies to extract content-related information from information sources, and to generate ontology-based resource descriptions. The preliminary experimental results demonstrate that our ontology-based approach could improve selection accuracy.
Two difficulties in designing data-centric routes [2,3,4,5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computational complexity resulting from the coupling of...
详细信息
ISBN:
(纸本)3540264221
Two difficulties in designing data-centric routes [2,3,4,5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computational complexity resulting from the coupling of routing and in-network data fusion. In this paper, we study combined routing and source coding with explicit side information in wireless sensor networks. Our data aggregation model is built upon the observation that in many physical situations the side information that provides the most coding gain comes from a small number of nearby sensors. Based on this model, we propose a routing strategy that separately routes the explicit side information to achieve data compression and cost minimization. The overall optimization problem is NP hard since it has the minimum Steiner tree as a subproblem. We propose a suboptimal algorithm based on maximum weight branching and the shortest path heuristic for the Steiner tree problem. The worst case and average performances of the algorithm are studied through analysis and simulation.
Services orchestration across enterprises, heterogeneous platforms and networking environments is increasingly becoming a competitive factor for many industrial application domains. The need for autonomic service orch...
详细信息
The graph structure of a Peer-to-Peer network defines the neighboring relations between Peer nodes. The nodes can issue queries only with the assistance of the graph edges. For that reason it is essential to find the ...
详细信息
ISBN:
(纸本)0780391225
The graph structure of a Peer-to-Peer network defines the neighboring relations between Peer nodes. The nodes can issue queries only with the assistance of the graph edges. For that reason it is essential to find the most valuable edges, that is, the edges that provide the most answers for the queries of a given node. However, the basic Peer-to-Peer protocols construct this graph on a random manner and they do not take the content of the stored or searched documents into account. Our solution improves the performance of a peer-to-peer network by constructing semantic profiles based on document metadata followed by a comparison of the semantic similarities on generalized topics, where these topic generalizations are made with an adaptive algorithm that utilize a well-tried full-language taxonomy. We expect that as time goes on our protocol, the SemPeer, transforms the graph so that neighboring nodes can answer each others queries with greater probability than with the previous graph structures.
暂无评论