Efficient Deterministic Distributed Computing in Ad-Hoc Wireless Networks
We study the problem of distributed construction of efficient de-centralized communication schedules for ad-hoc wireless networks. We consider a model which is close to real scenarios: (1) the SINR interference model, which covers most important distinctive features of contemporary wireless communic...
Uložené v:
| Vydané v: | Proceedings of the International Conference on Distributed Computing Systems s. 264 - 274 |
|---|---|
| Hlavní autori: | , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
21.07.2025
|
| Predmet: | |
| ISSN: | 2575-8411 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | We study the problem of distributed construction of efficient de-centralized communication schedules for ad-hoc wireless networks. We consider a model which is close to real scenarios: (1) the SINR interference model, which covers most important distinctive features of contemporary wireless communication, such as signal fading, collisions and accumulation of signal, and (2) any underlying metric of bounded growth, which includes Euclidean space with certain type of obstacles. Most of efficient solutions in the SINR model rely on probabilistic algorithms, assuming access of nodes to the sources of independent truly random bits, which in practice is hard to get by wireless devices.In this paper we show that key efficient de-centralized communication abstraction primitives, such as aggregation and broadcast schedules (which are bases of many other communication tasks), can be efficiently built by distributed algorithms in SINR networks without using any randomization. In particular, the length of the built communication schedules are asymptotically as efficient as those significantly relying on randomization, and close to the theoretic lower bounds. Importantly, the time (round) complexity of our solutions grows only logarithmically with respect to the growth of the density of a network, which makes them scalable in real-life scenarios. |
|---|---|
| AbstractList | We study the problem of distributed construction of efficient de-centralized communication schedules for ad-hoc wireless networks. We consider a model which is close to real scenarios: (1) the SINR interference model, which covers most important distinctive features of contemporary wireless communication, such as signal fading, collisions and accumulation of signal, and (2) any underlying metric of bounded growth, which includes Euclidean space with certain type of obstacles. Most of efficient solutions in the SINR model rely on probabilistic algorithms, assuming access of nodes to the sources of independent truly random bits, which in practice is hard to get by wireless devices.In this paper we show that key efficient de-centralized communication abstraction primitives, such as aggregation and broadcast schedules (which are bases of many other communication tasks), can be efficiently built by distributed algorithms in SINR networks without using any randomization. In particular, the length of the built communication schedules are asymptotically as efficient as those significantly relying on randomization, and close to the theoretic lower bounds. Importantly, the time (round) complexity of our solutions grows only logarithmically with respect to the growth of the density of a network, which makes them scalable in real-life scenarios. |
| Author | Kowalski, Dariusz R. Jurdzinski, Tomasz |
| Author_xml | – sequence: 1 givenname: Tomasz surname: Jurdzinski fullname: Jurdzinski, Tomasz email: tju@cs.uni.wroc.pl organization: University of Wroclaw,Poland – sequence: 2 givenname: Dariusz R. surname: Kowalski fullname: Kowalski, Dariusz R. email: dkowalski@augusta.edu organization: Augusta University,USA |
| BookMark | eNotjsFKAzEUAKMo2Nb-gUJ-YGteXpJNjmXb2kLRgwWPJbv7ItF2t2xSxL-3oKe5DMOM2U3Xd8TYI4gZgHBPm2pRvRkUFmdSSD0TQqC6YlNXOosIGkqJ5pqNpC51YRXAHRun9HnRtDU4YptlCLGJ1GW-oEzDMXYx5djwxQVDrM-ZWl71x9M5x-6Dx47P22LdN_w9DnSglPgL5e9--Er37Db4Q6LpPydst1ruqnWxfX3eVPNtER3mIjRGBGHBq7otpTHgQ-2Vx1Y1yiiojRM2eEJBl1nvCYx2dSu0odY0SgacsIe_bCSi_WmIRz_87AHAopUOfwENz0_w |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/ICDCS63083.2025.00034 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9798331517236 |
| EISSN | 2575-8411 |
| EndPage | 274 |
| ExternalDocumentID | 11183829 |
| Genre | orig-research |
| GroupedDBID | 29G 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR AAWTH ABLEC ACGFS ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP IPLJI OCL RIE RIL RIO RNS |
| ID | FETCH-LOGICAL-i93t-fc60f081a4bd72661afba4a3d4c4641b6908fae30e841aae1659bd056ed6c42f3 |
| IEDL.DBID | RIE |
| IngestDate | Wed Oct 15 14:20:52 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i93t-fc60f081a4bd72661afba4a3d4c4641b6908fae30e841aae1659bd056ed6c42f3 |
| PageCount | 11 |
| ParticipantIDs | ieee_primary_11183829 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-July-21 |
| PublicationDateYYYYMMDD | 2025-07-21 |
| PublicationDate_xml | – month: 07 year: 2025 text: 2025-July-21 day: 21 |
| PublicationDecade | 2020 |
| PublicationTitle | Proceedings of the International Conference on Distributed Computing Systems |
| PublicationTitleAbbrev | ICDCS |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0005863 |
| Score | 2.2980328 |
| Snippet | We study the problem of distributed construction of efficient de-centralized communication schedules for ad-hoc wireless networks. We consider a model which is... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 264 |
| SubjectTerms | Ad hoc networks Ad-hoc network Aggregation and broadcast schedules De-centralized schedules Deterministic algorithms Distributed algoriths Distributed computing Extraterrestrial measurements Fading channels Interference Lower bound Probabilistic logic Schedules Signal to noise ratio SINR interference model Wireless network Wireless networks |
| Title | Efficient Deterministic Distributed Computing in Ad-Hoc Wireless Networks |
| URI | https://ieeexplore.ieee.org/document/11183829 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07a8MwED6a0KFT-kjpGw1d1ViWIktjyYNkCYFmyBb0MgSKU_Lo7-9JdtouHboZg89w4nSn0_fdB_DMndC-8BGKEyTFilhTxbmhXBvMRsayvPRJbKKYzdRyqecNWT1xYUIICXwWXuJjusv3G3eIrbIexqXiKtctaBVFUZO1fvAcSvKGosMy3ZsOhoM3ybHCwENgHhsnWRRH_iWhkjLIuPPPf59D94eLR-bfWeYCTkJ1CZ2jGANpYvMKpqM0DAKNkGEDcUkzmMkwjsaNqlbBk_oztEPWFXn1dLJxJOJf33G_I7MaEb7rwmI8WgwmtNFJoGvN97R0MisxsxthfRHzrSmtEYZ74YQUzOL5V5Um8CwowYwJTPa19Vj4BC-dyEt-De1qU4UbIIZLrYR3WBdaYZi1aIKrfolxqpQT4ha60TOrj3oSxurolLs_3t_DWXR-7IXm7AHa--0hPMKp-9yvd9untH5fvR2cQg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB1BQYJTWYrY8YGraRy7rn1EXdSKElWih94qb5EqobTqwvdjOynlwoFbFCkTydbkjSfvzQN4poZJ27aBiuM49hWxxIJShalUHo2UJmluo9lEO8vEdCrHlVg9amGcc5F85l7CZfyXbxdmG1plTZ-XgopUHsJRi7GUlHKtPaNDcFqJdEgim8NOt_PBqa8x_DEwDa2TJNgj_zJRiRjSr__z7WfQ2Kvx0PgHZ87hwBUXUN_ZMaAqOy9h2IvjIHwQ1K1ILnEKM-qG4bjB18pZVD7m46B5gV4tHiwMCgzYT__FQ1nJCV83YNLvTToDXDkl4LmkG5wbnuQe2xXTth0QV-VaMUUtM4wzov0JWOTK0cQJRpRyhLektr70cZYblub0CmrFonDXgBTlUjBrfGWomSJa-xBUtHKfqUIYxm6gEVZmtixnYcx2i3L7x_0nOBlM3kez0TB7u4PTsBGhM5qSe6htVlv3AMfmazNfrx7jXn4DDTCfiQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+International+Conference+on+Distributed+Computing+Systems&rft.atitle=Efficient+Deterministic+Distributed+Computing+in+Ad-Hoc+Wireless+Networks&rft.au=Jurdzinski%2C+Tomasz&rft.au=Kowalski%2C+Dariusz+R.&rft.date=2025-07-21&rft.pub=IEEE&rft.eissn=2575-8411&rft.spage=264&rft.epage=274&rft_id=info:doi/10.1109%2FICDCS63083.2025.00034&rft.externalDocID=11183829 |