基于优先级的包插入队列调度算法仿真研究

提出一种高优先级数据包插入到低优先级数据包中发送的新型队列调度算法,该算法不仅较大幅度地降低了高优先级数据包的时延和时延抖动,同时不会降低带宽利用率,具有很强的实用性.通过OPNET建模验证了此种算法的有效性.     

一种面向实时业务的Ad Hoc网络MAC协议

为降低AdHoe网络中实时业务的端到端时延,提出了基于802．11DCF的改进协议。协议采用3种机制降低实时业务的时延：面向路径的连续转发机制将RTS中的转发信息携带在ACK中发送,给实时业务提供较高的接入优先级;标签交换机制使得中间节点可以在MAC层获取转发信息,加快了实时业务数据包的转发速度;重传控制机制减少了无效传输的超时数据包。仿真结果表明,在重负载条件下,改进协议中实时业务的时延比802．11DCF有大幅度的下降,网络吞吐量也有所提高。     

广义数据包到达的时延优化研究

在无线传感网中,Choobkar算法与Dilmaghani算法分析仅适用于在较高优先级节点空时隙时,较低优先级的节点总是有数据包要发送的情况。为此,提出了一种广义数据包到达算法(GPA)的时延分析。算法适用于数据包到达的任何模式,其中包括在较高优先级节点空时隙的情况下,较低优先级的节点可能或可能不具有待发送数据包。通过仿真验证,对比Choobkar算法和Dilmaghani算法,GPA算法的时延分析在整个负载范围内具有较好的准确度。     

VANETs城市场景下基于自适应时延的Geocast路由协议

基于广播式的Geocast路由协议能够在特定的地理区域内高效地发布数据.然而,广播模式引起冗余重播,易导致广播风暴问题.另外,由于城市场景下建筑物的影响,现有的多数广播抑制方案难以应用于城市环境.为此,提出面向城市的基于自适应时延的Geocast路由协议UGAD.UGAD采用了基于自适应时延的广播抑制方案,降低发生广播风暴的概率.同时,考虑到交叉路口的地理优势,给位于交叉路口的车辆“优惠”时延,使其具有优先转发数据包权力,从而提高数据包到达率.此外,考虑到城市道路的复杂性,UAGD采用基于交叉路口转发IF和贪婪转发GF两个模式,依据不同的道路情况选择不同的转发模式,从而降低冗余重播,并保持高的数据包到达率.最后,针对城市场景进行仿真,结果表明提出的UGAD具有高的数据包到达率,低的数据包重播率.     

基于动态分段网络编码的DTN高效路由算法

针对DTN现有的动态分段网络编码(Dynamic Segmented Network Coding,DSNC)路由算法在编码包头部存在冗余字段、ACK反馈阶段存在冗余开销和节点因无序转发编码包而影响数据包端到端时延等问题,提出基于动态分段网络编码的DTN高效路由算法—ERBNC(Efficient Routing Based on dynamic segmented Network Coding).该算法通过采取压缩编码包头部字段、删除冗余的ACK分组、设置编码包的发送优先级等措施以减少网络开销和数据包平均端到端时延.仿真结果表明,与DSNC算法相比,ERBNC算法在网络开销和端到端时延方面的性能均得到改善.     

基于SDN的链式快速转发网络模型研究

针对当前网络中降低数据包传输时延的机制复杂且在数据包的匹配过程中存在较高的处理时延,提出了基于软件定义网络(SDN)架构的虚拟链式快速通道路由模式(Chain-Like Hyperchannel Routing Mode,CHRN),在将不同优先级的数据流映射到不同的虚拟传输网络上的同时,时延敏感型数据将采用不查表的快速转发方式来降低数据包的处理时延.实验证明,这种方式在不影响普通数据包传输的条件下,有效提高了时延敏感型数据的传输效率.     

一种基于零副本的高效机会路由算法

针对现有DFOR(零副本机会路由)算法存在网络吞吐量不足、网络开销较大等问题,提出一种EOR(高效机会路由)算法。通过对数据包发送批次进行改进,可以有效地提升发送速率。在传输过程中,缩减发送包的包头大小以保证数据包被充分利用,并对原算法中可能存在发送时延过长的情况进行分析。理论分析和仿真结果表明,与DFOR算法相比,EOR算法在网络开销、吞吐量等方面均有所改善。     

在VANETs城市场景下的基于自适应时延的Geocast路由协议

基于广播式的Geocast路由协议能够在特定的地理区域内高效地发布数据。然而,广播模式引起冗余重播,易导致广播风暴问题。另外,由于城市场景下建筑物的影响,现有的多数广播抑制方案难以应用于城市环境。为此,提出面向城市的基于自适应时延的Geocast路由协议UGAD(Urban Geocast based on Adaptive Delay)。UGAD采用了基于自适应时延的广播抑制方案,降低发生广播风暴的概率。同时,考虑到交叉路口的地理优势,给位于交叉路口的车辆 “优惠”的时延,使其具有优先转发数据包权力,从而提高数据包到达率。此外,考虑到城市道路的复杂性,UAGD采用基于交叉路口转发IF(Intersection forwarding)和贪婪转发GF(Greedy forwarding)两个模式,依据不同的道路情况选择不同的转发模式,从而降低冗余重播,并保持高的数据包到达率。最后,针对城市场景进行仿真,结果表明提出的UGAD具有高的数据包到达率,低的数据包重播率。     

机会网络中消息冗余度动态估计的缓存管理策略

机会网络以存储-携带-转发的方式实现节点间通信,高效的节点缓存管理策略能够充分利用有限的缓存空间。该文提出了一种基于消息冗余度动态估计的自适应缓存管理机制,利用消息携带节点的活跃程度和当前网络状态下消息副本数量,预测给定消息的投递状态,节点以消息冗余程度为参数确定消息的转发以及携带优先级。结果表明,所提出的节点活跃度和消息副本数的估计方法比较准确,同时所提出的缓存管理策略能有效提高消息成功投递率,降低网络平均时延和网络负载率。     

移动无线传感网能量时延约束的自适应路由及性能评估

 针对间歇性连通的移动无线传感网提出一种能量时延约束的自适应路由协议(EDCA),EDCA由初始化阶段、转发决策阶段、转发阶段和等待阶段组成,传感器节点根据目标时延实时判断是否转发副本,并选择剩余能量多的节点进行副本转发.EDCA对平均时延和网络负载具有控制力,对网络环境变化具有自适应能力,能够有效延长网络生命周期.     

Intersection-Based Routing Protocol for VANETs

Vehicular ad hoc network (VANET) is an emerging wireless communications technology that is capable of enhancing driving safety and velocity by exchanging real-time transportation information. In VANETs, the carry-and-forward strategy has been adopted to overcome uneven distribution of vehicles. If the next vehicle located is in transmission range, then the vehicle forwards the packets; if not, then it carries the packets until meeting. The carry mostly occurs on sparsely populated road segments, with long carry distances having long end-to-end packet delays. Similarly, the dense condition could have long delays, due to queuing delays. The proposed intersection-based routing protocol finds a minimum delay routing path in various vehicle densities. Moreover, vehicles reroute each packet according to real-time road conditions in each intersection, and the packet routing at the intersections is dependent on the moving direction of the next vehicle. Finally, the simulation results show that the proposed Intersection-Based Routing (IBR) protocol has less end-to-end delay compared to vehicle-assisted data delivery (VADD) and greedy traffic aware routing protocol (GyTAR) protcols.     

Reinforcement Learning Based Mobility Adaptive Routing for Vehicular Ad-Hoc Networks

Vehicular ad-hoc networks (VANETs) is drawing more and more attentions in intelligent transportation system to reduce road accidents and assist safe driving. However, due to the high mobility and uneven distribution of vehicles in VANETs, multi-hops communication between the vehicles is still particularly challenging. Considering the distinctive characteristics of VANETs, in this paper, an adaptive routing protocol based on reinforcement learning (ARPRL) is proposed. Through distributed Q-Learning algorithm, ARPRL constantly learns and obtains the fresh network link status proactively with the periodic HELLO packets in the form of Q table update. Therefore, ARPRL’s dynamic adaptability to network changes is improved. Novel Q value update functions which take into account the vehicle mobility related information are designed to reinforce the Q values of wireless links by exchange of HELLO packets between neighbor vehicles. In order to avoid the routing loops caused in Q learning process, the HELLO packet structure is redesigned. In addition, reactive routing probe strategy is applied in the process of learning to speed up the convergence of Q learning. Finally, the feedback from the MAC layer is used to further improve the adaptation of Q learning to the VANETs environment. Through simulation experiment result, we show that ARPRL performs better than existing protocols in the form of average packet delivery ratio, end-to-end delay and number hops of route path while network overhead remains within acceptable ranges.     

Connectivity-aware minimum-delay geographic routing with vehicle tracking in VANETs

In this paper, we propose the connectivity-aware minimum-delay geographic routing (CMGR) protocol for vehicular ad hoc networks (VANETs), which adapts well to continuously changing network status in such networks. When the network is sparse, CMGR takes the connectivity of routes into consideration in its route selection logic to maximize the chance of packet reception. On the other hand, in situations with dense network nodes, CMGR determines the routes with adequate connectivity and selects among them the route with the minimum delay. The performance limitations of CMGR in special vehicular networking situations are studied and addressed. These situations, which include the case where the target vehicle has moved away from its expected location and the case where traffic in a road junction is so sparse that no next-hop vehicle can be found on the intended out-going road, are also problematic in most routing protocols for VANETs. Finally, the proposed protocol is compared with two plausible geographic connectivity-aware routing protocols for VANETs, A-STAR and VADD. The obtained results show that CMGR outperforms A-STAR and VADD in terms of both packet delivery ratio and ratio of dropped data packets. For example, under the specific conditions considered in the simulations, when the maximum allowable one-way transmission delay is 1 min and one gateway is deployed in the network, the packet delivery ratio of CMGR is approximately 25% better than VADD and A-STAR for high vehicle densities and goes up to 900% better for low vehicle densities.     

DIR: diagonal-intersection-based routing protocol for vehicular ad hoc networks

In this paper, we present a diagonal-intersection-based routing (DIR) protocol for vehicular ad hoc networks. The DIR protocol constructs a series of diagonal intersections between the source and destination vehicles. The DIR protocol is a geographic routing protocol. Based on the geographic routing protocol, source vehicle geographically forwards data packet toward the first diagonal intersection, second diagonal intersection, and so on, until the last diagonal intersection, and finally geographically reach to the destination vehicle. For given a pair of neighboring diagonal intersections, two or more disjoint sub-paths exist between them. The novel property of DIR protocol is the auto-adjustability, while the auto-adjustability is achieved that one sub-path with low data packet delay, between two neighboring diagonal intersections, is dynamically selected to forward data packets. To reduce the data packet delay, the route is automatically re-routed by the selected sub-path with lowest delay. The proposed DIR protocol allows the mobile source and destination vehicles in the urban VANETs. Experimental results show that the DIR protocol outperforms existing solutions in terms of packet delivery ratio, data packet delay, and throughput.     

ROAMER: Roadside Units as message routers in VANETs

Vehicular Ad hoc Networks, also known as VANETs, enable vehicles that are not necessarily within the same radio transmission range to communicate with each other. VANETs also allow vehicles to connect to Roadside Units (RSUs). The latter are connected to the Internet, forming a fixed infrastructure that offers them the capability of communicating with each other and with roaming vehicles. RSUs support cooperative and distributed applications in which vehicles and RSUs work together to coordinate actions and to share and process several types of information. RSUs have so far been used for different roles such as data disseminators, traffic directories, location servers, security managers, and service proxies. In this paper, we focus on routing; namely we exploit RSUs to route packets between any source and destination in the VANET. To our knowledge, this is the first attempt to use the RSU backbone to efficiently route packets to very far locations in VANETs by using geographic forwarding. We evaluate the RSU backbone routing performance via the ns2 simulation platform. We compare our scheme to existing solutions and prove the feasibility and efficiency of our scheme in terms of query delay, packet success delivery ratio, and total generated traffic.     

Cooperative communication for safety message dissemination in unsaturated networks with varying contention windows

Safety message dissemination is crucial in vehicular ad hoc networks (VANETs) for road safety applications. Vehicles regularly transmit safety messages to surrounding vehicles to prevent road accidents. However, changing vehicle mobility and density can cause unstable network conditions in VANETs, making it inappropriate to use a fixed contention window (CW) for different network densities. It has been proposed a 1-D Markov model under unsaturation conditions to analyze the performance of the system with varying CWs under changing vehicle densities. Additionally, it introduces the use of cooperative communication (CoC) to relay failed safety messages. In CoC, two control packets, namely, negative acknowledge (NACK) and enable to cooperate (ETC), are utilized. The proposed analytical model named cooperative communication for safety message dissemination (CoC-SMD) is used to calculate throughput and average packet delay for varying CW and different packet size. The simulation confirms the validity of the analytical results and show significant improvement in the metrics through the use of varying CW sizes and CoC compared with existing techniques.     

Utilizing the dropped packets for data delivery in VANETs

Timely and cost-efficient multi-hop data delivery among vehicles is essential for vehicular ad-hoc networks （VANETs）, and various routing protocols are envisioned for infrastructure-less vehicle-to-vehicle （V2V） communications. Generally, when a packet （or a duplicate） is delivered out of the routing path, it will be dropped. However, we observe that these packets （or duplicates） may also be delivered much faster than the packets delivered along the original routing path. In this paper, we propose a novel tree based routing scheme （TBRS） for ultilizing the dropped packets in VANETs. In TBRS, the packet is delivered along a routing tree with the destination as its root. And when the packet is delivered out its routing tree, it won＇t be dropt immediately and will be delivered for a while if it can arrive at another branch of the tree. We conduct the extensive simulations to evaluate the performance of TBRS based on the road map of a real city collected from Google Earth. The simulation results show that TBRS can outperform the existing protocols, especially when the network resources are limited.     

A distributed laxity-based priority scheduling scheme for time-sensitive traffic in mobile ad hoc networks

Characteristics of Mobile Ad hoc Networks such as shared broadcast channel, bandwidth and battery power limitations, highly dynamic topology, and location dependent errors, make provisioning of quality of service (QoS) in such networks very difficult. The Medium Access Control (MAC) layer plays a very important role as far as QoS is concerned. The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. We have proposed a new MAC layer protocol that includes a laxity-based priority scheduling scheme and an associated back-off scheme, for supporting time-sensitive traffic. In the proposed scheduling scheme, we select the next packet to be transmitted, based on its priority value which takes into consideration the uniform laxity budget of the packet, the current packet delivery ratio of the flow to which the packet belongs, and the packet delivery ratio desired by the user. The back-off mechanism devised by us grants a node access to the channel, based on the rank of its highest priority packet in comparison to other such packets queued at nodes in the neighborhood of the current node. We have studied the performance of our protocol that combines a packet scheduling scheme and a channel access scheme through simulation experiments, and the simulation results show that our protocol exhibits a significant improvement in packet delivery ratio under bounded end-to-end delay requirements, compared to the existing 802.11 DCF and the Distributed Priority Scheduling scheme proposed recently in [ACM Wireless Networks Journal 8 (5) (2002) 455–466; Proceedings of ACM MOBICOM '01, July 2001, pp. 200–209].     

一种基于迁移可测度的移动自组织网路由模型

 本文利用链路状态有效估测端到端路径的可达性。路由模型给出最近时间内,任意两点分组传输的迁移可测度;节点根据其邻节点的迁移可测度制定组合策略,计算组合迁移可测度,选取最优中继组合完成分组传输。仿真实验表明,该路由模型既可有效控制分组副本数目,又可获得较高的分组到达率。     

Location- and delay-aware cross-layer communication in V2I multihop vehicular networks

Intelligent transportation systems are targeted to improve the traffic safety and driving experience of passengers. Vehicular ad hoc networks are wireless communication networks proposed to be used as parts of ITS. VANETs facilitate communication among vehicles, and between vehicles and roadside equipment. A key challenge in developing such systems is to design routing and MAC protocols that not only provide good end-to-end packet delay but can also quickly adapt to changes in the network topology due to vehicular mobility. In this article we outline a new framework for location- and delayaware cross-layer communication that addresses these challenges. Our framework provides an efficient V2I data delivery system that relays packets over low-delay paths to a fixed base station or access point. Furthermore, an instance of this framework is also presented as a protocol. Our preliminary evaluations show that our design approach is promising, and provides delay predictability, fairness, and a good packet delivery ratio.