无线Ad Hoc网络中的功率感知聚类技术

S. K. Dhurandher, G. V. Singh
{"title":"无线Ad Hoc网络中的功率感知聚类技术","authors":"S. K. Dhurandher, G. V. Singh","doi":"10.1109/ISAHUC.2006.4290651","DOIUrl":null,"url":null,"abstract":"The concept of clustering has been proved to be very effective in managing the resources at the MAC level in a wireless multi hop network. In this paper we present a power aware clustering algorithm for mobile ad-hoc networks. The proposed algorithm takes into account, the transmission power, transmission rate, mobility, battery power, and the degree of a node for cluster head selection. The Lowest-ID algorithm finds the local minima of IDs and the Weighted Clustering Algorithm (WCA) finds the global minima of weights for selecting cluster heads. In contrast, the proposed power aware clustering algorithm finds only the local minima of weights for the clustering process. Through simulations, we investigated the performance of our algorithm with that of Lowest-ID and WCA in terms of the number of clusterhead changes, the number of reaffiliations, the control overhead and the throughput. The results have demonstrated the superior performance of the proposed algorithm in terms of energy consumption in the network.","PeriodicalId":165524,"journal":{"name":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":"{\"title\":\"Power Aware Clustering Technique in Wireless Ad Hoc Networks\",\"authors\":\"S. K. Dhurandher, G. V. Singh\",\"doi\":\"10.1109/ISAHUC.2006.4290651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The concept of clustering has been proved to be very effective in managing the resources at the MAC level in a wireless multi hop network. In this paper we present a power aware clustering algorithm for mobile ad-hoc networks. The proposed algorithm takes into account, the transmission power, transmission rate, mobility, battery power, and the degree of a node for cluster head selection. The Lowest-ID algorithm finds the local minima of IDs and the Weighted Clustering Algorithm (WCA) finds the global minima of weights for selecting cluster heads. In contrast, the proposed power aware clustering algorithm finds only the local minima of weights for the clustering process. Through simulations, we investigated the performance of our algorithm with that of Lowest-ID and WCA in terms of the number of clusterhead changes, the number of reaffiliations, the control overhead and the throughput. The results have demonstrated the superior performance of the proposed algorithm in terms of energy consumption in the network.\",\"PeriodicalId\":165524,\"journal\":{\"name\":\"2006 International Symposium on Ad Hoc and Ubiquitous Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"18\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Symposium on Ad Hoc and Ubiquitous Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISAHUC.2006.4290651\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Symposium on Ad Hoc and Ubiquitous Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAHUC.2006.4290651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 18

摘要

在无线多跳网络中,集群的概念在MAC层的资源管理中被证明是非常有效的。本文提出了一种适用于移动自组织网络的功率感知聚类算法。该算法综合考虑了传输功率、传输速率、可移动性、电池电量、节点的度等因素进行簇头选择。最小id算法寻找id的局部最小值,加权聚类算法(WCA)寻找权重的全局最小值来选择簇头。相比之下,本文提出的功率感知聚类算法在聚类过程中只找到局部最小权值。通过仿真,从簇头变化次数、重组次数、控制开销和吞吐量等方面比较了该算法与low - id和WCA算法的性能。结果表明,该算法在网络能耗方面具有优越的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Power Aware Clustering Technique in Wireless Ad Hoc Networks
The concept of clustering has been proved to be very effective in managing the resources at the MAC level in a wireless multi hop network. In this paper we present a power aware clustering algorithm for mobile ad-hoc networks. The proposed algorithm takes into account, the transmission power, transmission rate, mobility, battery power, and the degree of a node for cluster head selection. The Lowest-ID algorithm finds the local minima of IDs and the Weighted Clustering Algorithm (WCA) finds the global minima of weights for selecting cluster heads. In contrast, the proposed power aware clustering algorithm finds only the local minima of weights for the clustering process. Through simulations, we investigated the performance of our algorithm with that of Lowest-ID and WCA in terms of the number of clusterhead changes, the number of reaffiliations, the control overhead and the throughput. The results have demonstrated the superior performance of the proposed algorithm in terms of energy consumption in the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信