无线传感器网络安全路由协议技术研究综述

综述了无线传感器网络安全路由协议研究工作的最新进展,包括安全LEACH协议、安全分簇路由协议、高效安全路由协议、安全组播路由协议、安全地理路由协议、安全多径路由协议等技术,分析研究了几种具有代表性的安全路由协议,并指出当前无线传感器网络安全路由协议研究亟待解决的问题和将来的研究方向.     

基于改进量子行为粒子群优化的无线传感器网络QoS路由算法

为了进一步减少无线传感器网络的能量损耗和延迟时间并且有效延长节点生存时间,提出一种改进的量子行为粒子群(quantum based particle swarm optimization,QPSO)优化算法,并将其用于解决无线传感器网络的QoS组播路由问题。该算法采用适应度函数和全局最好位置的更新方法来寻找无线传感器网络中满足阈值限制下的最优路由。实验仿真和对比情况表明,该算法在节省能量损耗、控制延迟时间和延长网络节点的生存时间上取得了较好的效果。     

无线传感器网络适应QoS机制的网络模型

基于无线传感器网络服务质量(QoS)的特点,提出了一个独立于具体算法的、在点和边上都可加权的有向图网络模型,并用数学定义描述了QoS参数间的关系及服从的函数约束,使用该网络模型分析QoS路由的数学约束集并提出QoS路由选择策略。     

一种基于地理位置信息的高能效无线传感器网络

分簇协议的目的是要利用节点有限的资源, 完成高效的数据采集任务, 延长网络使用寿命. 在基于簇的网络结构基础上, 提出并行分布式自组织成簇协议 (Parallel distributed self-organization clustering protocol, PDSOCP), 按地理位置将目标区域划分为若干均匀分布的逻辑区域, 每个区域根据节点剩余能量多少以及到区域内其余节点平均距离远近选择一个簇头, 以代理和簇头共同管理簇事务, 并建立了自适应路由. 实验表明, 该算法能够减少网络能耗, 有效延长网络寿命, 获得更好的性能.     

无线传感器网络中基于Agent的QoS管理机制

针对无线传感器网络的节能特性和网络应用对服务质量(QoS)要求的不断提高,提出了一种节能高效的服务质量管理机制,运用Agent技术实现传感器节点的信息采集和QoS预约,当网络环境变化时进行QoS协商与再协商.与传统QoS机制相比,基于Agent实现的QoS管理机制能够最大限度对支持网络应用,更适合传感器网络的节能要求,延长网络的生命期.     

一种无线传感器网络平面路由协议研究

针对环境监测的应用场景,提出了一种平面多路径路由协议FMR。该协议选用多路径,使网络中大多节点的能量维持在一个大致的水平区间内,能量的消耗更加均衡。仿真结果表明,FMR的能量均衡性更好;使用网络中的节点更频繁;端到端的时延,FMR与AODV比较接近,但是远低于DSDV、DSR。     

基于能量迭代的无线传感器网络非均匀分簇路由算法

能量空洞是影响无线传感器网络性能的关键问题之一,据此提出了一种基于能量迭代的非均匀分簇路由算法。该算法首先在簇头选举时通过减少迭代次数,降低能量消耗,同时综合考虑节点能耗速度、节点到汇聚节点的距离等因素,选出最优簇头;其次,考虑到节点到汇聚节点距离和节点密度对网络生命周期的影响,提出了非均匀分簇算法,实现网络能耗均衡的目的。仿真实验表明,当最大簇半径为50m ,选举因素所占权重为0.4 ,簇半径调节系数为0.7时,本算法达到最优,与LEACH-E和LEACH相比,网络生命周期分别延长125%和136%,同时有效避免了能量空洞现象的产生。     

Energy-efficient forwarding in wireless sensor networks

For maximizing the energy efficiency in a wireless network, we propose two forwarding schemes termed single-link and multi-link energy-efficient forwarding that tradeoff delivery ratios against energy costs. Multi-link forwarding improves the network performance substantially by addressing multiple receivers at once during the packet forwarding process. If the first forwarding node does not receive a packet correctly, other nodes may act as backup nodes and perform the forwarding instead. By means of mathematical analyses, we derive how the energy efficiency of a forwarding path can be computed and how a forwarding tree is established. Routing cycles are explicitly taken into account and prevented by means of sequence numbers. Simulations and real-world experiments provide a comparison to other reference strategies, showing a superior performance of our forwarding scheme in terms of energy efficiency.     

基于预约调度的无线传感器网络的MAC协议*

提出了一种基于预约调度的用于无线传感器网络的MAC协议--SSMAC.该协议采用分布式竞争接入和预约调度发送,提供高能量效率的信道接入和支持QoS业务的传输,较好地解决了隐藏终端和暴露终端问题.仿真结果表明SSMAC协议在保持节能的同时,在降低媒体接入时延、提高报文投递成功率和提供QoS保障上较TRAMA协议性能有很大的提高.     

Coding- and interference-aware routing protocol in wireless networks

Network coding is considered as a promising technique to increase the bandwidth available in a wireless network. Many studies show that network coding can improve flow throughput only if an appropriate routing algorithm is used to identify paths with coding opportunities. Nevertheless, a good routing mechanism is very difficult to develop. Existing solutions either do not estimate the path bandwidth precisely enough or cannot identify the best path in some situations. In this paper, we describe our coding-aware routing protocol that provides a better path bandwidth estimate and is able to identify high throughput paths. Extensive NS2 simulations show that our protocol outperforms existing mechanisms.     

基于带状区域路由的无线传感器网络QoS协议

提出了一种基于带状区域路由的无线传感器网络QoS协议。根据网络传输路径的能耗模型分析,将路由的转发节点控制在以源节点与Sink节点连线的带状区域,有效降低了路径上的传输能耗。另外,在改进型QoS协议中,转发节点根据当前QoS约束动态重新建立新的带状区域宽度,使传输路径最大程度拟合源节点和Sink节点的连线,达到路径传输能耗最优。仿真实验表明,无线传感器网络QoS协议在满足网络QoS约束下,节省了网络能耗,延长了网络生存时间。     

无线传感器网络的研究与发展

简要介绍了无线传感器网络的体系结构特点和应用领域,对无线传感器网络涉及的关键硬件技术和软件算法的研究现状进行了总结,并探讨了其存在的问题及发展趋势。     

无线传感器网络动态重传算法

无线传感器网络路由协议通过点到点的重传来提高数据传输的可靠性,其重传机制没有考虑不同业务数据的可靠性需求差异,统一设定一个静态的最大重传次数。本文提出了一种动态重传算法,为每种业务分别根据其可靠性需求动态设定最大重传次数。对于较低可靠性需求的业务,相比于传统重传机制减少了重传次数。仿真表明动态重传算法能有效降低网络能耗。     

采用转发优先级的水下传感网络的机会路由

机会路由OR(Opportunistic Routing)在水下传感网络中广泛应用。然而,现存OR协议忽略了一个问题:转发节点采用恒定转发优先级,其加剧了部分节点的能耗,也未能平衡节点间的能量消耗。为此,提出基于轮换转发优先级的机会路由RFP-OR(Rotating Forwarding Priority-based OR)。RFP-OR路由利用节点剩余能量,链路可靠性和水压差值构建候选转发节点集,再计算候选转发节点集内每个节点的适度值,并依据适度值给节点设置转发优先级。最后,依据节点的转发优先级设置定时器,进而产生下一跳转发节点。仿真数据表明,提出的RFP-OR路由的活动节点数得到有效的提高,并且数据包传递率也得到了提升。     

基于网络编码的传感网多径路由模型分析

针对多径路由容易产生报文乱序和丢失的现象,将网络编码技术引入到多径路由中,建立了两个基于网络编码的传感网多径路由模型。通过源节点、中继节点编码和接收端解码,在报文乱序和部分丢失的情况下仍然可以恢复出源数据包,在保证降低冗余度的前提下,提高了网络的成功交付率。使用matlab对模型进行了仿真计算,发现两种模型适合于不同规模的网络,最后,提出了一种根据网络规模选择路由的方法。     

On random routing in wireless sensor grids: A mathematical model for rendezvous probability and performance optimization

Random routing protocols in Wireless Sensor Networks (WSNs) forward packets to randomly selected neighbors. These packets are ‘agents’ carrying information about events or ‘queries’ seeking such information. A novel mathematical framework is proposed for analyzing random routing protocols. Exact probability of a packet visiting a given node within a given hop count as well as the rendezvous probability of agents and queries meeting at a given node in a 2-D grid-based WSN are derived. The basic relationship needed for extending the models to a 3-D grid topology is provided. Exact probabilities of agents meeting queries are derived while ignoring physical boundary effects and packet losses, under two different strategies for forwarding the packet to a neighbor: (a) with equal probability, and (b) self-avoiding forwarding. We then extend the model to account for packet losses by considering the case where a packet is forwarded to a neighbor with equal probability. Also provided is the extension of the analysis for a network with rectangular boundaries. The exact solutions presented, unlike existing models relying on asymptotic behavior, are also applicable to small and medium scale networks. They can be used to set parameters and optimize performance of several classes of random routing protocols. All the models are validated using Monte Carlo simulations. Simulation results indicate that the model is also a good approximation for sparse arrays with 75% or higher node density. Finally, the utility of the model is demonstrated by determining the protocol parameters to optimize the performance of rumor routing protocol under a fixed energy budget.