Institutional Repository
| data dissemination scheme based on adaptive density of nodes in vehicular ad-hoc networks | |
| Yang Wei-Dong; Liu Ji-Zhao; Liu Yan; Deng Miao-Lei; Zhou Xin-Yun | |
| 2011 | |
| Source | Ruan Jian Xue Bao/Journal of Software
 |
| ISSN | 1000-9825 |
| Volume | 22Issue:UPPL. 1Pages:83-92 |
| English Abstract | The high mobility of vehicles causes the frequent change of networks topology. This is part of a huge huge challenge on the data dissemination of VANETs. Even though existing flood-based routing protocols provide high reliability, they can not achieve the good trade-off shown among delivery ratio, delay, and the number of message redundant copies. A data dissemination scheme based on adaptive node density for VANETs is proposed. Nodes can rapidly gain the geographical distribution of "hotspot" regions via the proposed distributed algorithm. The hop-count limit function is established which is based on the Euclidean distance of the nearest "hostspot" region and density of nodes. When making forwarding deciding, nodes set a dynamically upper bound on the message hop count to avoiding unnecessary message redundant copies in the "hotspot" region. The number of message redundant copies can be effectively reduced in the network. The simulation results show that the delivery ratio and delay of this scheme are close to the epidemic routing protocol, but the number of message copies can be reduced by 37.5%. © Copyright 2011, Editorial Department of Journal of Software. All rights reserved.; The high mobility of vehicles causes the frequent change of networks topology. This is part of a huge huge challenge on the data dissemination of VANETs. Even though existing flood-based routing protocols provide high reliability, they can not achieve the good trade-off shown among delivery ratio, delay, and the number of message redundant copies. A data dissemination scheme based on adaptive node density for VANETs is proposed. Nodes can rapidly gain the geographical distribution of "hotspot" regions via the proposed distributed algorithm. The hop-count limit function is established which is based on the Euclidean distance of the nearest "hostspot" region and density of nodes. When making forwarding deciding, nodes set a dynamically upper bound on the message hop count to avoiding unnecessary message redundant copies in the "hotspot" region. The number of message redundant copies can be effectively reduced in the network. The simulation results show that the delivery ratio and delay of this scheme are close to the epidemic routing protocol, but the number of message copies can be reduced by 37.5%. © Copyright 2011, Editorial Department of Journal of Software. All rights reserved. |
| Indexed Type | EI |
| Keyword | Ad Hoc Networks Geographical Distribution Geographical Regions Intelligent Vehicle Highway Systems Routing Protocols Telecommunication Networks |
| Department | (1) College of Information Science and Engineering He'nan University of Technology Zhengzhou 450001 China; (2) School of Software and Microelectronics Peking University Beijing 102600 China; (3) State Key Laboratory of Information Security Institute of Software The Chinese Academy of Sciences Beijing 100190 China |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/16060 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | Yang Wei-Dong,Liu Ji-Zhao,Liu Yan,et al. data dissemination scheme based on adaptive density of nodes in vehicular ad-hoc networks[J]. Ruan Jian Xue Bao/Journal of Software,2011,22(UPPL. 1):83-92. |
| APA | Yang Wei-Dong,Liu Ji-Zhao,Liu Yan,Deng Miao-Lei,&Zhou Xin-Yun.(2011).data dissemination scheme based on adaptive density of nodes in vehicular ad-hoc networks.Ruan Jian Xue Bao/Journal of Software,22(UPPL. 1),83-92. |
| MLA | Yang Wei-Dong,et al."data dissemination scheme based on adaptive density of nodes in vehicular ad-hoc networks".Ruan Jian Xue Bao/Journal of Software 22.UPPL. 1(2011):83-92. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment