一种无线传感器网络节点故障的检测方法

To reduce excessive computing and communication loads of traditional fault detection methods, a neighbor-data analysis based node fault detection method is proposed. First, historical data is analyzed to confirm the confidence level of sensor nodes. Then a nodes reading data is compared with neighbor nodes which are of good confidence level. Decision can be made whether this node is a failure or not. Simulation shows this method has good effect on fault detection accuracy and transient fault tolerance, and never transfers communication and computing overloading to sensor nodes.     

A Zone-Based Node Replica Detection Scheme for Wireless Sensor Networks

Wireless sensor networks (WSN) are susceptible to various kinds of attack, and node replication attack is one of them. It is considered to be one of the most serious attacks in WSN. In this type of attack, an adversary deploys clones of a legitimate node. These clones participate in all network activities and behave identically same as the legitimate node. Therefore, detection of clones in the network is a challenging task. Most of the work reported in the literature for clone detection is location dependent. In this paper, we have proposed a location independent zone-based node replica detection technique. In the proposed scheme, the network is dynamically divided into a number of zones. Each zone has a zone-leader, and they share their membership list among themselves. It is the responsibility of the zone-leader to detect the clone. The proposed technique is a deterministic one. We have compared our scheme with LSM, RED, and P-MPC and observed that it has a higher clone detection probability and a lower communication cost.     

A Tracking-Assisted Routing Scheme for Wireless Sensor Networks

Wireless sensor networks (WSNs) offer much promise for target tracking and environmental monitoring. While many WSN routing protocols have been proposed to date, most of these focus on the mobility of observers and assume that targets are fixed. However, in reality, many applications require for sensing data to be propagated from multiple mobile targets to multiple mobile observers. In addition, WSNs often operate under strict energy constraints, and therefore reducing energy dissipation is also an important issue. In this paper, we present a grid-based routing scheme known as TRENS. First, we address the issue of the WSN comprising multiple mobile targets and observers—with TRENS being the first scheme of its kind to use tracking technology to increase the efficiency of routing procedures in the context of dynamic topology. Next, we introduce a shortcutting approach to resolve energy issues by optimizing routing paths and thus decreasing communication costs and latency. Finally, we conduct extensive simulations to show how TRENS conserves energy and performs better than other grid-based schemes.     

Data Fault Detection in Wireless Sensor Networks Using Machine Learning Techniques

Wireless Personal Communications - Wireless Sensor Network (WSN) is a wireless network that consists of spatially distributed autonomous devices with sophisticated subsystem called sensors to...     

一种高效的无线传感器网络MAC层方案

媒体接入控制协议(MAC)是影响无线传感器网络能量效率的重要方面,SMAC是其中具有代表性的方案。SMAC无法实现调度表的全网同步,只能形成多个在局部范围内同步的簇,簇间边界节点相对于内部节点能量消耗要快。针对这一问题提出了一种改进的MAC方案,利用调度表的全网同步来实现簇的合并,消除了边界节点,提高了MAC层的能量效率,使网络连通性得到提高。仿真证明了方案的有效性和可扩展性。本方案同时满足无线传感器网络分布式和经济性的要求。     

Blind Adaptive Weighted Aggregation Scheme for Event Detection in Multihop Wireless Sensor Networks

The problem of decision fusion for event detection in Wireless Sensor Networks is the prime focus of this paper. Our proposed algorithm focuses on single hop (star) and multihop (tree) topologies, which are commonly deployed wireless sensor network topologies. In order to minimize the overall energy consumption in the network, a transmission constraint of one-bit is imposed on each sensor node. This poses a challenging problem of designing a one-bit decision fusion rule at every fusion center, which improves the overall detection accuracy at the sink node. The absence of apriori knowledge of each sensor’s local performance indices, makes the existing optimum fusion rule infeasible. Moreover, in the absence of a training sequence of true event occurrences, existing Adaptive distributed detection techniques also become inapplicable. In this setup, the key contribution of this paper is a Least Mean Squares based Blind Adaptive Weighted Aggregation Scheme (Blind-AdWAS) for Wireless Sensor Networks with tree topology. We extend our earlier work (Jagyasi et al. in Proceedings of 11th international symposium on wireless personal multimedia communication, 2008) to include an analysis of the effect of Rayleigh flat fading channel on Blind-AdWAS in comparison with existing channel-aware optimum and sub- optimum aggregation schemes. Even in the absence of any channel knowledge or knowledge of performance indices, Blind-AdWAS demonstrates robustness in event detection performance.     

Adaptive Power Control Scheme for Mobile Wireless Sensor Networks

Wireless Personal Communications - One of the major factors that affects the performance of wireless sensor networks (WSN) is its limited battery capacity. Mobile wireless sensor networks (MWSN)...     

一种有效的无线传感器网络密钥协商方案

 针对无线传感器网络能量、计算能力、存储空间以及带宽等局限性问题,提出了一种适合无线传感器网络的密钥协商方案EKASFWSN(Efficient Key Agreement Scheme for Wireless Sensor Networks).该方案首先运用身份加密(IBE)算法预置网络系统参数并通过计算获得节点的相关参数;然后节点使用组播技术向邻居节点广播其ID号并利用Diffie-Hellman密钥交换技术和IBE算法安全地交换节点间的相关参数、计算节点的密钥;最后利用计算获得的节点间共享密钥使用对称密码方法对网络消息进行加、解密.与目前在WSNS研究中比较流行的传统网络密钥协商方案进行的理论分析和仿真实验,结果表明:EKASFWSN方案较好的解决了无线传感器网络在计算能力、能量、存储空间和带宽等方面的局限性问题;并通过密钥交换和身份加密等技术提高了节点通信的安全.     

A Two-Layer Key Establishment Scheme for Wireless Sensor Networks

In a large scale sensor network, it is infeasible to assign a unique Transport Layer Key (TLK) for each pair of nodes to provide the end-to-end security due to the huge memory cost per node. Thus, conventional key establishment schemes follow a key predistribution approach to establish a Link Layer Key (LLK) infrastructure between neighboring nodes and rely on multihop paths to provide the end-to-end security. Their drawbacks include vulnerability to the node compromise attack, large memory cost, and energy inefficiency in the key establishment between neighboring nodes. In this paper, we propose a novel key establishment scheme, called LAKE, for sensor networks. LAKE uses a t-degree trivariate symmetric polynomial to facilitate the establishment of both TLKs and LLKs between sensor nodes in a two-dimensional space, where each node can calculate direct TLKs and LLKs with some logically neighboring nodes and rely on those nodes to negotiate indirect TLKs and LLKs with other nodes. Any two end nodes can negotiate a TLK on demand directly or with the help of only one intermediate node, which can be determined in advance. As for the LLK establishment, LAKE is more secure under the node compromise attack with much less memory cost than conventional solutions. Due to the location-based deployment, LAKE is also energy efficient in that each node has direct LLKs with most neighbors without spending too much energy on the establishment of indirect LLKs with neighbors through multihop routing.     

A Hybrid Trust Management Scheme for Wireless Sensor Networks

Wireless sensor network (WSN) consists of wireless small sensor nodes deployed in the terrain for continuous observation of physical or environmental conditions. The data collected from the WSN is used for making decisions. The condition for making critical decision is to assure the trustworthiness of the data generated from sensor nodes. However, the approaches for scoring the sensed data alone is not enough in WSN since there is an interdependency between node and data item. If the overall trust score of the network is based on one trust component, then the network might be misguided. In this work, we propose the hybrid approach to address the issue by assigning the trust score to data items and sensor nodes based on data quality and communication trust respectively. The proposed hybrid trust management scheme (HTMS) detects the data fault with the help of temporal and spatial correlations. The correlation metric and provenance data are used to score the sensed data. The data trust score is utilized for making decision. The communication trust and provenance data are used to evaluate the trust score of intermediate nodes and source node. If the data item is reliable enough to make critical decisions, a reward is given by means of adding trust score to the intermediate nodes and source node. A punishment is given by reducing the trust score of the source and intermediate nodes, if the data item is not reliable enough to make critical decisions. Result shows that the proposed HTMS detects the malicious, faulty, selfish node and untrustworthy data.     

一种基于ID的传感器网络密钥管理方案

对偶密钥的建立是无线传感器网络的安全基础,它使得节点之间能够进行安全通信。但是由于节点资源的限制,传统的密钥管理方法在传感器网络中并不适用。在分析了现有密钥预分配协议的前提下,该文提出一种新的基于ID的密钥预分配协议。此协议用计算和比较散列值的方式替代广播方式协商密钥,减少了传感器节点大量的通信消耗。然后,分析了所提出方案的安全性、通信量和计算量,并和已有协议进行了比较。结果表明本文的方法不仅能保证安全性,而且节约了大量通信资源。     

一种无状态的传感器网络密钥预分配方案

 在无线传感器网络中,节点被敌方捕获以后将泄露节点内存储的群组密钥等秘密信息,所以需要建立一种安全高效的群组密钥管理系统来及时对被捕获节点进行撤销,以保证无线传感器网络中群组通信的安全.提出一种基于逻辑密钥树结构的密钥预分配方案,群组控制者和密钥服务器(GCKS)为逻辑密钥树中每一逻辑节点分配一个密钥集,每一sensor节点对应一个叶节点,以及一条从该叶节点到根节点的路径,GCKS将该路径上所有节点的密钥植入sensor节点.节点撤销时,GCKS将逻辑密钥树分成互不相连的子树,利用子树中sensor节点的共享密钥进行群组密钥的更新.分析表明本方案满足无状态性,以及正确性、群组密钥保密性、前向保密性和后向保密性等安全性质,具有较低的存储、通信和计算开销,适用于无线传感器网络环境.     

Choice of Detection Parameters on Fault Detection in Wireless Sensor Networks: A Multiobjective Optimization Approach

In this paper, the intermittent fault detection in wireless sensor networks is formulated as an optimization problem and a recently introduced multiobjective swarm optimization (2LB-MOPSO) algorithm is used to find an optimum trade-off between detection accuracy and detection latency. Faulty sensor nodes are identified based on comparisons of sensed data between one-hop neighboring nodes. Time redundancy is used to detect intermittent faults since an intermittent fault does not occur consistently. Simulation and analytical results show that sensor nodes with permanent faults are identified with high accuracy and by properly choosing the inter-test interval most of the intermittent faults are isolated with negligible performance degradation.     

Energy Proficient Hybrid Secure Scheme for Wireless Sensor Networks

Wireless Personal Communications - One way hash chain with a new key indicating the performance of the node as well to isolate malicious nodes from the network. Public key cryptography is derived...     

A Distributed Node Localization Scheme for Wireless Sensor Networks

A distributed node localization scheme for wireless sensor networks (WSNs) is presented in this paper, and it includes three generic phases: (1) determine node-beacon distances, (2) compute node positions, and (3) refine the positions. Different from previous researches, we propose an algorithm combination Min–max + LI for the position derivation and SD method for the refinement in our scheme. Simulation shows that our proposed scheme can perform more robust than some representative distributed node localization schemes presented in previous researches in terms of the trade-off among accuracy, coverage, computation cost, and communication overhead.     

一种基于位置的WSN密钥管理方案

针对当前无线传感器网络（WSN）随机密钥预分布方案中网络只能概率连通且密钥不能作为认证的问题，文中提出了一种基于节点位置的密钥管理方案LBK-KMS，文中详细介绍LBK-KMS方案的建立过程；并从安全抵抗性，网络连通性，扩展性以及通信计算性能等方面与E-G以及q-Composite方案进行了比较分析；最后探讨了下一步可研究的工作．     

无线传感器网络的多空间密钥预分配方案

针对无线传感器网络的安全性要求,分析R.Blom的密钥预分配方案,并在此基础上做出改进,提出了多空间密钥预分配方案:为无线传感器网络中的每一个传感器节点构建多个密钥空间,并通过节点间的共同密钥空间使每个节点对之间都形成一个成对密钥。通过仿真实验测试该方案的安全性,实验结果认为该方案对于该方案对节点捕获攻击具有较高的弹性。     

EFT: Novel Fault Tolerant Management Framework for Wireless Sensor Networks

Wireless Personal Communications - The main application of wireless sensor networks is monitoring, and the nodes of these networks are located usually in harsh environments. Network management is...