TY - GEN
T1 - Opportunistic auto-adaptive dissemination in vehicular ad-hoc networks
AU - Jianwei, Niu
AU - Chang, Liu
AU - Jian, Ma
PY - 2009
Y1 - 2009
N2 - Opportunistic dissemination is a promising research domain, for more and more applications that need efficient information spreading in one area are emerging in vehicular ad-hoc networks (VANETs). The most important characteristic of vehicular networks is that they do not have a stable framework. The communication between vehicles mostly depends on the unexpected meeting. Some available data dissemination schemes, however, fail to utilize the peculiarities of vehicular networks. In this paper we propose a novel opportunistic auto-adaptive dissemination algorithm for VANETs. This algorithm takes into account the moving directions of vehicles, and it dynamically changes the number of message replicas to control the network load. It also devises rules how to inform the entering vehicles at the regional border. We evaluate our approach and the results show that our algorithm achieves a good delivery ratio with a smaller network load compared with Random Choice algorithm and Epidemic dissemination algorithm over a series of scenarios.
AB - Opportunistic dissemination is a promising research domain, for more and more applications that need efficient information spreading in one area are emerging in vehicular ad-hoc networks (VANETs). The most important characteristic of vehicular networks is that they do not have a stable framework. The communication between vehicles mostly depends on the unexpected meeting. Some available data dissemination schemes, however, fail to utilize the peculiarities of vehicular networks. In this paper we propose a novel opportunistic auto-adaptive dissemination algorithm for VANETs. This algorithm takes into account the moving directions of vehicles, and it dynamically changes the number of message replicas to control the network load. It also devises rules how to inform the entering vehicles at the regional border. We evaluate our approach and the results show that our algorithm achieves a good delivery ratio with a smaller network load compared with Random Choice algorithm and Epidemic dissemination algorithm over a series of scenarios.
KW - Adaptive multi-copy and bidirectional spread
KW - Data dissemination
KW - Opportunistic networks
KW - Vehicular ad-hoc networks
UR - https://www.scopus.com/pages/publications/77949860701
U2 - 10.1109/NetCoM.2009.39
DO - 10.1109/NetCoM.2009.39
M3 - 会议稿件
AN - SCOPUS:77949860701
SN - 9780769539249
T3 - 1st International Conference on Networks and Communications, NetCoM 2009
SP - 40
EP - 45
BT - 1st International Conference on Networks and Communications, NetCoM 2009
T2 - 1st International Conference on Networks and Communications, NetCoM 2009
Y2 - 27 December 2009 through 29 December 2009
ER -