A secure routing scheme for mobile wireless sensor networks

Frequency-hopping (FH) is a well-known spread-spectrum method of transmitting radio signals by hopping frequency channels along a predefined hopping sequence known to both transmitter and receiver. Although FH is resistant to jamming by external malicious nodes which have no knowledge of the sequence, it is of no effect against attacks by internal compromised nodes which know the sequence. In this article, we propose a secure scheme for creating the hopping sequence for mobile wireless sensor networks. The proposed scheme is based on the idea of a statistical en-route filtering (SEF). SEF exploits collective decision making by multiple detecting nodes in the dense deployment of large sensor networks. We demonstrate the effectiveness of our scheme thorough simulations.     

FDR: fault detection and recovery scheme for wireless sensor networks using virtual grid

Due to autonomous operation and constrained resources, nodes of a wireless sensor network are susceptible to failures. Due to multiple node failures, network topology may change or partition into many disconnected segments causing data/query path breakage. Early detection and recovery of faults is desirable in most scenarios. Also, due to limited battery life of a node, the solution must consume minimum possible energy for prolonged network operation. Hence in this paper, we propose a Fault Detection and Recovery scheme which is an energy efficient fault detection and recovery strategy that achieves minimum data loss by efficiently replacing faulty node on the present route or by finding full or partial alternate paths. Topology is managed by constructing a virtual grid over the entire network which helps in managing dynamically changing network topology easily and makes failure detection and recovery effective. It also helps to create energy efficient path between a source and a sink by finding shortest possible path. Further, nodes’ cooperation is exploited to create certain zones on the data/query path which provides alternate nodes or possible alternate paths if required on some node failures. Thus, scheme achieves fault tolerance and at the same time achieves energy efficiency by always selecting shortest path for data delivery between source and sink. Analytical and simulation study reveals the significant improvement in terms of fault detection and energy conservation over existing similar schemes.     

Distributed routing for signal detection in wireless sensor networks

We study the problem of energy-efficient routing for signal detection in wireless sensor networks. Generic routing protocols use networking-centric measures such as minimum hop or minimum energy to establish routes. These schemes do not take into account the performance of application-specific algorithms that is achievable from the data collected by the nodes along the routes. Routing protocols for signal detection have recently been proposed to facilitate joint optimization of detection performance and energy efficiency by developing metrics that connect detection performance with energy consumption of each link along the routes. In existing routing for signal detection (RSD) schemes, however, the routes are computed centrally requiring complex optimization algorithms and global information such as locations and observation coefficients of all nodes in the network. Clearly, for large-scale networks, or networks with dynamically changing topologies, distributed routing schemes are more practical due to their better flexibility and scalability. We present a distributed RSD protocol where each node, based on locally available information, selects its next-hop with the goal of maximizing the detection performance associated with unit energy expenditure. We show that the proposed protocol is readily implementable in ZigBee networks, and present simulation results that reveal its significant improvements in detection performance and energy efficiency over generic routing protocols.     

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的路由算法.该算法将监测区域分成一个固定不变的规则网格网络,并对网格簇头节点的选举方法进行了改进;通过数据的冗余传递和搜索框、候选转发节点集合的设置保证了数据传送的可靠性与时延性;同时容忍圆的引入保证了低功耗的要求.仿真结果表明,该算法较两层数据分发协议有更高的传输可靠性和较低的功耗.     

拥塞敏感的无线传感器网络路由算法

如何延长无线传感器网络的生命周期是一个重要的挑战.提出了一种新的拥塞敏感的路由算法,该算法充分考虑了路由选择过程中的数据负载与邻节点的缓存、信道竞争等状态的关系,每个节点以此计算一个能反映本地拥塞状态的权值,节点选择权值最高的下游节点作为下一跳来平衡下游节点的能耗和数据负载,同时降低下游节点的拥塞可能性.模拟实验表明:...     

无线传感器网络路由协议研究

无线传感器网络是由大量微型传感器节点组成的一个自组织的网络系统,路由协议是具关键技术之。在综合大量路由协议和算法文献的基础上,对现有的无线传感器网络路由协议进行了归纳,初步对其进行了分类,介绍了几个典型的方案,并对各种方案进行了分析,指出了其优缺点和发展趋势。     

一种链式分簇的无线传感器网络路由协议

提出了一种高效节能的链式分簇路由（CCR）协议。CCR协议提出了一种新的高效的双向的链式数据聚合与传输方式,在全网分簇的基础上在簇内使用此传输方式。簇头间通过路由树将采集到的数据发送到指定的唯一与基站通信的根簇头节点。仿真实验证明：CCR协议与LEACH和PEGASIS 2种早期的路由协议相比,其网络寿命分别提高了400％和200％。     

无线多媒体传感器网络QoS路由算法研究

由于廉价的CMOS摄像头、麦克风的出现,以及对含有丰富信息的图像,视频和音频信息需求导致了无线多媒体传感器网络-(WMSN)的出现.WMSN具有资源有限、可变的信道容量、数据高度冗余等特点,使得WMSN的QoS路由具有极大的挑战性.提出了一种基于Mesh结构的WMSN,并在该结构体系下,提出了一种基于蚁群算法的QoS路由算法.实验研究表明,蚁群算法具有不依赖全局信息的优点,具有应用于WMSN的前景.实验同时表明,决定蚁群算法收敛速度以及会影响传感器网络性能的一些关键参数较难确定,需要进一步研究.     

Energy-aware routing for delay-sensitive underwater wireless sensor networks

The energy reduction is a challenging problem in the applications of underwater wireless sensor networks （UWSNs）. The embedded battery is difficult to be replaced and it has an upper bound on its lifetime. Multihop relay is a popular method to reduce energy consumption in data transmission. The energy minimum path from source to destination in the sensor networks can be obtained through the shortest path algorithm. However, because of the node mobility, the global path planning approach is not suitable for the routing in UWSNs. It calls for an energy-efficient routing protocol for the high dynamic UWSNs. In this paper, we propose the modified energy weight routing （MEWR） protocol to deal with the energy-efficient routing of delay- sensitive UWSNs. MEWR is a low flooding routing protocol. It can tolerate the node mobility in UWSNs and achieve a low end-to-end packet delay. MEWR can provide lower energy consumption than the existing low delay routing protocols through the dynamic sending power adjustment. The simulation results demonstrate the effectiveness of MEWR.     

按需能量多路径的路由协议研究

微机电系统、处理器、无线通信及存储技术的进步促进了无线传感器网络的飞速发展,使得无线传感器网络成为一种全新的信息获取和处理技术,也因此与传统网络有着许多不同之处.介绍了无线传感器网络的特点及其通信协议体系结构,着重讨论了传感器网络路由协议的设计问题.在分层模型基础上,动态地选择汇聚节点和分层模型的能量多径路由协议可使能量均衡,延长网络寿命,提高数据转发率,这也是传感器网络路由设计的主要目标.     

一种无线传感器网络的密钥管理机制

介绍了一种用于无线传感器网络(WSNs)的密钥预分配机制:多密钥空间哈希随机密钥预分配(HARPMS)机制。该机制针对group-based节点投放模型,将密钥空间划分成多个子空间,在密钥分配和建立时使用Hash链技术,以提高网络的抗节点俘获能力。分析表明:相比传统的用于group-based投放模型的随机密钥预分配机制,HARPMS获得了同等的连通性,但却有更好的抗节点俘获能力。     

Optimized query routing trees for wireless sensor networks

In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with a path over which query results can be transmitted to the querying node. We found that current methods deployed in predominant data acquisition systems construct T in a sub-optimal manner which leads to significant waste of energy. In particular, since T is constructed in an ad hoc manner there is no guarantee that a given query workload will be distributed equally among all sensors. That leads to data collisions which represent a major source of energy waste. Additionally, current methods only provide a topological-based method, rather than a query-based method, to define the interval during which a sensing device should enable its transceiver in order to collect the query results from its children. We found that this imposes an order of magnitude increase in energy consumption.     

Design and analysis of a multi-candidate selection scheme for greedy routing in wireless sensor networks

Sleep and wake-up scheduling of sensor nodes is an efficient solution to prolong the network lifetime. However, existing scheduling algorithms may significantly decrease the number of active nodes so that the network may be intermittently connected. In such networks, traditional geographic routing protocols are inappropriate to obtain low latency routes due to route discovery and data forwarding latency. In this paper, we propose a novel multi-candidate selection (MCS) scheme for greedy routing that makes the best effort to find minimum latency routes in the sensor networks. In MCS, each source node sends an RREQ to a list of first wake-up forwarder candidates and selects a route with minimum estimated delivery latency based on their replies. The route found by MCS may be longer than that of distance-based greedy forwarding (DGF) (Finn, 1987). Hence, we introduce a latency-adaptive distance-based multi-candidate selection scheme for greedy forwarding to find routes with a small number of hops and acceptable delivery latency. Probabilistic analysis and simulation results demonstrate that MCS increases the routing performance significantly compared with DGF and ODML (Su et al., 2008) in terms of delivery latency.     

An efficient routing scheme with optimal power control in wireless multi-hop sensor networks

Power consumption is a critical problem in providing multimedia communications among wireless sensor nodes (WSNs). To reduce power consumption and satisfying QoS requirements, in this paper, we propose an efficient routing scheme with optimal power management and on-demand quality control for WSNs. Two cost functions are developed to minimize the transmitting power and maximize the link quality under the constraint that an end-to-end frame error probability should be met. The heuristic problem of minimizing power consumption under frame error constraints is formulated and resolved with a closed-form expression. With this closed-form expression, we can determine an optimal route rapidly by calculating the power requirement for each sensor node. Finally, our analytical results indicate that the proposed scheme is superior to a previous work with the same constraint and is also comparable to the results obtained from a heuristic simulation.     

基于蚁群的无线传感器网络路由算法

针对无线传感器节点能量、通信能力及计算能力有限等特点,将蚁群算法应用于无线传感器网络,提出一种改进的蚁群路由算法,考虑了节点的能量、距离、通信半径和传输方向等参数.实验结果表明:该算法有效地减少了网络能量消耗、节点死亡数、路由跳数和数据传输的路径长度,延长了无线传感器网络的寿命,实现无线传感器网络在通信过程中快速、节能的路由。     

无线传感器网络软故障诊断算法

在无线传感器网络中,软故障节点会产生并传输错误数据,这不仅会形成错误的决策,还会消耗能量,为此,提出一种基于节省能量的故障诊断(EFD)算法。该算法利用节点感知数据的空间相似性,通过对邻点所感知的传感数据进行比较,确定检测节点状态。对于网络中存在的节点瞬时故障,该算法引用TF模型思想,避免了不必要的数据比较,减少了时间冗余的检测次数。仿真结果表明:EFD算法能够提高网络诊断精度,同时可以降低诊断过程的能量消耗。     

无线传感器网络多径路由协议综述

由于无线传感器网络不同于传统的自组织网络,已有自组织网络路由协议不能有效应用于传感器网络中.文献中已提出不少无线传感器网络路由协议,但这些协议大多针对单路径情况.当链路失效时,单径路由协议需要重新发现新的路由,从而会对传输延时、能耗和可靠性带来较大影响.采用多径路由协议可弥补单径路由协议的不足,有利于提高数据传输的可靠性和实现负载平衡.通过对目前文献中几种典型的多径路由协议的分析和比较,指出进一步研究中值得关注的问题.