Upper and lower bounds for deterministic broadcast in powerline communication networks.

Powerline communication networks assume an interesting position in the communication network space: similarly to wireless networks, powerline networks are based on a shared broadcast medium; unlike wireless networks, however, the signal propagation is constrained to the power lines of the electrical infrastructure, which is essentially a graph. This article presents an algorithmic model to study the design of communication services over powerline communication networks. As a case study, we focus on the fundamental broadcast problem, and present and analyze a distributed algorithm $$\textsc {Color}\textsc {Cast}$$ which terminates in at most n communication rounds, where n denotes the network size, even in a model where link qualities are unpredictable and time-varying. For comparison, the achieved broadcast time is lower than what can be achieved by any unknown-topology algorithm (lower bounds $$\varOmega (n\log n / \log (n/D))$$ and $$\varOmega (n \log D)$$ are proved in Kowalski and Pelc (Distrib Comput 18(1):43-57, ) resp. Clementi et al. () where D is the network diameter). Moreover, existing known-topology broadcast algorithms often fail to deliver the broadcast message entirely in this model. This article also presents a general broadcast lower bound for the powerline model. [ABSTRACT FROM AUTHOR]