基于LKH混合树模型的新型组播密钥更新方案

安全组播是组播技术走向实用化必须解决的问题。在组成员动态变化时,设计一个高效的密钥管理方案是安全组播研究的主要问题。提出了一种基于新型混合树模型的组播密钥更新方案。该方案将GC的存储开销减小为4,同时,在成员加入或离开组时,由密钥更新引起的通信开销与nm保持对数关系(n为组成员数,m为每一族包含的成员数)。     

Self-healing group-wise key distribution schemes with time-limited node revocation for wireless sensor networks

In this article two novel group-wise key distribution schemes with time-limited node revocation are introduced for secure group communications in wireless sensor networks. The proposed key distribution schemes are based on two different hash chain structures, dual directional hash chain and hash binary tree. Their salient security properties include self-healing rekeying message distribution, which features a periodic one-way rekeying function with efficient tolerance for lost rekeying messages; and time-limited dynamic node attachment and detachment. Security evaluation shows that the proposed key distribution schemes generally satisfy the requirement of group communications in WSNs with lightweight communication and computation overhead, and are robust under poor communication channel quality.     

Multi‐path routing scheme for non‐interactive multicast communications

This paper proposes a multicast routing algorithm that makes use of multiple node‐disjoint distribution trees for its routing from the source to the multicast group members. The specialty of this scheme is that the different packets of a message between a source and destinations are routed through node‐disjoint paths to provide reliable and secure multicast communication. In this proposed routing scheme the computation of the node‐disjoint path for packet routing is done either at a centralized route moderator or in a distributed fashion at all destinations in order to avoid single point failure. An effective provision is made to enable new members to join the existing multicast trees and to prune leaving members. The performance parameters of the proposed reliable and secure multi‐path routing scheme are studied under various network conditions using GloMoSim. Copyright © 2006 John Wiley & Sons, Ltd.     

Topological Key Hierarchy for Energy-Efficient Group Key Management in Wireless Sensor Networks

A sensor network operating in open environments requires a network-wide group key for confidentiality of exchanged messages between sensor nodes. When a node behaves abnormally due to its malfunction or a compromise attack by adversaries, the central sink node should update the group key of other nodes. The major concern of this group key update procedure will be the multi-hop communication overheads of the rekeying messages due to the energy constraints of sensor nodes. Many researchers have tried to reduce the number of rekeying messages by using the logical key tree. In this paper, we propose an energy-efficient group key management scheme called Topological Key Hierarchy (TKH). TKH generates a key tree by using the underlying sensor network topology with consideration of subtree-based key tree separation and wireless multicast advantage. Based on our detailed analysis and simulation study, we compare the total rekeying costs of our scheme with the previous logical key tree schemes and demonstrate its energy efficiency.     

Froms: A failure tolerant and mobility enabled multicast routing paradigm with reinforcement learning for WSNs

A growing class of wireless sensor network (WSN) applications require the use of sensed data inside the network at multiple, possibly mobile base stations. Standard WSN routing techniques that move data from multiple sources to a single, fixed base station are not applicable, motivating new solutions that efficiently achieve multicast and handle mobility. This paper explores in depth the requirements of this set of application scenarios and proposes Froms, a machine learning-based multicast routing paradigm. Its primary benefits are flexibility to optimize routing over a variety of properties such as route length, battery levels, ease of recovery after node failures, and native support for sink mobility. We provide theoretical, simulation and experimentation results supporting these claims, showing the benefits of Froms in terms of low routing overhead, extended network lifetime, and other key metrics for the WSN environment.     

Wireless Sensor Network Path Optimization Using Sensor Node Coverage Area Calculation Approach

The proposed work is based on the path optimization approach for wireless sensor network (WSN). Path optimization is achieved by using the NSG 2.1 Tool, TCL Script file and NS2 simulator to improve the quality of service (QoS). Path optimization approach finds best suitable path between sensor nodes of WSN. The routing approach is not only the solution to improve the quality but also improves the WSN performance. The node cardinally is taken under consideration using the ad-hoc on demand distance vector routing protocol mechanism. Ad hoc approach emphasize on sensor nodes coverage area performance along with simulation time. NSG 2.1 Tool calculates the sensor node packet data delivery speed which can facilitate inter-node communication successfully. An experimental result verified that the proposed design is the best possible method which can escape from slow network response while covering maximum sensor nodes. It achieves coverage support in sensor node deployment. The result outcomes show best path for transferring packet from one sensor node to another node. The coverage area of sensor node gives the percentage of average coverage ratio of each node with respect to the simulation time.

     

传感器网络簇间通信自适应节能路由优化算法

提出了一种用于无线传感器网络簇间通信的自适应节能路由优化算法。网络中以总体通信能耗最小为首要原则建立端到端之间的路由,并对簇间通信提出了一种优化算法,使得簇首之间相互通信时,可以在直接、中继以及协作3种不同方式中自适应地选择最节能的通信方式。所提出的路由算法可确保源节点与基站通信过程中选择到最优或次优的节能路由,并可降低由于通信覆盖盲区造成的通信中断的概率。仿真结果表明,与其他传感器网络路由算法相比,所提出的路由算法在相同吞吐量和误码率前提下每一轮都消耗更少的能量,并且在不同的节点密度下都可有效地延长网络的生命周期和工作时间。     

传感器网络中基于三元多项式的密钥管理方案

提出一种新的密钥管理方案KMTP(key management based on ternary polynomial)。基站为每个节点建立唯一性标识,保证节点合法性;基于三元多项式设计簇内和簇间密钥预分配算法,可以保证秘密多项式的破解门限值分别大于簇内节点和分簇总数,理论上难以破解;通过构造安全连通邻接表,设计簇间多跳路由选择算法,保证通信阶段的安全;引入更新参数和更新认证数,保证密钥更新阶段的安全。仿真表明,相比已有方案,KMTP开销较小,且能够提供更高的安全性。     

一种改进的TLCH组播密钥管理方案

TLCH协议是一个适用于安全组播通信且可扩展性较好的组播密钥管理协议。它基于LKH的思想,采用双层的控制者的层次结构,并使用单向函数进行密钥更新,达到了较低的计算开销。使用hash函数对TLCH组播密钥管理方案中成员加入时的密钥更新算法进行改进。与原来的TLCH相比,改进后的TLCH可以进一步降低了通信开销。     

Secure and Energy-Efficient Traffic-Aware Key Management Scheme for Wireless Sensor Network

In Wireless Sensor Network (WSN), a sensor node may communicate with a small set of neighbor sensor nodes. Existing key management schemes, did not consider this communication between these nodes. They establish shared keys for all pairs of neighbor sensor nodes. When the number of sensor nodes in WSN is augmented, large number of keys is to be loaded in each sensor node, which in turn causes supplementary energy consumption. If any two close sensor nodes are seldom in the active-state the assignment of shared keys may be gratuitous, since they may be hardly exploited.In this paper, based on this information, secure and Energy-Efficient Traffic Aware key Management (EETKM) is developed for WSN. This determines shared keys for active sensors which takes part in the direct communication. In order to broadcast keys without retransmission or acknowledgements, the proposed scheme gives an efficient Re-keying mechanism. The proposed scheme attains high connectivity which is shown through numerical results. The proposed scheme is applied for various routing protocols and the simulation results shows the stronger resilience, low energy consumption and increased delivery ratio.     

A Cognitive Energy Efficient and Trusted Routing Model for the Security of Wireless Sensor Networks: CEMT

There are many smart applications evolved in the area of the wireless sensor networks. The applications of WSNs are exponentially increasing every year which creates a lot of security challenges that need to be addressed to safeguard the devices in WSN. Due to the dynamic characteristics of these resource constrained devices in WSN, there must be high level security requirements to be considered to create a high secure environments. This paper presents an efficient multi attribute based routing algorithm to provide secure routing of information for WSNs. The work proposed in this paper can decrease the energy and enhances the performance of the network than the currently available routing algorithm such as multi-attribute pheromone ant secure routing algorithm based on reputation value and ant-colony optimization algorithm. The proposed work secures the network environment with the improved detection techniques based on nodes’ higher coincidence rates to find the malicious behavior using trust calculation algorithm. This algorithm uses some QoS parameters such as reliability rate, elapsed time to detect impersonation attacks, and stability rate for trust related attacks, to perform an efficient trust calculation of the nodes in communication. The outcome of the simulation show that the proposed method enhances the performance of the network with the improved detection rate and secure routing service.

     

CrowWhale-ETR: CrowWhale optimization algorithm for energy and trust aware multicast routing in WSN for IoT applications

WSN serves as a medium for linking the physical and information network of IoT. Energy and trust are the two major factors that facilitate reliable communication in the network. During multicast routing, the BS engages in forwarding the data securely to the multiple destinations through the intermediate nodes, which is the major challenge in IoT. The paper addresses the challenges through proposing an energy-aware multicast routing protocol based on the optimization, CrowWhale-ETR, which is the integration of CSA and WOA based on the objective function designed with the energy and trust factors of the nodes. Initially, the trust and energy of the nodes are evaluated for establishing the routes that is chosen optimally using CWOA. This optimally chosen path is used for the data transmission, in which energy and trusts of the individual nodes are updated at the end of the individual transmission, in such a way the secure nodes can be selected, and which improves the secure communication in the network. The simulation is analyzed using 50 and 100 nodes in terms of the performance measures. The proposed method acquired the minimal delay of 0.2729 and 0.3491, maximal detection rate of 0.6726, maximal energy of 66.4275 and 71.0567, and maximal throughput of 0.4625 and 0.8649 in the presence and absence of attacks with 50 nodes for analysis.

     

A Secure Key Predistribution Scheme for WSN Using Elliptic Curve Cryptography

Security in wireless sensor networks (WSNs) is an upcoming research field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a WSN, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in WSNs. To achieve security, various key predistribution schemes have been proposed in the literature. A secure key management technique in WSN is a real challenging task. In this paper, a novel approach to the above problem by making use of elliptic curve cryptography (ECC) is presented. In the proposed scheme, a seed key, which is a distinct point in an elliptic curve, is assigned to each sensor node prior to its deployment. The private key ring for each sensor node is generated using the point doubling mathematical operation over the seed key. When two nodes share a common private key, then a link is established between these two nodes. By suitably choosing the value of the prime field and key ring size, the probability of two nodes sharing the same private key could be increased. The performance is evaluated in terms of connectivity and resilience against node capture. The results show that the performance is better for the proposed scheme with ECC compared to the other basic schemes.     

无线传感器网络MAC层协议的分析比较

无线传感器网络是一种由大量廉价微型传感器节点组成,并通过无线通信方式形成的多跳自组织网络,可用于对其部署区域的某些物理量进行智能监测。由于传感器节点数目较大,MAC协议是保证无线传感器网络高效通信的关键网络协议之一。另一方面,因为传感器节点受到电源能量有限、通信能力有限、计算和存储能力有限等现实条件的限制,传感器网络中的MAC协议又具有一些独特之处。对无线传感器网络MAC协议的研究现状进行较全面的考察,分析比较其中的几种典型MAC协议,并提出了该领域的发展趋势和未来工作的一些思路。     

Research on trust sensing based secure routing mechanism for wireless sensor network

Aiming at the serious impact of the typical network attacks caused by the limited energy and the poor deployment environment of wireless sensor network (WSN) on data transmission,a trust sensing based secure routing mechanism (TSSRM) with the lightweight characteristics and the ability to resist many common attacks simultaneously was proposed.Based on the analysis of the characteristics of network attack,the trust degree calculation model was constructed by combining node’s behavior with energy,at the same time the security route selection algorithm was also optimized by taking trust degree and QoS metrics into account.Performance analysis and simulation results show that TSSRM can improve the security and effectiveness of WSN.     

Tree‐based channel assignment schemes for multi‐channel wireless sensor networks

Many sensor node platforms used for establishing wireless sensor networks (WSNs) can support multiple radio channels for wireless communication. Therefore, rather than using a single radio channel for whole network, multiple channels can be utilized in a sensor network simultaneously to decrease overall network interference, which may help increase the aggregate network throughput and decrease packet collisions and delays. This method, however, requires appropriate schemes to be used for assigning channels to nodes for multi‐channel communication in the network. Because data generated by sensor nodes are usually delivered to the sink node using routing trees, a tree‐based channel assignment scheme is a natural approach for assigning channels in a WSN. We present two fast tree‐based channel assignment schemes (called bottom up channel assignment and neighbor count‐based channel assignment) for multi‐channel WSNs. We also propose a new interference metric that is used by our algorithms in making decisions. We validated and evaluated our proposed schemes via extensive simulation experiments. Our simulation results show that our algorithms can decrease interference in a network, thereby increasing performance, and that our algorithms are good alternatives for static channel assignment in WSNs. Copyright © 2015 John Wiley & Sons, Ltd.     

DR-NAP: Data reduction strategy using neural adaptation phenomenon in wireless sensor networks

Internet of Things (IoT) has got significant popularity among the researchers' community as they have been applied in numerous application domains. Most of the IoT applications are implemented with the help of wireless sensor networks (WSNs). These WSNs use different sensor nodes with a limited battery power supply. Hence, the energy of the sensor node is considered as one of the primary constraints of WSN. Besides, data communication in WSN dissipates more energy than processing the data. In most WSNs applications, the sensed data generated from the same location sensor nodes are identical or time-series/periodical data. This redundant data transmission leads to more energy consumption. To reduce the energy consumption, a data reduction strategy using neural adaptation phenomenon (DR-NAP) has been proposed to decrease the communication energy in routing data to the BS in WSN. The neural adaptation phenomenon has been utilized for designing a simple data reduction scheme to decrease the amount of data transmitted. In this way, the sensor node energy is saved and the lifetime of the network is enhanced. The proposed approach has been implanted in the existing gravitational search algorithm (GSA)-based clustered routing for WSN. The sensed data are transmitted to CH and BS using DR-NAP. Real sensor data from the Intel Berkeley Research lab have been used for conducting the experiments. The experiment results show 47.82% and 51.96% of improvement in network lifetime when compared with GSA-based clustered routing and clustering scheme using Canada Geese Migration Principle (CS-CGMP) for routing, respectively.     

A Centralized Mechanism for Preventing DDOS Attack in Wireless Sensor Networks

Wireless sensor networks face numerous limitations. Security and Privacy are the two most essential parameters that require consideration in wireless sensor networks for conveying responsive information amid basic applications. High density and limited communication range of sensor nodes, forwarding packets in sensor networks have caused the performance of during multi-hop data transmission. Hence communication with different devices these days are not secure, due to the absence of centralized monitoring and overprotective requirements. This paper is related to speak about Distributed Denial of Service which debilitates the ability of the network and the data being transmitted. The earlier system guarantees the WSN through a self arranged and confined procedure between the nodes in the sensor environment. Here, the authors present the Centralized Detect Eliminate and Control algorithm for authorization and centralized monitoring component to discover the node that has turned into a victim node and to get rid of the information communicated to the fatality node from the neighbour nodes. Overprotective of the communication between the nodes leads to dependability. The simulation results improve the malicious node detection rate and increase the various parameters like throughput and reduce the average delay. This leads to, the overall detection rate built, eventually enhancing the parameters of the network environment.

     

基于共享路径和网络编码的光组播容量优化

为了降低光组播路由 的光域网络编码代价和提高达到理论最大光组播容量的 概率,提出一种基于共享链路和网络编 码的优化光组播容量方法。首先设计一种从多条源－ 宿最短路径中选择能达到最大光组播容量的最短路径簇,然后在 最短路径簇中计算路径的共享度,选择共享度高的组播路径传输网络编码信息,构造网络编 码次数最少的光组播编码子图, 解决传统的网络编码组 播路由和最大共享度链路组播路由中存在的网络编码次数过多和达到最大光组播容量概率过 低的问 题。仿真结果表明:本文提出的方法具有最低的网络编码代价,能以最大的概率达到光组播 理论最大容量。     

一种基于时间结构树的多播密钥管理方案

随着Internet的发展,多播通信技术得到了广泛的应用.其中组密钥管理是多播安全的核心问题.文中在分析已有研究的基础上,提出了一种基于时间结构树的密钥管理方案,采用周期性的密钥更新机制,通过安全滤波器分配新的组密钥,大大减少了密钥更新时的传输消息,提高了密钥更新的效率,实现密钥更新的可靠性.