{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:53:35Z","timestamp":1771703615860,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Networks"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1023\/a:1019126406181","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"81-94","source":"Crossref","is-referenced-by-count":274,"title":["A unified framework and algorithm for channel assignment in wireless networks"],"prefix":"10.1007","volume":"5","author":[{"given":"S.","family":"Ramanathan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"330502_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon, A. Bar-Noy, N. Linial and D. Peleg, On the complexity of radio communication, in: Proceedings of 21st Annual ACM Symposium on Theory of Computing (1989).","DOI":"10.1145\/73007.73033"},{"key":"330502_CR2","doi-asserted-by":"crossref","unstructured":"E. Arikan, Some complexity results about packet radio networks, IEEE Transactions on Information Theory 30 (July 1984) 910\u2013198.","DOI":"10.1109\/TIT.1984.1056928"},{"key":"330502_CR3","doi-asserted-by":"crossref","unstructured":"A.A. Bertossi and M.A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, in: Proceedings of INFOCOM (1992).","DOI":"10.1109\/INFCOM.1992.263490"},{"key":"330502_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/T-VT.1978.23724","volume":"27","author":"F. Box","year":"1978","unstructured":"F. Box, A heuristic technique for assigning frequencies to mobile radio nets, IEEE Transactions on Vehicular Technology 27 (May 1978) 57\u201374.","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"1","key":"330502_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/90.282605","volume":"2","author":"I. Chlamtac","year":"1994","unstructured":"I. Chlamtac and A. Farago, Making transmission schedules immune to topology changes in multi-hop packet radio networks, IEEE\/ACM Transactions on Networking 2(1) (February 1994) 23\u201329.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"330502_CR6","unstructured":"I. Chlamtac and S. Kutten, A spatial reuse TDMA\/FDMA for mobile multi-hop radio networks, in: Proceedings of INFOCOM (1985)."},{"key":"330502_CR7","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1109\/TCOM.1987.1096847","volume":"35","author":"I. Chlamtac","year":"1987","unstructured":"I. Chlamtac and A. Lerner, Fair algorithms for maximal link activation in multihop radio networks, IEEE Transactions on Communications 35 (July 1987) 739\u2013746.","journal-title":"IEEE Transactions on Communications"},{"issue":"10","key":"330502_CR8","doi-asserted-by":"crossref","first-page":"1353","DOI":"10.1109\/12.35830","volume":"38","author":"I. Cidon","year":"1989","unstructured":"I. Cidon and M. Sidi, Distributed assignment algorithms for multihop radio networks, IEEE Transactions on Computers 38(10) (October 1989) 1353\u20131361.","journal-title":"IEEE Transactions on Computers"},{"key":"330502_CR9","unstructured":"W. Diepstraten, G. Ennis and P. Berlanger, DFWMAC: Distributed Foundation Wireless Medium Access Control, IEEE Document P802.11\u201393\/190 (November 1993)."},{"key":"330502_CR10","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1109\/26.52656","volume":"38","author":"A. Ephremedis","year":"1990","unstructured":"A. Ephremedis and T. Truong, Scheduling broadcasts in multihop radio networks, IEEE Transactions on Communications 38 (April 1990) 456\u2013460.","journal-title":"IEEE Transactions on Communications"},{"issue":"1","key":"330502_CR11","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1109\/PROC.1987.13705","volume":"75","author":"A. Ephremedis","year":"1987","unstructured":"A. Ephremedis, J.E. Wieselthier and D.J. Baker, A design concept for reliable mobile radio networks with frequency hopping signalling, Proceedings of the IEEE 75(1) (January 1987) 56\u201373.","journal-title":"Proceedings of the IEEE"},{"key":"330502_CR12","doi-asserted-by":"crossref","unstructured":"S. Even, O. Goldreich, S. Moran and P. Tong, On the NP-completeness of certain network testing problems, Networks 14 (1984).","DOI":"10.1002\/net.3230140102"},{"key":"330502_CR13","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)."},{"key":"330502_CR14","doi-asserted-by":"crossref","unstructured":"B. Hajek and G. Sasaki, Link scheduling in polynomial time, IEEE Transactions on Information Theory 34(5) (September 1988).","DOI":"10.1109\/18.21215"},{"key":"330502_CR15","doi-asserted-by":"crossref","unstructured":"W.K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68(12) (December 1980).","DOI":"10.1109\/PROC.1980.11899"},{"key":"330502_CR16","volume-title":"Graph Theory","author":"F. Harary","year":"1972","unstructured":"F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1972)."},{"key":"330502_CR17","doi-asserted-by":"crossref","unstructured":"L. Hu, Distributed code assignments for CDMA packet radio networks, in: Proceedings of INFOCOM (1991).","DOI":"10.1109\/INFCOM.1991.147683"},{"key":"330502_CR18","doi-asserted-by":"crossref","unstructured":"J. Jubin and J.D. Tornow, The DARPA packet radio network protocols, Proceedings of the IEEE 75 (1987).","DOI":"10.1109\/PROC.1987.13702"},{"key":"330502_CR19","doi-asserted-by":"crossref","unstructured":"R.S. Kahn, J. Gronemeyer, J. Burchfiel and R. Kunzelman, Advances in packet radio technology, Proceedings of the IEEE 66(11) (November 1978).","DOI":"10.1109\/PROC.1978.11151"},{"key":"330502_CR20","volume-title":"Routing in Communication Networks","author":"G. Lauer","year":"1995","unstructured":"G. Lauer, Packet-radio routing, in: Routing in Communication Networks, ed. M. Steenstrup (Prentice-Hall, Englewood Cliffs, NJ, 1995)."},{"key":"330502_CR21","doi-asserted-by":"crossref","unstructured":"E.L. Lloyd and S. Ramanathan, Efficient distributed algorithms for channel assignment in multihop radio networks, Journal of High Speed Networks 2(4) (1993).","DOI":"10.3233\/JHS-1993-2405"},{"key":"330502_CR22","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1002\/j.1538-7305.1965.tb01678.x","volume":"44","author":"V.H. MacDonald","year":"1965","unstructured":"V.H. MacDonald, The cellular concept, The Bell Systems Technical Journal 44 (1965) 547\u2013588.","journal-title":"The Bell Systems Technical Journal"},{"key":"330502_CR23","unstructured":"T. Makansi, Transmitter oriented code assignment for multihop packet radio, IEEE Transactions on Information Theory 34(5) (September 1988)."},{"key":"330502_CR24","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1017\/S030500410006028X","volume":"93","author":"A. Mansfield","year":"1983","unstructured":"A. Mansfield, Determining the thickness of graphs is NP-hard, Mathematical Proceedings of the Cambridge Philosophical Society 93 (1983) 9\u201323.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"330502_CR25","volume-title":"Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics","author":"T. Nishizeki","year":"1988","unstructured":"T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, Vol. 32 (North-Holland, Amsterdam, 1988)."},{"key":"330502_CR26","doi-asserted-by":"crossref","unstructured":"C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, in: Proceedings of ACM SIGCOMM, 1994.","DOI":"10.1145\/190314.190336"},{"key":"330502_CR27","unstructured":"M. Post, P. Sarachik and A. Kershenbaum, A biased greedy algorithm for scheduling multi-hop radio networks, in: Proceedings of the Conference on Information Science Systems (1985)."},{"key":"330502_CR28","doi-asserted-by":"crossref","unstructured":"S. Ramanathan, Scheduling algorithms for multihop radio networks, Ph.D. thesis, University of Delaware (1992).","DOI":"10.1145\/144179.144283"},{"key":"330502_CR29","doi-asserted-by":"crossref","unstructured":"S. Ramanathan and E.L. Lloyd, Scheduling algorithms for multihop radio networks, IEEE\/ACM Transactions on Networking 1(2) (April 1993).","DOI":"10.1109\/90.222924"},{"key":"330502_CR30","doi-asserted-by":"crossref","unstructured":"R. Ramaswami and K.K. Parhi, Distributed Scheduling of Broadcasts in a radio network, in: Proceedings of IEEE INFOCOM (1989).","DOI":"10.1109\/INFCOM.1989.101493"},{"key":"330502_CR31","doi-asserted-by":"crossref","unstructured":"A. Sen and M.L. Huson, A new model for scheduling packet radio networks, in: Proceedings of INFOCOM (1996) pp. 1116\u20131124.","DOI":"10.1109\/INFCOM.1996.493055"},{"issue":"1","key":"330502_CR32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/PROC.1987.13707","volume":"75","author":"N. Shacham","year":"1987","unstructured":"N. Shacham and J. Westcott, Future directions in packet radio architectures and protocols, Proceedings of the IEEE 75(1) (January 1987) 83\u201399.","journal-title":"Proceedings of the IEEE"},{"key":"330502_CR33","unstructured":"J.A. Silvester, Perfect scheduling in multi-hop broadcast networks, in: Proceedings of ICCC (1982)."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1023\/A:1019126406181.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/article\/10.1023\/A:1019126406181\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1023\/A:1019126406181.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T12:01:54Z","timestamp":1755086514000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/link.springer.com\/10.1023\/A:1019126406181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["330502"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1023\/a:1019126406181","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}