TY - GEN
T1 - Cluster based emergency message dissemination scheme for vehicular Ad Hoc networks
AU - Jin, Dongxu
AU - Shi, Fei
AU - Song, Joo Seok
PY - 2015/1/8
Y1 - 2015/1/8
N2 - Wireless and mobile communications has experienced an unprecedented rapid growth during the last decade. Vehicular Ad Hoc Networks (VANETs) are a completely wirelessly connected through the nodes, which usually has dynamic topologies. VANETs can be employed in many applications such as traffic control, safety related message dissemination, and entertainment infotainment. Broadcast storm problem is one of the hot issues in VANETs as it lacks of central management. Many methods are proposed to solve this problem, such as p-persistence based, 1-persistance based, and counter based schemes. However, all of the related works have weaknesses that cannot be ignored either associated with intersection problem or limited environment. In this paper, a novel clustering algorithm is proposed that guarantees efficient clustering. Thereafter, an efficient cluster maintenance mechanism is proposed. Then we show how the emergency messages are transmitted in proposed cluster structure. Finally, the simulation study confirms the availability and efficiency of the proposed clustering algorithm.
AB - Wireless and mobile communications has experienced an unprecedented rapid growth during the last decade. Vehicular Ad Hoc Networks (VANETs) are a completely wirelessly connected through the nodes, which usually has dynamic topologies. VANETs can be employed in many applications such as traffic control, safety related message dissemination, and entertainment infotainment. Broadcast storm problem is one of the hot issues in VANETs as it lacks of central management. Many methods are proposed to solve this problem, such as p-persistence based, 1-persistance based, and counter based schemes. However, all of the related works have weaknesses that cannot be ignored either associated with intersection problem or limited environment. In this paper, a novel clustering algorithm is proposed that guarantees efficient clustering. Thereafter, an efficient cluster maintenance mechanism is proposed. Then we show how the emergency messages are transmitted in proposed cluster structure. Finally, the simulation study confirms the availability and efficiency of the proposed clustering algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84926154358&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84926154358&partnerID=8YFLogxK
U2 - 10.1145/2701126.2701153
DO - 10.1145/2701126.2701153
M3 - Conference contribution
AN - SCOPUS:84926154358
T3 - ACM IMCOM 2015 - Proceedings
BT - ACM IMCOM 2015 - Proceedings
PB - Association for Computing Machinery, Inc
T2 - 9th International Conference on Ubiquitous Information Management and Communication, ACM IMCOM 2015
Y2 - 8 January 2015 through 10 January 2015
ER -