{"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}
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