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 |
| 刊名 | Ruan Jian Xue Bao/Journal of Software
 |
| 出版日期 | 2011 |
| 卷号 | 22期号:UPPL. 1页码:83-92 |
| 关键词 | Ad hoc networks Geographical distribution Geographical regions Intelligent vehicle highway systems Routing protocols Telecommunication networks |
| ISSN号 | 1000-9825 |
| 中文摘要 | 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. |
| 收录类别 | EI |
| 语种 | 中文 |
| 公开日期 | 2013-10-08 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16060]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。