A Failsafe Distributed Protocol for Minimum Delay Routing

Previous distributed routing protocols in data-communication networks that achieve minimum average delay are extended to take into consideration topological changes in the network.     

A Distributed Energy-Aware Routing Protocol for Underwater Wireless Sensor Networks

The design of routing protocols for Underwater Wireless Sensor Networks (UWSNs) poses many challenges due to the intrinsic properties of underwater environments. In this paper we present DUCS (Distributed Underwater Clustering Scheme), a new GPS-free routing protocol that does not use flooding techniques, minimizes the proactive routing message exchange and uses data aggregation to eliminate redundant information. Besides, DUCS assumes random node mobility and compensates the high propagation delays of the underwater medium using a continually adjusted timing advance combined with guard time values to minimize data loss. The theoretical and simulation studies carried out demonstrate its effectiveness.     

基于生成树的无线传感器网络分布式路由协议

在无线传感器网络中,节点具有有限的电池能量,为了延长网络的生存时间,提出了一种基于生成树的分布式路由协议STRP及其具有能量意识的改进版本STRP-PA.每个传感器节点根据相邻节点与基站的距离、剩余能量等信息寻找父节点,构造一棵以基站为根的近优最小生成树,节点采集的数据沿树传输,并在树杈节点进行聚合.仿真实验结果表明:STRP-PA协议能够节省网络能量,显著延长网络稳定工作的时间,性能明显好于LEACH协议.     

802.11 Mesh network中WBDMR分布式路由协议的研究

提出了一种适用于中等规模的802．11 Mesh network网络的无线分布式路由协议（WBDMR）。该协议借鉴了基于Ad-Hoc 的ADOV协议并进行了改造,实现了不同BSS（基本服务集）间无线客户端通过无线中继相互通信。利用节点间交换链路损耗信息实现了动态负载平衡、有效地抑制了冗余路由信息的传播、消除了路由环路、建立了备份路由。仿真结果表明,WBDMR协议具有较好的路由特性和时延特性。     

Multi-factor and Distributed Clustering Routing Protocol in Wireless Sensor Networks

One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and scalability. However, in existing clustering algorithms, too heavy burden of cluster heads may lead to rapid death of the sensor nodes. The location of function nodes and the number of the neighbor nodes are also not carefully considered during clustering. In this paper, a multi-factor and distributed clustering routing protocol MFDCRP based on communication nodes is proposed by combining cluster-based routing protocol and multi-hop transmission. Communication nodes are introduced to relay the multi-hop transmission and elect cluster heads in order to ease the overload of cluster heads. The protocol optimizes the election of cluster nodes by combining various factors such as the residual energy of nodes, the distance between cluster heads and the base station, and the number of the neighbor nodes. The local optimal path construction algorithm for multi-hop transmission is also improved. Simulation results show that MFDCRP can effectively save the energy of sensor nodes, balance the network energy distribution, and greatly prolong the network lifetime, compared with the existing protocols.     

D2F: A Routing Protocol for Distributed Data Fusion in Wireless Sensor Networks

Data fusion can be distributed into network and executed on network nodes, to reduce data from redundant sensor nodes, to fuse the information from complementary sensor nodes and to get the complete view from cooperative nodes. Consequently only the inference of interest is sent to end user. This distributed data fusion can significantly reduce the data transmission cost and there is no need for a powerful centralized node to process the collected information. However, to achieve the advantages of distributed data fusion and better utilization of network resources, each fusion function needs to be performed at particular network node for minimizing energy cost of data fusion application, both data transmission cost and computation cost. In this paper, distributed data fusion routing (D2F) is proposed, which is designed for deploying distributed data fusion application in wireless sensor networks. D2F can find the optimal route path and fusion placements for a given data fusion tree, which obtains the optimal energy consumption for in-network data fusion. D2F can also handle different link failures and maintain the optimality of energy cost of data fusion by adapting to the dynamic change of network.     

一种蜂窝辅助的AODV路由协议

首先提出了一种新的融合AdHoe和蜂窝网络体系结构。接着在这种融合网络结构下,对传统AODV路由协议进行了改进,设计了一种蜂窝辅助的AODV路由协议（CA-AODV）。CA-AODV路由协议利用蜂窝系统中代理节点所保存的移动adhoe节点位置信息,来维护、更新节点中的路由,这种主动维护路由信息的方法从而可以提高传统AODV协议的性能。最后文中通过NS-2仿真表明：在数据发送率较高的情况下,CA-AODV路由协议能显著提高传统AODV协议的系统参数性能。     

动态QoS多播路由协议

本文主要研讨了具有QoS约束的动态多播路由问题.文中描述了一种适用于QoS多播路由的网络模型,提出了一种动态QoS多播路由协议(DQMRP),该协议能操作在单播路由协议的顶层,它只要求网络链路(或节点)的局部状态信息,不需要维护全局状态信息.DQMRP可有效地减少构造一棵多播树的开销,多播组成员可动态地加入／退出多播会晤.该协议可搜索多条可行树枝,并能选择一条最优(或近优)树枝将新成员连接到多播树.文中给出了DQMRP的正确性证明和复杂性分析,并通过仿真实验验证了该协议的可用性和有效性.     

基于地理信息系统的路由协议研究

针对车辆自组织网络提出了基于地理信息系统的路由协议GBRP,以此来解决节点高速移动而引起的路径重建问题.由于利用了地理信息系统中提取的道路空间信息,该协议可以规避城市环境下车辆自组织网络中存在的固定的或者暂时的拓扑空洞问题.仿真实验结果表明新的路由协议与DSR相比有较高的分组传输率,较低的路由开销,协议扩展性更好,更适合于城市环境下的车载通信.     

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

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

一种面向无线视频传感器网络的多径QoS保障路由协议

针对无线视频传感器网络网络带宽有限、网络拓扑结构动态不稳定的特点,以及视频传输对实时性的要求,设计并实现了一种面向WVSN的多径QoS保障路由协议-EDQMR协议,该协议不仅考虑了跳数、时延、节点之间的距离等约束条件,也同时将节点剩余能量作为约束条件,以路径能量的消耗最小为代价函数进行最优路径的选择,不仅考虑单个节点的能耗,也均衡了整个网络的能耗.仿真结果表明,与现有的AOMDV协议相比,在时延满足需求的前提下,本文提出的EDQMR协议可以显著提高数据包的传输成功率,并能有效延长网络的工作寿命.     

一种基于簇首成链的分层分簇路由协议

基于LEACH和PEGASIS算法,设计了一种基于簇首成链的分层分簇路由协议CHCRP(A Chain-cluster Based Hierarchical Clustering Routing Protocol).CHCRP算法把网络分成多个层次,对LEACH协议的簇首选取机制进行改进,采用一跳竞争机制使得簇首分布均匀.为了减少链式路由的时间延迟,簇首间通过分层形成"主链"和"从链"多跳通信.仿真结果表明该算法能够均衡簇首间通信能耗,延长无线传感器网络生存周期并且降低了数据传输的滞后性.     

无线Mesh网络路由协议——多射频质量源路由（MR-LQSR）协议

无线Mesh网络使用传统的基于最短路径的移动Ad Hoc网络路由协议并不能获得良好的性能,为此提出了一种新的无线Mesh网路由协议——MR—LQSR算法及新的路由判据——WCETT．能在吞吐量与延时之间获得一种平衡。     

A Distributed Routing Method for Dynamic Multicasting

Single point, sender based control does not scale well for multicast delivery. For applications, such as group video or teleconferencing a low total cost multicast tree is required. In this article we present a destination driven algorithm to minimize the total tree cost of multicast tree in a dynamic situation for the whole session duration. In this heuristic approach we considered the staying duration of participants are available at the time of joining. The performance of our algorithm is analyzed through extensive simulation and evaluated against several other existing dynamic multicast routing and also against one well known near optimum heuristic algorithm used for solving Steiner tree problem. We have further tested our algorithm using erroneous information given by the joining participants. Simulation results show that its performance does not degrade that much even when the range of error is considerably high, which proves the robustness of our algorithm.     

基于PNNI的ASON路由协议

通用多协议标签交换(GMPLS )是将多协议标签交换 /流量工程(MPLS-TE )进行光网络扩展,并被广泛接受作为自动交换光网络(ASON )控制面协议的理想选择,然而标准化组织正讨论研究将专用网网间接口( PNNI )协议用于 ASON 控制面的潜力。文中主要通过对 PNNI 的路由分层概念、 PNNI 的路由信息分发机制和 PNNI 的路径选择机制的介绍,给出 PNNI 路由的几个扩展,以适合 ASON 的路由需求。     

一种适用于战术条件下的自组织网路由协议

应用于战术条件下的自组织网络,其拓扑具有长期稳定而短期突变的特性;其流量具有不均衡性,中心节点的流量比重较大.针对战术无线网络的这种特性设计了一种混合式路由协议(HRP),协议为近端节点采用先应式协议维护路由而为远端节点采用反应式协议维护路由,对远端节点的路由请求采用OLSR协议的MPR思想,限制反应式协议的路由开销.并且,在近端拓扑变化频度超过门限值后,发起针对繁忙节点的路由发现请求,保持到繁忙节点的路由常新,从而提高了路由命中率.仿真结果表明,应用HRP协议后,无论其选路质量还是应用层业务的时延和吞吐量指标都优于DSR和ZRP协议.     

一种新型的Ad hoc QoS多播路由协议

无线自组织（Ad hoc）网络的应用环境要求其必须提供一定的服务质量（QoS）保证，然而，无线信道固有的特点及节点移动造成网络拓扑的频繁变化，使得在无线Ad hoc网络中支持QoS较困难。可以采用Ad hoc QoS多播（AQM）协议通过事先预约邻居节点以跟踪资源的有效性等措施来解决这一问题。通过考虑传输时延、丢失率、带宽要求、时延抖动、吞吐量等QoS指标，寻找满足特定QoS要求的路由，AQM协议可以明显地改善多播通信的性能。网络仿真结果表明AQM协议基本适合Adhoc网络。     

A Mobicast Routing Protocol in Vehicular Ad-Hoc Networks

In this paper, we present a “spatiotemporal multicast”, called a “mobicast”, protocol for supporting applications which require spatiotemporal coordination in vehicular ad hoc networks (VANETs). The spatiotemporal character of a mobicast is to forward a mobicast message to vehicles located in some geographic zone at time t, where the geographic zone is denoted as zone of relevance (ZOR). Vehicles located in ZOR at the time t must keep the connectivity to maintain the real-time data communication between all vehicles in ZOR. The connectivity is kept of all vehicles in ZOR through the vehicular ad hoc networks (VANETs). The connectivity of ZOR is lost if any vehicle in ZOR suddenly accelerates or decelerates its velocity. The temporal network fragmentation problem is occurred such that vehicle in ZOR cannot successfully receive the mobicast messages. To solve the problem, a new mobicast protocol is presented in this work to successfully disseminate mobicast messages to all vehicles in ZOR via a special geographic zone, called as zone of forwarding (ZOF). The main contribution of this work is to develop a new mobicast routing protocol to dynamically estimate the accurate ZOF to successfully disseminate mobicast messages to all vehicles in ZOR. To illustrate the performance achievement, simulation results are examined in terms of dissemination successful rate, packet overhead multiplication, packet delivery delay, and throughput.     

一种新颖的认知无线电组播路由协议

由于认知无线电(CR)网络具有频谱动态性、频谱差异性以及频谱多样性等特点,传统的组播路由策略已不再适合于CR网络,CR组播路由面临新的挑战。结合博弈论知识建立了频谱分配模型并得出了最优的纳什均衡解,详细介绍了基于时延约束的CR的组播路由协议并对其进行了分析,最后指出其进一步的研究方向。     

Ad Hoc多播路由协议研究与实现

文中研究了一种基于分割树的移动Ad Hoc网络（MANET）多播路由协议（TPBOM）,该协议中,信源基于成员节点的定位信息创建一个Steiner树覆盖图,为满足可扩展性的要求,信源利用最大权反向分割（MHRTP）的树分割算法将其分割为若干个区,并将每个区封装进一个树分发数据包中,以便将所创建的Steiner树分发至所有成员节点,封装的数据包中不包含目的地址列表,数据则沿该Steiner树进行传输,仿真实现表明,TPBOM在可扩展的多播群中获得了较高的性能。