无线传感器网络UDHR协议的设计与实现

针对无线传感器网络(WSN)数据流的特点,提出一种WSN上下行路由异构的协议(UDHR),上下行路由可采用不同的算法,适合于时间驱动、事件驱动以及查询的数据收集模式.利用OMNeT++平台对UDHR协议进行建模仿真,结果表明该协议开销小、扩展性好、健壮稳定.并且在自主开发的Testbed平台上实现了该路由协议,利用该平台可实时观察整个WSN网络拓扑变化、网络开销、监测每个节点能量消耗以及数据收集等情况.     

高动态Ad Hoc路由协议性能分析

Ad Hoc网络是一种没有固定设施的无线移动自组织网络,动态变化的拓扑结构对路由协议的性能有着重要影响。研究了动态源路由(DSR)协议、Ad Hoc按需距离矢量(AODV)路由协议和最优链路状态路由(OLSR)协议3种传统路由协议,利用OPNET软件作为仿真工具,设计了2种不同网络规模条件下空中飞行平台网络拓扑结构背景的高动态仿真方案,通过比较网络时延、归一化网络吞吐量、路由负载和数据传送成功率,分析了它们的性能。仿真结果表明,OLSR协议的综合性能优于其它协议,更适合于节点高速移动且网络拓扑结构频繁变化的Ad hoc网络,并为下一步研究打下基础。     

一种可扩展的无线Mesh适配树路由协议

提出一种可扩展的无线Mesh适配树路由协议(SMTRP),解决无线Mesh随着网络规模扩大引起路由延迟增大,网络性能严重下降的问题.该协议引入Mesh适配树和自适应地址块机制,通过将网络拓扑反映在逻辑地址上,每个节点仅需维护自己的N跳邻居节点的信息,判断出数据包该往哪个方向转发,无需维护大量的路由表,节省了存储空间,减少了通信开销以及能量消耗.理论证明了SMTRP算法的可扩展性,并在OPNET仿真平台上验证了SMTRP协议的有效性.     

一种空基自组网路由协议的研究

针对传统Ad Hoc路由协议无法满足空基自组网在高动态拓扑下成功投递、路由开销和低延迟的要求,研究了一种利用空基平台已规划的航线信息来提高网络路由性能的路由协议.该路由协议由已知移动信息路由协议（MARP,mobility aware route protocol）和移动信息洪泛协议（MDP,mobility dissemination protocol）组成.MARP利用规划的航线信息预测网络拓扑并计算路由,MDP采用洪泛方式通知网络中所有节点实际拓扑和预测拓扑的差异信息.设计该协议的数据结构、链路预测机制、实际链路探测机制、多余广播减少机制.通过QualNet仿真验证,结果表明,MARP/MDP在平均报文传输延迟、报文成功投递率及路由开销方面比AODV和OLSR协议具有更优越的性能.     

无线传感器网络高可靠低维护地理路由协议

无线传感器网络地理路由协议要求节点根据少量本地路由信息将数据分组传输路由到目标节点。为了消除路由环,地理路由算法通常需要将网络拓扑平面化。然而现有的平面化算法要么假设节点的通信半径是一固定值,在实际应用中不适用;要么对每一条链路都进行检测是否有交叉链路,路由维护代价很高。针对以上问题,提出一种具有高可靠性和低维护成本的地理路由协议RPR(region partitioning-based routing),其基本思想是将网络划分为规则多边形区域,并在贪心路由失败时将多边形区域内的所有节点看作一个虚拟节点进行周边路由。多边形区域间通信能够降低平均路由路径长度,从而提高了路由的可靠性。基于区域划分的网络平面化策略不需要检测和删除相交链路,因此减少了路由维护开销。模拟实验结果显示,RPR协议比现有方法的平均路由路径长度更短,路由维护开销更低。     

ADHOC按需路由协议的仿真与性能分析

介绍了ADHOC网络中路由协议的基本概念和特殊性，引出三种具有典型性的按需路由协议：DSR、AODV、TORA，接下来用OPNET软件对这三种路由协议在不同的网络规模、网络拓扑变化快慢程度下进行仿真，并从路由分组开销、网络时延和分组投递率几个方面进行对比分析论证，得出这3种路由协议在不同场景下的性能特点。     

无线自组网链路状态自适应路由协议设计

文章首先指出了链路状态（LS）路由协议的不足,接着建了LSARP协议的数学模型,并详细介绍了其组成及设计过程。NS-2仿真实验表明,该协议能够提高网络数据传输速率和分组投递率,路由开销小,相比LS协议各方面性能都有明显提高,能有效缓解LS路由协议路由开销和网络拓扑结构同步之间的矛盾。     

移动感知的分区MANET路由协议

在分析MANET特性及应用需求的基础上，提出了一种移动感知的分区MANET路由协议MAFZP，谚协议基于到最小ID节点的距离形成分区并维护简化的全局网络拓扑，通过巧妙地利用节点的邻接点信息使得蹲由请求的时间开销和通信开销均降为O（2R），该协议还通过移动感知隔离移动异常的节点，可进一步降低路由拦制开销。仿真结果表明，该协议具有路由请求时延低，控制开销少的特点。     

一种无线自组织网络动态路由协议

介绍了一种基于稀疏树的无线自组织网络动态路由协议,该协议采用了稀疏树路径生成算法来减少路由更新的数据量并减少网络链路的冗余,采用增量更新来降低路由协议开销并降低对传输带宽的占用,支持单向信道,采用快速路径查找算法消除网络拓扑动态变化过程中的环路与无穷计数问题。仿真结果显示它具有收敛快,开销小等特性,能够较好地适应窄带无线通信环境的需要。     

基于Ad hoc的按需路由协议DSR的优化研究与实现

无线Ad hoc网络是一种不需要基础设施的自组织和自管理网络,网络中所有的节点同时具有终端和路由器的功能。因此网络可以通过节点路由发现机制转发分组,并进行路由维护。文中对DSR(动态源路由协议)的路由发现过程进行了优化,并采用OPNET仿真软件对基于DSR协议的Ad hoc网络的路由开销和时延等关键参数进行了仿真统计,分析了改进后的路由协议对网络质量的影响。     

空中异构战术网络IP通信架构及协议开销分析

空中异构战术无线网络由多种不同类型的无线数据链网络构成，IP通信技术可有效解决空中平台异构无线网络的互联互通问题。给出了空中异构战术无线网络模型，并根据不同类型的无线数据链网络特点，分析了端到端通信协议栈关系以及不同无线数据链网络间协议转换与适配方式。探讨了网络静态和动态IP地址分配方法以及网络的路由架构与寻址方式，提出了不同无线数据链网络间IP报文传输的打包方式。对传输的开销性能仿真对比分析表明，基于通用成帧协议的打包方式的协议开销性能较优。     

Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks

In this paper, the well-known network backbone formation problem is modeled as the stochastic min-degree constrained minimum spanning tree (md-MST) problem, where the link duration is associated with the edge weight. Then, a decentralized learning automata-based algorithm is proposed to form the most stable backbone of the wireless mobile ad hoc network (MANET) by finding a near optimal solution to the stochastic md-MST problem of the network topology graph. The proposed method significantly decreases the network overhead and shortens the network delay by reducing the number of intermediate forwarding hosts. It also extends the backbone lifetime by selection of the links with the maximum expected duration. The convergence of the proposed algorithm to the most stable network backbone is proven on the basis of the Martingale theorem. Several simulation experiments are conducted to investigate the efficiency of the proposed backbone formation algorithm. Numerical results show the superiority of the proposed method over the existing methods in terms of the backbone lifetime, end-to-end delay, backbone size, packet delivery ratio, and control message overhead.     

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.     

Mobility prediction and routing in ad hoc wireless networks

By exploiting non-random behaviors for the mobility patterns that mobile users exhibit, we can predict the future state of network topology and perform route reconstruction proactively in a timely manner. Moreover, by using the predicted information on the network topology, we can eliminate transmissions of control packets otherwise needed to reconstruct the route and thus reduce overhead. In this paper, we propose various schemes to improve routing protocol performances by using mobility prediction. We then evaluate the effectiveness of using mobility prediction via simulation. Copyright © 2001 John Wiley & Sons, Ltd.     

高动态无线自组网路由协议设计

针对节点快速移动过程中网络建立时间较长,数据端到端传输时延无法得到可靠保 障,并且由于维护动态网络连接性造成网络开销较大等方面的问题,提出了一种无线自组网 路由协议,通过分簇算法快速将网络分为多个簇,每个簇包括簇首节点、成员节点和簇间网 关节点。该协议能够应用于快速移动节点构成的高动态无线自组织网络中,实现了先应式和 反应式路由算法进行了有机结合,能够在快速变化的拓扑结构中为未知路由提供优化的路由 结果,利用较小的网络开销实现网络快速构建和数据端到端的实时传输。     

A stable virtual backbone for wireless MANETS

Due to the highly dynamicity and absence of a fixed infrastructure in wireless mobile ad hoc networks (MANET), formation of a stable virtual backbone through which all the network hosts are connected is of great importance. In this paper, a learning automata-based distributed algorithm is proposed for constructing the most stable virtual backbone of the MANET. To do so, the backbone formation problem is first modeled by the stochastic version of the bounded diameter minimum spanning tree (BDMST) problem. Then, the network backbone is constructed by solving the stochastic BDMST problem for the network topology graph. Several simulation experiments are conducted to investigate the efficiency of the proposed backbone formation protocol. The obtained results are compared with those of the best existing methods. Numerical results show the superiority of the proposed method over the others in terms of backbone lifetime, end-to-end delay, backbone size, packet delivery ratio, and control message overhead.     

无线Ad hoc网络中基于拓扑的功率感知路由协议

无线Ad hoc网络中的节点通常是由电池提供能量,高效的节能策略在网络性能中具有非常重要的地位。为了降低网络能量的消耗,该文提出了一种TPR(Topology-based Power-aware Routing)协议。TPR协议主要利用无线传输中的多跳节能特性,通过建立节点的功率高效邻居集合,并用该集合去控制路由请求报文的转发过程,从而得以建立节能路由。计算机仿真验证表明,相比于现有的节能协议,TPR协议在获得较好节能效果的同时,并能在路由开销、路由发现时间、端到端时延等方面取得较好的均衡。     

System lifetime optimization for heterogeneous sensor networks with a hub-spoke technology

As a specific area of sensor networks, wireless in-home sensor networks differ from general sensor networks in that the network has nodes with heterogeneous resources and dissimilar mobility attributes. For example, sensor with different radio coverage, energy capacity, and processing capabilities are deployed, and some of the sensors are mobile and others are fixed in position. The architecture and routing protocol for this type of heterogeneous sensor networks must be based on the resources and characteristics of their member nodes. In addition, the sole stress on energy efficiency for performance measurement is not sufficient. System lifetime is more important in this case. We propose a hub-spoke network topology that is adaptively formed according to the resources of its members. A protocol named resource oriented protocol (ROP) was developed to build the network topology. This protocol principally divides the network operation into two phases. In the topology formation phase, nodes report their available resource characteristics, based on which network architecture is optimally built. We stress that due to the existence of nodes with limitless resources, a top-down appointment process can build the architecture with minimum resource consumption of ordinary nodes. In the topology update phase, mobile sensors and isolated sensors are accepted into the network with an optimal balance of resources. To avoid overhead of periodic route updates, we use a reactive strategy to maintain route cache. Simulation results show that the hub-spoke topology built by ROP can achieve much longer system lifetime.     

传输网络光缆物理路由的规划

光传输网络的突出优势就是组网,自愈环是其主要拓扑结构,网络具有自愈保护功能。本地传输网络一般按骨干层、汇聚层和接入层的功能结构组织,在层次网络结构中,如何组织光缆路由。本文利用分枝限界法解决了自愈环光缆路由的选择问题,提出了分层网络光缆路由规划的数学模型。