{"title":"UOSPR: UnObservable secure proactive routing protocol for fast and secure transmission using B.A.T.M.A.N","authors":"S. Balaji, M. Prabha","doi":"10.1109/ICGHPC.2013.6533931","DOIUrl":null,"url":null,"abstract":"USOR deals with the concept of unlinkability, unobservability and anonymity by combining group signature and ID-based encryption for route discovery. Apart from the security, there is another requirement in transmission is effective and efficient delivery of data. USOR uses ordinary distance calculations to get the knowledge about neighbour nodes. At the same time we can't incorporate the entire information about the network into single node or every node. We know that nodes in ad-hoc network have limited storage and battery power. Already half of the power vested in security, remaining power has to be used for calculating routes and data transmission. For that we are merging the above USOR with Better Approach To Mobile Ad-hoc Networking, or B.A.T.M.A.N. which is a routing protocol that has the knowledge of its best route alone - no single node has all the data. This technique eliminates extending the information to the concerning network changes to every node in the network. Each node only maintains the best hop details not the entire network topology. From this we are achieving fast transmission of data in a secure way with minimum node failure rate.","PeriodicalId":119498,"journal":{"name":"2013 International Conference on Green High Performance Computing (ICGHPC)","volume":"59 17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Green High Performance Computing (ICGHPC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICGHPC.2013.6533931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
USOR deals with the concept of unlinkability, unobservability and anonymity by combining group signature and ID-based encryption for route discovery. Apart from the security, there is another requirement in transmission is effective and efficient delivery of data. USOR uses ordinary distance calculations to get the knowledge about neighbour nodes. At the same time we can't incorporate the entire information about the network into single node or every node. We know that nodes in ad-hoc network have limited storage and battery power. Already half of the power vested in security, remaining power has to be used for calculating routes and data transmission. For that we are merging the above USOR with Better Approach To Mobile Ad-hoc Networking, or B.A.T.M.A.N. which is a routing protocol that has the knowledge of its best route alone - no single node has all the data. This technique eliminates extending the information to the concerning network changes to every node in the network. Each node only maintains the best hop details not the entire network topology. From this we are achieving fast transmission of data in a secure way with minimum node failure rate.
USOR通过组合组签名和基于id的加密进行路由发现,处理了不可链接性、不可观察性和匿名性的概念。在传输中,除了安全性之外,还有一个要求是数据的有效和高效的传递。USOR使用普通的距离计算来获得关于邻居节点的知识。同时,我们不能将整个网络的信息整合到单个节点或每个节点中。我们知道,自组织网络中的节点存储和电池电量有限。已经有一半的电力用于安全,剩余的电力必须用于计算路线和数据传输。为此,我们将上述USOR与更好的移动自组织网络方法(Better Approach To Mobile Ad-hoc Networking,简称b.a.t.m.a.n)合并在一起。b.a.t.m.a.n是一种路由协议,它只知道最佳路由——没有一个节点拥有所有数据。这种技术避免了将有关网络更改的信息扩展到网络中的每个节点。每个节点只维护最佳跳的详细信息,而不是整个网络拓扑。由此,我们以最小的节点故障率以安全的方式实现了数据的快速传输。