基于序列模型的无线传感网入侵检测系统

随着物联网(IoT)的快速发展,越来越多的IoT节点设备被部署,但伴随而来的安全问题也不可忽视。IoT的网络层节点设备主要通过无线传感网进行通信,其相较于互联网更开放也更容易受到拒绝服务等网络攻击。针对无线传感网面临的网络层安全问题,提出了一种基于序列模型的网络入侵检测系统,对网络层入侵进行检测和报警,具有较高的识别率以及较低的误报率。另外,针对无线传感网节点设备面临的节点主机设备的安全问题,在考虑节点开销的基础上,提出了一种基于简单序列模型的主机入侵检测系统。实验结果表明,针对无线传感网的网络层以及主机层的两个入侵检测系统的准确率都达到了99%以上,误报率在1%左右,达到了工业需求,这两个系统可以全面有效地保护无线传感网安全。

一种基于云模型的WSNs节点信誉安全方案

针对已有基于轻量云模型的节点信誉安全方案中存在的决策困难问题以及推荐节点的恶意行为识别问题,提出了优化的轻量云模型MLCM(Modified Light-weighted Cloud Model),并在此基础上设计实现一种新型的节点信誉安全方案.首先,在传统无线传感网信任管理信任值的处理方式的基础上,对节点的直接信任值和间接信任值进行综合处理后再利用云模型简化逆向云算子进行计算,以解决信任误判问题;其次,用云隶属度函数计算推荐信任值,在涉及推荐节点信任值计算时可以提高恶意节点识别的准确度.实验表明,该方案在克服传统的入侵容忍和敏感度之间矛盾问题的同时,还解决了攻击节点对单一节点发动攻击时造成的决策困难问题和恶意节点准确识别问题.

Research on stateful public key based secure data aggregation model for wireless sensor networks

Data aggregation technology reduces traffic overhead of wireless sensor network and extends effective working time of the network,yet continued operation of wireless sensor networks increases the probability of aggregation nodes being captured and probability of aggregated data being tampered.Thus it will seriously affect the security performance of the network. For network security issues,a stateful public key based SDAM( secure data aggregation model) is proposed for wireless sensor networks( WSNs),which employs a new stateful public key encryption to provide efficient end-to-end security. Moreover,the security aggregation model will not impose any bound on the aggregation function property,so as to realize the low cost and high security level at the same time.

Secure Data Aggregation Approach Based on Monitoring in Wireless Sensor Networks

In order to avoid internal attacks during data aggregation in wireless sensor networks, a grid-based network architecture fit for monitoring is designed and the algorithms for network division, initialization and grid tree construction are presented. The characteristics of on-off attacks are first studied and monitoring mechanisms are then designed for sensor nodes. A Fast Detection and Slow Recovery (FDSR) algorithm is proposed to prevent on-off attacks by observing the behaviors of the nodes and computing reputations. A recovery mechanism is designed to isolate malicious nodes by identifying the new roles of nodes and updating the grid tree. In the experiments, some situations of on-off attacks are simulated and the results are compared with other approaches. The experimental results indicate that our approach can detect malicious nodes effectively and guarantee secure data aggregation with acceptable energy consumption.

Node cooperation based location secure verification algorithm in wireless sensor networks localization

For the application of wireless sensor networks in the military field, one of the main challenges is security. To solve the problem of verifying the location claim for a node, a new location verifica- tion algorithm called node cooperation based location secure verification （NCBLSV） algorithm is proposed. NCBLSV could verify malicious nodes by contrasting neighbor nodes and nodes under beam width angle using an adaptive array antenna at a base point. Simulation experiments are con- ducted to evaluate the performance of this algorithm by varying the communication range and the an- tenna beam width angle. Results show that NCBLSV algorithm has high probability of successful ma- licious nodes detection and low probability of false nodes detection. Thus, it is proved that the NCBLSV algorithm is useful and necessary in the wireless sensor networks security.

Cluster Based Secure Dynamic Keying Technique for Heterogeneous Mobile Wireless Sensor Networks

In Heterogeneous Wireless Sensor Networks, the mobility of the sensor nodes becomes essential in various applications. During node mobility, there are possibilities for the malicious node to become the cluster head or cluster member. This causes the cluster or the whole network to be controlled by the malicious nodes. To offer high level of security, the mobile sensor nodes need to be authenticated. Further, clustering of nodes improves scalability, energy efficient routing and data delivery. In this paper, we propose a cluster based secure dynamic keying technique to authenticate the nodes during mobility. The nodes with high configuration are chosen as cluster heads based on the weight value which is estimated using parameters such as the node degree, average distance, node's average speed, and virtual battery power. The keys are dynamically generated and used for providing security. Even the keys are compromised by the attackers, they are not able to use the previous keys to cheat or disuse the authenticated nodes. In addition, a bidirectional malicious node detection technique is employed which eliminates the malicious node from the network. By simulation, it is proved that the proposed technique provides efficient security with reduced energy consumption during node mobility.

Security Enhancement of Robust User Authentication Framework for Wireless Sensor Networks

In order to relvedy the security weaknesses of a robust user authentication framework for wireless sensor networks, an enhanced user authentication framework is presented. The enhanced scheme requires proof of the possession of both a password and a snort card, and provides more security guarantees in two aspects： 1） it addresses the untmceability property so that any third party accessing the communication channel cannot link two authentication sessions originated from the same user, and 2） the use of a smart card prevents offiine attacks to guess passwords. The security and efficiency analyses indicate that our enhanced scheme provides the highest level of security at reasonable computational costs. Therefore, it is a practical authentication scheme with attractive security features for wireless sensor networks.

A multipath routing protocol for wireless sensor network for mine security monitoring

Underground mining is a hazardous industrial activity. In order to provide a safe working environment for miners, a Wireless Sensor Network (WSN) technology has been used for security monitoring. It can provide a wide range of surveillance with a relatively low cost. In this study, an Energy-Based Multipath Routing (EBMR) protocol is proposed, which considers residual energy capacity and link quality in choosing hops and routing paths. Hops and paths with a high residual energy capacity and link quality will have the best chance to be selected to transmit data packages. Since the EBMR stores several routes in the routing table, when the current path fails, another path will be chosen to fulfill the task immediately. In this way, EBMR improves reliability and decrease time latency. Compared to AOMDV and REAR, EBMR decreases time latency by 51% and 12%.

EKAES:AN EFFICIENT KEY AGREEMENT AND ENCRYPTION SCHEME FOR WIRELESS SENSOR NETWORKS

Wireless sensor networks are being deployed for some practical applications and their se-curity has received considerable attention.It is an important challenge to find out suitable keyagreement and encryption scheme for wireless sensor networks due to limitations of the power,com-putation capability and storage resources.In this paper,an efficient key agreement and encryptionscheme for wireless sensor networks is presented.Results of analysis and simulations among the pro-posed scheme and other schemes show that the proposed scheme has some advantages in terms ofenergy consumption,computation requirement,storage requirement and security.

AN ACCURATE PREDICTION MODEL FOR COMPUTATIONAL OVERHEADS OF SECURITY MECHANISMS IN WIRELESS SENSOR NETWORKS

In Wireless Sensor Networks (WSNs), it is necessary to predict computational overheads of security mechanisms without final implementations to provide guidelines for system design. This paper presents an accurate and flexible model to predict overheads of these mechanisms. This model is based on overheads of basic operations frequently used in cryptography algorithms, which are essential elements of security mechanisms. Several popular cryptography algorithms and security mechanisms are evaluated using this model. According to simulation results, relative prediction errors are less than 7% for most cryptography algorithms and security mechanisms.

WAPN:a distributed wormhole attack detection approach for wireless sensor networks

As the applications of wireless sensor networks(WSNs) diversify,providing secure communication is emerging as a critical requirement. In this paper,we investigate the detection of wormhole attack,a serious security issue for WSNs. Wormhole attack is difficult to detect and prevent,as it can work without compromising sensor nodes or breaching the encryption key. We present a wormhole attack detection approach based on the probability distribution of the neighboring-node-number,WAPN,which helps the sensor nodes to judge distributively whether a wormhole attack is taking place and whether they are in the in-fluencing area of the attack. WAPN can be easily implemented in resource-constrained WSNs without any additional requirements,such as node localization,tight synchronization,or directional antennas. WAPN uses the neighboring-node-number as the judging criterion,since a wormhole usually results in a significant increase of the neighboring-node-number due to the extra attacking link. Firstly,we model the distribution of the neighboring-node-number in the form of a Bernoulli distribution. Then the model is simplified to meet the sensor nodes' constraints in computing and memory capacity. Finally,we propose a simple method to obtain the threshold number,which is used to detect the existence of a wormhole. Simulation results show that WAPN is effective under the conditions of different network topologies and wormhole parameters.