Directed information dissemination in vehicular ad-hoc networks

被引:3
作者
Hossain, A. K. M. Mahtab [1 ]
Mekbungwan, Preechai [2 ]
Kanchanasut, Kanchana [2 ]
机构
[1] Natl Univ Ireland Univ Coll Cork, Dept Comp Sci, Cork, Ireland
[2] Asian Inst Technol, IntERLab, Khlong Luang, Thailand
关键词
Vehicular ad-hoc network (VANET); Multipoint relay (MPR); Traffic information propagation; Optimized link state routing (OLSR); Driver assistance;
D O I
10.1007/s11276-013-0655-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, we utilize the idea of multipoint relays (MPRs) found in literature (Jacquet et al. in Proceedings of IEEE INMIC, 2001), to propagate accident information in a restricted way (e. g., only backwards). We devise an algorithm to identify MPRs that are geographically situated behind a particular node using only its neighbor table, and speed information of the neighboring vehicles. With the identification of the backward MPRs, it is possible to restrict the information dissemination to vehicles behind a particular vehicular ad-hoc network (VANET) node only. This might benefit the approaching vehicles so that the driver could take preventive measures in real-time since he/she will have an indication of the severity of road conditions ahead. We assume that there exists an inter vehicular network using optimized link state routing (OLSR) where accident information can be propagated to all nodes using on-going OLSR control packets. We envision our application will run on top of existing routing protocols (e. g., OLSR), thereby resulting in very little integration effort, and retaining OLSR's reduced network traffic advantage through the use of MPRs. We analyze our back MPR identification algorithm in a detailed manner. We also show that by using our approach the location of the accident alert instigator node could be pinpointed if a subset of the nodes in the same VANET know their geographical positions. We use VANET mobility models generated by SUMO into NS-3 for our simulations, and also perform preliminary experiments to verify the algorithm's effectiveness. Our analysis and experiments show favorable results.
引用
收藏
页码:899 / 916
页数:18
相关论文
共 24 条
  • [1] [Anonymous], COMPLEXITY RESULTS E
  • [2] [Anonymous], STEID PROTOCOL EMERG
  • [3] [Anonymous], 2000, RR3898 INRIA
  • [4] [Anonymous], IEEE VEHICULAR TECHN
  • [5] Challenges of intervehicle ad hoc networks
    Blum, JJ
    Eskandarian, A
    Hoffman, LJ
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2004, 5 (04) : 347 - 351
  • [6] UNIT DISK GRAPHS
    CLARK, BN
    COLBOURN, CJ
    JOHNSON, DS
    [J]. DISCRETE MATHEMATICS, 1990, 86 (1-3) : 165 - 177
  • [7] Cormen TH., 2009, Introduction to Algorithms, V3
  • [8] Ermel E., 2007, P EUR WIR
  • [9] Ghafoor K. Z., 2012, WIRELESS NETWORKS
  • [10] Goel S., 2004, P IEEE ITS