基于半马尔可夫节点行为模型的自利邻居隔离

J. Sengathir, R. Manoharan, R. Raja Kumar
{"title":"基于半马尔可夫节点行为模型的自利邻居隔离","authors":"J. Sengathir, R. Manoharan, R. Raja Kumar","doi":"10.1109/ICRTIT.2014.6996155","DOIUrl":null,"url":null,"abstract":"Reliable dissemination of data in mobile ad hoc network necessitates high degree of connectivity among the nodes present in that environment. The existence of selfish nodes could drastically affect the network connectivity. However, the impact of selfish nodes on network connectivity has been studied either through reputation factor computed based on past history or conditional probability manipulated based on both the past and present behavior of nodes. Hence, a need arises for formulating a mathematical model that makes its future routing decision only based on the present context of the node. In this paper, we propose a Semi-Markov based mathematical model, which isolates selfish nodes exponentially. In particular, we stochastically analyze the network resilience with the aid of transition probability matrix. The effectiveness of the proposed model for network survivability has been verified through quantitative analysis. The numerical results, thus obtained make it evident that the network survivability decreases when the number of selfish nodes increases in an ad hoc scenario.","PeriodicalId":422275,"journal":{"name":"2014 International Conference on Recent Trends in Information Technology","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Semi - Markov based node behavior model for isolating selfish neighbors in MANETs\",\"authors\":\"J. Sengathir, R. Manoharan, R. Raja Kumar\",\"doi\":\"10.1109/ICRTIT.2014.6996155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Reliable dissemination of data in mobile ad hoc network necessitates high degree of connectivity among the nodes present in that environment. The existence of selfish nodes could drastically affect the network connectivity. However, the impact of selfish nodes on network connectivity has been studied either through reputation factor computed based on past history or conditional probability manipulated based on both the past and present behavior of nodes. Hence, a need arises for formulating a mathematical model that makes its future routing decision only based on the present context of the node. In this paper, we propose a Semi-Markov based mathematical model, which isolates selfish nodes exponentially. In particular, we stochastically analyze the network resilience with the aid of transition probability matrix. The effectiveness of the proposed model for network survivability has been verified through quantitative analysis. The numerical results, thus obtained make it evident that the network survivability decreases when the number of selfish nodes increases in an ad hoc scenario.\",\"PeriodicalId\":422275,\"journal\":{\"name\":\"2014 International Conference on Recent Trends in Information Technology\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 International Conference on Recent Trends in Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRTIT.2014.6996155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Recent Trends in Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRTIT.2014.6996155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在移动自组织网络中,数据的可靠传播需要该环境中节点之间的高度连接。自私节点的存在会严重影响网络的连通性。然而,自私节点对网络连通性的影响已经通过基于过去历史计算的声誉因子或基于节点过去和现在行为操纵的条件概率来研究。因此,需要制定一种数学模型,使其未来的路由决策仅基于节点的当前上下文。本文提出了一种基于半马尔可夫的数学模型,该模型可以指数地隔离自利节点。特别地,我们借助转移概率矩阵对网络弹性进行了随机分析。通过定量分析,验证了所提网络生存能力模型的有效性。由此得到的数值结果表明,当自利节点数量增加时,网络的生存性明显降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Semi - Markov based node behavior model for isolating selfish neighbors in MANETs
Reliable dissemination of data in mobile ad hoc network necessitates high degree of connectivity among the nodes present in that environment. The existence of selfish nodes could drastically affect the network connectivity. However, the impact of selfish nodes on network connectivity has been studied either through reputation factor computed based on past history or conditional probability manipulated based on both the past and present behavior of nodes. Hence, a need arises for formulating a mathematical model that makes its future routing decision only based on the present context of the node. In this paper, we propose a Semi-Markov based mathematical model, which isolates selfish nodes exponentially. In particular, we stochastically analyze the network resilience with the aid of transition probability matrix. The effectiveness of the proposed model for network survivability has been verified through quantitative analysis. The numerical results, thus obtained make it evident that the network survivability decreases when the number of selfish nodes increases in an ad hoc scenario.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信