共查询到19条相似文献,搜索用时 93 毫秒
1.
在簇形结构的无线传感器网络中,针对基本单元簇,在IEEE 802.15.4协议的MAC层讨论查询质量的优化问题。建立了以查询质量为目标,带宽限制为约束条件的优化模型,并提出了动态规划法和查询质量因子动态更新算法相结合的动态查询质量保证算法。仿真实验表明,该方法能提高IEEE 802.15.4的实时带宽利用率,减少查询响应时间,并能根据不同的查询质量要求提供相应的服务。 相似文献
2.
3.
4.
对于无线传感器网络,用户需要通过查询网络中的感知数据来分析检测某个环境中的物理现象。和节点本地数据处理操作相比,数据通信消耗了网络的大部分能量。因此,如何优化查询以尽量减少数据通信量成为无线传感器网络中数据处理工作的核心技术之一。本文以两个典型的数据管理系统为例,探讨了传感器网络中查询优化的关键技术。 相似文献
5.
针对无线传感器网络中多个Top-k查询问题,提出了一种Top-k多查询处理的算法,对接收到的多个Top-k查询请求进行预处理,预处理依据是约束条件,得出两类不同的查询集合:单约束条件的多查询和多约束条件的多查询。针对单约束条件的多查询提出了ETOP算法,该算法首先对排在时间序列最前面的Top-k查询请求进行基于网内处理,然后把查询结果存入基站缓存,并把结果的最小值设定为阈值传输到各个节点,再根据后续查询请求的查询范围进行相应的查询,从而快速地获得Top-k查询结果。实验表明:Top-k多查询方法在能够很好地实现查询的同时,减少了无线传感器网络中的传输消耗和能量消耗。 相似文献
6.
本文系统介绍了PROSPECTORPROOF算法。PROSPECTORPROOF算法在预先分配一定带宽的基础上,在传感器节点内部将感知数据排序,上传被各节点证明的感知数据的数量。在改进算法中引入了本地过滤策略,使得在查询过程中节点内部实现了感知数据的过滤。改进的算法利用了PROSPECTORPROOF算法中产生的数据作进一步的查询优化,能够缩小查询范围而且能够得到准确的感知数据。较好的实现了查询的基本功能,将系统能量消耗降低了11.5%。 相似文献
7.
8.
提出了一种基于过滤的算法(filter based algorithm,FBA)来连续地维护传感器网络中的滑动窗口轮廓查询。首先,研究了利用元组过滤器和格过滤器来减少网络中数据传输量的两种方法。由于它们各有利弊,提出了根据数据分布来选择合适的过滤器的自适应过滤法;另外,提出了一系列的优化方法来进一步提高算法的能量有效性。仿真和真实数据的实验结果表明,FBA及其优化方法能有效地减少连续维护传感器网络中滑动窗口轮廓时的通信代价,进而节约传感器网络的能量。 相似文献
9.
10.
提出了一个无线传感器网络多查询的节能优化方案。该方案通过建立相似查询判断算法把多查询中的相似查询分为一组,并在每一组找一个能使传输能耗达到最小的中继节点作为处理节点。组内节点的数据都传送到该处理节点,并由该节点利用数据处理函数处理数据,然后再传到基站。这样就减少了网络中数据的传输量,从而有效地节省了网络的能量,达到能量的最大化利用。 相似文献
11.
12.
13.
14.
针对无线传感器网络节点能量受限,路由协议鲁棒性不强的特点,提出了一种基于免疫机制的路由优化算法。利用组播理论与人工免疫全局优化性能,建立路由优化与免疫系统映射关系,设计路由优化算法中的抗体表示、克隆繁殖、克隆选择和基因变异等免疫规则,并从计算方式、局部收敛预防和鲁棒性三方面分析算法的性能。仿真验证了算法的有效性。 相似文献
15.
16.
17.
Feilong Tang Ilsun You Song Guo Minyi Guo Yonggong Ma 《Journal of Intelligent Manufacturing》2012,23(4):1305-1313
Wireless sensor networks (WSNs) are an emerging technology for monitoring physical world. Different from the traditional wireless networks and ad hoc networks, the energy constraint of WSNs makes energy saving become the most important goal of various routing algorithms. For this purpose, a cluster based routing algorithm LEACH (low energy adaptive clustering hierarchy) has been proposed to organize a sensor network into a set of clusters so that the energy consumption can be evenly distributed among all the sensor nodes. Periodical cluster head voting in LEACH, however, consumes non-negligible energy and other resources. While another chain-based algorithm PEGASIS (power- efficient gathering in sensor information systems) can reduce such energy consumption, it causes a longer delay for data transmission. In this paper, we propose a routing algorithm called CCM (Chain-Cluster based Mixed routing), which makes full use of the advantages of LEACH and PEGASIS, and provide improved performance. It divides a WSN into a few chains and runs in two stages. In the first stage, sensor nodes in each chain transmit data to their own chain head node in parallel, using an improved chain routing protocol. In the second stage, all chain head nodes group as a cluster in a self- organized manner, where they transmit fused data to a voted cluster head using the cluster based routing. Experimental results demonstrate that our CCM algorithm outperforms both LEACH and PEGASIS in terms of the product of consumed energy and delay, weighting the overall performance of both energy consumption and transmission delay. 相似文献
18.
In this paper, a new approach has been introduced that integrates an evolutionary-based mechanism with a distributed query sensor cover algorithm for optimal query execution in self-organized wireless sensor networks (WSN). An algorithm based on an evolutionary technique is proposed, with problem-specific genetic operators to improve computing efficiency. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execution of spatial queries. Any reduction in communication cost would result in an efficient use of battery energy, which is very limited in sensors. Our objective is to self-organize the network, in response to a query, into a topology that involves an optimal subset of sensors that is sufficient to process the query subject to connectivity, coverage, energy consumption, cover size and communication overhead constraints. Query processing must incorporate energy awareness into the system by reducing the total energy consumption and hence increasing the lifetime of the sensor cover, which is beneficial for large long running queries. Experiments have been carried out on networks with different sensors Transmission radius, different query sizes, and different network configurations. Through extensive simulations, we have shown that our designed technique result in substantial energy savings in a sensor network. Compared with other techniques, the results demonstrated a significant improvement of the proposed technique in terms of energy-efficient query cover with lower communication cost and lower size. 相似文献
19.