Pith

open record

sign in
Browse

arxiv: 2408.11499 · v2 · pith:LTWLYVNZ · submitted 2024-08-21 · cs.NI

Power-Domain Interference Graph Estimation for Multi-hop BLE Networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:LTWLYVNZrecord.jsonopen to challenge →

classification cs.NI
keywords networkspowercommunicationmeasurementnetworktasksconcurrentflooding
0
0 comments X
read the original abstract

Traditional wisdom for network management allocates network resources separately for the measurement and communication tasks. Heavy measurement tasks may compete limited resources with communication tasks and significantly degrade overall network performance. It is therefore challenging for the interference graph, deemed as incurring heavy measurement overhead, to be used in practice in wireless networks. To address this challenge in wireless sensor networks, our core insight is to use power as a new dimension for interference graph estimation (IGE) such that IGE can be done simultaneously with the communication tasks using the same frequency-time resources. We propose to marry power-domain IGE with concurrent flooding to achieve simultaneous measurement and communication in BLE networks, where the power linearity prerequisite for power-domain IGE holds naturally true in concurrent flooding. With extensive experiments, we conclude the necessary conditions for the power linearity to hold and analyze several nonlinearity issues of power related to hardware imperfections. We design and implement network protocols and power control algorithms for IGE in multi-hop BLE networks and conduct experiments to show that the marriage is mutually beneficial for both IGE and concurrent flooding. Furthermore, we demonstrate the potential of IGE in improving channel map convergence and convergecast in BLE networks.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.