Abstract
Packet radio networks are modeled as arbitrary graphs by most researchers. In this paper we show that an arbitrary graph is an inaccurate model of the radio networks. This is true because there exists a large class of graphs which will not model the radio networks. Radio networks can be modeled accurately by a restricted class of graphs called the planar point graphs. Since the radio networks can accurately be modeled only by a restricted class of graphs, the NP-completeness results for scheduling using an arbitrary graph as the model, do not correctly reflect the complexity of the problem. In this paper we study the broadcast scheduling problem using the restricted class as the model. We show that the problem remains NP-complete even in this restricted domain. We give an O(n log n) algorithm when all the transceivers are located on a line.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Arikan, Some complexity results about packet radio networks, IEEE Trans. Inform. Theory 30 (July 1984) 681–685.
R. Bar-Yehuda, A. Israeli and A. Itai, Multiple communication in multi-hop radio networks, in: Proc. 8th Ann. ACM Sympos. Princ. Distrib. Comput. (ACM, 1989) pp. 329–338.
T. Biedl and G. Kant, A better heuristic for orthogonal graph drawing, in: Proc. 2nd Ann. European Sympos. Algorithms (1994).
I. Chlamtac and S. Kutten, A spatial reuse tdma/fdma for mobile multihop radio networks, in: INFOCOM (IEEE, March 1985) pp. 389–394.
I. Chlamtac and A. Lerner, A link allocation protocol for mobile multi-hop radio networks, in: GLOBECOM (IEEE, 1985) pp. 238–242.
B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit disk graphs, Discrete Math. 86 (1990) 165–177.
A. Ephremides and T. V. Truong, Scheduling broadcasts in multihop radio networks, IEEE Trans. Communications 38 (April 1990) 456–461.
S. Even, O. Goldreich, S. Moran and P. Tong, On the NPcompleteness of certain network testing problems, Networks 14 (1984) 1–24.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979).
M. R. Garey, D. S. Johnson and L. J. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237–267.
U. I. Gupta, D. T. Lee and J. Y.-T. Leung, An optimal solution for the channel–assignment problem, IEEE Trans. Computers 28 (November 1979) 807–810.
B. Hajek and G. Sasaki, Link scheduling in polynomial time, IEEE Trans. Inform. Theory 34 (September 1988) 910–917.
M. L. Huson, A new model for scheduling radio networks, Ph.D. thesis, Arizona State University, Tempe, AZ (August 1995).
D. S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms 3 (1982) 182–195.
H. Maehara, Space graphs and sphericity, Discrete Appl. Math. 7 (1984) 55–64.
S.T. McCormick, Optimal approximation of sparse Hessians and its equivalence to a graph coloring problem, Technical Report SOL 81-22, Stanford University, Department of Operations Research (1981).
R. Ogier, A decomposition method for optimal link scheduling, in: Proc. 24th Allerton Conf. (October 1986) pp. 822–823.
S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multi-hop radio networks, in: SIGCOM (ACM, 1992) pp. 211–222.
S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multihop radio networks, IEEE/ACM Trans. Networking 1 (April 1993) 166–172.
R. Ramaswami and K. K. Parhi, Distributed scheduling of broadcasts in a radio network, in: INFOCOM (IEEE, 1989) pp. 497–504.
L. G. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Computers 30 (February 1981) 135–140.
Rights and permissions
About this article
Cite this article
Sen, A., Huson, M.L. A new model for scheduling packet radio networks. Wireless Networks 3, 71–82 (1997). https://doi.org/10.1023/A:1019128411323
Issue Date:
DOI: https://doi.org/10.1023/A:1019128411323