A Quorum-Based Route Cache Maintenance Protocol for Mobile Ad-Hoc Networks

Gwo-Jong Yu
{"title":"A Quorum-Based Route Cache Maintenance Protocol for Mobile Ad-Hoc Networks","authors":"Gwo-Jong Yu","doi":"10.1109/AINA.2008.151","DOIUrl":null,"url":null,"abstract":"The objective of this paper is to propose a quorum- based robust and efficient routing protocol (QRERP) for mobile Ad Hoc network. There are four phases in the proposed QRERP. They are initialization phase, route discovery phase, route reply phase and data transmission phases. In initialization phase, the entire network is partitioned into several connected subgraph. Each subgraph is represented by a host adjacency matrix (HAM) and a logical coterie tree. In the route discovery phase, a route can be discovered by local matrix computation, quorum-based routing table query or quorum-based flooding mechanism. When a route is established, a packet can be replied from destination to source node and the route information can be distributed to the set of coteries passed through by this routing path. Finally, after the routing path is confirmed by route reply packet, source node can communication with destination. During the data transmission, when route is broken due to node mobility or power exhausted, a route maintenance mechanism can be triggered to mainline the robustness of the routing path. The performance of the proposed QRERP is demonstrated by experimental results. From the results, we can conclude that the proposed approach has advantages of backup route, less control overhead, mobility maintenance and route maintenance.","PeriodicalId":328651,"journal":{"name":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","volume":"43 1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"22nd International Conference on Advanced Information Networking and Applications (aina 2008)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2008.151","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The objective of this paper is to propose a quorum- based robust and efficient routing protocol (QRERP) for mobile Ad Hoc network. There are four phases in the proposed QRERP. They are initialization phase, route discovery phase, route reply phase and data transmission phases. In initialization phase, the entire network is partitioned into several connected subgraph. Each subgraph is represented by a host adjacency matrix (HAM) and a logical coterie tree. In the route discovery phase, a route can be discovered by local matrix computation, quorum-based routing table query or quorum-based flooding mechanism. When a route is established, a packet can be replied from destination to source node and the route information can be distributed to the set of coteries passed through by this routing path. Finally, after the routing path is confirmed by route reply packet, source node can communication with destination. During the data transmission, when route is broken due to node mobility or power exhausted, a route maintenance mechanism can be triggered to mainline the robustness of the routing path. The performance of the proposed QRERP is demonstrated by experimental results. From the results, we can conclude that the proposed approach has advantages of backup route, less control overhead, mobility maintenance and route maintenance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于群体的移动Ad-Hoc网络路由缓存维护协议
本文的目的是提出一种基于仲裁的移动Ad Hoc网络鲁棒高效路由协议(QRERP)。建议的QRERP分为四个阶段。它们分别是初始化阶段、路由发现阶段、路由应答阶段和数据传输阶段。在初始化阶段,将整个网络划分为若干连通的子图。每个子图由一个主机邻接矩阵(HAM)和一个逻辑小窝树表示。在路由发现阶段,可以通过本地矩阵计算、基于群体的路由表查询或基于群体的泛洪机制来发现路由。当路由建立后,报文可以从目的节点回复到源节点,并且路由信息可以分发到该路由路径所经过的集群集合中。最后,在路由应答报文确认路由路径后,源节点与目的节点进行通信。在数据传输过程中,当由于节点移动或功率耗尽导致路由中断时,可以触发路由维护机制,以保证路由路径的鲁棒性。实验结果验证了该方法的有效性。结果表明,该方法具有备用路由、控制开销小、机动性维护和路由维护等优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
STAMP: Towards A Scalable Topology Announcement and Management Protocol Analysis of Packet Relaying Models and Incentive Strategies in Wireless Ad Hoc Networks with Game Theory Extending Always Best Connected Paradigm for Voice Communications in Next Generation Wireless Network Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch Near Optimal Broadcasting in Optimal Triple Loop Graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1