The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network
We usually use a digraph to represent a wireless network (WN). Correspondingly, a connected dominating set (CDS) of the digraph is usually used to denote a virtual backbone (VB) of the corresponding WN. In this article, focusing on the problem of a minimum strongly connected dominating and absorbing...
Gespeichert in:
| Veröffentlicht in: | Wireless communications and mobile computing 2020, Vol.2020 (2020), p.1-14 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 14 |
|---|---|
| container_issue | 2020 |
| container_start_page | 1 |
| container_title | Wireless communications and mobile computing |
| container_volume | 2020 |
| creator | Liang, Xinyu Li, Yanyan Yi, Meng Liang, Jiarong |
| description | We usually use a digraph to represent a wireless network (WN). Correspondingly, a connected dominating set (CDS) of the digraph is usually used to denote a virtual backbone (VB) of the corresponding WN. In this article, focusing on the problem of a minimum strongly connected dominating and absorbing set (MSCDAS) with a bounded diameter (or guaranteed routing cost) for a digraph, which is strongly connected, we introduce two algorithms. One is called the guaranteed routing cost strongly connected dominating and absorbing set (GOC-SCDAS), which can generate a strongly connected dominating and absorbing set (SCDAS) with a performance ratio 14.4k+1/22 in respect of the optimal solution. Another is called the α guaranteed routing cost strongly connected bidirectional dominating and absorbing set (α-GOC-SCBDAS), which can generate a strongly connected bidirectional dominating and absorbing set (SCBDAS) with a performance ratio 8.8443k+1/22k+1/22 in respect of the optimal solution and a better routing cost, where k=rmax/rmin and rmin,rmax is the transmission range of nodes in the network. Through the simulation experiments, we obtain the conclusion that in terms of the diameter and average routing path length (ARPL) of CDS, the outputs of our algorithms are better than those of the algorithm in (Du et al. 2006). |
| doi_str_mv | 10.1155/2020/5602325 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2423438350</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2423438350</sourcerecordid><originalsourceid>FETCH-LOGICAL-c360t-d062d414c57ef4ed5108590c90d56eeb73f1c99c5032f02b5fd62dbaf7144fec3</originalsourceid><addsrcrecordid>eNqFkEtPwzAQhC0EEqVw44wscYTQtR0nzRHKU6rgUuAYOc5adR9xsRNV_HtcpYIjp12NvtkdDSHnDG4Yk3LEgcNIZsAFlwdkwKSAZJzl-eHvnhXH5CSEBQAI4GxAZrM50olrQus73VrXUGeooh_Wt51a0Tull5VrkG5tO4_6neuaGmt6b9UaW_TUNlH9tB5XGAJ9xXbr_PKUHBm1Cni2n0Py_vgwmzwn07enl8ntNNEigzapIeN1ylItczQp1pLBWBagC6hlhljlwjBdFFqC4AZ4JU0dDZUyOUtTg1oMyWV_d-PdV4ehLReu8018WfKUi1SMRfQOyXVPae9C8GjKjbdr5b9LBuWut3LXW7nvLeJXPT63Ta229j_6oqcxMmjUH81jyBjgB15ZdZw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2423438350</pqid></control><display><type>article</type><title>The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network</title><source>Wiley Online Library Open Access</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Alma/SFX Local Collection</source><creator>Liang, Xinyu ; Li, Yanyan ; Yi, Meng ; Liang, Jiarong</creator><contributor>Mahgoub, Imadeldin ; Imadeldin Mahgoub</contributor><creatorcontrib>Liang, Xinyu ; Li, Yanyan ; Yi, Meng ; Liang, Jiarong ; Mahgoub, Imadeldin ; Imadeldin Mahgoub</creatorcontrib><description>We usually use a digraph to represent a wireless network (WN). Correspondingly, a connected dominating set (CDS) of the digraph is usually used to denote a virtual backbone (VB) of the corresponding WN. In this article, focusing on the problem of a minimum strongly connected dominating and absorbing set (MSCDAS) with a bounded diameter (or guaranteed routing cost) for a digraph, which is strongly connected, we introduce two algorithms. One is called the guaranteed routing cost strongly connected dominating and absorbing set (GOC-SCDAS), which can generate a strongly connected dominating and absorbing set (SCDAS) with a performance ratio 14.4k+1/22 in respect of the optimal solution. Another is called the α guaranteed routing cost strongly connected bidirectional dominating and absorbing set (α-GOC-SCBDAS), which can generate a strongly connected bidirectional dominating and absorbing set (SCBDAS) with a performance ratio 8.8443k+1/22k+1/22 in respect of the optimal solution and a better routing cost, where k=rmax/rmin and rmin,rmax is the transmission range of nodes in the network. Through the simulation experiments, we obtain the conclusion that in terms of the diameter and average routing path length (ARPL) of CDS, the outputs of our algorithms are better than those of the algorithm in (Du et al. 2006).</description><identifier>ISSN: 1530-8669</identifier><identifier>EISSN: 1530-8677</identifier><identifier>DOI: 10.1155/2020/5602325</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Publishing Corporation</publisher><subject>Algorithms ; Backbone ; Computer simulation ; Graph theory ; Radio communications ; Sensors ; Wireless networks</subject><ispartof>Wireless communications and mobile computing, 2020, Vol.2020 (2020), p.1-14</ispartof><rights>Copyright © 2020 Jiarong Liang et al.</rights><rights>Copyright © 2020 Jiarong Liang et al. This work is licensed under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c360t-d062d414c57ef4ed5108590c90d56eeb73f1c99c5032f02b5fd62dbaf7144fec3</citedby><cites>FETCH-LOGICAL-c360t-d062d414c57ef4ed5108590c90d56eeb73f1c99c5032f02b5fd62dbaf7144fec3</cites><orcidid>0000-0003-1315-5311</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,4009,27902,27903,27904</link.rule.ids></links><search><contributor>Mahgoub, Imadeldin</contributor><contributor>Imadeldin Mahgoub</contributor><creatorcontrib>Liang, Xinyu</creatorcontrib><creatorcontrib>Li, Yanyan</creatorcontrib><creatorcontrib>Yi, Meng</creatorcontrib><creatorcontrib>Liang, Jiarong</creatorcontrib><title>The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network</title><title>Wireless communications and mobile computing</title><description>We usually use a digraph to represent a wireless network (WN). Correspondingly, a connected dominating set (CDS) of the digraph is usually used to denote a virtual backbone (VB) of the corresponding WN. In this article, focusing on the problem of a minimum strongly connected dominating and absorbing set (MSCDAS) with a bounded diameter (or guaranteed routing cost) for a digraph, which is strongly connected, we introduce two algorithms. One is called the guaranteed routing cost strongly connected dominating and absorbing set (GOC-SCDAS), which can generate a strongly connected dominating and absorbing set (SCDAS) with a performance ratio 14.4k+1/22 in respect of the optimal solution. Another is called the α guaranteed routing cost strongly connected bidirectional dominating and absorbing set (α-GOC-SCBDAS), which can generate a strongly connected bidirectional dominating and absorbing set (SCBDAS) with a performance ratio 8.8443k+1/22k+1/22 in respect of the optimal solution and a better routing cost, where k=rmax/rmin and rmin,rmax is the transmission range of nodes in the network. Through the simulation experiments, we obtain the conclusion that in terms of the diameter and average routing path length (ARPL) of CDS, the outputs of our algorithms are better than those of the algorithm in (Du et al. 2006).</description><subject>Algorithms</subject><subject>Backbone</subject><subject>Computer simulation</subject><subject>Graph theory</subject><subject>Radio communications</subject><subject>Sensors</subject><subject>Wireless networks</subject><issn>1530-8669</issn><issn>1530-8677</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>BENPR</sourceid><recordid>eNqFkEtPwzAQhC0EEqVw44wscYTQtR0nzRHKU6rgUuAYOc5adR9xsRNV_HtcpYIjp12NvtkdDSHnDG4Yk3LEgcNIZsAFlwdkwKSAZJzl-eHvnhXH5CSEBQAI4GxAZrM50olrQus73VrXUGeooh_Wt51a0Tull5VrkG5tO4_6neuaGmt6b9UaW_TUNlH9tB5XGAJ9xXbr_PKUHBm1Cni2n0Py_vgwmzwn07enl8ntNNEigzapIeN1ylItczQp1pLBWBagC6hlhljlwjBdFFqC4AZ4JU0dDZUyOUtTg1oMyWV_d-PdV4ehLReu8018WfKUi1SMRfQOyXVPae9C8GjKjbdr5b9LBuWut3LXW7nvLeJXPT63Ta229j_6oqcxMmjUH81jyBjgB15ZdZw</recordid><startdate>2020</startdate><enddate>2020</enddate><creator>Liang, Xinyu</creator><creator>Li, Yanyan</creator><creator>Yi, Meng</creator><creator>Liang, Jiarong</creator><general>Hindawi Publishing Corporation</general><general>Hindawi</general><general>Hindawi Limited</general><scope>ADJCN</scope><scope>AHFXO</scope><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7XB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0003-1315-5311</orcidid></search><sort><creationdate>2020</creationdate><title>The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network</title><author>Liang, Xinyu ; Li, Yanyan ; Yi, Meng ; Liang, Jiarong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c360t-d062d414c57ef4ed5108590c90d56eeb73f1c99c5032f02b5fd62dbaf7144fec3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Algorithms</topic><topic>Backbone</topic><topic>Computer simulation</topic><topic>Graph theory</topic><topic>Radio communications</topic><topic>Sensors</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Liang, Xinyu</creatorcontrib><creatorcontrib>Li, Yanyan</creatorcontrib><creatorcontrib>Yi, Meng</creatorcontrib><creatorcontrib>Liang, Jiarong</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Wireless communications and mobile computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Liang, Xinyu</au><au>Li, Yanyan</au><au>Yi, Meng</au><au>Liang, Jiarong</au><au>Mahgoub, Imadeldin</au><au>Imadeldin Mahgoub</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network</atitle><jtitle>Wireless communications and mobile computing</jtitle><date>2020</date><risdate>2020</risdate><volume>2020</volume><issue>2020</issue><spage>1</spage><epage>14</epage><pages>1-14</pages><issn>1530-8669</issn><eissn>1530-8677</eissn><abstract>We usually use a digraph to represent a wireless network (WN). Correspondingly, a connected dominating set (CDS) of the digraph is usually used to denote a virtual backbone (VB) of the corresponding WN. In this article, focusing on the problem of a minimum strongly connected dominating and absorbing set (MSCDAS) with a bounded diameter (or guaranteed routing cost) for a digraph, which is strongly connected, we introduce two algorithms. One is called the guaranteed routing cost strongly connected dominating and absorbing set (GOC-SCDAS), which can generate a strongly connected dominating and absorbing set (SCDAS) with a performance ratio 14.4k+1/22 in respect of the optimal solution. Another is called the α guaranteed routing cost strongly connected bidirectional dominating and absorbing set (α-GOC-SCBDAS), which can generate a strongly connected bidirectional dominating and absorbing set (SCBDAS) with a performance ratio 8.8443k+1/22k+1/22 in respect of the optimal solution and a better routing cost, where k=rmax/rmin and rmin,rmax is the transmission range of nodes in the network. Through the simulation experiments, we obtain the conclusion that in terms of the diameter and average routing path length (ARPL) of CDS, the outputs of our algorithms are better than those of the algorithm in (Du et al. 2006).</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Publishing Corporation</pub><doi>10.1155/2020/5602325</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0003-1315-5311</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1530-8669 |
| ispartof | Wireless communications and mobile computing, 2020, Vol.2020 (2020), p.1-14 |
| issn | 1530-8669 1530-8677 |
| language | eng |
| recordid | cdi_proquest_journals_2423438350 |
| source | Wiley Online Library Open Access; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Alma/SFX Local Collection |
| subjects | Algorithms Backbone Computer simulation Graph theory Radio communications Sensors Wireless networks |
| title | The Construction of a Virtual Backbone with a Bounded Diameter in a Wireless Network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T03%3A03%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Construction%20of%20a%20Virtual%20Backbone%20with%20a%20Bounded%20Diameter%20in%20a%20Wireless%20Network&rft.jtitle=Wireless%20communications%20and%20mobile%20computing&rft.au=Liang,%20Xinyu&rft.date=2020&rft.volume=2020&rft.issue=2020&rft.spage=1&rft.epage=14&rft.pages=1-14&rft.issn=1530-8669&rft.eissn=1530-8677&rft_id=info:doi/10.1155/2020/5602325&rft_dat=%3Cproquest_cross%3E2423438350%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2423438350&rft_id=info:pmid/&rfr_iscdi=true |