一种基于改进支持度的节能型WSNs数据融合算法

无线传感器网络(WSNs)内有大量的冗余数据,它们消耗了过多的网络能量;目前的数据融合算法对数据彼此间的联系考虑得不够充分,融合精度有待提高.针对上述问题,提出了一种基于改进支持度的节能型数据融合算法.该算法在网络的感知节点根据设定的阈值对采集到的数据进行初次融合,并引入自支持度的概念,与灰色接近度理论相结合改进支持度函数,将改进的支持度函数应用到汇聚节点计算最终的数据融合估计值.使用Matlab进行仿真的结果表明:该算法可节能27.87％,数据融合的温度绝对误差均值约为0.98℃,达到了节能和提高融合精度的目的.     

基于RSSI的无线传感器网络迭代安全定位算法

分析了无线传感器网络节点定位过程中的安全性问题,针对接收信号强度指示(RSSI)测距技术,提出了一种结合梯度下降法和离群检测技术的安全定位算法.仿真和实验结果表明:使用该算法的无线传感器节点在存在攻击的环境下依然能够正常定位,当平均测距误差为0.7m时,定位误差为1m.     

一种安全有效的无线传感器网络数据收集方案

数据收集技术是无线传感器网络（WSNs）中的重要技术之一。针对无线传感器网络中存在恶意节点攻击可能造成数据包丢失,给出一种安全有效的无线传感器网络数据收集方案。该方案首先利用多路径路由和跟踪反馈机制构造出安全路径,然后再根据安全路径进行数据收集。性能分析结果表明：与基于随机分散路由的数据收集方案相比,所给方案可以大幅降低数据包被拦截率,具有更高的安全性。     

一种基于迭代投票的无线传感器网络安全定位算法

绝大多数的定位算法都是基于信标节点的坐标信息计算未知节点的坐标信息,因此,信标节点的可信性至关重要.无线传感器网络在敌对环境中易受攻击,由此提出了一种安全定位算法.在算法中,节点间无需坐标交换,可直接迭代投票选出可信的信标节点进行定位,并通过仿真验证算法有效性.     

A novel knowledge-guided evolutionary scheduling strategy for energy-efficient connected coverage optimization in WSNs

One of the most important challenges in designing wireless sensor network is how to construct full-connected network containing least active sensor nodes with satisfied quality of services, such as the coverage rate and energy consumption. This energy-efficiency full-connected coverage optimization problem is modeled as a single-objective optimization problem with constraint. To solve this problem, a knowledge-guided evolutionary scheduling strategy is proposed. Three highlights of this strategy are: (1) Knowledge is defined as the importance of sensor node, which depends on the distance between sensor node and sink node. (2) The genes of an individual correspond to senor nodes in descending order of their importance. (3) Considering sensor nodes’ importance and redundancy rate, knowledge-guided mutation operator and repair strategy are present. Simulation results show that the proposed method can find the optimal full-connected wireless sensor network containing least sensor nodes and consuming less energy for communication by less computation time. Though the coverage rate of the optimum is larger, it still satisfies the coverage constraint. Moreover, this strategy fits for the problems that the communication radius of sensor node is less than two times of its sensing radius.     

WSNs中高效且适应性强的安全数据融合*

针对无线传感器网络中传感节点能量的有限性和无线链路的时变性,设计了一种高能效的、适应性强的安全数据融合算法EASDA。该算法在融合过程中基于非物理意义的模式码将传感器节点分成冗余集,在数据传输过程中利用数字喷泉码进行编码。仿真结果显示,该算法有效地减少了冗余数据的传输,使网络中能耗更加均衡,并且适应于任何删除信道。     

一种基于分环的能量高效无线传感器网络分簇路由协议

针对现存分簇路由协议能耗不均衡和簇首节点死亡过早的缺陷,设计了一种基于分环模型的能量高效分簇路由协议.根据节点剩余能量和位置选举簇首,采用主次簇首轮换方式减低簇首节点能耗.仿真结果表明:该算法能够均衡网络能耗,延长无线传感器网络生命周期.     

基于名誉机制的无线传感器网络安全路由协议

针对无线传感器网络中TEEN路由协议安全性不高的问题,在TEEN的基础上引入了名誉机制,提出了一种安全高效的路由协议TEENRM.TEENRM在每个节点上构建一个名誉表,在簇首选举前,先对簇内节点名誉度进行验证,当节点的名誉度值低于限定值时,禁止该节点参与簇首的选举,以此建立多个安全的簇,抵御HELLO泛洪攻击与选择转发攻击,提高网络的路由安全.仿真结果表明:改进后的协议较原协议有较高的分组投递率和较低的端到端时延,并能延长网络的生存时间.     

一种分布式能量高效的WSNs非均匀分簇路由协议

针对无线传感器网络(WSNs)多跳通信方式中存在的"热区"问题,提出了一种分布式的、能量高效的非均匀分簇(DEEUC)路由协议。该协议将节点的剩余能量作为簇首选择的一个重要指标,候选簇首由上轮簇首根据簇内成员节点的剩余能量指定,候选簇首能否最终成簇首也是其能量竞争的结果。在DEEUC协议中,簇首以多跳的方式与基站进行通信并选择正向单位能耗最小的邻居簇首作为路由节点以节约能耗。仿真实验表明:DEEUC能较好地提高网络能效,延长网络生存时间。     

A chaotic permutation and diffusion based image encryption algorithm for secure communications

In this digital era, a huge amount of digital data is being generated, transmitted, and stored over the network. Images are widely searched, shared and uploaded which make them more vulnerable to the attackers. Therefore, image encryption has become the most widespread form of secure image communication. In recent past, a range of chaotic encryption schemes have been proposed for image encryption which suffers from low key space and high computational overhead. In this paper, the authors have proposed a secure image encryption technique based on 2D Baker’s map. In the proposed scheme a plain image is permuted first, based on a sequence of pseudo random number generated by 2D Baker’s map followed by diffusion process based on XORing. The strength of the proposed scheme is analyzed using the most well-known security test measures like NPCR, MSE, PSNR, UACI, correlation coefficient, Entropy etc. and the results demonstrate that the proposed scheme is resistive to various types of known attacks. The scheme runs on comparatively low computational overhead. Further, the results are compared with existing schemes.

     

A resource-efficient encryption algorithm for multimedia big data

Nowadays, multimedia is considered to be the biggest big data as it dominates the traffic in the Internet and mobile phones. Currently symmetric encryption algorithms are used in IoT but when considering multimedia big data in IoT, symmetric encryption algorithms incur more computational cost. In this paper, we have designed and developed a resource-efficient encryption system for encrypting multimedia big data in IoT. The proposed system takes the advantages of the Feistel Encryption Scheme, an Advanced Encryption Standard (AES), and genetic algorithms. To satisfy high throughput, the GPU has also been used in the proposed system. This system is evaluated on real IoT medical multimedia data to benchmark the encryption algorithms such as MARS, RC6, 3-DES, DES, and Blowfish in terms of computational running time and throughput for both encryption and decryption processes as well as the avalanche effect. The results show that the proposed system has the lowest running time and highest throughput for both encryption and decryption processes and highest avalanche effect with compared to the existing encryption algorithms. To satisfy the security objective, the developed algorithm has better Avalanche Effect with compared to any of the other existing algorithms and hence can be incorporated in the process of encryption/decryption of any plain multimedia big data. Also, it has shown that the classical and modern ciphers have very less Avalanche Effect and hence cannot be used for encryption of confidential multimedia messages or confidential big data. The developed encryption algorithm has higher Avalanche Effect and for instance, AES in the proposed system has an Avalanche Effect of %52.50. Therefore, such system is able to secure the multimedia big data against real-time attacks.

     

CHESDA: continuous hybrid and energy-efficient secure data aggregation for WSN

The Journal of Supercomputing - Data aggregation is an effective mechanism to prolong lifetime in the wireless sensor networks by preventing extra data transmission. However, it may have some...     

A secure energy-efficient m-banking application for mobile devices

Mobile banking is one of the emerging services in telecommunications due to the explosive increase in the number of mobile customers around the world. Solutions for mobile banking are varied, ranging from the use of Wireless Transport Layer Security, Security Socket Layer, or application-layer based options. Whereas security at the transport layer is a good choice for e-banking, using it in a mobile device presents several disadvantages such as high energy consumption. In this work, we present a secure energy-efficient m-banking solution for mobile devices. We propose an application-layer protocol whose message formats and message exchanges are designed to reduce time processing, bandwidth use, and energy consumption. Through experimentation, we demonstrate that our secure solution reduces power and energy consumption in more than 30% compared to a secure web-access from the mobile device.     

Hybrid data encryption model integrating multi-objective adaptive genetic algorithm for secure medical data communication over cloud-based healthcare systems

Multimedia Tools and Applications - The exponential rise in the development of cloud computing environments in the healthcare field, the protection and confidentiality of the medical records become...     

Perceptual encryption with compression for secure vector map data processing

With the rapidly rising interest in geographic information system (GIS) contents, a large volume of valuable map data has been unlawfully distributed by pirates. Therefore, the secure storage and transmission of classified national digital map datasets have been increasingly threatened. As the importance of secure, large-volume map datasets has increased, vector map security techniques that focus on secure network and data encryption have been studied. These techniques are required to ensure access control and prevent illegal copying of digital maps. This paper presents perceptual encryption on the vector compression domain for copy protection and access control of vector maps. Our algorithm compresses all vector data of polylines and polygons by lossless minimum coding object (MCO) units and perceptually encrypts using two processes using the mean points and directions of MCOs. The first process changes the position of vector data by randomly permuting the mean points of MCOs, the so-called position encryption. The second process changes the geographic shape by circularly encrypting the directions of vertices in MCOs by the XOR operator. Experimental results have verified that our algorithm can encrypt GIS digital maps effectively and simply and can also improve the compression ratio, unlike general data encryption techniques, and thus, our algorithm is very effective for a large volume of GIS datasets.     

能量高效的WSNs分簇数据融合算法

针对无线传感器网络(WSNs)中多跳通信造成的“热区”以及数据冗余问题,提出了一种能量高效的分簇数据融合算法(EECDA).该算法在分簇阶段综合考虑节点的剩余能量、到基站的距离和邻居节点的数目,周期性地选择簇首和划分不同规模的簇;对簇内数据进行融合,利用辛普森积分法则计算预测接收数据,在保证采集数据实时性和准确性的前提下,降低数据的冗余性,减少通信负载,提高网络的能量利用率.仿真结果表明:该算法能够对数据进行高效预测,减少网络通信量,相较已有的算法,能够有效延长网络的生存周期.     

一种新的无线传感器网络安全路由协议

针对Gossiping协议中存在信息重叠、没有考虑到节点能量利用率和网络传输安全等问题,根据图论中Prims或者Kruskal算法来生成最小生成树的思想,在改进的最小生成树算法前提下,提出了一种传感器网络能量高效的安全路由(EESR)方案,引入了节点的可信度和能量值来作为图中边的权值,充分地考虑到能量的利用,同时防止了恶意节点篡改、丢弃数据包。实验结果表明:该方法提高了网络能量利用率,降低了网络丢包率,延长了无线传感器网络的生命周期。     

一种基于树均匀分簇的WSNs节能路由协议

针对无线传感器网络(WSNs)典型分簇LEACH算法簇首分布不均和簇首与基站一跳通信能耗大的问题,提出一种基于树均匀分簇的节能路由协议(EUCR).基于节点接收信号强度与自身剩余能量的乘积及网络连通度选取簇首,计算簇首间的合理距离,使网络均匀分簇;基于跳数与簇首当前剩余能量构造簇间优化路由树.在OMNeT++中对EUC...     

A novel finite rings based algebraic scheme of evolving secure S-boxes for images encryption

Multimedia Tools and Applications - Substitution-boxes have significant role in block ciphers as they are the only component which offers nonlinearity in the anticipated symmetric encryption...     

A secure re‐encryption scheme for data services in a cloud computing environment

Cloud computing as a promising technology and paradigm can provide various data services, such as data sharing and distribution, which allows users to derive benefits without the need for deep knowledge about them. However, the popular cloud data services also bring forth many new data security and privacy challenges. Cloud service provider untrusted, outsourced data security, hence collusion attacks from cloud service providers and data users become extremely challenging issues. To resolve these issues, we design the basic parts of secure re‐encryption scheme for data services in a cloud computing environment, and further propose an efficient and secure re‐encryption algorithm based on the EIGamal algorithm, to satisfy basic security requirements. The proposed scheme not only makes full use of the powerful processing ability of cloud computing but also can effectively ensure cloud data security. Extensive analysis shows that our proposed scheme is highly efficient and provably secure under existing security model. Copyright © 2015 John Wiley & Sons, Ltd.