车联网中动态TDMA机制的设计与分析

简要介绍了车联网的概念和通信特点,分析了车联网中常见MAC协议的性能缺陷。基于动态TDMA机制,提出了一种自适应车联网中通信节点数量快速变化的动态MAC协议D-MAC。详细介绍了MAC帧结构、时隙扩张机制和冗余时隙回收算法。利用Vanet Mobi Sim交通模拟器和NS-2网络仿真器对本协议进行了仿真实验,结果表明在多种复杂交通环境下本协议的消息传输可靠性高、实时性强。     

Ad Hoc网络路由协议研究及其性能比较

介绍和分析了当前Ad Hoc网络中的主要路由协议算法,在Linux下使用网络仿真软件NS2评价Ad Hoc路由协议中的距离矢量路由协议、临时排序路由算法、动态源路由协议和Ad Hoc按需距离矢量路由协议,编写了用于仿真实现的脚本程序,并对仿真结果进行了分析比较和性能评价,由此得出不同协议的特性及其适用范围。     

一种适用于无线网络的AODV-MPR协议研究

为了降低无线自组网按需平面距离矢量路由(AODV)协议在维护路由时广播参数中源地址和目的地址均为本节点地址的路由应答报文(HELLO消息)时的网络开销,提出了一种基于广播中继(MPR)的AODV路由协议改进方案,对AODV的HELLO消息机制进行了改进,并在NS2中对改进协议和原AODV协议进行了对比仿真。仿真结果证明:改进的AODV协议在网络吞吐量、端到端时延和丢包率方面均优于原AODV协议。     

无线Mesh网路由协议仿真及性能分析

当前对无线网格网络（Mesh网络）主要研究之一是无线路由技术,即针对无线Mesh网络自身的特点进行路由设计。在熟悉基于Linux平台的网络仿真器（NS2）针对Mesh网络路由协议的仿真过程的基础上,利用NS2网络仿真软件分别从端到端平均时延、分组递交率、归一化路由开销三个方面比较了目前三种典型的路由协议——按需平面距离矢量路由（AODV）、动态源路由（DSR）和目的序列距离矢量路由（DSDV）的性能,并详细介绍了整个仿真过程的步骤。最后,通过分析AODV协议的吞吐量,得出网络最佳容纳的节点数,研究成果对协议的实现具有重要的应用价值。     

无线网络路由协议性能的研究与仿真

文章简要介绍自组网中常用的路由协议,利用网络仿真软件NS2对DSDV、DSR和AODV路由协议进行仿真,通过不同仿真场景计算出路由协议的第一个包收到时间、平均延时和包投递率.结果表明DSDV路由协议适合用于节点静止的网络场景,在移动环境下使用AODV和DSR路由协议有更好的网络性能.     

基于NS2的无线自组织网络路由协议仿真

在无线自组织网络中,由于节点移动,网络拓扑结构变化频繁,所以路由协议的选择一直都是关键问题。该文采用NS2软件对两种主要的协议：动态源路由协议（DSR）和自组网按需距离矢量路由协议（AODV）进行了仿真。并且通过端到端延时、路由开销和分组投递率三种参数在不同条件下的数据对两种协议进行了评估。实验结果表明没有一种协议能够完全适用于自组网,对于特殊环境选择不同协议以满足需要。     

基于不同移动节点数目的Ad Hoc路由协议性能比较

文章主要介绍了基于仿真软件NS的Ad Hoc网络路由协议的仿真和比较.首先对现有Ad Hoc网络的相关路由协议进行分类说明,并主要对DSDV和AODV路协议进行介绍和分析;接着对仿真工具NS进行了介绍;最后设计了两个不同移动节点数目的运动场景对两种Ad Hoc路由协议进行仿真和比较.通过对仿真过程中产生的数据包延迟和丢包率进行分析,给出了结论.     

一种基于分簇的改进ZRP路由协议

车联网(VANET)是Ad Hoc网络技术在车载环境下的具体应用,由于其网络拓扑频繁变化、节点快速移动、路由开销较大等原因,传统路由协议无法有效适用于车联网,新型路由协议的研究成为更具挑战性的热点。针对车辆网中ZRP协议规定任意节点都可划分为区域而导致分区高度重叠的问题,提出一种能够适用于车联网的基于分簇的改进ZRP路由协议,该协议用分层网络中的分簇来取代ZRP路由协议中的分区,以道路上行驶速度较慢的货车(客车)为簇首,两跳范围内的普通车辆根据分簇算法成为簇成员等方法实行主动式分簇,来降低簇生成算法的计算量,减少路由维护开销及端对端时延,增加分组投递率。采用OPNET仿真工具对改进的协议进行仿真分析,仿真结果表明,相比传统的ZRP路由协议,新改进协议的路由开销降低了20%,端对端时延降低29%,分组投递率提高36%。     

基于NS2仿真的SCTP协议分析

本论文对SCTP协议进行了分析并用NS2软件进行了仿真。首先,介绍了SCTP协议内容和结构。其次,详细叙述了SCTP协议通信的建立与关闭过程。然后,阐述了利用NS2对SCTP进行仿真的方法并分析其结果。     

边缘智能下基于强化学习的车联网路由协议

为实现复杂城市车联网环境下高可靠、自适应的数据包路由协议,提出一个端-边-云边缘智能架构,该架构包括终端用户层、边缘协作层和云计算层。在所提边缘智能架构的基础上,设计了一个基于多智能体强化学习的数据包路由协议。实验结果表明,相比于现有的紧急消息传输机制、基于交叉路口雾节点的分布式路由协议和基于双深度Q网络的路由协议,所提协议在消息传输时延和接收率方面分别取得29.65%～44.06%和17.08%～25.38%的优化。     

无线Ad Hoc环境下EIGRP的安全加固

文章指出了Ad Hoc网络存在的安全隐患和安全路由协议的设计需求,提出了一种基于EIGRP的具有认证和加密功能的安全路由加固方案。协议采用公钥密码体制,利用节点对路由信息的签名,能有效地抵制各种恶意攻击。     

基于MANET网络的服务协议

为了实现MANET网络的服务协议,提出了一种基于OLSR路由协议的MANET网络服务发布发现协议的设计方案,分析了OLSR路由协议的特点,根据MPR节点算法的特殊性,将服务消息通过MPR节点转发,通过主动模式和被动模式获取服务消息,实现服务发现.并设计了在OLSR路由协议下的服务协议机制.     

城市环境VANETS下的基于beacon控制的路由方案

车载网络(Vehicular ad hoc networks,VANETs)是一种特殊形式的网络,具有节点高速移动、拓扑频繁的变化的特性。这些特性为消息的传播带来挑战。路由机制是实现消息传递的关键因素。地理位置路由被广泛地应用于VANETS,要求节点周期广播beacon消息。然而,节点周期地广播beacon消息,降低了路由性能,特别是在城市区域,由于节点密集,每个节点均广播beacon消息,恶化了路由性能。为此,针对城市环境,提出基于beacon控制的路由协议RPBC(Routing protocol with beacon control)。在RPBC中,并非每个节点广播beacon消息,而设置有效的机制选择部分节点广播,从而降低了beacon冗余,同时,采用最短路径算法,减少数据传输跳数。仿真结果表明,提出的RBPC在分组投递率、端到端传输时延以及路由开销方面均有较好的性能。     

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

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

Practical Routing in Delay-Tolerant Networks

Delay-tolerant networks (DTNs) have the potential to interconnect devices in regions that current networking technology cannot reach. To realize the DTN vision, routes must be found over multiple unreliable, intermittently-connected hops. In this paper we present a practical routing protocol that uses only observed information about the network. We designed a metric that estimates the average waiting time for each potential next hop. This learned topology information is distributed using a link-state routing protocol, where the link-state packets are "flooded" using epidemic routing. The routing is recomputed each time connections are established, allowing messages to take advantage of unpredictable contacts. A message is forwarded if the topology suggests that the connected node is "closer" to the destination than the current node. We demonstrate through simulation that our protocol provides performance similar to that of schemes that have global knowledge of the network topology, yet without requiring that knowledge. Further, it requires significantly less resources than the alternative, epidemic routing, suggesting that our approach scales better with the number of messages in the network. This performance is achieved with minimal protocol overhead for networks of approximately 100 nodes.     

Trading latency for energy in densely deployed wireless ad hoc networks using message ferrying

Wireless mobile ad hoc networks (MANETs) have the potential for use in important application environments, such as remote environmental monitoring, where energy resources are limited. Efficient power management is necessary to allow these networks to operate over a long period of time. One of the key factors affecting the design of power management mechanisms is the routing protocol in use within the network. In this paper, we investigate the Message ferrying (MF) routing paradigm as a means to save energy while trading off data delivery delay. In MF, special nodes called ferries move around the deployment area to deliver messages for nodes. While this routing paradigm has been developed mainly to deliver messages in partitioned networks, here we explore its use in a connected MANET. The reliance on the movement of ferries to deliver messages increases the delivery delay if a network is not partitioned. However, delegating message delivery to ferries provides the opportunity for nodes to save energy by aggressively disabling their radios when ferries are far away. To exploit this feature, we present a power management framework, in which nodes switch their power management modes based on knowledge of ferry location. We evaluate the performance of our scheme using ns-2 simulations and compare it with a multihop routing protocol, dynamic source routing (DSR). Our simulation results show that MF achieves energy savings as high as 95% compared to DSR without power management and still delivers more than 98% of messages. In contrast, a power-managed DSR delivers many fewer messages than MF to achieve similar energy savings. In the scenario of heavy traffic load, the power-managed DSR delivers less than 20% of messages. MF also shows robust performance for highly mobile nodes, while the performance of DSR suffers significantly. Thus, delay tolerant applications can use MF rather than a multihop routing protocol to save energy efficiently when both routing approaches are available.     

适用于水下物联网的混合地理路由协议设计

该文针对水下物联网(IoUT)数据传输问题设计了一种混合地理路由协议。海洋环境的复杂性严重地限制了IoUT水下物联网节点间的数据传输性能,因此需要一个高效的路由协议以对抗复杂的信道环境。无状态几何路由(G-STAR)是一种采用贪婪转发模式的地理路由协议,在大多数3维物联网情景中能够找到合适的数据传输路径,然而水下环境中存在诸多不利因素制约了G-STAR的性能。对此,该文提出一个混合G-STAR(Hybrid G-STAR, H-G-STAR)协议,在保有G-STAR优势的基础上对协议在水下环境中的适应性进行了针对性设计。通过增加基于信道监听的无协作转发策略,在节点数量足够时自发地选择信道状况最佳的路径进行路由,由此避开贪婪转发在水下环境中可能遭遇的极端劣化信道。仿真结果显示H-G-STAR协议相较于基准G-STAR协议有着更好的路由性能,并且在物理层能够取得更低的误比特率(BER),在水下节点的网络拓扑中更为适用。     

Load balancing routing with queue overflow prediction for WSNs

The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

     

Reliable Distributed Local Repair Approach for Maximizing Reliability and Packet Delivery Rate in Wireless on Demand AODV Networks

The most used protocol in Mobile Ad hoc Networks (MANETs) uses the Ad hoc On-Demand Distance Vector (AODV) routing protocol for achieving dynamic, self-organizing, and on-demand multihop routing. In AODV, wireless links may be lost occasionally because the nodes on the routing path are unreachable. Such a problem causes AODV inefficient and unreliable. For solving the problem, AODV provides a local repair mechanism for an intermediate node to find an alternative route to destination when the node detects links broken. The repair mechanism uses the broadcast-type RREQ message for discovering a repair route, which results in a large number of repair control messages and requires a large amount of power consumption for sending these messages. Therefore, in this paper we propose a unicast-type distributed local repair protocol for repairing breaks expeditiously, i.e., achieving high network reliability and utilization, less the number of control messages, and less the repair delay. Furthermore, the optimal number of hops in a neighbor table is analyzed. Numerical results indicate that the proposed approach is superior to other repair approaches in terms of successful fixing rate, control message overhead, and network utilization.     

Performance evaluation of the MoM mobile multicast protocol

This paper presents a performance study of a mobile multicast protocol called MoM, which is designed to support IP multicast for mobile hosts in an IP internetwork. The protocol uses the basic unicast routing capability of IETF Mobile IP, and leverages existing IP multicast to provide multicast services for mobile hosts as well. A key feature of the MoM protocol is the use of designated multicast service providers (DMSPs) to improve the scalability of mobile multicast. Discrete-event simulation is used in the performance evaluation of the protocol. The performance study focuses on the scalability, routing efficiency, fairness, and overhead of the MoM protocol, as well as on DMSP selection policies and the deliverability of multicast messages. The simulation results suggest distinct performance advantages for the MoM protocol over other approaches for mobile multicast, such as bi-directional tunnelling, particularly as the number of mobile group members increases. Furthermore, even simple policies for choosing a DMSP from possible candidates provide reasonable tradeoffs between handoff rates, routing efficiency, deliverability of messages, and protocol overhead. This revised version was published online in June 2006 with corrections to the Cover Date.