基于定向预算的无线传感器网络聚类

Leonidas Tzevelekas, I. Stavrakakis
{"title":"基于定向预算的无线传感器网络聚类","authors":"Leonidas Tzevelekas, I. Stavrakakis","doi":"10.1109/MOBHOC.2006.278632","DOIUrl":null,"url":null,"abstract":"Wireless sensor networks are typically bound to operate autonomously on a field, under severe energy constraints and without any centralized control. It is thus essential to develop self organization protocols/algorithms which enable the autonomous, distributed and energy efficient network self organization. Budget based clustering approaches have recently been proposed for this purpose, by specifying rules for distributing a given budget of tokens to neighbors. In this paper, two strictly localized, budget based clustering algorithms are pro posed: the directed budget based (DBB) and directed budget based with random delays (DBB-RD). The basic, innovative idea is to utilize clustering status information that can be readily available (e.g. through the HELLO exchanges) to reduce or eliminate token distribution contentions (both intra and inter cluster) that severely limit the effectiveness of earlier budget based approaches. Simulation results are presented demonstrating a substantial improvement over the earlier approaches with respect to the achieved cluster sizes and time to complete network decomposition","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Directed Budget-Based Clustering for Wireless Sensor Networks\",\"authors\":\"Leonidas Tzevelekas, I. Stavrakakis\",\"doi\":\"10.1109/MOBHOC.2006.278632\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless sensor networks are typically bound to operate autonomously on a field, under severe energy constraints and without any centralized control. It is thus essential to develop self organization protocols/algorithms which enable the autonomous, distributed and energy efficient network self organization. Budget based clustering approaches have recently been proposed for this purpose, by specifying rules for distributing a given budget of tokens to neighbors. In this paper, two strictly localized, budget based clustering algorithms are pro posed: the directed budget based (DBB) and directed budget based with random delays (DBB-RD). The basic, innovative idea is to utilize clustering status information that can be readily available (e.g. through the HELLO exchanges) to reduce or eliminate token distribution contentions (both intra and inter cluster) that severely limit the effectiveness of earlier budget based approaches. Simulation results are presented demonstrating a substantial improvement over the earlier approaches with respect to the achieved cluster sizes and time to complete network decomposition\",\"PeriodicalId\":345003,\"journal\":{\"name\":\"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MOBHOC.2006.278632\",\"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 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOBHOC.2006.278632","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

无线传感器网络通常必须在现场自主运行,在严格的能源限制下,没有任何集中控制。因此,有必要开发自组织协议/算法,使自主、分布式和节能的网络自组织成为可能。最近有人为此提出了基于预算的聚类方法,通过指定将给定预算的令牌分配给邻居的规则。本文提出了两种严格局部的、基于预算的聚类算法:基于定向预算的聚类算法(DBB)和基于随机延迟的定向预算聚类算法(DBB- rd)。基本的、创新的想法是利用可以随时获得的集群状态信息(例如,通过HELLO交换)来减少或消除令牌分发争用(集群内部和集群间),这些争用严重限制了早期基于预算的方法的有效性。仿真结果表明,在实现的簇大小和完成网络分解的时间方面,该方法比先前的方法有了实质性的改进
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Directed Budget-Based Clustering for Wireless Sensor Networks
Wireless sensor networks are typically bound to operate autonomously on a field, under severe energy constraints and without any centralized control. It is thus essential to develop self organization protocols/algorithms which enable the autonomous, distributed and energy efficient network self organization. Budget based clustering approaches have recently been proposed for this purpose, by specifying rules for distributing a given budget of tokens to neighbors. In this paper, two strictly localized, budget based clustering algorithms are pro posed: the directed budget based (DBB) and directed budget based with random delays (DBB-RD). The basic, innovative idea is to utilize clustering status information that can be readily available (e.g. through the HELLO exchanges) to reduce or eliminate token distribution contentions (both intra and inter cluster) that severely limit the effectiveness of earlier budget based approaches. Simulation results are presented demonstrating a substantial improvement over the earlier approaches with respect to the achieved cluster sizes and time to complete network decomposition
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信