Learning Automata based Contention Aware Data Forwarding Scheme for Safety Applications in Vehicular Ad Hoc Networks

被引:1
作者
Kumar, Neeraj [1 ]
Iqbal, Rahat [2 ]
James, Anne [2 ]
Dua, Amit [1 ]
机构
[1] Thapar Univ, Dept Comp Sci & Engn, Patiala 147004, Punjab, India
[2] Coverty Univ, Dept Comp & Digital Environm, Coverty, England
来源
2013 IEEE 10TH INTERNATIONAL CONFERENCE ON E-BUSINESS ENGINEERING (ICEBE) | 2013年
关键词
Vehicular Ad Hoc Networks; Data Dissemination; Learning automata; Vehicular cloud; COOPERATIVE TRANSMISSION; ROUTING ALGORITHM; WIRELESS; BROADCAST; MOBILITY; PROTOCOL;
D O I
10.1109/ICEBE.2013.59
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With an exponential growth of demands of the users to access various resources during mobility lead to the popularity of Vehicular Ad Hoc Networks (VANETs). Users may access various resources from cloud which consists of many resources for the ease of users. VANETs have been used in wide range of applications such as Intelligent Transport Systems (ITS), Safety alarms on roads/in community, online resource access using Internet connectivity etc. Among these applications, safety applications are most important and various proposals exist in literature for the same. But most of the existing proposals have used unicast sender based data forwarding which results an overall performance degradation with respect to the metrics such as packet delivery ratio, end-to-end delay and reliable data transmission. Keeping in view of the above, in this paper, we propose new Learning Automata based Contention Aware Data forwarding scheme for VANETs using cloud infrastructure. Learning Automata (LAs) are assumed to be located in the vehicles which share the information (such as vehicles density, directions of the vehicles or vehicles velocity etc) with the other LAs for taking the adaptive decisions about data forwarding. Based upon these values, automaton performs its action. Corresponding to each action performed by the automaton, its action may be rewarded or penalized by some constant values from the environment where it is working. Based upon the inputs from the environment, each automaton updates its action probability values for the next rounds. An adaptive Learning Automata based Contention Aware Data Forwarding (LACADF) algorithm is also proposed. The proposed scheme is evaluated with respect to different network parameters such as message overhead, throughput, delay etc. with varying density and mobility of the vehicles. The results obtained show that the proposed scheme is better than the other conventional schemes with respect to the above metrics.
引用
收藏
页码:385 / 392
页数:8
相关论文
共 46 条
[1]  
[Anonymous], 2004, 8021D2004 IEEE, P1
[2]   An application-level framework for information dissemination and collection in vehicular networks [J].
Borsetti, Diego ;
Fiore, Marco ;
Casetti, Claudio ;
Chiasserini, Carla-Fabiana .
PERFORMANCE EVALUATION, 2011, 68 (09) :876-896
[3]  
Boukerche A, 2006, IEEE ACM DIS SIM, P143
[4]   Enhancing peer-to-peer content discovery techniques over mobile ad hoc networks [J].
da Hora, Diego N. ;
Macedo, Daniel F. ;
Oliveira, Leonardo B. ;
Siqueira, Isabela G. ;
Loureiro, Antonio A. F. ;
Nogueira, Jose M. ;
Pujolle, Guy .
COMPUTER COMMUNICATIONS, 2009, 32 (13-14) :1445-1459
[5]   A cellular learning automata-based deployment strategy for mobile wireless sensor networks [J].
Esnaashari, M. ;
Meybodi, M. R. .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (07) :988-1001
[6]   A learning automata based scheduling solution to the dynamic point coverage problem in wireless sensor networks [J].
Esnaashari, M. ;
Meybodi, M. R. .
COMPUTER NETWORKS, 2010, 54 (14) :2410-2438
[7]   Velocity-assisted predictive mobility and location-aware routing protocols for mobile ad hoc networks [J].
Feng, Kai-Ten ;
Hsu, Chung-Hsien ;
Lu, Tse-En .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2008, 57 (01) :448-464
[8]  
Fonsecan Antonio, 2012, J NETWORK COMPUTER A
[9]  
FuSSler H., 2003, ACM SIGMOBILE Mobile Computing and Communications Review, V7, P47, DOI [10.1145/881978.881992, DOI 10.1145/881978.881992]
[10]  
Granelli F., 2006, P IEEE WORKSH AUT NE