A secure and efficient data aggregation scheme for wireless sensor networks

In resource‐constrained wireless sensor networks, data aggregation is a key technique for power‐efficient information acquisition. Consequently, the intermediate sensor nodes performing aggregation tasks known as aggregators are valuable and attractive targets for attackers. We address the problem of defending against malicious adversaries who intend to stealthily change some aggregates to entice the base station to accept deceiving results. A secure and efficient aggregation scheme is proposed, in which the base station composes a secret configuration matrix and each sensor node is pre‐loaded with a limited part of the matrix known as a secret share containing certain local instructions. For each aggregation session, a set of scrambled aggregates are constructed in such a manner that there exists a secret yet unrevealed relationship between these values. The base station, aware of the relationship derived from the configuration matrix, can both extract the intended result from the received aggregates and verify it on its own. Our scheme avoids the interactive verification phase which existent protocols typically take to ensure the aggregation integrity, and thus observably lowers the communication overhead. The proposed scheme also features protection of data confidentiality, and analysis shows that it can detect stealthy alteration attacks with a significant probability. Copyright © 2010 John Wiley & Sons, Ltd.     

无线传感器网络安全路由研究综述

首先总结了无线传感器网络路由面临的主要安全威胁及其应对机制;然后根据协议所采用的核心安全策略对现有的安全路由协议进行了归纳、分类和比较,并着重对国内外重要的安全路由协议进行了介绍和分析。最后提出了几个无线传感器网络安全路由中需要进一步研究的问题。     

A color-theory-based energy efficient routing algorithm for mobile wireless sensor networks

Wireless sensor networks (WSNs) with nodes spreading in a target area have abilities of sensing, computing, and communication. Since the GPS device is expensive, we used a small number of fixed anchor nodes that are aware of their locations to help estimate the locations of sensor nodes in WSNs. To efficiently route sensed data to the destination (the server), identifying the location of each sensor node can be of great help. We adopted a range-free color-theory based dynamic localization (CDL) [Shen-Hai Shee, Kuochen Wang, I.L. Hsieh, Color-theory-based dynamic localization in mobile wireless sensor networks, in: Proceedings of Workshop on Wireless, Ad Hoc, Sensor Networks, August 2005] approach, to help identify the location of each sensor node. Since sensor nodes are battery-powered, we propose an efficient color-theory-based energy efficient routing (CEER) algorithm to prolong the life time of each sensor node. The uniqueness of our approach is that by comparing the associated RGB values among neighboring nodes, we can efficiently choose a better routing path with energy awareness. Besides, the CEER has no topology hole problem. Simulation results have shown that our CEER algorithm can save up to 50–60% energy than ESDSR [Mohammed Tarique, Kemal E. Tepe, Mohammad Naserian, Energy saving dynamic source routing for ad hoc wireless networks, in: Proceedings of Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, April 2005, pp. 305–310] in mobile wireless sensor networks. In addition, the latency per packet of CEER is 50% less than that of ESDSR.     

A gradient based routing scheme for street lighting wireless sensor networks

Routing for wireless sensor networks based on gradient is a simple, reliable solution resulting in low information costs for the network package, as well as for the node itself. It is used for convergent traffic, where sensor nodes send messages to the sink node. Due to message transmission failures inherent to wireless sensor networks, researches in this area agree that point-to-point message confirmation in these networks is essential. This work proposes solutions for gradient-based routing using a confirmation mechanism for different neighbors, where four protocol variations are evaluated for sensor networks applications in order to monitor and control electrical variables. Results demonstrate that the protocol based on the longest distance has a satisfactory package delivery rate in severe conditions specified to the application. Furthermore, results show in which situations each routing protocol variation better suits the target application.     

一种新的支持移动Sink的多媒体传感器网络路由协议

提出了一种新的支持移动Sink的多媒体传感器网络路由协议,该协议利用锚节点作为转发节点与移动Sink进行通信,避免多媒体传感器节点与Sink直接进行远距离通信,在多媒体传感器节点中采用改进的基于地理信息的路由协议建立路由路径.仿真实验表明:该协议不仅能支持移动Sink,而且能够有效降低节点能耗,延长网络寿命,提高数据传...     

Effective fault detection and routing scheme for wireless sensor networks

In a wireless sensor network (WSN), random occurrences of faulty nodes degrade the quality of service of the network. In this paper, we propose an efficient fault detection and routing (EFDR) scheme to manage a large size WSN. The faulty nodes are detected by neighbour node’s temporal and spatial correlation of sensing information and heart beat message passed by the cluster head. In EFDR scheme, three linear cellular automata (CA) are used to manage transmitter circuit/ battery condition/microcontroller fault, receiver circuit fault and sensor circuit fault representation. On the other hand, L-system rules based data routing scheme is proposed to determine optimal routing path between cluster head and base station. The proposed EFDR technique is capable of detecting and managing the faulty nodes in an efficient manner. The simulation results show 86% improvement in the rate of energy loss compared to an existing algorithm.     

A cluster-tree-based energy-efficient routing protocol for wireless sensor networks with a mobile sink

The Journal of Supercomputing - With the rapid development of the Internet of Things technology, wireless sensor networks as the core technique have been applied in military, precision agriculture,...     

Rendezvous based routing protocol for wireless sensor networks with mobile sink

In wireless sensor networks, the sensor nodes find the route towards the sink to transmit data. Data transmission happens either directly to the sink node or through the intermediate nodes. As the sensor node has limited energy, it is very important to develop efficient routing technique to prolong network life time. In this paper we proposed rendezvous-based routing protocol, which creates a rendezvous region in the middle of the network and constructs a tree within that region. There are two different modes of data transmission in the proposed protocol. In Method 1, the tree is directed towards the sink and the source node transmits the data to the sink via this tree, whereas in Method 2, the sink transmits its location to the tree, and the source node gets the sink’s location from the tree and transmits the data directly to the sink. The proposed protocol is validated through experiment and compared with the existing protocols using some metrics such as packet delivery ratio, energy consumption, end-to-end latency, network life time.     

一种无线传感器网络匿名安全路由协议*

为了能在有限资源的无线传感器网络上进行安全的匿名通信,使用双线性函数的双线性对和异或运算提出了一种匿名安全路由协议,与目前现有的无线网络匿名通信方案相比,协议不仅能提供身份的机密性、位置隐私性和路由的匿名性,而且还满足前向和后向安全性,并且大大提高了系统的计算复杂度和带宽消耗,更适合无线传感器网络。     

无线传感器网络中基于位置信息的路由算法研究

为了保证移动无线传感器网络中数据的高效稳定传输,提出了一种基于地理位置信息支持多个移动sink的路由算法.该算法将监测区域分成一个固定不变的规则网格网络,并对网格簇头节点的选举方法进行了改进;通过数据的冗余传递和搜索框、候选转发节点集合的设置保证了数据传送的可靠性与时延性;同时容忍圆的引入保证了低功耗的要求.仿真结果表明,该算法较两层数据分发协议有更高的传输可靠性和较低的功耗.     

A secure and robust temporal credential-based three-factor user authentication scheme for wireless sensor networks

User authentication is one of the most important security services required for the resource-constrained wireless sensor networks (WSNs). In user authentication, for critical applications of WSNs, a legitimate user is allowed to query and collect the real-time data at any time from a sensor node of the network as and when he/she demands for it. In order to get the real-time information from the nodes, the user needs to be first authenticated by the nodes as well as the gateway node (GWN) of WSN so that illegal access to nodes do not happen in the network. Recently, Jiang et al. proposed an efficient two-factor user authentication scheme with unlinkability property in WSNs Jiang (2014). In this paper, we analyze Jiang et al.’s scheme. Unfortunately, we point out that Jiang et al.’s scheme has still several drawbacks such as (1) it fails to protect privileged insider attack, (2) inefficient registration phase for the sensor nodes, (3) it fails to provide proper authentication in login and authentication phase, (4) it fails to update properly the new changed password of a user in the password update phase, (5) it lacks of supporting dynamic sensor node addition after initial deployment of nodes in the network, and (6) it lacks the formal security verification. In order to withstand these pitfalls found in Jiang et al.’s scheme, we aim to propose a three-factor user authentication scheme for WSNs. Our scheme preserves the original merits of Jiang et al.’s scheme. Our scheme is efficient as compared to Jiang et al.’s scheme and other schemes. Furthermore, our scheme provides better security features and higher security level than other schemes. In addition, we simulate our scheme for the formal security analysis using the widely-accepted AVISPA (Automated Validation of Internet Security Protocols and Applications) tool. The simulation results clearly demonstrate that our scheme is also secure.     

A secure alternate path routing in sensor networks

This paper presents a secure alternate path routing in sensor networks. Our alternate path scheme makes the routing protocol resilient in the presence of malicious nodes that launch selective forwarding attacks. SeRINS (a Secure alternate path Routing IN Sensor networks) detects and isolates the compromised nodes, which try to inject inconsistent routing information, from the network by neighbor report system. In neighbor report system, a node’s route advertisement is verified by its surrounding neighbor nodes so that the suspect node is reported to the base station and is excluded from the network. Simulation experiments show that SeRINS is resilient in the presence of several compromised nodes which launch selective forwarding attacks, and robust by excluding the compromised nodes which inject inconsistent routing information from the network.     

Energy-efficient routing for mobile data collectors in wireless sensor networks with obstacles

This paper proposes an energy-efficient routing mechanism by introducing intentional mobility to wireless sensor networks (WSNs) with obstacles. In the sensing field, Mobile Data Collectors (MDCs) can freely move for collecting data from sensors. An MDC begins its periodical movement from the base station and finally returns and transports the data to the base station. In physical environments, the sensing field may contain various obstacles. A research challenge is how to find an obstacle-avoiding shortest tour for the MDC. Firstly, we obtain the same size grid cells by dividing the network region. Secondly, according to the line sweep technique, the spanning graph is easily constructed. The spanning graph composed of some grid cells usually includes the shortest search path for the MDC. Then, based on the spanning graph, we can construct a complete graph by Warshall-Floyd algorithm. Finally, we present a heuristic tour-planning algorithm on the basis of the complete graph. Through simulation, the validity of our method is verified. This paper contributes in providing an energy-efficient routing mechanism for the WSNs with obstacles.     

Robust and secure routing scheme for wireless multihop network

Mobile ad hoc network (MANET) is an appealing technology that has attracted lots of research efforts. On-demand routing protocol such as AODV may suffer from frequent topological changes. Due to frequent communication failures, multipath MANET is preferred than single-path MANET in many applications as former is used for achieving robustness and load balancing and improving reliability. Although multipath MANET is attractive solution, there are still some major flaws that prevent commercial growth. Security is one of these main barriers; MANETs are known to be particularly vulnerable to security attack. The paper presents a design of robust and secure framework for multipath MANET. In this paper, we propose not only a robust multipath routing protocol but also an extended security scheme. We discuss security analysis for proposed security scheme. And we also conduct simulation to evaluate such a framework through different performance metrics. Results show that the proposed routing protocol achieves better performance in terms of various metrics than other protocols.     

A chain-cluster based routing algorithm for wireless sensor networks

Wireless sensor networks (WSNs) are an emerging technology for monitoring physical world. Different from the traditional wireless networks and ad hoc networks, the energy constraint of WSNs makes energy saving become the most important goal of various routing algorithms. For this purpose, a cluster based routing algorithm LEACH (low energy adaptive clustering hierarchy) has been proposed to organize a sensor network into a set of clusters so that the energy consumption can be evenly distributed among all the sensor nodes. Periodical cluster head voting in LEACH, however, consumes non-negligible energy and other resources. While another chain-based algorithm PEGASIS (power- efficient gathering in sensor information systems) can reduce such energy consumption, it causes a longer delay for data transmission. In this paper, we propose a routing algorithm called CCM (Chain-Cluster based Mixed routing), which makes full use of the advantages of LEACH and PEGASIS, and provide improved performance. It divides a WSN into a few chains and runs in two stages. In the first stage, sensor nodes in each chain transmit data to their own chain head node in parallel, using an improved chain routing protocol. In the second stage, all chain head nodes group as a cluster in a self- organized manner, where they transmit fused data to a voted cluster head using the cluster based routing. Experimental results demonstrate that our CCM algorithm outperforms both LEACH and PEGASIS in terms of the product of consumed energy and delay, weighting the overall performance of both energy consumption and transmission delay.     

一种基于DPSO的无线传感器网络QoS路由算法

针对无线传感器网络中不同业务对服务质量(QoS)的不同需求,提出一种基于离散粒子群优化(DPSO)的无线传感器网络QoS路由(DPSO-QR)算法。算法将路由建立过程抽象为多目标优化过程,以节点间通信的传播损耗、时延、带宽、丢包率为优化目标,利用DPSO算法实现多目标优化,为拥有不同QoS需求的网络业务提供满足其特有需求的优化路由。仿真实验表明:与SAR,EQR算法相比,DPSO-QR算法降低了网络平均端到端时延,减小了丢包率,延长了网络寿命。     

一种基于LEACH协议的无线传感器网络路由算法

无线传感器网络路由技术是当今国内外研究的重点和热点,其设计的首要目标是提高能量有效性,延长网络生命周期。结合前人研究的成果,针对特定的网络应用环境,对LEACH协议路由算法的进行了改进。理论分析及仿真结果表明,改进后的路由算法比原LEACH协议路由算法系统整体能耗降低,网络生命周期和吞吐量显著提高,并且网络扩展性能更好。这对于可靠性有特殊要求的应用场合具有一定的实用价值。     

水下无线传感网络中一种地理-机会的混合路由

为了提高水下无线传感网络(UWSNs)的数据采集效率,提出基于地理-机会的水下无线传感网的混合路由(GOHR)。当源节点需要转发数据包时,首先计算候选转发节点集,并依据集内节点的归一化权重进行排序,形成转发簇;然后分析每个簇的期望权重值;最终由最大期望权重值的簇内节点转发数据包。同时,引用时延机制,抑制冗余数据包。仿真结果表明,提出的GOHR协议提高了数据包传递率,降低了数据包传输时延。     

A survey on event-driven and query-driven hierarchical routing protocols for mobile sink-based wireless sensor networks

The Journal of Supercomputing - The sink mobility in wireless sensor networks (WSNs) brings new challenges specifically while designing the routing protocols. The advertisement of the mobile sink...