Reliable energy-efficient routing with novel route update in wireless sensor networks

In this paper we introduce a novel energy-aware routing protocol REPU （reliable, efficient with path update）, which provides reliability and energy efficiency in data delivery. REPU utilizes the residual energy available in the nodes and the received signal strength of the nodes to identify the best possible route to the destination. Reliability is achieved by selecting a number of intermediate nodes as waypoints and the route is divided into smaller segments by the way-points. One distinct advantage of this model is that when a node on the route moves out or fails, instead of discarding the whole original route, only the two way-point nodes of the broken segment are used to find a new path. REPU outperforms traditional schemes by establishing an energy-efficient path and also takes care of efficient route maintenance. Simulation results show that this routing scheme achieves much higher performance than the classical routing protocols, even in the presence of high node density, and overcomes simultaneous packet forwarding.     

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 influencing 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.     

基于蚁群优化算法的传感器网络能量有效性覆盖机制

提出了一种解决无线传感器网络覆盖问题的能量有效性启发式机制.该机制在节能的前提下,实现了对目标监控区域的完全覆盖,且覆盖精度与目标的重要性级别成正比关系.机制的实现运用了蚁群优化算法,算法的设计过程采用了新颖的启发式因子构造方法和基于评价函数的全局信息素更新规则,由此,人工蚂蚁被赋予了对目标监控区域的覆盖状况和对传感器网络区域能量状况的自适应感知能力,并通过增加优化解集中节点上的信息素量,加速求取最优解的收敛过程.最后,蚁群在迭代优化的基础上构建出解决无线传感器网络覆盖问题的健壮优化解,该优化解能够在能量有效性的基础上具备良好的覆盖有效性和较长的生命周期.     

无线传感器网络中基于网格的能量感知路由协议研究(英文)

通过建立无线传感器网络环境中的能耗模型, 研究了高效能耗以及由路径损耗模型不同带来的数据干扰问题. 采用二维网格分簇机制, 其中簇头选举算法基于节点的剩余能量和随机退避时间, 以一种高效且分散的方式使簇头在所有传感器节点中均匀轮换. 节点除了在传输和接收数据过程中消耗能量, 在干扰重传时也需要消耗额外的能量. 根据平面几何学, 通过分析和数学推导, 得出网络的总能耗与分簇机制中的网格结构直接相关的结论, 其中簇的大小决定传输范围, 节点距离决定路径损耗指数, 网络结构决定同时传输数据的节点产生的干扰总数. 通过分析和仿真实验, 提出了在无线传感器网络中优化的网格结构和对应的网格大小, 从而在最大化降低能耗和最小化总体冲突之间达成平衡.     

Real-time localization estimator of mobile node in wireless sensor networks based on extended Kalman filter

Localization of the sensor nodes is a key supporting technology in wireless sensor networks (WSNs). In this paper, a real-time localization estimator of mobile node in WSNs based on extended Kalman filter (KF) is proposed. Mobile node movement model is analyzed and online sequential iterative method is used to compute location result. The detailed steps of mobile sensor node self-localization adopting extended Kalman filter (EKF) is designed. The simulation results show that the accuracy of the localization estimator scheme designed is better than those of maximum likelihood estimation (MLE) and traditional KF algorithm.     

Optimized algorithm for balancing clusters in wireless sensor networks

Wireless sensor networks consist of hundreds or thousands of sensor nodes that involve numerous restrictions including computation capability and battery capacity. Topology control is an important issue for achieving a balanced placement of sensor nodes. The clustering scheme is a widely known and efficient means of topology control for transmitting information to the base station in two hops. The automatic routing scheme of the self-organizing technique is another critical element of wireless sensor networks. In this paper we propose an optimal algorithm with cluster balance taken into consideration, and compare it with three well known and widely used approaches, i.e., LEACH, MEER, and VAP-E, in performance evaluation. Experimental results show that the proposed approach increases the overall network lifetime, indicating that the amount of energy required for communication to the base station will be reduced for locating an optimal cluster.     

无线传感器网络中的MAC协议研究

为研究无线传感器网对能耗的要求,提出一种无线传感器网媒体接入控制协议.通过分析各类MAC典型协议特点,归纳其设计原则和分类方法,比较各协议间的性能差异,给出MAC协议的设计策略.     

基于到达时间差的无线传感器网络中Sybil攻击检测方案

As wireless sensor networks （WSN） are deployed in fire monitoring, object tracking applications, security emerges as a central requirement. A case that Sybil node illegitimately reports messages to the master node with multiple non-existent identities （ID） will cause harmful effects on decision-making or resource allocation in these applications. In this paper, we present an efficient and lightweight solution for Sybil attack detection based on the time difference of arrival （TDOA） between the source node and beacon nodes. This solution can detect the existence of Sybil attacks, and locate the Sybil nodes. We demonstrate efficiency of the solution through experiments. The experiments show that this solution can detect all Sybil attack cases without missing.     

无线传感器网络中分簇定向扩散路由协议研究

结合定向扩散路由协议提出了一种新的分簇路由算法（CDD）．该算法在无线传感器定向扩算路由协议的基础上,引入分簇的概念,在大规模部署的传感器网络中,针对事件只发生在某一个局部检测区域的情况对传统的定向扩散路由协议进行改进,仿真证明了改进算法的有效性．     

Optimal distributed resource allocation in a wireless sensor network for control systems

INTRODUCTION With the rapid development of wireless com-munication technology, the combination of wireless communication and control systems becomes a new trend of networked control systems. Among the kinds of wireless technologies, wireless sensor network (WSN) has attracted a lot of interest and visibility due to its huge application space. WSN is a kind of wire-less ad-hoc network which connects embedded sen-sors, actuators, and processors and in which each node consists of a wireles…     

一种基于时间隐蔽信道的WSN认证算法

为解决无线传感器网络(WSN)内节点与网关及网关与终端之间的数据安全传输问题,针对WSN节点受到严格时空资源限制的特点,提出了一种在WSN节点之间、节点与网关之间利用时间隐蔽通信来进行身份认证的算法,被认证方可通过调整发送的数据包间隔特征来携带认证信息,认证方则从接收的数据包间隔特征中提取认证信息以进行验证。仿真结果表明,在阈值选取适当的情况下,基于时间隐蔽通信的认证算法能在WSN环境下稳定地工作,获得正确可靠的编解码结果,可以以较低的时空开销保证WSN节点之间、节点与网关之间数据传输的安全性。