Design and analysis of connected dominating set formation for topology control in wireless ad hoc networks

B. Han, W. Jia
{"title":"Design and analysis of connected dominating set formation for topology control in wireless ad hoc networks","authors":"B. Han, W. Jia","doi":"10.1109/ICCCN.2005.1523797","DOIUrl":null,"url":null,"abstract":"To efficiently manage ad hoc networks, this paper proposes a novel distributed algorithm for connected dominating set (CDS) formation in wireless ad hoc networks with time and message complexity O(n). This Area algorithm partitions the nodes into different areas and selectively connects two dominators that are two or three hops away. Compared with previous well-known algorithms, we confirm the effectiveness of this algorithm through analysis and comprehensive simulation study. The number of nodes in the CDS formed by this Area algorithm is up to around 55% less than that constructed by others.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523797","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

To efficiently manage ad hoc networks, this paper proposes a novel distributed algorithm for connected dominating set (CDS) formation in wireless ad hoc networks with time and message complexity O(n). This Area algorithm partitions the nodes into different areas and selectively connects two dominators that are two or three hops away. Compared with previous well-known algorithms, we confirm the effectiveness of this algorithm through analysis and comprehensive simulation study. The number of nodes in the CDS formed by this Area algorithm is up to around 55% less than that constructed by others.
无线自组网拓扑控制中连通支配集的设计与分析
为了有效地管理自组织网络,本文提出了一种时间复杂度和消息复杂度为0 (n)的无线自组织网络中连接支配集(CDS)形成的分布式算法。该算法将节点划分为不同的区域,并有选择地连接两个相距两或三跳的支配者。通过分析和综合仿真研究,与以往的知名算法进行了比较,验证了该算法的有效性。该Area算法形成的CDS节点数比其他算法构建的CDS节点数最多减少55%左右。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信