A new model for scheduling packet radio networks

Wireless Networks

Volumn 3, Issue 1, 1997, Pages 71-82

  Sen, Arunabha ^a,b,c   Huson, Mark L ^a,d,e,f,g,h  

^a Arizona State University ^*  (United States)

^b JADAVPUR UNIVERSITY   (India)

^c UNIVERSITY OF SOUTH CAROLINA   (United States)

^d UNIVERSITY OF TULSA   (United States)

^e UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^f AIR FORCE INSTITUTE OF TECHNOLOGY   (United States)

^g ARIZONA STATE UNIVERSITY   (United States)

^h UNITED STATES AIR FORCE ACADEMY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CELLULAR RADIO SYSTEMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; TRANSCEIVERS;

PLANAR POINT GRAPHS;

PACKET NETWORKS;

EID: 0030679903     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019128411323     Document Type: Article

References (21)

1. E. Arikan, Some complexity results about packet radio networks, IEEE Trans. Inform. Theory 30 (July 1984) 681-685.
2. 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.
3. T. Biedl and G. Kant, A better heuristic for orthogonal graph drawing, in: Proc. 2nd Ann. European Sympos. Algorithms (1994).
4. I. Chlamtac and S. Kutten, A spatial reuse tdma/fdma for mobile multihop radio networks, in: INFOCOM (IEEE, March 1985) pp. 389-394.
5. I. Chlamtac and A. Lerner, A link allocation protocol for mobile multi-hop radio networks, in: GLOBECOM (IEEE, 1985) pp. 238-242.
6. B. N. Clark, C. J. Colbourn and D. S. Johnson, Unit disk graphs, Discrete Math. 86 (1990) 165-177.
7. A. Ephremides and T. V. Truong, Scheduling broadcasts in multihop radio networks, IEEE Trans. Communications 38 (April 1990) 456-461.
8. S. Even, O. Goldreich, S. Moran and P. Tong, On the NP-completeness of certain network testing problems, Networks 14 (1984) 1-24.
9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, 1979).
10. M. R. Garey, D. S. Johnson and L. J. Stockmeyer, Some simplified NP-complete graph problems, Theoret. Comput. Sci. 1 (1976) 237-267.
11. 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.
12. B. Hajek and G. Sasaki, Link scheduling in polynomial time, IEEE Trans. Inform. Theory 34 (September 1988) 910-917.
13. M. L. Huson, A new model for scheduling radio networks, Ph.D. thesis, Arizona State University, Tempe, AZ (August 1995).
14. D. S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms 3 (1982) 182-195.
15. H. Maehara, Space graphs and sphericity, Discrete Appl. Math. 7 (1984) 55-64.
16. 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).
17. R. Ogier, A decomposition method for optimal link scheduling, in: Proc. 24th Allerton Conf. (October 1986) pp. 822-823.
18. S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multi-hop radio networks, in: SIGCOM (ACM, 1992) pp. 211-222.
19. S. Ramanathan and E. L. Lloyd, Scheduling algorithms for multi-hop radio networks, IEEE/ACM Trans. Networking 1 (April 1993) 166-172.
20. R. Ramaswami and K. K. Parhi, Distributed scheduling of broadcasts in a radio network, in: INFOCOM (IEEE, 1989) pp. 497-504.
21. L. G. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Computers 30 (February 1981) 135-140.