基于WCA的城域网中DSR和OLSR路由协议重聚类方法

Mahesh Gochar, Ravinder Singh
{"title":"基于WCA的城域网中DSR和OLSR路由协议重聚类方法","authors":"Mahesh Gochar, Ravinder Singh","doi":"10.1109/rise.2017.8378205","DOIUrl":null,"url":null,"abstract":"This is a weighted cluster algorithm based on re-clustering approach for OLSR and DSR protocols in MANET. In this protocol, all the nodes of the networks are clustered into a single cluster; we have analyzed the way how to compute the trusting values according to their interaction performances between the nodes. Based on the trusting value, we can decide and check whether the connection between the two nodes is reliable or not. On the basis of no. of reliable connections, we can choose the cluster head in the cluster, and the nodes which hold solid association with cluster head will be the base nodes, base nodes and the cluster head can work together for being the service providing congregation (group) for the cluster. Each member will circulate a secret share mechanism which will be a part of secret key for itself, and come into being the parameter of authentication in the processing of investigation about the up to date requirement in the next cluster, and the obscure and secret share mechanism can also be authenticated by the node itself. One node has been confirmed as a malicious node at a time; cluster head broadcasts the information to all the cluster members and refuse to provide updating service for the particular malicious node. The protocol has absolute forward confidentiality and backward confidentiality. The keys of nodes and cluster are generated after discussion among the service group members, Man-in-the-middle attack can be resisted by this way. At the same time, the cluster can achieve the periodic update, the cluster head will be reelected, service group will be reformed, subsequently, the key of cluster and nodes will be updated as well.","PeriodicalId":166244,"journal":{"name":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"WCA based re-clustering approach in DSR and OLSR routing protocols in MANET\",\"authors\":\"Mahesh Gochar, Ravinder Singh\",\"doi\":\"10.1109/rise.2017.8378205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This is a weighted cluster algorithm based on re-clustering approach for OLSR and DSR protocols in MANET. In this protocol, all the nodes of the networks are clustered into a single cluster; we have analyzed the way how to compute the trusting values according to their interaction performances between the nodes. Based on the trusting value, we can decide and check whether the connection between the two nodes is reliable or not. On the basis of no. of reliable connections, we can choose the cluster head in the cluster, and the nodes which hold solid association with cluster head will be the base nodes, base nodes and the cluster head can work together for being the service providing congregation (group) for the cluster. Each member will circulate a secret share mechanism which will be a part of secret key for itself, and come into being the parameter of authentication in the processing of investigation about the up to date requirement in the next cluster, and the obscure and secret share mechanism can also be authenticated by the node itself. One node has been confirmed as a malicious node at a time; cluster head broadcasts the information to all the cluster members and refuse to provide updating service for the particular malicious node. The protocol has absolute forward confidentiality and backward confidentiality. The keys of nodes and cluster are generated after discussion among the service group members, Man-in-the-middle attack can be resisted by this way. At the same time, the cluster can achieve the periodic update, the cluster head will be reelected, service group will be reformed, subsequently, the key of cluster and nodes will be updated as well.\",\"PeriodicalId\":166244,\"journal\":{\"name\":\"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)\",\"volume\":\"39 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/rise.2017.8378205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Recent Innovations in Signal processing and Embedded Systems (RISE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/rise.2017.8378205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

这是一种基于重聚类方法的加权聚类算法,适用于无线局域网中的OLSR和DSR协议。在该协议中,网络的所有节点都聚集成一个集群;根据节点间的交互性能,分析了节点间信任值的计算方法。根据信任值,我们可以判断和检查两个节点之间的连接是否可靠。在没有的基础上。对于可靠的连接,我们可以在集群中选择簇头,与簇头保持牢固关联的节点作为基础节点,基础节点和簇头可以一起工作,作为集群提供服务的集合(组)。每个成员将循环一个秘密共享机制,该机制将成为自己秘密密钥的一部分,并在下一个集群中调查最新需求的过程中形成认证参数,并且模糊和秘密共享机制也可以由节点自己进行认证。一次确认一个节点为恶意节点;集群头向所有集群成员广播信息,并拒绝为特定的恶意节点提供更新服务。协议具有绝对的前向保密和后向保密。节点和集群的密钥由服务组成员讨论生成,可以抵御中间人攻击。同时,集群可以实现周期性更新,重新选举集群头,改革服务组,随后更新集群和节点的密钥。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
WCA based re-clustering approach in DSR and OLSR routing protocols in MANET
This is a weighted cluster algorithm based on re-clustering approach for OLSR and DSR protocols in MANET. In this protocol, all the nodes of the networks are clustered into a single cluster; we have analyzed the way how to compute the trusting values according to their interaction performances between the nodes. Based on the trusting value, we can decide and check whether the connection between the two nodes is reliable or not. On the basis of no. of reliable connections, we can choose the cluster head in the cluster, and the nodes which hold solid association with cluster head will be the base nodes, base nodes and the cluster head can work together for being the service providing congregation (group) for the cluster. Each member will circulate a secret share mechanism which will be a part of secret key for itself, and come into being the parameter of authentication in the processing of investigation about the up to date requirement in the next cluster, and the obscure and secret share mechanism can also be authenticated by the node itself. One node has been confirmed as a malicious node at a time; cluster head broadcasts the information to all the cluster members and refuse to provide updating service for the particular malicious node. The protocol has absolute forward confidentiality and backward confidentiality. The keys of nodes and cluster are generated after discussion among the service group members, Man-in-the-middle attack can be resisted by this way. At the same time, the cluster can achieve the periodic update, the cluster head will be reelected, service group will be reformed, subsequently, the key of cluster and nodes will be updated as well.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信