Our work is to study the Minimum Latency Broadcast Scheduling problem in the ge- ometric SINR model with power control. With power control, sensor nodes ...

We study the minimum latency broadcast scheduling problem, in which a single source has a quantity of data that must be transmitted to all other nodes in a ...

Abstract: Our work is to study the Minimum Latency Broadcast Scheduling problem in the geometric SINR model with power control.

We first design a constant approximation algorithm for the 2-Disk model and then extend it to the SINR model. This result is the first result on broadcast ...

In this paper, we revisit the wireless link scheduling problem under a graded version of the SINR interference model. Unlike the traditional thresholded ...

For strong connectivity broadcast, we present a new randomized algorithm that solves the problem in O(D log (n)polylog(R)) rounds in networks of size n, with ...

Sep 3, 2021 · In this paper, we study the dynamic broadcast problem in SINR-based time-varying directed acyclic multi-hop wireless networks formed by point-to ...

Apr 6, 2015 · Abstract—We study the multi-broadcast problem in multi-hop wireless networks under the SINR model deployed in the 2D. Euclidean plane.

We present the first algorithm that implements an abstract MAC (absMAC) layer in the Signal-to-Interference-plus-Noise-Ratio (SINR) wireless network model.

Abstract. In this paper, we revisit the wireless link scheduling prob- lem under a graded version of the SINR interference model.