移动自组织网络中基于移动性的聚类度量

P. Basu, Naved Khan, T. Little
{"title":"移动自组织网络中基于移动性的聚类度量","authors":"P. Basu, Naved Khan, T. Little","doi":"10.1109/CDCS.2001.918738","DOIUrl":null,"url":null,"abstract":"We present a novel relative mobility metric for mobile ad hoc networks (MANETs). It is based on the ratio of power levels due to successive receptions at each node from its neighbors. We propose a distributed clustering algorithm, MOBIC, based on the use of this mobility metric for selection of clusterheads, and demonstrate that it leads to more stable cluster formation than the \"least clusterhead change\" version of the well known Lowest-ID clustering algorithm (Chiang et al., 1997). We show reduction of as much as 33% in the rate of clusterhead changes owing to the use of the proposed technique. In a MANET that uses scalable cluster-based services, network performance metrics such as throughput and delay are tightly coupled with the frequency of cluster reorganization. Therefore, we believe that using MOBIC can result in a more stable configuration, and thus yield better performance.","PeriodicalId":273489,"journal":{"name":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"761","resultStr":"{\"title\":\"A mobility based metric for clustering in mobile ad hoc networks\",\"authors\":\"P. Basu, Naved Khan, T. Little\",\"doi\":\"10.1109/CDCS.2001.918738\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a novel relative mobility metric for mobile ad hoc networks (MANETs). It is based on the ratio of power levels due to successive receptions at each node from its neighbors. We propose a distributed clustering algorithm, MOBIC, based on the use of this mobility metric for selection of clusterheads, and demonstrate that it leads to more stable cluster formation than the \\\"least clusterhead change\\\" version of the well known Lowest-ID clustering algorithm (Chiang et al., 1997). We show reduction of as much as 33% in the rate of clusterhead changes owing to the use of the proposed technique. In a MANET that uses scalable cluster-based services, network performance metrics such as throughput and delay are tightly coupled with the frequency of cluster reorganization. Therefore, we believe that using MOBIC can result in a more stable configuration, and thus yield better performance.\",\"PeriodicalId\":273489,\"journal\":{\"name\":\"Proceedings 21st International Conference on Distributed Computing Systems Workshops\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"761\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 21st International Conference on Distributed Computing Systems Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDCS.2001.918738\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 21st International Conference on Distributed Computing Systems Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDCS.2001.918738","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 761

摘要

我们提出了一种新的移动自组织网络(manet)的相对移动性度量。它基于每个节点从相邻节点连续接收到的功率水平之比。我们提出了一种分布式聚类算法,MOBIC,基于使用这种移动性度量来选择簇头,并证明它比众所周知的最低id聚类算法的“最小簇头变化”版本更稳定的簇形成(Chiang et al., 1997)。我们显示,由于使用了所提出的技术,簇头变化率降低了33%。在使用可扩展的基于集群的服务的MANET中,网络性能指标(如吞吐量和延迟)与集群重组的频率紧密耦合。因此,我们相信使用MOBIC可以产生更稳定的配置,从而产生更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A mobility based metric for clustering in mobile ad hoc networks
We present a novel relative mobility metric for mobile ad hoc networks (MANETs). It is based on the ratio of power levels due to successive receptions at each node from its neighbors. We propose a distributed clustering algorithm, MOBIC, based on the use of this mobility metric for selection of clusterheads, and demonstrate that it leads to more stable cluster formation than the "least clusterhead change" version of the well known Lowest-ID clustering algorithm (Chiang et al., 1997). We show reduction of as much as 33% in the rate of clusterhead changes owing to the use of the proposed technique. In a MANET that uses scalable cluster-based services, network performance metrics such as throughput and delay are tightly coupled with the frequency of cluster reorganization. Therefore, we believe that using MOBIC can result in a more stable configuration, and thus yield better performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信