Radiocolorings in Periodic Planar Graphs: PSPACE-Completeness and Efficient Approximations for the Optimal Range of Frequencies

• Authors: Dimitris Fotakis;Sotiris E. Nikoletseas;Vicky G. Papadopoulou;Paul G. Spirakis
• Venue: WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
• Year: 2002

The Frequency Assignment Problem (FAP) in radio networks is the problem of assigning frequencies to transmitters exploiting frequency reuse while keeping signal interference to acceptable levels. The FAP is usually modelled by variations of the graph coloring problem. The Radiocoloring (RC) of a graph G(V,E) is an assignment function 驴 : V 驴 IN such that |驴(u) - 驴(v)| 驴 2, when u, v are neighbors in G, and |驴(u) - 驴(v)| 驴 1 when the distance of u, v in G is two. The range of frequencies used is called span. Here, we consider the optimization version of the Radiocoloring Problem (RCP) of finding a radiocoloring assignment of minimum span, called min span RCP.In this paper, we deal with a variation of RCP: that of satisfying frequency assignment requests with some periodic behavior. In this case, the interference graph is an (infinite) periodic graph. Infinite periodic graphs model finite networks that accept periodic (in time, e.g. daily) requests for frequency assignment. Alternatively, they may model very large networks produced by the repetition of a small graph.A periodic graph G is defined by an infinite two-way sequence of repetitions of the same finite graph Gi(Vi, Ei). The edge set of G is derived by connecting the vertices of each iteration Gi to some of the vertices of the next iteration Gi+1, the same for all Gi. The model of periodic graphs considered here is similar to that of periodic graphs in Orlin [13], Marathe et al [10]. We focus on planar periodic graphs, because in many cases real networks are planar and also because of their independent mathematical interest. We give two basic results: - We prove that the min span RCP is PSP ACE-complete for periodic planar graphs. - We provide an O(n(驴(Gi) + 驴)) time algorithm, (where |Vi| = n, 驴(Gi) is the maximum degree of the graph Gi and 驴 is the number of edges connecting each Gi to Gi+1), which obtains a radiocoloring of a periodic planar graph G that approximates the minimum span within a ratio which tends to 2 as 驴(Gi) + 驴 tends to infinity.