首页> 外文期刊>Journal of Theoretical and Applied Information Technology >AN EFFICIENT DELAY AWARE QUALITY RELATION BASED ROUTING TREE ON WIRELESS NETWORK
【24h】

AN EFFICIENT DELAY AWARE QUALITY RELATION BASED ROUTING TREE ON WIRELESS NETWORK

机译:无线网络中基于路由树的有效延迟通知质量关系

获取原文
           

摘要

Wireless network combine different types of nodes and vector path to perform information processing with active node variance. The wireless node is additionally positioned to carry out routing with multiple base stations, and routing work is taken as an upcoming research work. Many reliable routing approaches are widely used in many resource limited applications, since it improves data delivery rate and reduces the average delay. However, they lack quality of routing and increases the delay time. In this paper, we propose a Menger connectivity graph based on minimum hop, called Delay Aware Quality Relation based Routing Tree (DAQR-RT). DAQR-RT provides the quality routing tree on wireless network. DAQR utilizes the active window conception to record the quality relationship using previous routing data information in wireless network. The previous routing information (i.e., historical information) is designed with the objective of reducing the delayed time rate efficiently in proposed DAQR-RT. Delay Aware Quality Relation constructs the recognized routing tree in wireless network. Besides, Active window conception previous information quality is captured and estimates the before constructing the recognized routing decision tree for effective broadcasting of information. Finally, the quality relationship in DAQR-RT mechanism uses a Menger connectivity graph based on minimum hop count field which resulting in avoids the poor connectivity and reducing the possibility of retransmissions while broadcasting. Simulations results are conducted to measure the efficiency of proposed DAQR-RT in wireless network through data transmission rate, size of the data block, delay rate, throughput and reduces retransmission during broadcasting. In the performance evaluation, we show that the Delay Aware Routing Tree algorithm achieves comparable performance to the state-of-the-art methods. Experimental analysis shows that DAQR-RT is able to reduce the delay time while broadcasting by 25.62% and reduce the retransmission rate by 37.5% compared to the state-of-the-art works.
机译:无线网络结合了不同类型的节点和矢量路径,以执行具有活动节点方差的信息处理。无线节点还被定位为执行与多个基站的路由,并且路由工作被视为即将进行的研究工作。由于许多可靠的路由方法提高了数据传输速率并减少了平均延迟,因此在许多资源受限的应用中被广泛使用。但是,它们缺乏路由质量,并增加了延迟时间。在本文中,我们提出了一种基于最小跃点的Menger连接图,称为基于延迟感知质量关系的路由树(DAQR-RT)。 DAQR-RT在无线网络上提供了质量路由树。 DAQR利用活动窗口概念在无线网络中使用先前的路由数据信息来记录质量关系。设计先前的路由信息​​(即,历史信息)的目的是在提出的DAQR-RT中有效地减少延迟时间率。延迟感知质量关系构建了无线网络中公认的路由树。此外,在构造识别出的路由决策树以有效广播信息之前,捕获活动窗口概念先前的信息质量并对其进行估计。最后,DAQR-RT机制中的质量关系使用基于最小跳数字段的Menger连接图,从而避免了较差的连接并减少了广播时重传的可能性。进行了仿真结果,以通过数据传输速率,数据块大小,延迟率,吞吐量以及减少广播过程中的重传来测量拟议中的DAQR-RT在无线网络中的效率。在性能评估中,我们证明了“延迟感知路由树”算法可达到与最新方法相当的性能。实验分析表明,与最新技术相比,DAQR-RT能够将广播时的延迟时间减少25.62%,并将重传率降低37.5%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号