View in EDS

Information dissemination in wireless ad-hoc networks under the weighted-TIM framework.

Saved in:
Bibliographic Details
Title: Information dissemination in wireless ad-hoc networks under the weighted-TIM framework.
Authors: Dong, Lu1 (AUTHOR), Kowalski, Dariusz R.2,3 (AUTHOR), Kudaravalli, Harshita1 (AUTHOR), Mosteiro, Miguel A.1 (AUTHOR) mmosteiro@pace.edu
Source: Theoretical Computer Science. Jan2022, Vol. 901, p19-34. 16p.
Subjects: Information dissemination, Superimposed coding, Transmitters (Communication), Bipartite graphs, Ad hoc computer networks, Simulation methods & models
Abstract: We study communication from layer to layer of a network modeling it as a bipartite graph of transmitters and receivers. We seek to minimize the time needed for all receivers to get a message held by all transmitters. We study this Layer Dissemination problem under the Weighted Topological Interference Management (W-TIM) framework, which subsumes previous models of interference. We present randomized and deterministic protocols for Layer Dissemination, based on Selective-with-Interference Families , a combinatorial object related to group testing non-adaptive algorithms and superimposed codes. Our approach combines an engineering solution with theoretical guarantees. We characterize the network with a global measure of interference based on measurements in the specific deployment area. Then, our protocols distributedly produce an ad-hoc transmissions schedule for dissemination. We complement our theoretical study with simulations of a real network-deployment area to compare our protocols with previous work for models that ignore some physical constraints. The striking improvement in performance shown by our simulations with respect to using previous simplified models of interference shows the importance of using W-TIM to develop algorithms. [ABSTRACT FROM AUTHOR]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:We study communication from layer to layer of a network modeling it as a bipartite graph of transmitters and receivers. We seek to minimize the time needed for all receivers to get a message held by all transmitters. We study this Layer Dissemination problem under the Weighted Topological Interference Management (W-TIM) framework, which subsumes previous models of interference. We present randomized and deterministic protocols for Layer Dissemination, based on Selective-with-Interference Families , a combinatorial object related to group testing non-adaptive algorithms and superimposed codes. Our approach combines an engineering solution with theoretical guarantees. We characterize the network with a global measure of interference based on measurements in the specific deployment area. Then, our protocols distributedly produce an ad-hoc transmissions schedule for dissemination. We complement our theoretical study with simulations of a real network-deployment area to compare our protocols with previous work for models that ignore some physical constraints. The striking improvement in performance shown by our simulations with respect to using previous simplified models of interference shows the importance of using W-TIM to develop algorithms. [ABSTRACT FROM AUTHOR]
ISSN:03043975
DOI:10.1016/j.tcs.2021.11.022