TADL: A Trust-Aware Dynamic Location-Based Protocol Suite For Discovering Multiple Paths in MANETs

Helen Bakhsh, Ning Zhang, A. Carpenter
{"title":"TADL: A Trust-Aware Dynamic Location-Based Protocol Suite For Discovering Multiple Paths in MANETs","authors":"Helen Bakhsh, Ning Zhang, A. Carpenter","doi":"10.1145/2684464.2684491","DOIUrl":null,"url":null,"abstract":"This paper describes the design and evaluation of a multiple path discovery protocol suite aimed at finding a set of most trust-worthy paths for routing higher priority traffic towards a destination node with minimum overhead costs. The protocol suite, called a the Trust-Aware Dynamic Location-based (TADL) protocol suite, has taken three measures to optimize the path discovery outcome: (a) it uses a directional approach to broadcast route request packets to a destination, (b) it adjust the size of the searching area dynamically in response to the underlying network conditions, and (c) it uses trust values to govern the selection of neighbours in path formation and to reduce the overhead incurred in trust estimation, we have adopted a direct trust model. Measures (a) and (b) are take to minimise the level of broadcast traffic injected into the network in order to accomplish the path discovery task, and measure (c) is taken to ensure that the paths discovered are of best quality in terms of reliable packet deliveries. TADL is evaluated, using simulation, against the LAR protocol that has only implemented (a) (i.e. LAR only uses a location-based directional broadcast approach) under various network conditions. Our simulation study shows that TADL outperforms LAR in terms of reducing the routing overheads in the network. This overhead reduction can have a positive effect on QoS making the TADL more effective and efficient in providing QoS.","PeriodicalId":298587,"journal":{"name":"Proceedings of the 16th International Conference on Distributed Computing and Networking","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th International Conference on Distributed Computing and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2684464.2684491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper describes the design and evaluation of a multiple path discovery protocol suite aimed at finding a set of most trust-worthy paths for routing higher priority traffic towards a destination node with minimum overhead costs. The protocol suite, called a the Trust-Aware Dynamic Location-based (TADL) protocol suite, has taken three measures to optimize the path discovery outcome: (a) it uses a directional approach to broadcast route request packets to a destination, (b) it adjust the size of the searching area dynamically in response to the underlying network conditions, and (c) it uses trust values to govern the selection of neighbours in path formation and to reduce the overhead incurred in trust estimation, we have adopted a direct trust model. Measures (a) and (b) are take to minimise the level of broadcast traffic injected into the network in order to accomplish the path discovery task, and measure (c) is taken to ensure that the paths discovered are of best quality in terms of reliable packet deliveries. TADL is evaluated, using simulation, against the LAR protocol that has only implemented (a) (i.e. LAR only uses a location-based directional broadcast approach) under various network conditions. Our simulation study shows that TADL outperforms LAR in terms of reducing the routing overheads in the network. This overhead reduction can have a positive effect on QoS making the TADL more effective and efficient in providing QoS.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于信任感知的动态位置协议套件,用于发现manet中的多条路径
本文描述了多路径发现协议套件的设计和评估,旨在找到一组最可信的路径,以最小的开销将高优先级流量路由到目标节点。该协议套件称为基于信任感知的动态位置(TADL)协议套件,它采取了三种措施来优化路径发现结果:(a)采用定向方法向目的地广播路由请求数据包,(b)根据底层网络情况动态调整搜索区域的大小,(c)在路径形成中使用信任值来控制邻居的选择,并减少信任估计产生的开销,我们采用了直接信任模型。采取措施(a)及(b)是为了尽量减少注入网络的广播流量,以完成路径发现任务,而采取措施(c)则是为了确保所发现的路径在可靠的数据包传送方面具有最佳质量。使用仿真对在各种网络条件下仅实现(a)(即LAR仅使用基于位置的定向广播方法)的LAR协议进行评估。我们的模拟研究表明,在减少网络中的路由开销方面,TADL优于LAR。这种开销的减少可以对QoS产生积极影响,使TADL在提供QoS方面更加有效和高效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Distributed Computation of Sparse Cuts via Random Walks Self-Stabilizing ℓ-Exclusion Revisited Optimally Resilient Asynchronous MPC with Linear Communication Complexity OPCAM: Optimal Algorithms Implementing Causal Memories in Shared Memory Systems Solving Consensus in Opportunistic Networks
×
引用
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