首页> 外文期刊>Wireless personal communications: An Internaional Journal >Design of a Buffer Enabled Ad hoc On-demand Multipath Distance Vector Routing Protocol for Improving Throughput in Mobile Ad hoc Networks
【24h】

Design of a Buffer Enabled Ad hoc On-demand Multipath Distance Vector Routing Protocol for Improving Throughput in Mobile Ad hoc Networks

机译:缓冲区的设计启用了Ad-Demand MultiPath距离矢量路由协议,用于提高移动临时网络中的吞吐量

获取原文
获取原文并翻译 | 示例
           

摘要

The buffering in Mobile Ad hoc Networks (MANETs) will depend on end-to-end delay of every user's information from the arrival time of the resource node which is waiting for the receiving time-span of the destination node. Normally each base station will act as relay node or repeater for different mobile nodes as well as for different base stations. Deployment of base station in the MANET is also a critical research. Each base station contain large number of nodes which is connected based on peer-to- peer communications. Dynamic queuing method is used to share the traffic load to various paths which are selected according to the least buffer size; that increases the packet delivery of the network. Dynamic queuing method is used to reduce the overall waiting time of the packets in the network. In this paper, we propose Buffer Enabled Ad hoc On-demand Multipath Distance Vector (BE-AOMDV) algorithm, that generates the routing protocol with Bernoulli model and find that the packet information minimizes the average end-to-end delay. By using periodic updates on the buffer information of the nodes in the paths, the nodes can take dynamic decisions regarding the help of better routes in the data transmission which can lead to even better use of resources of the network. Buffer Enable Multipath Routing is compared with other multipath routing techniques. Furthermore, using perceptive simplifications, we find that the effect of buffers in networks increases the throughput although incongruously considering average end-to-end delay. During widespread simulations, our simulation results proved that the network with the appearance of data stream circumstance improves using Bernoulli function and the proposed method has the increased throughput compared to other related methods.
机译:移动ad hoc网络(船只)中的缓冲将取决于正在等待目的节点的接收时间跨度的资源节点的到达时间的每个用户信息的端到端延迟。通常每个基站都将充当不同移动节点以及不同基站的中继节点或转发器。在MANET中部署基站也是一个关键的研究。每个基站包含大量节点,该节点基于对等通信连接。动态排队方法用于将流量负载与根据最小缓冲区大小选择的各种路径共享;这增加了网络的数据包传递。动态排队方法用于减少网络中数据包的总等待时间。在本文中,我们提出了缓冲区启用的临时按需多路径距离向量(BE-AOMDV)算法,它与Bernoulli模型生成路由协议,并发现数据包信息最小化平均端到端延迟。通过在路径中的节点的缓冲区信息上使用定期更新,节点可以采取关于数据传输中更好路由的帮助的动态决策,这可能导致更好地利用网络资源。缓冲区使能多路径路由与其他多径路由技术进行比较。此外,使用感知简化,我们发现网络中的缓冲区的效果增加了吞吐量,尽管不协调地考虑平均端到端延迟。在广泛的模拟期间,我们的仿真结果证明,通过伯努利函数的外观具有数据流环境的网络,与其他相关方法相比,该方法具有增加的吞吐量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号