无线自组网拓扑控制中连通支配集的设计与分析

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005. Pub Date : 2005-10-31 DOI:10.1109/ICCCN.2005.1523797

B. Han, W. Jia

{"title":"无线自组网拓扑控制中连通支配集的设计与分析","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":"{\"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}","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

摘要

为了有效地管理自组织网络，本文提出了一种时间复杂度和消息复杂度为0 (n)的无线自组织网络中连接支配集(CDS)形成的分布式算法。该算法将节点划分为不同的区域，并有选择地连接两个相距两或三跳的支配者。通过分析和综合仿真研究，与以往的知名算法进行了比较，验证了该算法的有效性。该Area算法形成的CDS节点数比其他算法构建的CDS节点数最多减少55%左右。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.

自引率

0.00%

发文量