首页> 外文期刊>Journal of Theoretical and Applied Information Technology >A NEW APPROACH ON STEP CLUSTERING BASED GREEDY ROUTING IN VEHICULAR AD HOC NETWORKS
【24h】

A NEW APPROACH ON STEP CLUSTERING BASED GREEDY ROUTING IN VEHICULAR AD HOC NETWORKS

机译:车载AD HOC网络中基于贪婪路由的聚类新方法。

获取原文
           

摘要

VANETs are recent mobile wireless ad hoc networks which plays an important role in communications and various commercial applications. Routing of data is a challenge because of moving of the nodes ie., vehicles. Then the disconnection in between the nodes are always not predictable. The node which we are sending may be at our communication range at that moment, but after the sending of packet, due to some circumstances it may not reach the correct target. In the mean time the target node may go out of the transmission range. This happens due to many reasons like low packet delivery, increased packet overhead or routing overhead. In this paper we propose SCBGR(Step Clustering Based Greedy Routing) which is a position based routing algorithm which uses weight score method for efficient packet forwarding. We had used ns2.33 simulator. The routing overhead has been reduced considerably comparing to the recent routing protocols. The simulation results shows that SCBGR has overcome the limitations of the previous protocols.
机译:VANET是最近的移动无线自组织网络,在通信和各种商业应用中起着重要的作用。由于节点(即车辆)的移动,数据的路由是一个挑战。这样,节点之间的断开总是不可预测的。我们正在发送的节点当时可能在我们的通信范围内,但是在发送数据包之后,由于某些情况,它可能无法达到正确的目标。同时,目标节点可能超出传输范围。发生这种情况的原因有很多,例如低数据包传递,增加的数据包开销或路由开销。在本文中,我们提出了SCBGR(基于步骤聚类的贪婪路由),这是一种基于位置的路由算法,该算法使用权重计分方法进行有效的数据包转发。我们曾经使用过ns2.33模拟器。与最新的路由协议相比,路由开销已大大减少。仿真结果表明,SCBGR克服了先前协议的局限性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号