First-Fit Scheduling for Beaconing in Multihop Wireless Networks

Abstract

Abstract-Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed in synchronous time-slots and each node can transmit at most one fixed-size packet in each time-slot. The problem Minimumlatency beaconing schedule (MLBS) in multihop wireless networks seeks a shortest schedule for beaconing subject to the interference constraint. MLBS has been intensively studied since the mid-1980s, but all assume the protocol interference model with uniform interference radii. In this paper, we first present a constant-approximation algorithm for MLBS under the protocol interference model with arbitrary interference radii. Then, we develop a constant-approximation algorithm for MLBS under the physical interference model. Both approximation algorithms have efficient implementations in a greedy first-fit manner.

Link scheduling in wireless networks with successive interference cancellation

“…Scheduling with MPR: Interference-aware scheduling is a classic issue [3,5,9,13,22,23]. The famous link interference models, e.g., the protocol and physical models [10], are proposed originally for networks with single packet reception.…”

Link Scheduling in Wireless Networks with Successive Interference Cancellation

“…Scheduling with MPR: Interference-aware scheduling is a classic issue [3,5,9,13,22,23]. The famous link interference models, e.g., the protocol and physical models [10], are proposed originally for networks with single packet reception.…”

Minimum-Latency Beaconing Schedule in duty-cycled multihop wireless networks

“…MLBS is NP-hard even in the simplest setting: all the nodes have uniform beaconing radius and uniform interference radius equal to the beaconing radius [12]. MLBS and its variants have been extensively studied in the literature [1], [2], [4], [10], [11], [12], [13], [14], [15], [17], [18].…”

“…In addition, each node has an interference radius ( ) ≥ 1 and its interference range is the disk centered at of radius ( ). Then, a pair of nodes and conflict with each other (i.e., they cannot transmit simultaneously) if and only if one of the following three conditions holds (see [15]): (1) and are within each other's beaconing range, (2) some node other than and is within 's beaconing range and 's interference range, and (3) some node other than and is within 's beaconing range and 's interference range.…”