Grey Wolf based compressive sensing scheme for data gathering in IoT based heterogeneous WSNs

Wireless Networks - Sensor node energy constraint is considered as an impediment in the further development of the Internet of Things (IoT) technology. One of the most efficient solution is to...     

GWO‐C: Grey wolf optimizer‐based clustering scheme for WSNs

A wireless sensor network (WSN) is a prominent technology that could assist in the fourth industrial revolution. Sensor nodes present in the WSNs are functioned by a battery. It is impossible to recharge or replace the battery, hence energy is the most important resource of WSNs. Many techniques have been devised and used over the years to conserve this scarce resource of WSNs. Clustering has turned out to be one of the most efficient methods for this purpose. This paper intends to propose an efficient technique for election of cluster heads in WSNs to increase the network lifespan. For the achievement of this task, grey wolf optimizer (GWO) has been employed. In this paper, the general GWO has been modified to cater to the specific purpose of cluster head selection in WSNs. The objective function for the proposed formulation considers average intra‐cluster distance, sink distance, residual energy, and CH balancing factor. The simulations are carried out in diverse conditions. On comparison of the proposed protocol, ie, GWO‐C protocol with some well‐known clustering protocols, the obtained results prove that the proposed protocol outperforms with respect to the consumption of the energy, throughput, and the lifespan of the network. The proposed protocol forms energy‐efficient and scalable clusters.     

基于多层分簇优化的认知无线电网络协作频谱感知策略

针对认知无线电网络(CRN)中基于簇的频谱感知策略的检测性能和能耗问题,提出一种基于多层分簇优化的协作频谱感知策略。首先,将CRN分成多个簇,进而将簇分成多个组,再将组分成多个子组,构建三层分簇结构;然后,利用提出的优化算法获得最优的分簇参数和决策阈值;最后,通过投票机制和K-out-of-N规则对各级决策进行聚合,进行频谱感知。实验结果表明,该方案在获得较高主要用户(PU)频谱占用检测率的同时,能够最大限度地减少信道开销,提高了网络的吞吐量。     

基于网格的无线传感器网络非均匀分簇算法

在无线传感器网络中,首先要考虑的是如何解决能耗问题.针对无线传感器网络现有算法存在的节点能耗不均匀及节点部署密集造成的数据冗余和能量浪费,提出了一种节能路由算法UECG.通过设定虚拟网格以及非均匀分簇来实现网络能量的均衡消耗.仿真结果表明,与LEACH协议及其改进协议EEUC相比,UECG算法能够有效减少冗余数据,平衡簇群间的能量消耗,达到延长网络寿命的目的.     

压缩感知图像融合

目前图像融合的方法大多数都是基于小波变换的图像融合方法,通过对小渡变换之后的低频系数和高频系数分别采用不同的融合准则,来达到所需要的图像以进行下一步处理,这些方法需要知道原始图像,也就是对硬件要求较高。采用压缩感知图像融合,即,将压缩感知用于图像融合,使得只知道原始图像在某个变换下的投影值的情况下,通过对已知的投影值使用融合规则得到融合后的投影值,然后用重构算法重构出图像,大大降低了对硬件的要求。在此给出了压缩感知融合方法与基于小波变换的图像融合方法的实验结果,融合结果表明,在不降低融合效果和视觉效果的基础上,该方法能够极大地降低硬件成本。采用熵作为衡量融合效果的指标,并对用两种方法融合的结果图像做了对比,研究结果表明,CS融合方法要优于基于小渡变换的图像融合方法。     

基于压缩感知的信号重构

压缩感知是针对稀疏或可压缩信号,在采样的同时即可对信号数据进行适当压缩的新理论,采用该理论,可以仅需少量信号的观测值来实现精确重构信号。文中概述了CS理论框架及关键技术问题,介绍了信号稀疏表示、观测矩阵和重构算法。最后仿真实现了基于压缩感知的信号重构,并对正交匹配追踪(OMP)重构算法性能作了分析。     

率失真优化的压缩感知图像编码

针对基于压缩感知的图像编码系统,分析了系统中编码参数和码率以及失真的关系,在此基础上提出了基于压缩感知的图像编码系统的码率-失真模型.根据所提模型设计了率失真优化的压缩感知图像编码算法.在给定码率的条件下,优化编码参数,使得编码器失真最小.算法在Matlab的编码平台上进行了仿真和实验,结果证明提出的码率-失真模型能够很好地拟合实际率失真曲线,并且基于该模型的率失真优化算法有效的提高了压缩感知图像编码系统的性能.     

A compressive sensing and unmixing scheme for hyperspectral data processing

Hyperspectral data processing typically demands enormous computational resources in terms of storage, computation, and input/output throughputs, particularly when real-time processing is desired. In this paper, a proof-of-concept study is conducted on compressive sensing (CS) and unmixing for hyperspectral imaging. Specifically, we investigate a low-complexity scheme for hyperspectral data compression and reconstruction. In this scheme, compressed hyperspectral data are acquired directly by a device similar to the single-pixel camera based on the principle of CS. To decode the compressed data, we propose a numerical procedure to compute directly the unmixed abundance fractions of given endmembers, completely bypassing high-complexity tasks involving the hyperspectral data cube itself. The reconstruction model is to minimize the total variation of the abundance fractions subject to a preprocessed fidelity equation with a significantly reduced size and other side constraints. An augmented Lagrangian-type algorithm is developed to solve this model. We conduct extensive numerical experiments to demonstrate the feasibility and efficiency of the proposed approach, using both synthetic data and hardware-measured data. Experimental and computational evidences obtained from this paper indicate that the proposed scheme has a high potential in real-world applications.     

HSCA: a novel harmony search based efficient clustering in heterogeneous WSNs

Clustering objective reasons scalability, fault tolerance, data aggregation or fusion, load balancing of cluster heads, stabilized network topology, maximal network lifetime, increased connectivity, reduced routing delay, collision avoidance and utilizing sleeping schemes in wireless sensor networks. Load balanced clustering effectively organize the network into a connected hierarchy. Clustering is a discrete problem that can have more than one solution under different operating constraints. In this scenario, meta-heuristic algorithms are found suitable because they give set of solutions in acceptable time constraints. In the literature, several analytical and meta-heuristic approaches have been developed for load balanced clustering. In this paper, a novel harmony search based energy efficient load balanced clustering algorithm is presented and it is tested on a large sample network. Results demonstrated that the proposed approach has faster convergence and gives reliable and efficient load balanced clustering as compared to conventional harmony search algorithm (HSA) and several other methods in the literature. Moreover, the robustness of the proposed approach is also verified for different cases of fixed and variable parameters of HSA.     

Deterministic binary matrix based compressive data aggregation in big data WSNs

In big data wireless sensor networks, the volume of data sharply increases at an unprecedented rate and the dense deployment of sensor nodes will lead to high spatial-temporal correlation and redundancy of sensors’ readings. Compressive data aggregation may be an indispensable way to eliminate the redundancy. However, the existing compressive data aggregation requires a large number of sensor nodes to take part in each measurement, which may cause heavy load in data transmission. To solve this problem, in this paper, we propose a new compressive data aggregation scheme based on compressive sensing. We apply the deterministic binary matrix based on low density parity check codes as measurement matrix. Each row of the measurement matrix represents a projection process. Owing to the sparsity characteristics of the matrix, only the nodes whose corresponding elements in the matrix are non-zero take part in each projection. Each projection can form an aggregation tree with minimum energy consumption. After all the measurements are collected, the sink node can recover original readings precisely. Simulation results show that our algorithm can efficiently reduce the number of the transmitted packets and the energy consumption of the whole network while reconstructing the original readings accurately.     

基于压缩感知的多光谱图像去马赛克算法

针对目前多光谱图像去马赛克算法存在计算量大、效率低的缺点,本文提出一种基于压缩感知的多光谱图像去马赛克算法。首先,分析去马赛克与压缩感知问题的等价性,建立基于压缩感知的去马赛克模型;然后,采用离散余弦变换构建压缩感知的稀疏基,将去马赛克问题转化为压缩感知的信号重构问题;最后,采用改进的光滑0范数和修正牛顿法的重构算法求解去马赛克问题,得到重构的多光谱图像。仿真实验表明,相对于基于克罗内克压缩感知和组稀疏两种算法,本文算法提高了重构的多光谱图像的峰值信噪比,能有效减少对比算法重构多光谱图像中出现的锯齿现象,改善了重构图像具有更好的视觉效果。实验结果验证了本文算法的有效性。     

基于压缩感知的高光谱遥感影像重构方法研究

高光谱遥感影像包含丰富的空间、辐射以及光谱信息,同时海量的数据也引发了高光谱成像技术在传输和存储方面的诸多问题。针对这一问题,根据高光谱遥感影像谱间相关性强的特性,提出了一种结合谱间多向预测的基于压缩感知的高光谱遥感影像重构方法。首先,根据高光谱遥感影像的谱间相关性对高光谱遥感影像的波段进行分组,每组确定一个参考波段,使用平滑l_0范数算法重构每组的参考波段。其次,根据重构恢复的相邻组内的参考波段,建立了一个非参考波段预测模型,用来计算非参考波段的预测测量值;然后,计算实际测量值与预测测量值的差值,使用SL0算法重构该差值得到差值向量;最后,利用得到的差值向量迭代更新预测测量值,直到恢复该波段原始图像。仿真实验结果表明,该方法提高了高光谱遥感影像的重构效果。     

Weighted centroid localization based on compressive sensing

To solve the problem of estimating the locations of sensor nodes in wireless sensor networks where most nodes are without an effective positioning device, a novel range-free localization algorithm—weighted centroid localization based on compressive sensing (WCLCS) is proposed. WCLCS makes use of compressive sensing to get decomposition coefficients between each nonbeacon node and beacon nodes. According to these coefficients, WCLCS algorithm decides the weighted value of each beacon node for Centroid and estimates the locations of nonbeacon nodes. The simulation results show that WCLCS has better localization performance than LSVM.     

基于压缩感知的数字全息成像技术

提出一种基于压缩感知理论和数字全息术的数字全息压缩成像技术。通过传统相移数字全息技术获取干涉图样,将干涉同样投影到测量矩阵上,通过计算內积直接获取全息压缩数据。这些数据经过传统通信信道传输后,利用压缩感知重构算法获得原始全息数据,然后经过菲涅尔逆变换得到原始图像。实验仿真结果证明了这种压缩全息成像方法的可行性。     

基于压缩传感的光子计数成像系统

提出了一种基于压缩传感理论的光子计数成像系统。该系统以单光子计数器作为探测元件,以期在面元探测技术不甚成熟的现状下用点探测器进行极弱光探测。通过计算机模拟计算,验证了压缩传感理论结合单光子计数器应用于极弱光成像的可行性,讨论了单光子计数器的暗计数率、量子效率和测量噪声对成像质量的影响。介绍了压缩传感理论,为了获得更好的图像质量和更快的计算速度,提出了SpaRSA-DWT稀疏重建算法,并与传统的IWT算法进行对比。给出了两种算法下,迭代次数、测量数、噪声功率分别与获得图像信噪比的关系曲线,证明了SpaRSA-DWT算法的优越性。     

WSNs中基于三因素节点评估的安全认证方案

为了减少传感器节点的资源利用并提高网络的安全性,提出了一种基于信任度的认证方案。该方案在计算节点信任度时引入时间片、安全行动系数和交互频度来计算节点信任度,这样使得自私节点很难伪装成正常节点,信任度与当前节点行为紧密相关,并防止节点通过很少的交易次数来达到较高的信任度,再利用信任度来判断一个节点是否可信,有效地提高了应用的安全性,对恶意节点的攻击起到一定的阻碍作用。然后设计了身份标识、密码、智能卡相结合的认证方案,并且用户在与传感器节点认证之前,网关查询网络中节点的信任度,从而找到可信的节点与用户进行认证,实现可信的传感器节点、网关节点和用户三者之间的交互认证,并且用户能方便地更改密码。安全性分析、性能分析及仿真实验的结果表明,与已提出的认证方案相比,该方案能够抵制重放攻击、内部攻击、伪装攻击等,同时计算花费少,适合于对安全性和性能有要求的无线传感器网络。本文网络版地址：http：//www.eepw.com.cn/article/276364.htm     

A game theory based energy efficient clustering routing protocol for WSNs

The energy constraint is one of the inherent defects of the Wireless Sensor Networks (WSNs). How to prolong the lifespan of the network has attracted more and more attention. Numerous achievements have emerged successively recently. Among these mechanisms designing routing protocols is one of the most promising ones owing to the large amount of energy consumed for data transmission. The background and related works are described firstly in detail in this paper. Then a game model for selecting the Cluster Head is presented. Subsequently, a novel routing protocol named Game theory based Energy Efficient Clustering routing protocol (GEEC) is proposed. GEEC, which belongs to a kind of clustering routing protocols, adopts evolutionary game theory mechanism to achieve energy exhaust equilibrium as well as lifetime extension at the same time. Finally, extensive simulation experiments are conducted. The experimental results indicate that a significant improvement in energy balance as well as in energy conservation compared with other two kinds of well-known clustering routing protocols is achieved.     

基于二维压缩感知的定向遥感和变化检测

基于高斯测量矩阵的一维压缩感知测量数据不仅能很好地保持稀疏信号的能量信息, 也能够很好地继承稀疏信号的方向信息.但是在一维压缩感知模型中方向信息无法应用于稀疏信号的重构和检验.针对遥感影像中变化区域稀疏的特点提出了二维压缩感知模型.并利用能量和方向信息构建了基于二维压缩感知的稀疏信号重构算法(2DOMP).理论分析和实验结果证明, 2DOMP算法的信号重构能力更强.同时根据压缩感知恢复稀疏信号只需要很少测量数据的特性提出了定向遥感和定向变化检测的概念.     

Radar ECCM based on phase-aid distributed compressive sensing

This paper proposes an electronic counter countermeasure (ECCM) technique to suppress randomly distributed multiple false targets generated by digital radio frequency memory-based electronic warfare equipment. Firstly, we present the modulation behaviors of deceptive multiple false targets jamming. Afterward, we discuss the ECCM potential of distributed compressive sensing (DCS) which not only could eliminate random distributed jamming signals but also could preserve the target echo. Further, an approach is proposed relying on phase-aided DCS to improve the performance against a special case of jamming signals that fall in the same range cell but with random amplitudes and phases. Finally, the suppression performances are evaluated through simulations illustrating the feasibility and validity of proposed algorithm.     

Blind single-image super resolution based on compressive sensing

Blind super resolution is an interesting area in image processing that can restore high resolution (HR) image without requiring prior information of the volatile point spread function (PSF). In this paper, a novel framework is proposed for blind single-image super resolution (SISR) problem based on compressive sensing (CS) framework that is one of the first works that considers general PSFs. The fundamental idea in the proposed approach is to use sparsity on a known sparse transform domain as a powerful regularizer in both the image and blur domains. Therefore, a new cost function with respect to the unknown HR image patch and PSF kernel is presented and minimization is performed based on two subproblems that are modeled similar to that of CS. Simulation results demonstrate the effectiveness of the proposed algorithm that is competitive with methods that use multiple LR images to achieve a single HR image.