检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈振[1,2] 翟琰[1] 胡松华[1] 韩江洪[1]
机构地区:[1]合肥工业大学计算机与信息学院,合肥230009 [2]安徽大学计算机教学部,合肥230601
出 处:《电子测量与仪器学报》2014年第8期836-842,共7页Journal of Electronic Measurement and Instrumentation
基 金:国家自然科学基金(6137088);国家电子信息产业发展基金(2010)301;高等学校博士学科点专项科研基金(20100111110004)资助项目
摘 要:为提高车载自组网的路由扩展性,提出了一种基于网络划分的车载自组网路由构建及数据传输方法。首先,提出了一种新的车载自组网划分算法来把网络划分为多个子网,随后,搭建和维护各子网中的头尾节点间路由,最后,所有路由的搭建和维护都基于各个子网的头尾节点间路由。该方法将链路失败的影响局限于包含该链路的子网中,并且能够多次复用子网中的路由信息。仿真表明,在网络节点数和路由数目不断增多的情况下,相对于直接在网络中应用相关路由算法,文中方法显著地减小了路由代价,提高了网络性能。仿真结果充分地说明了文中方法的有效性。To improve vehicular ad hoc networks routing scalability, we constructed the route and transmitted the packet based on dividing the networks. Firstly, a new network division algorithm was proposed to divide the networks into subnets. Then, the route between tail node and head node of the subnets was constructed and maintained. Finally, all other routes were built through the route. So, a broken route was repaired locally and some routes information was multiplexed. The simulation results show that, with the number of the networks nodes and the number of routes increasing, the proposed method significantly reduces the routing overhead and has an optimal performance with respect to the related routing algorithm applying directly. The effectiveness of the method is proven.
分 类 号:TN915.02[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.170