Upper and lower bounds for deterministic broadcast in powerline communication networks

Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., auf der Heide, F. Meyer: Token dissemination in geometric dynamic networks. In: Flocchini, P., Gao, J., Kranakis, E., auf der Heide, F. Meyer (eds.) 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics. Algorithms for Sensor Systems, Lecture Notes in Computer Science, vol. 8243. Springer, Berlin, Heidelberg, pp. 22–34. (2014)

Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43(2), 290–298 (1991)

Awerbuch, B.: A new distributed depth-first-search algorithm. Inform. Process. Lett. 20(3), 147–150 (1985)

Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45, 104–126 (1992)

Ben Saad, L., Chauvenet, C., Tourancheau, B. et al.: Simulation of the RPL Routing Protocol for IPv6 Sensor Networks: two cases studies. In: SENSORCOMM, (2011)

Bumiller G.: Power-line Physical Layer Emulator for Protocol Development. In: ISPLC, (2004)

Burkhart, M., Von Rickenbach, P., Wattenhofer, R., Zollinger, A.: Does topology control reduce interference? In: Proceedings of the 5th ACM International Symposium on Mobile ad hoc Networking and Computing, pp. 9–19. ACM, (2004)

Cicalese, F., Manne, F., Xin, Q.: Faster centralized communication in radio networks. In: Algorithms and Computation. (2006)

Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1–3), 165–177 (1990)

Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 709–718. Society for Industrial and Applied Mathematics, (2001)

Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms 492–501 (2003)

De Marco, G.: Distributed broadcast in unknown radio networks. In: Proceedings of 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 208–217 (2008)

Elkin, M., Kortsarz, G.: Polylogarithmic inapproximability of the radio broadcast problem. In: Proceedings of APPROX, vol. 3122. pp. 105–116 (2004)

Fussen, M., Wattenhofer, R., Zollinger, A.: Interference arises at the receiver. In: Wireless Networks, Communications and Mobile Computing, 2005 International Conference on, vol. 1, pp. 427–432. IEEE, (2005)

Gasieniec, L., Kowalski, D.R., Lingas, A., Wahlen, M.: Efficient broadcasting in known geometric radio networks with non-uniform ranges. In: Distributed Computing, pp. 274–288. Springer, (2008)

Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: PODC (2005)

Ghaffari, M., Kantor, E., Lynch, N., Newport, C.: Multi-message broadcast with abstract mac layers and unreliable links. In: PODC (2014)

Ghaffari, M., Lynch, N., Newport, C.: The cost of radio network broadcast for different models of unreliable links. In: PODC (2013)

Gungor, V.C., Sahin, D., Kocak, T., Ergut, S., Buccella, C., Cecati, C., Hancke, G.P.: Smart grid technologies: communication technologies and standards. IEEE Trans. Ind. Inform. 7(4), 529–539 (2011)

Khabbazian, M., Kuhn, F., Kowalski, D.R., Lynch, N.: Decomposing broadcast algorithms using abstract mac layers. In: Proceedings of the 6th International Workshop on Foundations of Mobile Computing, pp. 13–22. ACM (2010)

Kostakos, V.: Temporal graphs. Phys. A Stat. Mech. Appl. 388(6), 1007–1023 (2009)

Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18(1), 43–57 (2005)

Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. 19(3), 185–195 (2007)

Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: Proc. ACM Symposium on Theory of Computing (STOC), pp. 513–522 (2010)

Kuhn, F., Oshman, R.: The complexity of data aggregation in directed networks. In: Proceedings of 25th International Conference on Distributed Computing (DISC), pp. 416–431 (2011)

Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad-hoc networks beyond unit disk graphs. In: Proceedings of the 2003 joint workshop on Foundations of mobile computing, pp. 69–78. ACM (2003)

Kushilevitz, E., Mansour, Y.: An $$\omega (d \log (n/d))$$ ω ( d log ( n / d ) ) lower bound for broadcast in radio networks. In: Proceedings of 12th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 65–74 (1993)

Malacasa E., Morabito, G.: Characterization of PLC Communication Channel: a Networking Perspective. In: WSPLC (2009)

Patel, A., Aparicio, J., Tas, N., Loiacono, M., Rosca, J.: Assessing communications technology options for smart grid applications. In: IEEE SmartGridComm (2011)

Peleg, D.: Time-efficient broadcasting in radio networks: a review. In: ICDCT (2007)

Pignolet, Y.-A., Rinis, I., Dzung, D., Karaagac, A.: Multi-Interface extensions for PLC / wireless simulator. In: WSPLC (2012)

Versolatto, F., Tonello, A., Analysis of the PLC channel statistics using a bottom-up random simulator. In: ISPLC (2010)