随机节点失效的空间增长模型

W. Wenjun
{"title":"随机节点失效的空间增长模型","authors":"W. Wenjun","doi":"10.1109/ICICTA.2015.213","DOIUrl":null,"url":null,"abstract":"Ad-hoc network is an important applied branch of scale-free networks, which has been widely studied. In this paper, insertions and failures of nodes in ad-hoc networks are modeled in spatial growth models. The preferential attachment probability is based on the topological degree and modulated by a Euclidean distance dependent power-law function. Node failures are represented by random node deletions in the model. Degree distributions of the proposed spatial growth models for ad-hoc networks are evaluated. The results show that both the Euclidean distance dependent preferential attachment and the random node deletion can change the degree distribution. When the distance exponent is smaller than-1 or the deletion ratio is larger than 0.5, the network is not scale-free any more, and the degree distribution follows the exponential decay law. The varying of the average degree of the node with time is also evaluated. The results show that, irrelevant to the distance exponent, the average degree can achieve a convergent value for each value of the deletion ratio and simulation results match calculated values completely.","PeriodicalId":231694,"journal":{"name":"2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Spatial Growth Models with Random Node Failures\",\"authors\":\"W. Wenjun\",\"doi\":\"10.1109/ICICTA.2015.213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ad-hoc network is an important applied branch of scale-free networks, which has been widely studied. In this paper, insertions and failures of nodes in ad-hoc networks are modeled in spatial growth models. The preferential attachment probability is based on the topological degree and modulated by a Euclidean distance dependent power-law function. Node failures are represented by random node deletions in the model. Degree distributions of the proposed spatial growth models for ad-hoc networks are evaluated. The results show that both the Euclidean distance dependent preferential attachment and the random node deletion can change the degree distribution. When the distance exponent is smaller than-1 or the deletion ratio is larger than 0.5, the network is not scale-free any more, and the degree distribution follows the exponential decay law. The varying of the average degree of the node with time is also evaluated. The results show that, irrelevant to the distance exponent, the average degree can achieve a convergent value for each value of the deletion ratio and simulation results match calculated values completely.\",\"PeriodicalId\":231694,\"journal\":{\"name\":\"2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICTA.2015.213\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 8th International Conference on Intelligent Computation Technology and Automation (ICICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICTA.2015.213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

自组网是无标度网络的一个重要应用分支,得到了广泛的研究。本文用空间增长模型对自组织网络中节点的插入和失效进行了建模。优先附着概率基于拓扑度,由依赖于欧氏距离的幂律函数调制。节点故障由模型中的随机节点删除表示。评价了所提出的ad-hoc网络空间增长模型的程度分布。结果表明,依赖于欧氏距离的优先连接和随机节点删除都能改变度分布。当距离指数小于-1或缺失比大于0.5时,网络不再是无标度的,度分布遵循指数衰减规律。计算了节点的平均度随时间的变化。结果表明,在与距离指数无关的情况下,平均度对删除率的每个值都能达到一个收敛值,仿真结果与计算值完全吻合。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Spatial Growth Models with Random Node Failures
Ad-hoc network is an important applied branch of scale-free networks, which has been widely studied. In this paper, insertions and failures of nodes in ad-hoc networks are modeled in spatial growth models. The preferential attachment probability is based on the topological degree and modulated by a Euclidean distance dependent power-law function. Node failures are represented by random node deletions in the model. Degree distributions of the proposed spatial growth models for ad-hoc networks are evaluated. The results show that both the Euclidean distance dependent preferential attachment and the random node deletion can change the degree distribution. When the distance exponent is smaller than-1 or the deletion ratio is larger than 0.5, the network is not scale-free any more, and the degree distribution follows the exponential decay law. The varying of the average degree of the node with time is also evaluated. The results show that, irrelevant to the distance exponent, the average degree can achieve a convergent value for each value of the deletion ratio and simulation results match calculated values completely.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信