无线自组织网络中的K-Leader选举

V. Raychoudhury, Jiannong Cao, Weigang Wu
{"title":"无线自组织网络中的K-Leader选举","authors":"V. Raychoudhury, Jiannong Cao, Weigang Wu","doi":"10.1109/ICCCN.2008.ECP.35","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a distributed algorithm to elect the top K leaders among the nodes in a wireless ad hoc network. Leader election is a fundamental distributed coordination problem arising from many applications, e.g. token regeneration, directory service. However, there is no deterministic algorithm proposed for electing k leaders. In our algorithm, election is based on the weight values of the nodes, which can represent any performance related attribute such as the node's battery power, computational capabilities etc. To achieve message efficiency, coordinator nodes are first selected locally and then the coordinator nodes collect the weight information of other nodes using a diffusing computation approach. The coordinator nodes collaborate with each other to further reduce the message cost. Node failures are also considered in our design. The simulation results show that, compared with a naive solution, our proposed algorithm can elect top K leaders with much less message cost.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Top K-Leader Election in Wireless Ad Hoc Networks\",\"authors\":\"V. Raychoudhury, Jiannong Cao, Weigang Wu\",\"doi\":\"10.1109/ICCCN.2008.ECP.35\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a distributed algorithm to elect the top K leaders among the nodes in a wireless ad hoc network. Leader election is a fundamental distributed coordination problem arising from many applications, e.g. token regeneration, directory service. However, there is no deterministic algorithm proposed for electing k leaders. In our algorithm, election is based on the weight values of the nodes, which can represent any performance related attribute such as the node's battery power, computational capabilities etc. To achieve message efficiency, coordinator nodes are first selected locally and then the coordinator nodes collect the weight information of other nodes using a diffusing computation approach. The coordinator nodes collaborate with each other to further reduce the message cost. Node failures are also considered in our design. The simulation results show that, compared with a naive solution, our proposed algorithm can elect top K leaders with much less message cost.\",\"PeriodicalId\":314071,\"journal\":{\"name\":\"2008 Proceedings of 17th International Conference on Computer Communications and Networks\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Proceedings of 17th International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2008.ECP.35\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2008.ECP.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

摘要

在本文中,我们提出了一种分布式算法来在无线自组织网络的节点中选出最顶端的K个领导者。领导者选举是一个基本的分布式协调问题,在许多应用中都会出现,例如令牌再生、目录服务等。然而,对于k个领导人的选举,并没有提出确定性的算法。在我们的算法中,选举是基于节点的权重值,它可以表示任何与性能相关的属性,如节点的电池电量,计算能力等。为了提高消息效率,首先在本地选择协调节点,然后使用扩散计算方法收集其他节点的权重信息。协调器节点相互协作以进一步降低消息成本。在我们的设计中也考虑了节点故障。仿真结果表明,与朴素算法相比,本文算法能够以更小的消息代价选出K个最优领导者。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Top K-Leader Election in Wireless Ad Hoc Networks
In this paper, we propose a distributed algorithm to elect the top K leaders among the nodes in a wireless ad hoc network. Leader election is a fundamental distributed coordination problem arising from many applications, e.g. token regeneration, directory service. However, there is no deterministic algorithm proposed for electing k leaders. In our algorithm, election is based on the weight values of the nodes, which can represent any performance related attribute such as the node's battery power, computational capabilities etc. To achieve message efficiency, coordinator nodes are first selected locally and then the coordinator nodes collect the weight information of other nodes using a diffusing computation approach. The coordinator nodes collaborate with each other to further reduce the message cost. Node failures are also considered in our design. The simulation results show that, compared with a naive solution, our proposed algorithm can elect top K leaders with much less message cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信