检索结果-内蒙古大学图书馆

作者： Noura Yahya Salim Al-Hoqani Loughborough University

学位级别：博士

In the past research, smart sensor devices have become mature enough for large, distributed networks of such sensors to start to be deployed. Such networks can include tens or hundreds of independent nodes that can perform their functions without human interactions such as recharging of batteries, the configuration of network routes and others. Each of the sensors in the wireless sensor network is considered as microsystem, which consists of memory, processor, transducers and low bandwidth as well as a low range radio transceiver. This study investigates an adaptive sampling strategy for WSS aimed at reducing the number of data samples by sensing data only when a significant change in these processes is detected. This detection strategy is based on an extension to Holt's Method and statistical model. To investigate this strategy, the water consumption in a household is used as a case study. A query distribution approach is proposed, which is presented in detail in chapter 5. Our developed wireless sensor query engine is programmed on Sensinode testbed cc2430. The implemented model used on the wireless sensor platform and the architecture of the model is presented in chapters six, seven, and eight. This thesis presents a contribution by designing the experimental simulation setup and by developing the required database interface GUI sensing system, which enables the end user to send the inquiries to the sensor's network whenever needed, the On-Demand query Sensing system ODQS is enhanced with a probabilistic model for the purpose of sensing only when the system is insufficient to answer the user queries. Moreover, a dynamic aggregation methodology is integrated so as to make the system more adaptive to query message costs. Dynamic on-demand approach for aggregated queries is implemented, based in a wireless sensor network by integrating the dynamic programming technique for the most optimal query decision, the optimality factor in our experiment is the query cost. In

关键词： Wireless Sensor networks in-network query processing Adaptive sampling Dynamic query Probabilistic query model query optimisation Tree-based Graph-based Dijkstra query On-demand query sensing query plan Sensinode cc2430 aggregated queries

来源：评论

学校读者我要写书评

暂无评论

Efficient information gathering from large wireless sensor networks

引用

COMPUTER COMMUNICATIONS 2018年 132卷 84-95页

作者： Merzoug, Mohammed Amine Boukerche, Azzedine Mostefaoui, Ahmed Univ Bejaia Fac Exact Sci Dept Comp Sci Bejaia 06000 Algeria Univ Burgundy Franche Comte FEMTO ST Inst DISC Dept F-90000 Belfort France Univ Ottawa PARADISE Res Lab Ottawa ON Canada

Considering large WSNs and comparing data aggregation approaches in terms of scalability, robustness, completeness, and time/energy effectiveness, recent research has asserted the superiority of serial structure-free approaches over serial structure-based ones, and over both parallel structure-free and parallel structure-based techniques. But, in spite of the fact that serial structure-free approaches excel in large and medium-scale networks, their underlying path-construction algorithms are not optimal and can be improved by reducing the involved communications and further shortening the visiting path. To respond to this need, this paper presents Geometric Serial Search (GSS);a new serial structure-free algorithm specifically designed to efficiently gather information from large wireless resource-constrained networks. In addition to its completeness (i.e., visiting all nodes), collision-free nature, high scalability, energy/time efficiency, and robustness against topology changes (failures in links/nodes, ... ), the main advantage distinguishing GSS is that it considerably reduces communications and always approaches the optimal number of hops. More precisely, in GSS, no control packets or complex data structures are required, instead, one packet-hops from node to node and explores the entire network. While gradually finding its way through the network, this packet interrogates nodes and collects their responses at the same time. The followed path is not established in advance, can stem from any node in the network, and requires only the one-hop neighborhood information of each traversed node to be gradually drawn. The obtained OMNeT++ simulation results presented in this paper demonstrate the efficiency of GSS and confirm all the previously cited claims.

关键词： Large-scale wireless sensor networks Efficient information gathering Serial data aggregation in-network query processing Sensor data fusion

来源：评论

学校读者我要写书评

暂无评论

A data-centric storage scheme for high storage utilization in wireless sensor networks

引用

CLUSTER COMPUTING-THE JOURNAL OF networkS SOFTWARE TOOLS AND APPLICATIONS 2015年第1期18卷 247-257页

作者： Park, Junho Seong, Dongook Kim, Hyunju Park, Kisoon Lee, Byoungyup Yoo, Jaesoo Agcy Def Dev Taejon 305600 South Korea Chungbuk Natl Univ Sch Informat & Commun Engn Cheongju 361763 Chungbuk South Korea Chungbuk Natl Univ Sch Comp & Commun Engn Cheongju 361763 Chungbuk South Korea BOAS Elect Inc Cheongju 361763 Chungbuk South Korea TestMidas Inc Elect & Telecommun Res Inst Taejon 305700 South Korea Pai Chai Univ Taejon 302735 South Korea

In wireless sensor networks, a data-centric storage (DCS) scheme is one of representative researches to store sensor readings and to process a query efficiently. The DCS scheme assigns distributed data regions to sensor nodes and stores sensor readings to the sensor node which is responsible for the data region to process the query efficiently. However, the existing DCS schemes have some drawbacks that the sensor nodes have the fixed ranges to store sensor readings. Because the ranges of the sensor readings change periodically in real world applications, the existing DCS schemes have problems that they use storage space unevenly in entire sensors and their network lifetimes are reduced. To overcome this problem, we propose a novel DCS scheme for high storage utilization in wireless sensor networks. The proposed scheme stores the sensed data equally in the entire sensor network to improve the storage utilization. To show the superiority of our proposed scheme, we compare it with the existing DCS schemes. Our experimental results show that our proposed scheme improves about 498 % storage utilization and about 377.7 % network lifetime over the existing schemes on average.

关键词： Wireless sensor networks Data-centric storage in-network query processing Context-aware Storage utilization

来源：评论

学校读者我要写书评

暂无评论

On query processing in wireless sensor networks using classes of quality of queries

引用

INFORMATION FUSION 2014年第1期15卷 44-55页

作者： Brayner, Angelo Coelho, Andre L. V. Marinho, Karina Holanda, Raimir Castro, Wagner Univ Fortaleza UNIFOR Grad Program Appl Informat Ceara Brazil

This paper introduces the concept of quality of queries (QoQs) towards a more adaptive query processing in wireless sensor networks (WSNs). This approach aims at the intelligent consumption of the limited resources (energy and memory) available in these networks while still delivering a reasonable level of data quality as expected by client applications. In a nutshell, the concept of QoQ stipulates that the results of different queries injected into the same WSN can be tailored according to different criteria, in particular the levels of query result accuracy and energy consumption. For this purpose, four classes of QoQ (CoQoQ) are specified having in mind distinct requirements in terms of these criteria. To allow the implementation of these classes in a real WSN setting, a new novelty-detection based algorithm, referred to as AdaQuali (which stands for "ADAptive QUALIty control for query processing in WSN"), is also proposed in a manner as to control the sensor node activities through the dynamic adjustment of their rates of data collection and transmission. In order to validate the novel approach, simulations with a prototype implemented in Sinalgo have been conducted over real temperature data. The results achieved evidence the suitability of the proposal and point to gains of up to 66.76%, for different CoQoQ in terms of reduction in energy consumption. (C) 2012 Elsevier B.V. All rights reserved.

关键词： Wireless sensor networks in-network query processing Quality of queries Novelty detection Energy consumption

来源：评论

学校读者我要写书评

暂无评论

IJA: An Efficient Algorithm for query processing in Sensor networks

引用

SENSORS 2011年第2期11卷 1682-1692页

作者： Lee, Hyun Chang Lee, Young Jae Lim, Ji Hyang Kim, Dong Hwa Jeonju Univ Dept Multimedia Jeonju South Korea Wonkwang Univ Div Informat & E Commerce Iksan South Korea Daegu Cyber Univ Dept Art Therapy Taegu South Korea Hanbat Natl Univ Taejon South Korea

One of main features in sensor networks is the function that processes real time state information after gathering needed data from many domains. The component technologies consisting of each node called a sensor node that are including physical sensors, processors, actuators and power have advanced significantly over the last decade. Thanks to the advanced technology, over time sensor networks have been adopted in an all-round industry sensing physical phenomenon. However, sensor nodes in sensor networks are considerably constrained because with their energy and memory resources they have a very limited ability to process any information compared to conventional computer systems. Thus query processing over the nodes should be constrained because of their limitations. Due to the problems, the join operations in sensor networks are typically processed in a distributed manner over a set of nodes and have been studied. By way of example while simple queries, such as select and aggregate queries, in sensor networks have been addressed in the literature, the processing of join queries in sensor networks remains to be investigated. Therefore, in this paper, we propose and describe an Incremental Join Algorithm (IJA) in Sensor networks to reduce the overhead caused by moving a join pair to the final join node or to minimize the communication cost that is the main consumer of the battery when processing the distributed queries in sensor networks environments. At the same time, the simulation result shows that the proposed IJA algorithm significantly reduces the number of bytes to be moved to join nodes compared to the popular synopsis join algorithm.

关键词： sensor network communication cost incremental algorithm in-network query processing wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Exact Top-K Queries in Wireless Sensor networks

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2011年第10期23卷 1513-1525页

作者： Malhotra, Baljeet Nascimento, Mario A. Nikolaidis, Ioanis Natl Univ Singapore Ctr Maritime Studies Singapore 118411 Singapore Univ Alberta Dept Comp Sci Edmonton AB T6G 2E8 Canada

In this paper, we consider the exact top-k query problem in wireless sensor networks, i.e., where one seeks to find the k highest reported values as well as the complete set of nodes that reported them. Our primary contribution in this context is EXTOK, a provably correct and topology-independent new filtering-based algorithm for processing exact top-k queries. As a secondary contribution we confirm a previous result of ours by showing that the efficiency of top-k query processing algorithms, including EXTOK, can be further improved by simply choosing a proper underlying logical tree topology. We examine EXTOK's performance with respect to a number of parameters and different logical tree topologies while using both synthetic and real data sets. Our simulation reveal that EXTOK consistently outperforms the current state-of-the-art algorithm by a very significant margin and regardless of the underlying logical tree topology.

关键词： Wireless sensor networks top-k query processing in-network query processing energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Stream engines meet wireless sensor networks: cost-based planning and processing of complex queries in AnduIN

引用

DISTRIBUTED AND PARALLEL DATABASES 2011年第1-2期29卷 151-183页

作者： Klan, Daniel Karnstedt, Marcel Hose, Katja Ribe-Baumann, Liz Sattler, Kai-Uwe Ilmenau Univ Technol Databases & Informat Syst Grp Ilmenau Germany Max Planck Inst Informat Saarbrucken Germany NUI Galway DERI Galway Ireland

Wireless sensor networks are powerful, distributed, self-organizing systems used for event and environmental monitoring. In-network query processors like TinyDB offer a user friendly SQL-like application development. Due to the sensor nodes' resource limitations, monolithic approaches often support only a restricted number of operators. For this reason, complex processing is typically outsourced to the base station. Nevertheless, previous work has shown that complete or partial in-network processing can be more efficient than the base station approach. In this paper, we introduce AnduIN, a system for developing, deploying, and running complex in-network processing tasks. In particular, we present the query planning and execution strategies used in AnduIN, a system combining sensor-local in-network processing and a data stream engine. query planning employs a multi-dimensional cost model taking energy consumption into account and decides autonomously which query parts will be processed within the sensor network and which parts will be processed at the central instance.

关键词： Sensor networks Data streams Power awareness Distributed computation in-network query processing query planning

来源：评论

学校读者我要写书评

暂无评论

A Context Aware Data-Centric Storage Scheme in Wireless Sensor networks

A Context Aware Data-Centric Storage Scheme in Wireless Sens...

引用

International Conference on Multimedia, Computer Graphics and Broadcasting (MulGraB 2011)

作者： Kim, Hyunju Park, Junho Seong, Dongook Yoo, Jaesoo Chungbuk Natl Univ Dept Informat & Commun Engn 410 Seongbong Ro Cheongju Chungbuk South Korea Korea Adv Inst Sci & Technol Yuseonggu Daejeon South Korea

ISBN: (纸本)9783642271854

In wireless sensor networks, a data-centric storage scheme (DCS) is one of representative researches to store sensor readings and to process a query efficiently. The DCS scheme assigns distributed data regions to sensor nodes and stores sensor readings to the sensor node which is responsible for the data region to process the query efficiently. However, the existing DCS schemes have some drawbacks that the sensor nodes have the fixed ranges to store sensor readings. Because the ranges of the sensor readings change periodically in real world applications, the existing DCS schemes have problems that they use storage space unevenly in entire sensors and their network lifetimes are reduced. To solve such problems, we propose a context aware data-centric storage scheme to store sensor readings equally in the entire sensor network. To show the superiority of our proposed scheme, we compare it with the existing DCS schemes. Our experimental results show that our proposed scheme improves about 377.7% network lifetime over the existing schemes on average.

关键词： Wireless Sensor networks Data-Centric Storage Scheme in-network query processing

来源：评论

学校读者我要写书评

暂无评论

Maximum lifetime continuous query processing in wireless sensor networks

引用

AD HOC networkS 2010年第7期8卷 723-741页

作者： Kalpakis, Konstantinos Tang, Shilang Univ Maryland Dept Comp Sci & Elect Engn Baltimore MD 21201 USA

Monitoring applications emerge as one of the most important applications of wireless sensor networks (WSNs). Such applications typically have long-running complex queries that are continuously evaluated over the sensor measurement streams. Due to the limited energy of the sensors in WSNs, energy efficient query evaluation is critical to prolong the system lifetime - the earliest time that the network can not perform its intended task anymore. We model complex queries by expression trees and consider the problem of maximizing the lifetime of a wireless sensor network for the continuous in-network evaluation of an expression trees T, so the value of its root is available at the base station. In-network evaluation means that the evaluation of the operators of T may be pushed to the network nodes, and continuous means the repeated evaluation of T (once at each round). Continuous in-network evaluation of T entails addressing the following two coupled aspects of the problem: (a) the placement of the operators, variables, and constants of T to network nodes and (b) the routing of their values to the appropriate network nodes that needed them to evaluate the operators. We analyze the complexity and provide a simple and effective algorithm for the placement of the nodes of T onto the sensor nodes of a WSN. Our algorithm of operator placement attempts to minimize the total amount of data that need to be communicated. A placement of T induces a certain Maximum Lifetime Concurrent Flow (MLCF) problem. We provide an efficient algorithm that finds near-optimal integral solutions to the MLCF problem, where a solution is a collection of paths on which certain amount of integral flow is routed. Our approach to the continuous in-network evaluation of T consists of utilizing both our placement and routing algorithms above. We demonstrate experimentally that our approach consistently and effectively find the maximum lifetime solutions for the continuous in-network evaluation of express

关键词： Wireless sensor networks in-network query processing Energy management Lifetime maximization Operator placement Routing

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Distributed Spatial Join processing in Wireless Sensor networks

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2010年第6期E93D卷 1447-1458页

作者： Kim, Min Soo Son, Jin Hyun Kim, Ju Wan Kim, Myoung Ho ETRI Dept Telemat Res Taejon 305700 South Korea Hanyang Univ Dept Comp Sci & Engn Ansan 426791 Kyeonggi Do South Korea Korea Adv Inst Sci & Technol Dept Comp Sci Taejon 305701 South Korea

In the area of wireless sensor networks, the efficient spatial query processing based on the locations of sensor nodes is required. Especially, spatial queries on two sensor networks need a distributed spatial join processing among the sensor networks. Because the distributed spatial join processing causes lots of wireless transmissions in accessing sensor nodes of two sensor networks;our goal of this paper is to reduce the wireless transmissions for the energy efficiency of sensor nodes. In this paper, we propose an energy-efficient distributed spatial join algorithm on two heterogeneous sensor networks, which performs in-network spatial join processing. To optimize the in-network processing, we also propose a Grid-based Rectangle tree (GR-tree) and a grid-based approximation function. The GR-tree reduces the wireless transmissions by supporting a distributed spatial search for sensor nodes. The grid-based approximation function reduces the wireless transmissions by reducing the volume of spatial query objects which should be pushed down to sensor nodes: Finally, we compare naive and existing approaches through extensive experiments and clarify our approach's distinguished features.

关键词： distributed spatial index distributed spatial join in-network query processing wireless sensor network

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：