Let P be a set of nodes in a wireless network, where each node is modeled as a point in the plane, and let s ∈ P be a given source node. Each node p can transmit information to all other nodes within unit distance, provided p is activated. The (homogeneous) broadcast problem is to activate a minimum number of nodes such that in the resulting directed communication graph, the source s can reach any other node. We study the complexity of the regular and the hop-bounded version of the problem (in the latter, s must be able to reach every node within a specified number of hops), with the restriction that all points lie inside a strip of width w. We almost completely characterize the complexity of both the regular and the hop-bounded versions as a function of the strip width w.
CITATION STYLE
de Berg, M., Bodlaender, H. L., & Kisfaludi-Bak, S. (2017). The homogeneous broadcast problem in narrow and wide strips. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10389 LNCS, pp. 289–300). Springer Verlag. https://doi.org/10.1007/978-3-319-62127-2_25
Mendeley helps you to discover research relevant for your work.