Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2017

Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks

Abstract

In this paper, we study the distance-2 broadcast scheduling problem in synchronous wireless networks of known topology. Two constraints are taken under consideration: the schedule must be collision-free and the nodes at distance 2 must be informed by nodes at distance 1. In general graphs, a tight bound of O(log(n) 2 ) slots to complete the broadcast is known, n being the number of nodes at distance 2. We improve this bound to O(log(n)) in unit disk graphs, and to O(1) when the neighbourhoods of the nodes are circular intervals.
Fichier principal
Vignette du fichier
140.pdf (126.62 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

lirmm-01660842 , version 1 (20-12-2019)

Identifiers

Cite

Valentin Pollet, Vincent Boudet, Jean-Claude König. Distance-2 Collision-Free Broadcast Scheduling in Wireless Networks. FedCSIS: Federated Conference on Computer Science and Information Systems, Sep 2017, Prague, Czech Republic. pp.469-472, ⟨10.15439/2017F140⟩. ⟨lirmm-01660842⟩
150 View
55 Download

Altmetric

Share

Gmail Facebook X LinkedIn More