基于ACP的RPL路由协议设计与实现

有损低功耗网络路由协议(Routing Protocol for Lossy and Low-power Networks,RPL)是为解决在无线传感网中无线传感节点受限而被提出,现有的实现是基于Contiki和Tiny操作系统,并不能应用在基于有线自治网络的自治控制平面(Autonomic Control Plane,ACP)中。为了对ACP提供可靠的通信支撑,设计和实现了基于ACP的RPL路由协议软件。协议软件主要由通信模块、消息处理模块、路由构造模块以及路由维护模块组成。其中,针对协议的实现是基于Linux操作系统根据ACP标准使用C语言进行开发。测试结果表明,实现的RPL协议能够支持ACP中正常的通信功能。     

节点移动处理的高效RPL路由协议

针对低功耗有损网络（low-power and lossy network,LLN）的节点移动问题,提出基于博弈论自适应调整传输速率的移动RPL路由（GT-mRPL）。GT-mRPL路由通过博弈论传输速率,进而获取高的数据分组传递率和吞吐量。在移动环境中,将节点竞争发送数据过程设计成一个游戏。将通过增加传输率所获取的增益（效用函数）与因节点移动而产生的成本（移动函数）的比值看成收益函数。同时,考虑能耗对收益函数的影响。仿真结果表明,在移动环境下,提出的GT-mRPL路由降低了数据分组丢失率,提高了吞吐量。     

无线传感器网络中RPL路由协议性能研究

RPL路由协议是专门设计用于低功耗有损网络的IPv6路由协议。RPL支持3种通信模式,适用于多种应用。文章针对RPL的2种信息流模式MP2P(Multipoint to Point)和P2MP(Point to Multipoint),从丢包率、时延、控制消息开销3个方面对RPL进行了分析。实验使用传感器节点部署了真实的网络环境并获得相应的数据。实验结果表明了RPL协议在无线传感器网络中具有较高的路由性能,但是RPL网络中下行路由的建立与维护需要进一步的优化。     

移动代理在MANET路由协议中的应用研究

移动Ad Hoc网络(MANET)是由移动节点组成的分布式异构网络,其路由协议的研究是该领域的焦点之一。本文分析了现有移动Ad Hoc网络两类路由协议的优缺点,接着提出将移动代理应用于AODV路山协议的方案,最后给出了初步的仿真结果。仿真结果表明,通过移动代理的漫游更新途经节点路由表,可以在网络负载增加不人的情况下,减少路由发起数,降低端到端的数据传输延迟。     

多功率移动锚节点辅助的分布式节点定位方法

提出了一种移动锚节点辅助的分布式定位算法.与以前的基于移动锚节点的定位算法不同,此算法不需要任何测距技术支持.它是利用移动锚节点的功率控制,即以不同的发射功率发射信标信号,接收到信标信号的未知节点将这些信标信息转化为一系列二次不等式约束,然后通过凸优化技术求解这些不等式组来逼近未知节点位置的最佳估计.仿真结果表明,提出的距离无关的定位算法可适合实际定位情况且具有较高的定位精度.     

一种GRID路由协议的网关选取方法

原GRID路由协议的网关选取方法单一,不能适应节点高速随机移动的特征。提出基于结构熵的网关选取方法,定义了栅格内各节点的结构熵,利用节点的结构熵增量作为网关选取的主要准则,并改进了原GRID路由协议的网关选取方法。仿真结果表明,随着栅格节点密度的增加,改进型GRID路由协议使端到端平均时延下降0.2 s,平均跳数下降2跳次,但在一定程度上增加了路由开销。为今后路由协议的网关选取方法提供一种新的思路。     

移动Ad Hoc网络的安全路由协议研究

ad hoc网络是一种新型的无线移动网络,因其独特的组网特性,使得安全问题成为其发展的最大束缚。路由协议的安全是自组网安全的一个重要部分。本文首先论述移动AdHoc网络中的安全问题,介绍了多种安全路由的协议和方案,并对其中的三种按需安全路由协议进行了比较,最后提出进一步研究AdHoc网络路由安全应注意的问题。     

无线传感器网络节点定位研究与实现

无线传感器网络在军事和民用领域都有着广阔的应用前景,其许多应用都是基于节点的位置信息.文中分析了节点定位算法,研究并实现了一种基于无线信号与超声波时间差(TDOA)定位技术的短距离精确定位系统.该系统由中心节点、接收超声波的参考节点和发射超声波的信标节点构成,结构简单,易于实现.     

一种安全的Ad Hoc On-demand路由协议

由于Ad Hoc网络固有的弱点,设计安全、有效的Ad Hoc路由协议是困难的.本文从新的角度设计了一个简单、安全的On-demand路由协议.在路径请求和响应阶段,源节点和目的节点的身份分别被隐藏,只有那些位于目的节点选择的最优路径上的节点可以获得完整的路由信息,从而产生有效的前向和反向路径.同时,一个公开的单向Hash函数可以利用隐藏的路由信息构建单向Hash链用于路由信息的认证,从而不需要预先的共享密钥.在一次路由计算中,只有源节点和目的节点需要进行一次非对称密码运算.     

对MANET AODV路由协议攻击效果分析

移动无线自组织网络(Mobile Ad Hoc Network,MANET)具有抗毁性强、组网灵活的特点,战场通信环境是其很重要的应用背景,基于距离向量的按需路由协议(Ad-hoc On-demand Vector Routing,AODV)在移动无线自组织网络中具有广泛的应用。针对移动无线自组网AODV路由协议,在分析其工作原理的基础上,建立网络流量的分析模型。从网络发起泛搜索路由引起网络流量变化的角度,分析不同的协议攻击方法对网络的影响。     

An efficient distributed routing protocol for wireless sensor networks with mobile sinks

Introducing mobile sinks into a wireless sensor network can effectively improve the network performance. However, sink mobility can bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose a dynamic layered routing protocol to address this problem. The proposed protocol integrates dynamic layered Voronoi scoping and dynamic anchor selection to effectively reduce the dissemination scopes and frequencies of routing updates as the sinks move in the network. Simulation results show that the proposed protocol can effectively reduce the protocol overhead while ensuring high packet delivery ratio as compared with existing work. Copyright © 2014 John Wiley & Sons, Ltd.     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

WSN中最小代价前向协议的研究与改进

对无线传感器网络（WSN）中的最小代价前向协议进行了研究，通过引入随机选择和数据融合功能改进原有协议。用跳数作为代价分析了改进后的协议性能，并进行计算机仿真，结果表明改进后的协议具有更低的网络负荷和更长的生命周期。     

基于LEACH路由协议的混合光无线传感网络研究

分析了基于低功耗自适应分簇(LEACH)路由协议的无线传感网络(WSN)在不同拓扑形状下的生命周期,并改进了长方形拓扑形状的路由协议。进而针对WSN在某些场合能量有限、易受干扰和安全性差等缺点,在长方形区域中引入分布式光纤传感结构。将传感光纤铺设在环境复杂和外界电磁波干扰大的监测区域,从而提高整个传感网络的生命周期和可靠性。理论分析和仿真结果表明,改进的拓扑和协议在提高可靠性的同时,有效地延长了光WSN的生存时间,性能优于传统LEACH协议。     

时间依赖的混合型网络的分布式路由协议

提出了时间依赖的混合型网络模型(HTDN 模型),有效地描述了网络中链路权值随时间变化的特性,并且网络中的节点可以采用不同的等待策略;并给出了 HTDN 模型的路径优化理论。在此基础上设计了有效的分布式路由协议 DMDRP,能计算出 HTDN 模型中所有节点对之间的最短延时路径,并证明了协议的正确性。最后通过仿真试验,给出了 DMDRP 协议与传统路由方案的性能对比分析。     

DDRP: An efficient data‐driven routing protocol for wireless sensor networks with mobile sinks

Introduction of mobile sinks into a wireless sensor network can largely improve the network performance. However, sink mobility can cause unexpected changes of network topology, which may bring excessive protocol overhead for route maintenance and may offset the benefit from using mobile sinks. In this paper, we propose an efficient data‐driven routing protocol (DDRP) to address this problem. The design objective is to effectively reduce the protocol overhead for data gathering in wireless sensor networks with mobile sinks. DDRP exploits the broadcast feature of wireless medium for route learning. Specifically, each data packet carries an additional option recording the known distance from the sender of the packet to target mobile sink. The overhearing of transmission of such a data packet will gratuitously provide each listener a route to a mobile sink. Continuous such route‐learning among nodes will provide fresh route information to more and more nodes in the network. When no route to mobile sink is known, random walk routing simply is adopted for data packet forwarding. Simulation results show that DDRP can achieve much lower protocol overhead and longer network lifetime as compared with existing work while preserving high packet delivery ratio. Copyright © 2012 John Wiley & Sons, Ltd.     

RAARPL: End-to-end Reliability-Aware Adaptive RPL routing protocol for Internet of things

The RPL protocol has been accepted by the Internet Engineering Task Force as the only routing standard for the Internet of things (IoT). Although RPL has been significantly used in IoT routing, it still has extensive challenges. One of the most basic challenges is related to the reliability of routing. The severe limitations of resources, wireless communication, and variable topology, along with other limitations of IoT, have caused reliability in these networks to be a challenging topic. However, in RPL, no measures are provided to support the reliability of routing. To improve this issue, in this article, RPL was improved based on reliability requirements, and a new protocol was proposed called the Reliability-Aware Adaptive RPL routing protocol (RAARPL). RAARPL selects the parents based on the evaluation of various criteria related to reliability and forms the network topology. In addition, the conditions of the paths were also considered in the decision-making so that the reliability depends on the paths and parents. In order to maintain stability, RAARPL had controlled the parent selection and children assignment in a way that will prevent errors as much as possible. The simulation results by Cooja and compared with CLRPL and RPL protocols in various scenarios indicated the high efficiency of RAARPL in improving the reliability of data exchange and successful delivery ratio, reducing the instability of topology and the network throughput.     

基于代价函数的WSN能效路由协议性能分析

无线传感器网络(WSN,wireless sensor network)中,基于代价的能效路由协议(CEERP,cost-based en-ergy-efficient routing protocol)通过计算与比较代价函数值可以找到具有优异性能的路由。在前期研究提出的CEERP协议基础上,对该协议的代价函数、能耗和时延性能进行了分析,确定了首个节点死亡前系统所能完成的通信轮数的上下限以及时延计算公式。在采用能耗与时延的乘积作为性能评价标准的前提下,对多种同类协议的性能进行了比较与讨论,并在节点稀疏布署和非理想信道的情况下分别对CEERP的性能进行了进一步仿真。结果表明,CEERP协议在能耗与时延的综合性能上相对于其他同类协议具有很大的优越性。     

一种无线传感器网路由算法的设计与实现

讨论了无线传感器网络的特殊性,分析了其路由算法的需求。借鉴Ad Hoc网中比较成熟的AODV(Ad Hoc按需平面距离矢量)协议和DSR(动态源路由)协议,采用了按需驱动的路由策略,优化了路由建立和维护算法,提出了RODR(简化的按需路由)协议。采用该路由算法的网络协议已在由ATmega128L微处理器和CC2420构成的节点机上实现,通过组网实验,初步验证了其可行性。     

基于混沌粒子群与蚁群算法的WSN路由协议

为了降低无线传感器网络（WSN）能量消耗,延长网络生存周期,提出了一种基于混沌粒子群（CPSO）和蚁群算法相结合的路由协议。该协议针对典型的分簇协议LEACH（Low-Energy Adaptive Clustering Hierarchy）协议的簇头选择进行了优化,考虑了节点剩余能量和簇内密集性等因素,采用新的混沌粒子群算法对簇头选择进行优化。然后,针对LEACH协议簇头到基站采用单跳通信,容易使簇头早亡的问题,采用蚁群算法优化簇头到基站的路由路径,减少通信消耗的能量。仿真结果表明,与传统的LEACH协议相比,新的协议能有效减少能量消耗,延长网络生命周期。