Prioritizing and scheduling messages for congestion control in vehicular ad hoc networks

被引:31
作者
Taherkhani, Nasrin [1 ]
Pierre, Samuel [1 ]
机构
[1] Polytech Montreal, Dept Comp & Software Engn, Mobile Comp & Networking Res Lab LARIM, Montreal, PQ H3T 1J4, Canada
关键词
Congestion control; Message priority; Meta-heuristic techniques; Queue scheduling; Tabu search; Vehicular ad hoc networks;
D O I
10.1016/j.comnet.2016.06.027
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Vehicular Ad Hoc Networks (VANets) is considered as a technology which can increase safety and convenience of drivers and passenger. Due to channel congestion in high density situation, VANets' safety applications suffer of degradation of performance. In order to improve performance, reliability, and safety over VANets, congestion control should be taken into account. However, congestion control is a challenging task due to the special characteristics of VANets (e.g. high mobility, high rate of topology change, frequently broken rout, and so on). In this paper, DySch and TaSch strategies are proposed. Those strategies assign priorities to the safety and service messages based on the content of messages (static factor), state of network (dynamic factor) and size of messages. DySch and TaSch strategies schedule the messages dynamically and heuristically, respectively. Their performance is investigated using highway and urban scenarios while the average delay, average throughput, number of packet loss, packet loss ratio, and waiting delay in queues are considered. Simulation results show that DySch and TaSch strategies can significantly improve the performance of VANets in comparison to the best conventional strategies. Employing the proposed strategies to control congestion in VANets helps increase reliability and safety by giving higher priority to the safety messages. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:15 / 28
页数:14
相关论文
共 44 条
[1]  
[Anonymous], TABU SEARCH
[2]  
[Anonymous], 2007, P 8 EUR WIR C
[3]  
[Anonymous], IEEE GLOB P
[4]  
[Anonymous], 23 CHAOS COMM C
[5]  
[Anonymous], AD HOC NETW
[6]  
[Anonymous], J COMMUN
[7]  
[Anonymous], IEEE WIR COMM NETW C
[8]  
[Anonymous], 2012, P 2 ACM INT S DESIGN
[9]  
[Anonymous], 2010, 17 ITS WORLD C
[10]  
[Anonymous], ARCHIVES DES SCI