Re-Pro Routing Protocol with trust based security for Broadcasting in Mobile Ad hoc Network

R. Mariappan, S. Mohan
{"title":"Re-Pro Routing Protocol with trust based security for Broadcasting in Mobile Ad hoc Network","authors":"R. Mariappan, S. Mohan","doi":"10.1109/ICOAC.2011.6165163","DOIUrl":null,"url":null,"abstract":"In this paper, we present new protocol design scenario like Re-Pro Routing Protocol (RPRP) for Broadcasting in wireless mobile Ad-hoc Network and a comparative performance for Mobile Ad hoc Networks protocols like as Ad-hoc On-Demand Distance Vector Routing protocol focusing on the effects of changes such as the increasing number of receivers or sources and increasing the number of nodes. Although some simulation results of MANET protocols have been published before, these protocols have not been compared in isolation. A systematic performance evaluation of these protocols is done by performing certain simulations and the trust methods are one of the security methods in mobile Ad-Hoc networks and this methods are prone to security risks but have found their acceptance due to efficiency over computationally expensive and time consuming cryptographic methods. The major problem with the trust methods is the period during which trust is growing and is yet to reach the requisite threshold. This paper also proposes security mechanism dependent upon Electronic Code (EC) combined with permutation functions. The proposed mechanism has low time complexity, is easier to implement, computationally inexpensive and has very high brute force search value.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Advanced Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOAC.2011.6165163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we present new protocol design scenario like Re-Pro Routing Protocol (RPRP) for Broadcasting in wireless mobile Ad-hoc Network and a comparative performance for Mobile Ad hoc Networks protocols like as Ad-hoc On-Demand Distance Vector Routing protocol focusing on the effects of changes such as the increasing number of receivers or sources and increasing the number of nodes. Although some simulation results of MANET protocols have been published before, these protocols have not been compared in isolation. A systematic performance evaluation of these protocols is done by performing certain simulations and the trust methods are one of the security methods in mobile Ad-Hoc networks and this methods are prone to security risks but have found their acceptance due to efficiency over computationally expensive and time consuming cryptographic methods. The major problem with the trust methods is the period during which trust is growing and is yet to reach the requisite threshold. This paper also proposes security mechanism dependent upon Electronic Code (EC) combined with permutation functions. The proposed mechanism has low time complexity, is easier to implement, computationally inexpensive and has very high brute force search value.
基于信任安全的移动Ad hoc网络广播Re-Pro路由协议
在本文中,我们提出了新的协议设计方案,如无线移动自组织网络广播的Re-Pro路由协议(RPRP),以及移动自组织网络协议的比较性能,如自组织按需距离矢量路由协议,重点关注诸如增加接收器或源数量以及增加节点数量等变化的影响。虽然之前已经发表了一些MANET协议的仿真结果,但这些协议并没有单独进行比较。通过模拟对这些协议进行了系统的性能评估,信任方法是移动Ad-Hoc网络中的一种安全方法,这种方法容易存在安全风险,但由于其效率高于计算昂贵且耗时的加密方法,因此已被人们所接受。信任方法的主要问题是信任正在成长,尚未达到必要的阈值。并结合排列函数提出了基于电子码(EC)的安全机制。该机制时间复杂度低,易于实现,计算成本低,具有很高的蛮力搜索价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信