检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:徐利亚[1] 黄传河[1] 田聪[1] 代闯仁[1] 张熠[1]
出 处:《武汉理工大学学报(信息与管理工程版)》2011年第6期871-873,共3页Journal of Wuhan University of Technology:Information & Management Engineering
基 金:国家自然科学基金重点资助项目(60633020);湖北省自然科学基金重点资助项目(2010CDA004)
摘 要:论述了车用自组织网络(vehicular ad hoc network,VANET),认为车辆节点既是网络的终端也是路由器,可以实现自组织和自管理的通信。与一般无线自组织网络相比,车用自组织网络具有节点运动速度快、节点移动受道路拓扑约束和节点数量巨大等特点。路由选择是车用自组织网络成功运行的基础,对此提出了一种基于交通感知的路由协议。该协议由两个部分完成:先动态选择传送数据包需经过的交叉路口;再在两交叉路口之间的路径中根据一种贪婪的策略来选择传送数据的下一跳节点。模拟结果显示,与传统的地理位置路由协议等相比,所提出的协议在数据的传递率和端到端的延时等方面都有较大的提高。VANET is self - organized and each node is the terminal node as well as the router. VANET can realize self - organization and self- management, which has some specific attributes that are different from the conventional MANET ( mobile ad hoc networks) such as nodes distribution,constrained but high mobility patterns, etc. One of the fundamental components for the success of VANET applications is routing. In our current work, a traffic - aware routing protocol (TAR) suited for city environments was proposed. It consisted of two modules : dynamic selection of the junctions which a packet must penetrate to reach its destination, and a strategy used to transfer the packets between two junctions. In this paper, detailed description of the approach was given and its added value was presented. The proposed protocol was compared with other existing vehicular routing protocols. Simulation results show that significant performance improvement has been achieved in terms of packet dehvery ratio, end - to - end delay.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222