Probabilistic quantization of unbiased broadcast gossip algorithms for consensus in distributed networks
In this paper, probabilistic quantization on Unbiased Broadcast Gossip Algorithms (UBGA) is introduced to adapt to the limited bandwidth of distributed network channels. This innovative quantized consensus algorithm is called Quantized UBGA (QUBGA). By briefly describing the graph and time model, an...
Gespeichert in:
| Veröffentlicht in: | Wireless networks 2024-07, Vol.30 (5), p.3349-3355 |
|---|---|
| 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 | 3355 |
|---|---|
| container_issue | 5 |
| container_start_page | 3349 |
| container_title | Wireless networks |
| container_volume | 30 |
| creator | Wu, Shaochuan Wei, Yuming Gao, Yulong Zhang, Wenbin |
| description | In this paper, probabilistic quantization on Unbiased Broadcast Gossip Algorithms (UBGA) is introduced to adapt to the limited bandwidth of distributed network channels. This innovative quantized consensus algorithm is called Quantized UBGA (QUBGA). By briefly describing the graph and time model, and reviewing UBGA, it is proved that QUBGA can converge in expectation and in the second moment for strongly connected digraphs. Furthermore, it is proved that the convergence rate of QUBGA is related to quantized resolution and topology structure. Performance analysis results are consistent with theoretical analysis. |
| doi_str_mv | 10.1007/s11276-019-01969-w |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2187111794</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2187111794</sourcerecordid><originalsourceid>FETCH-LOGICAL-c270t-986246de6b132376554fba427f3269e7be1e4d336bd86913c7da2da3f8f389f3</originalsourceid><addsrcrecordid>eNp9kEtLQzEQhYMoWKt_wFXA9dU8bvNYSvEFgi66D8m9SZvaJm2SS9Ffb-oV3LkYZgbOOcN8AFxjdIsR4ncZY8JZg7A8FpPN4QRM8IyTRtT1tM6IkAYhKs7BRc5rhJCgUk7A6j1Fo43f-Fx8B_eDDsV_6eJjgNHBIRivs-2hSVH3nc4FLmPOfgf1ZhmTL6tthi4m2MWQbchDhj7AvoYlb4ZSjcGWQ0wf-RKcOb3J9uq3T8Hi8WExf25e355e5vevTUc4Ko0UjLSst8xgSihns1nrjG4Jd5Qwabmx2LY9pcz0gklMO95r0mvqhKNCOjoFN2PsLsX9YHNR6zikUC8qggXHGHPZVhUZVV2q3yTr1C75rU6fCiN1BKpGoKrCVD9A1aGa6GjKVRyWNv1F_-P6BgU5fAQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2187111794</pqid></control><display><type>article</type><title>Probabilistic quantization of unbiased broadcast gossip algorithms for consensus in distributed networks</title><source>SpringerLink Journals - AutoHoldings</source><creator>Wu, Shaochuan ; Wei, Yuming ; Gao, Yulong ; Zhang, Wenbin</creator><creatorcontrib>Wu, Shaochuan ; Wei, Yuming ; Gao, Yulong ; Zhang, Wenbin</creatorcontrib><description>In this paper, probabilistic quantization on Unbiased Broadcast Gossip Algorithms (UBGA) is introduced to adapt to the limited bandwidth of distributed network channels. This innovative quantized consensus algorithm is called Quantized UBGA (QUBGA). By briefly describing the graph and time model, and reviewing UBGA, it is proved that QUBGA can converge in expectation and in the second moment for strongly connected digraphs. Furthermore, it is proved that the convergence rate of QUBGA is related to quantized resolution and topology structure. Performance analysis results are consistent with theoretical analysis.</description><identifier>ISSN: 1022-0038</identifier><identifier>EISSN: 1572-8196</identifier><identifier>DOI: 10.1007/s11276-019-01969-w</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Communications Engineering ; Computer Communication Networks ; Computer networks ; Convergence ; Electrical Engineering ; Engineering ; Gossip ; Graph theory ; IT in Business ; Measurement ; Networks ; Wireless networks</subject><ispartof>Wireless networks, 2024-07, Vol.30 (5), p.3349-3355</ispartof><rights>Springer Science+Business Media, LLC, part of Springer Nature 2019</rights><rights>Wireless Networks is a copyright of Springer, (2019). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c270t-986246de6b132376554fba427f3269e7be1e4d336bd86913c7da2da3f8f389f3</cites><orcidid>0000-0002-2362-3126</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11276-019-01969-w$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s11276-019-01969-w$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Wu, Shaochuan</creatorcontrib><creatorcontrib>Wei, Yuming</creatorcontrib><creatorcontrib>Gao, Yulong</creatorcontrib><creatorcontrib>Zhang, Wenbin</creatorcontrib><title>Probabilistic quantization of unbiased broadcast gossip algorithms for consensus in distributed networks</title><title>Wireless networks</title><addtitle>Wireless Netw</addtitle><description>In this paper, probabilistic quantization on Unbiased Broadcast Gossip Algorithms (UBGA) is introduced to adapt to the limited bandwidth of distributed network channels. This innovative quantized consensus algorithm is called Quantized UBGA (QUBGA). By briefly describing the graph and time model, and reviewing UBGA, it is proved that QUBGA can converge in expectation and in the second moment for strongly connected digraphs. Furthermore, it is proved that the convergence rate of QUBGA is related to quantized resolution and topology structure. Performance analysis results are consistent with theoretical analysis.</description><subject>Algorithms</subject><subject>Communications Engineering</subject><subject>Computer Communication Networks</subject><subject>Computer networks</subject><subject>Convergence</subject><subject>Electrical Engineering</subject><subject>Engineering</subject><subject>Gossip</subject><subject>Graph theory</subject><subject>IT in Business</subject><subject>Measurement</subject><subject>Networks</subject><subject>Wireless networks</subject><issn>1022-0038</issn><issn>1572-8196</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp9kEtLQzEQhYMoWKt_wFXA9dU8bvNYSvEFgi66D8m9SZvaJm2SS9Ffb-oV3LkYZgbOOcN8AFxjdIsR4ncZY8JZg7A8FpPN4QRM8IyTRtT1tM6IkAYhKs7BRc5rhJCgUk7A6j1Fo43f-Fx8B_eDDsV_6eJjgNHBIRivs-2hSVH3nc4FLmPOfgf1ZhmTL6tthi4m2MWQbchDhj7AvoYlb4ZSjcGWQ0wf-RKcOb3J9uq3T8Hi8WExf25e355e5vevTUc4Ko0UjLSst8xgSihns1nrjG4Jd5Qwabmx2LY9pcz0gklMO95r0mvqhKNCOjoFN2PsLsX9YHNR6zikUC8qggXHGHPZVhUZVV2q3yTr1C75rU6fCiN1BKpGoKrCVD9A1aGa6GjKVRyWNv1F_-P6BgU5fAQ</recordid><startdate>20240701</startdate><enddate>20240701</enddate><creator>Wu, Shaochuan</creator><creator>Wei, Yuming</creator><creator>Gao, Yulong</creator><creator>Zhang, Wenbin</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7SP</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>L.-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M2P</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0002-2362-3126</orcidid></search><sort><creationdate>20240701</creationdate><title>Probabilistic quantization of unbiased broadcast gossip algorithms for consensus in distributed networks</title><author>Wu, Shaochuan ; Wei, Yuming ; Gao, Yulong ; Zhang, Wenbin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c270t-986246de6b132376554fba427f3269e7be1e4d336bd86913c7da2da3f8f389f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Communications Engineering</topic><topic>Computer Communication Networks</topic><topic>Computer networks</topic><topic>Convergence</topic><topic>Electrical Engineering</topic><topic>Engineering</topic><topic>Gossip</topic><topic>Graph theory</topic><topic>IT in Business</topic><topic>Measurement</topic><topic>Networks</topic><topic>Wireless networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wu, Shaochuan</creatorcontrib><creatorcontrib>Wei, Yuming</creatorcontrib><creatorcontrib>Gao, Yulong</creatorcontrib><creatorcontrib>Zhang, Wenbin</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</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>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>ABI/INFORM Professional Advanced</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>ABI/INFORM Global</collection><collection>Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</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 networks</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wu, Shaochuan</au><au>Wei, Yuming</au><au>Gao, Yulong</au><au>Zhang, Wenbin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Probabilistic quantization of unbiased broadcast gossip algorithms for consensus in distributed networks</atitle><jtitle>Wireless networks</jtitle><stitle>Wireless Netw</stitle><date>2024-07-01</date><risdate>2024</risdate><volume>30</volume><issue>5</issue><spage>3349</spage><epage>3355</epage><pages>3349-3355</pages><issn>1022-0038</issn><eissn>1572-8196</eissn><abstract>In this paper, probabilistic quantization on Unbiased Broadcast Gossip Algorithms (UBGA) is introduced to adapt to the limited bandwidth of distributed network channels. This innovative quantized consensus algorithm is called Quantized UBGA (QUBGA). By briefly describing the graph and time model, and reviewing UBGA, it is proved that QUBGA can converge in expectation and in the second moment for strongly connected digraphs. Furthermore, it is proved that the convergence rate of QUBGA is related to quantized resolution and topology structure. Performance analysis results are consistent with theoretical analysis.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s11276-019-01969-w</doi><tpages>7</tpages><orcidid>https://orcid.org/0000-0002-2362-3126</orcidid></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1022-0038 |
| ispartof | Wireless networks, 2024-07, Vol.30 (5), p.3349-3355 |
| issn | 1022-0038 1572-8196 |
| language | eng |
| recordid | cdi_proquest_journals_2187111794 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Algorithms Communications Engineering Computer Communication Networks Computer networks Convergence Electrical Engineering Engineering Gossip Graph theory IT in Business Measurement Networks Wireless networks |
| title | Probabilistic quantization of unbiased broadcast gossip algorithms for consensus in distributed networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A35%3A50IST&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=Probabilistic%20quantization%20of%20unbiased%20broadcast%20gossip%20algorithms%20for%20consensus%20in%20distributed%20networks&rft.jtitle=Wireless%20networks&rft.au=Wu,%20Shaochuan&rft.date=2024-07-01&rft.volume=30&rft.issue=5&rft.spage=3349&rft.epage=3355&rft.pages=3349-3355&rft.issn=1022-0038&rft.eissn=1572-8196&rft_id=info:doi/10.1007/s11276-019-01969-w&rft_dat=%3Cproquest_cross%3E2187111794%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=2187111794&rft_id=info:pmid/&rfr_iscdi=true |