On construction of quality virtual backbone in wireless networks using cooperative communication

IF 4.5 3区计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Communications Pub Date : 2024-09-12 DOI:10.1016/j.comcom.2024.107952

Junhao Wang , Jiarong Liang , Qingnian Li

{"title":"On construction of quality virtual backbone in wireless networks using cooperative communication","authors":"Junhao Wang , Jiarong Liang , Qingnian Li","doi":"10.1016/j.comcom.2024.107952","DOIUrl":null,"url":null,"abstract":"<div><p>An extended connected dominating set (ECDS) in a wireless network with cooperative communication (CC) is a subset of nodes such that its induced subgraph is connected and each node outside the ECDS is covered by either one neighbor or several quasineighbors in the ECDS. Traditionality, the size of virtual backbone (VB) is the only factor considered in the problem of CDS construction. However, diameter is also an important factor to evaluate VB. In this paper we consider the problem of constructing quality ECDSs in unit disk graphs under CC with both of these two factors. We propose a two-phase centralized algorithm BD-ECDS to construct an ECDS for a given UDG with CC, which has a constant performance ratio (PR) and diameter. To obtain the PR of this two-phase centralized algorithm, we first give an upper bound of the EDS and use this upper bound to prove that the size of the ECDS under CC generated by the centralized algorithm is no greater than <span><math><mrow><mn>120</mn><mrow><mo>|</mo><mi>E</mi><mi>C</mi><mi>D</mi><msub><mrow><mi>S</mi></mrow><mrow><mi>o</mi><mi>p</mi><mi>t</mi></mrow></msub><mo>|</mo></mrow><mo>−</mo><mn>2</mn></mrow></math></span>, where <span><math><mrow><mi>E</mi><mi>C</mi><mi>D</mi><msub><mrow><mi>S</mi></mrow><mrow><mi>o</mi><mi>p</mi><mi>t</mi></mrow></msub></mrow></math></span> is the size of the minimum ECDS. Furthermore, our theoretical analysis and simulation results show that our algorithm BD-ECDS is superior to previous approaches.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"228 ","pages":"Article 107952"},"PeriodicalIF":4.5000,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366424002998","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

An extended connected dominating set (ECDS) in a wireless network with cooperative communication (CC) is a subset of nodes such that its induced subgraph is connected and each node outside the ECDS is covered by either one neighbor or several quasineighbors in the ECDS. Traditionality, the size of virtual backbone (VB) is the only factor considered in the problem of CDS construction. However, diameter is also an important factor to evaluate VB. In this paper we consider the problem of constructing quality ECDSs in unit disk graphs under CC with both of these two factors. We propose a two-phase centralized algorithm BD-ECDS to construct an ECDS for a given UDG with CC, which has a constant performance ratio (PR) and diameter. To obtain the PR of this two-phase centralized algorithm, we first give an upper bound of the EDS and use this upper bound to prove that the size of the ECDS under CC generated by the centralized algorithm is no greater than $120 | E C D S_{o p t} | - 2$ , where $E C D S_{o p t}$ is the size of the minimum ECDS. Furthermore, our theoretical analysis and simulation results show that our algorithm BD-ECDS is superior to previous approaches.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

论利用合作通信在无线网络中构建高质量虚拟骨干网

合作通信（CC）无线网络中的扩展连通支配集（ECDS）是这样一个节点子集：它的诱导子图是连通的，ECDS 以外的每个节点都被 ECDS 中的一个邻居或几个准邻居覆盖。传统上，虚拟骨干网（VB）的大小是 CDS 构建问题中唯一要考虑的因素。然而，直径也是评估 VB 的一个重要因素。在本文中，我们考虑了在 CC 下的单位盘图中构建高质量 ECDS 的问题，同时考虑了这两个因素。我们提出了一种两阶段集中算法 BD-ECDS，用于为具有 CC 的给定 UDG 构建具有恒定性能比（PR）和直径的 ECDS。为了得到这种两阶段集中算法的 PR，我们首先给出了 EDS 的上界，并利用这个上界证明了集中算法生成的 CC 下 ECDS 的大小不大于 120|ECDSopt|-2，其中 ECDSopt 是最小 ECDS 的大小。此外，我们的理论分析和仿真结果表明，我们的算法 BD-ECDS 优于之前的方法。

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

求助全文

约1分钟内获得全文去求助

来源期刊

Computer Communications 工程技术-电信学

CiteScore

14.10

自引率

5.00%

发文量

397

审稿时长

66 days

期刊介绍： Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.