Efficient Interference Graph Estimation via Concurrent Flooding
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914387028082688 |
|---|---|
| author | Jia, Haifeng Wei, Yichen Wang, Zhan Jin, Jiani Li, Haorui Pi, Yibo |
| author_facet | Jia, Haifeng Wei, Yichen Wang, Zhan Jin, Jiani Li, Haorui Pi, Yibo |
| contents | Traditional wisdom for network management allocates network resources separately for the measurement and data transmission tasks. Heavy measurement tasks may take up resources for data transmission and significantly reduce network performance. It is therefore challenging for interference graphs, deemed as incurring heavy measurement overhead, to be used in practice in wireless networks. To address this challenge in wireless sensor networks, we propose to use power as a new dimension for interference graph estimation (IGE) and integrate IGE with concurrent flooding such that IGE can be done simultaneously with flooding using the same frequency-time resources. With controlled and real-world experiments, we show that it is feasible to efficiently achieve IGE via concurrent flooding on the commercial off-the-shelf (COTS) devices by controlling the transmit powers of nodes. We believe that efficient IGE would be a key enabler for the practical use of the existing scheduling algorithms assuming known interference graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_16807 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Efficient Interference Graph Estimation via Concurrent Flooding Jia, Haifeng Wei, Yichen Wang, Zhan Jin, Jiani Li, Haorui Pi, Yibo Networking and Internet Architecture Systems and Control C.2 Traditional wisdom for network management allocates network resources separately for the measurement and data transmission tasks. Heavy measurement tasks may take up resources for data transmission and significantly reduce network performance. It is therefore challenging for interference graphs, deemed as incurring heavy measurement overhead, to be used in practice in wireless networks. To address this challenge in wireless sensor networks, we propose to use power as a new dimension for interference graph estimation (IGE) and integrate IGE with concurrent flooding such that IGE can be done simultaneously with flooding using the same frequency-time resources. With controlled and real-world experiments, we show that it is feasible to efficiently achieve IGE via concurrent flooding on the commercial off-the-shelf (COTS) devices by controlling the transmit powers of nodes. We believe that efficient IGE would be a key enabler for the practical use of the existing scheduling algorithms assuming known interference graphs. |
| title | Efficient Interference Graph Estimation via Concurrent Flooding |
| topic | Networking and Internet Architecture Systems and Control C.2 |
| url | https://arxiv.org/abs/2312.16807 |