共查询到20条相似文献,搜索用时 15 毫秒
1.
无线传感器网络(WSNs)中节点受体积、功率、成本等限制而导致了节点能量、生命周期有限的问题.提出一种基于压缩感知算法的无线传感器网络节能优化方法,并结合无线传感器网络中的链型拓扑网络模型,给出基于压缩感知理论的节能网络数据传输模型.通过理论分析比较表明压缩感知方法在节能方面的优越性,然后在得出的网络能耗模型的基础上进行仿真.仿真结果表明:压缩感知方法有效减少了网络能耗. 相似文献
2.
3.
无线传感器网络中一种分布式数据压缩算法 总被引:1,自引:0,他引:1
无线传感器网络有限的能量与通信带宽难以适应网络中大量数据的传输,需要在网络内部对传感数据进行压缩处理。基于任意支撑长度的小波函数,提出了一种分布式数据压缩算法。首先研究边界效应对传感数据重构带来的影响,然后基于虚拟网格环模型给出了一种分布式小波数据压缩算法。理论分析与实验结果表明,该算法能有效地去除传感数据中存在的空间相关性。而且,随着簇头与簇内节点距离的增加,该算法比非分布式方式更节省网络耗能。 相似文献
4.
5.
对矢量数据压缩算法中DP压缩算法在引入无线传感器网络的同时进行了改进,针对压缩过程中对数据的扫描次数问题,提出簇首提取压缩算法。该算法中“簇首”即为“数据簇首”,簇首提取压缩算法设定步长减少压缩过程中对数据的扫描次数,并采用最佳曲线拟合方法对监测数据点做直线优化拟合,根据数据间的依附关系,将体现整体特征的簇首数据进行提取;同时,对非簇首数据进行子群划分。仿真结果表明,簇首提取压缩算法程序更为简单,对大波动数据有较好的簇首提取效果,减少了网络中数据的传输量,有效地节省了整个网络的能量消耗。 相似文献
6.
This paper studies the problem of neighbor discovery in wireless networks, namely, each node wishes to discover and identify the network interface addresses (NIAs) of those nodes within a single hop. A novel paradigm, called compressed neighbor discovery is proposed, which enables all nodes to simultaneously discover their respective neighborhoods with a single frame of transmission, which is typically of a few thousand symbol epochs. The key technique is to assign each node a unique on–off signature and let all nodes simultaneously transmit their signatures. Despite that the radios are half-duplex, each node observes a superposition of its neighbors’ signatures (partially) through its own off-slots. To identify its neighbors out of a large network address space, each node solves a compressed sensing (or sparse recovery) problem.Two practical schemes are studied. The first employs random on–off signatures, and each node discovers its neighbors using a noncoherent detection algorithm based on group testing. The second scheme uses on–off signatures based on a deterministic second-order Reed–Muller code, and applies a chirp decoding algorithm. The second scheme needs much lower signal-to-noise ratio (SNR) to achieve the same error performance. The complexity of the chirp decoding algorithm is sub-linear, so that it is in principle scalable to networks with billions of nodes with 48-bit IEEE 802.11 MAC addresses. The compressed neighbor discovery schemes are much more efficient than conventional random-access discovery, where nodes have to retransmit over many frames with random delays to be successfully discovered. 相似文献
7.
Practical data compression in wireless sensor networks: A survey 总被引:1,自引:0,他引:1
Tossaporn Srisooksai Kamol KeamarungsiPoonlap Lamsrichan Kiyomichi Araki 《Journal of Network and Computer Applications》2012,35(1):37-59
Power consumption is a critical problem affecting the lifetime of wireless sensor networks. A number of techniques have been proposed to solve this issue, such as energy-efficient medium access control or routing protocols. Among those proposed techniques, the data compression scheme is one that can be used to reduce transmitted data over wireless channels. This technique leads to a reduction in the required inter-node communication, which is the main power consumer in wireless sensor networks. In this article, a comprehensive review of existing data compression approaches in wireless sensor networks is provided. First, suitable sets of criteria are defined to classify existing techniques as well as to determine what practical data compression in wireless sensor networks should be. Next, the details of each classified compression category are described. Finally, their performance, open issues, limitations and suitable applications are analyzed and compared based on the criteria of practical data compression in wireless sensor networks. 相似文献
8.
Both the overhearing and overhearing avoidance in a densely distributed sensor network may inevitably incur considerable power consumption. In this paper we propose a so-called CCS-MAC (collaborative compression strategy-based MAC) MAC protocol which facilitates to exploit those overheard data that is treated useless in traditional MAC protocols for the purpose of cost and energy savings. Particularly the CCS-MAC enables different sensor nodes to perform data compression cooperatively with regard to those overheard data, so that the redundancy of data prepared for the link layer transmission can be totally eliminated at the earliest. The problem of collaborative compression is analyzed and discussed along with a corresponding linear programming model formulated. Based on it a heuristic node-selection algorithm with a time complexity of (O(N2)) is proposed to the solve the linear programming problem. The node-selection algorithm is implemented in CCS-MAC at each sensor node in a distributed manner. The experiment results verify that the proposed CCS-MAC scheme can achieve a significant energy savings so as to prolong the lifetime of the sensor networks so far. 相似文献
9.
《Computer Communications》2007,30(11-12):2375-2384
Research on wireless sensor networks (WSNs) has received tremendous attention in the past few years due to their potential applications and advances in the VLSI design. In WSNs with tiny sensors, mobility of a sink may provide an energy efficient way for data dissemination. Having a mobile sink in WSN, however, creates new challenges to routing and sensor distribution modeling in the network. In this paper, based on clustering and routing optimization algorithms, we propose a new scheme called K-means and TSP-based mobility (KAT mobility). After clustering the sensor nodes, the proposed method navigates the mobile sink to traverse through the cluster centers according to the trajectory of an optimized route. The mobile sink then collects the data from sensors at the visited clusters. Simulation results have demonstrated that the proposed scheme can provide not only better energy efficiency as compared to those obtained by conventional methods which assume random waypoint for the mobile sink, but also fault-resilience in case of malfunctions of some sensors due to attacks. 相似文献
10.
无线传感器网络在结构健康监测方面有着广泛的应用,但由于该领域的传感器数量和种类众多,数据压缩对系统的高效运行起着关键作用。因此,提出了一种基于压缩感知的无线传感结构健康监测方法,对航空铝板的结构振动信号采用高斯随机矩阵将高维信号序列投影到低维空间,获得稀疏采样的线性测量值,实现信号的压缩采样。研究改进的正交匹配追踪算法来实现稀疏信号的重构。实验结果表明,与已有的无线传感结构健康监测相比,采用压缩采样的监测方法具有良好的抗噪性,并能获得较好的数据压缩效果,节省了网络的带宽和能量;通过信号的近似重构(重构误差在±0.13),能实现航空铝板损伤准确识别(误差0.84mm)。 相似文献
11.
12.
Mohsen Nasri Author VitaeAbdelhamid HelaliAuthor Vitae Halim Sghaier Author VitaeHassen Maaref Author Vitae 《Computers & Electrical Engineering》2011,37(5):798-810
When using wireless sensor networks for real-time image transmission, some critical points should be considered. These points are limited computational power, storage capability, narrow bandwidth and required energy. Therefore, efficient compression and transmission of images in wireless sensor network is considered. To address the above mentioned concerns, an efficient adaptive compression scheme that ensures a significant computational and energy reduction as well as communication with minimal degradation of the image quality is proposed. This scheme is based on wavelet image transform and distributed image compression by sharing the processing of tasks to extend the overall lifetime of the network. Simulation results are presented and they show that the proposed scheme optimizes the network lifetime, reduces significantly the amount of the required memory and minimizes the computation energy by reducing the number of arithmetic operations and memory accesses. 相似文献
13.
研究传感器网络中的小波变换问题,提出了一种基于最优小波变换的分布式数据压缩算法。主要工作有:(1)提出基于混合分解的分布式小波变换,利用节点的计算能力减少节点间交换数据产生小波系数的通信开销;(2)提出自适应小波变换,最优变换级根据小波变换的压缩增益和由此产生的网络开销自适应确定。仿真实验表明,和现有的小波数据压缩算法以及非分布式方式相比,提出的算法具有更优的网络性能。 相似文献
14.
为了对无线传感器网络的压缩数据收集有一个全面的认识和评估,对到目前为止国内外的相关研究成果作了一个系统的介绍。首先,介绍了压缩数据收集及改进方法的框架的建立;然后,分别根据无线传感器网络的传输模式和压缩感知理论的三要素,对压缩数据收集方法分类进行了阐述;接下来,说明了压缩数据收集的自适应和优化问题,与其他方法的联合应用,及实际应用范例;最后,指出了压缩数据收集存在的问题和未来的发展方向。 相似文献
15.
Kim Yong-Min Park Junho Lim Jongtae Yoo Jaesoo 《Multimedia Tools and Applications》2017,76(19):19707-19722
Multimedia Tools and Applications - In this paper, we propose an energy-efficient compression scheme for wireless multimedia sensor networks. To do this, we analyze the characteristics of... 相似文献
16.
17.
介绍了应用于无线传感器网络(Wireless Sensor Networks,WSN)中的一种数据传输方案--压缩网络编码(Compressed Network Coding,CNC)。在WSN中,通常应用网络编码(Network Coding,NC)来适应拓扑结构的动态变化并提高数据传输效率。考虑到传感器网络中节点测量值之间的相关性,与随机线性网络编码(Random Linear Network Coding,RLNC)方案中的编码操作与压缩感知(Compressed Sensing,CS)中随机投影操作之间的相似性,CNC方案将CS引入到NC中,通过对测量值数据包以及NC局部编码向量的设计,来解决传统NC译码存在的“全有或全无”问题。在汇聚节点收集到的数据包个数小于网络中源节点个数的情况下,CNC方案仍能以高概率精确重构感知数据。仿真结果表明,在合理的误差容许范围内重构测量值,所需的数据包个数仅为传统NC方案所需个数的一半,与传统NC技术相比,CNC方案将数据传输效率提升了20%以上。 相似文献
18.
UAV-assisted data gathering in wireless sensor networks 总被引:2,自引:0,他引:2
Mianxiong Dong Kaoru Ota Man Lin Zunyi Tang Suguo Du Haojin Zhu 《The Journal of supercomputing》2014,70(3):1142-1155
An unmanned aerial vehicle (UAV) is a promising carriage for data gathering in wireless sensor networks since it has sufficient as well as efficient resources both in terms of time and energy due to its direct communication between the UAV and sensor nodes. On the other hand, to realize the data gathering system with UAV in wireless sensor networks, there are still some challenging issues remain such that the highly affected problem by the speed of UAVs and network density, also the heavy conflicts if a lot of sensor nodes concurrently send its own data to the UAV. To solve those problems, we propose a new data gathering algorithm, leveraging both the UAV and mobile agents (MAs) to autonomously collect and process data in wireless sensor networks. Specifically, the UAV dispatches MAs to the network and every MA is responsible for collecting and processing the data from sensor nodes in an area of the network by traveling around that area. The UAV gets desired information via MAs with aggregated sensory data. In this paper, we design a itinerary of MA migration with considering the network density. Simulation results demonstrate that our proposed method is time- and energy-efficient for any density of the network. 相似文献
19.
Sylvia Tai Robert R. Benkoczi Hossam Hassanein Selim G. Akl 《Journal of Parallel and Distributed Computing》2007
In this paper we study the effects of data relaying in wireless sensor networks (WSNets) under QoS constraints with two different strategies. In the first, data packets originating from the same source are sent to the base station possibly along several different paths, while in the second, exactly one path is used for this purpose. The two strategies correspond to splitting and not splitting relaying traffic, respectively. We model a sensor network architecture based on a three-tier hierarchy of nodes which generalizes to a two-tier WSNet with multiple sinks. Our results apply therefore to both types of networks. Based on the assumptions in our model, we describe several methods for computing relaying paths that are optimal with respect to energy consumption and satisfy QoS requirements expressed by the delay with which data are delivered to the base station(s). We then use our algorithms to perform an empirical analysis that quantifies the performance gains and losses of the splittable and unsplittable traffic allocation strategies for WSNets with delay-constrained traffic. Our experiments show that splitting traffic does not provide a significant advantage in energy consumption, but can afford strategies for relaying data with a lower delay penalty when using a model based on soft-delay constraints. 相似文献
20.
Hongli Xu Liusheng Huang Yindong Zhang He Huang Shenglong Jiang Gang Liu 《Journal of Parallel and Distributed Computing》2010
Recently, cooperative communication mechanism is shown to be a promising technology to improve the transmit diversity only by a single transceiver antenna. Using this communication paradigm, multiple source nodes are able to coordinate their transmissions so as to obtain energy savings. As data aggregation is one of the most important operations in wireless sensor networks, this paper studies the energy-efficient data aggregation problem through cooperative communication. We first define the cooperative data aggregation (CDA) problem, and formally prove that this problem is NP-Hard. Due to the difficult nature of this problem, we propose a heuristic algorithm MCT for cooperative data aggregation. The theoretical analysis shows that this algorithm can reach the approximate performance ratio of 2. Moreover, the distributed implementation DMCT of the algorithm is also described. We prove that both centralized and distributed algorithms can construct the same topology for cooperative data aggregation. The experimental simulations show that the proposed algorithms will decrease the power consumption by about 12.5% and 66.3% compared with PEDAP and PEGASIS algorithms respectively. 相似文献