移动Ad Hoc网络的实时自组织自治聚类

Y. Kakuda, T. Ohta, Ryotaro Oda
{"title":"移动Ad Hoc网络的实时自组织自治聚类","authors":"Y. Kakuda, T. Ohta, Ryotaro Oda","doi":"10.1109/ISORCW.2010.14","DOIUrl":null,"url":null,"abstract":"In order to realize hierarchical routings that should be executed in large-scaled mobile ad hoc networks that vary their topologies considerably with time, we have developed autonomous clustering with high scalability and adaptability. In autonomous clustering, an entire network is divided into disjoint subnetworks (called clusters), and they are maintained by periodically sending messages within the clusters. This paper proposes real-time self-organizing autonomous clustering, in which interval and power for transmitting such messages are dynamically changed depending on variation of mobility and density of the clusters. Since their mobility and density can be estimated by local information obtained in the clusters and according to their respective change the clusters are self-organized in real-time way, the proposed real-time self-organizing autonomous clustering can contribute to enhancement of its scalability and adaptability.","PeriodicalId":174806,"journal":{"name":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","volume":"42 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Real-Time Self-Organizing Autonomous Clustering for Mobile Ad Hoc Networks\",\"authors\":\"Y. Kakuda, T. Ohta, Ryotaro Oda\",\"doi\":\"10.1109/ISORCW.2010.14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to realize hierarchical routings that should be executed in large-scaled mobile ad hoc networks that vary their topologies considerably with time, we have developed autonomous clustering with high scalability and adaptability. In autonomous clustering, an entire network is divided into disjoint subnetworks (called clusters), and they are maintained by periodically sending messages within the clusters. This paper proposes real-time self-organizing autonomous clustering, in which interval and power for transmitting such messages are dynamically changed depending on variation of mobility and density of the clusters. Since their mobility and density can be estimated by local information obtained in the clusters and according to their respective change the clusters are self-organized in real-time way, the proposed real-time self-organizing autonomous clustering can contribute to enhancement of its scalability and adaptability.\",\"PeriodicalId\":174806,\"journal\":{\"name\":\"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISORCW.2010.14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORCW.2010.14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

为了实现在拓扑结构随时间变化较大的大规模移动自组织网络中执行的分层路由,我们开发了具有高可扩展性和适应性的自治集群。在自治集群中,将整个网络划分为不相交的子网(称为集群),并通过在集群内定期发送消息来维护它们。本文提出了一种实时自组织自治聚类算法,该算法根据簇的迁移率和密度的变化动态地改变发送消息的间隔和功率。由于簇的迁移率和密度可由簇中获取的局部信息来估计,并且簇根据各自的变化进行实时自组织,因此本文提出的实时自组织自治簇有助于增强簇的可扩展性和适应性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Real-Time Self-Organizing Autonomous Clustering for Mobile Ad Hoc Networks
In order to realize hierarchical routings that should be executed in large-scaled mobile ad hoc networks that vary their topologies considerably with time, we have developed autonomous clustering with high scalability and adaptability. In autonomous clustering, an entire network is divided into disjoint subnetworks (called clusters), and they are maintained by periodically sending messages within the clusters. This paper proposes real-time self-organizing autonomous clustering, in which interval and power for transmitting such messages are dynamically changed depending on variation of mobility and density of the clusters. Since their mobility and density can be estimated by local information obtained in the clusters and according to their respective change the clusters are self-organized in real-time way, the proposed real-time self-organizing autonomous clustering can contribute to enhancement of its scalability and adaptability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信