Open AccessClustering multi‐hop information dissemination method in vehicular ad hoc networks
Author(s) -
Tian Daxin,
Wang Yunpeng,
Xia Haiying,
Cai Fengtian
Publication year - 2013
Publication title -
iet intelligent transport systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.579
H-Index - 45
eISSN - 1751-9578
pISSN - 1751-956X
DOI - 10.1049/iet-its.2011.0227
Subject(s) - computer science , wireless ad hoc network , computer network , vehicular ad hoc network , dissemination , cluster analysis , optimized link state routing protocol , ad hoc wireless distribution service , distributed computing , mobile ad hoc network , adaptive quality of service multi hop routing , routing protocol , wireless routing protocol , destination sequenced distance vector routing , wireless , routing (electronic design automation) , dynamic source routing , artificial intelligence , telecommunications , network packet
As a special case of mobile ad hoc networks, vehicular ad hoc networks (VANETs) have attracted great interest in the research community. With the help of wireless communication, many of the safety related and non‐safety related applications can be realised in VANETs. In the multi‐hop and dynamic topology networks, building and maintaining a route is very challenging. To disseminate information among the vehicles and the infrastructures efficiently, a position‐based clustering multi‐hop routing method is proposed. The method hierarchically organises VANETs based on the competitive learning Hebb neural network, which partitions the vehicles into clusters, and these clusters are represented by virtual cluster‐heads. The method is evaluated using NS2 and compared with typical ad hoc routing protocol Ad hoc On‐Demand Distance Vector, Distance Routing Effect Algorithm for Mobility. The simulation results prove that the method is efficient.