Unified framework and algorithm for channel assignment in wireless networks

Wireless Networks

Volumn 5, Issue 2, 1999, Pages 81-94

  Ramanathan, S ^a,b  

^a BBN TECHNOLOGIES   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODE DIVISION MULTIPLE ACCESS; COMMUNICATION CHANNELS (INFORMATION THEORY); FREQUENCY DIVISION MULTIPLE ACCESS; TELECOMMUNICATION LINKS; TIME DIVISION MULTIPLE ACCESS;

ATOMIC CONSTRAINTS; MULTIHOP NETWORKS;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0032658710     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1019126406181     Document Type: Article

References (33)

1. 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).
2. E. Arikan, Some complexity results about packet radio networks, IEEE Transactions on Information Theory 30 (July 1984) 910-198.
3. A.A. Bertossi and M.A. Bonuccelli, Code assignment for hidden terminal interference avoidance in multihop packet radio networks, in: Proceedings of INFOCOM (1992).
4. F. Box, A heuristic technique for assigning frequencies to mobile radio nets, IEEE Transactions on Vehicular Technology 27 (May 1978) 57-74.
5. 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-29.
6. I. Chlamtac and S. Kutten, A spatial reuse TDMA/FDMA for mobile multi-hop radio networks, in: Proceedings of INFOCOM (1985).
7. I. Chlamtac and A. Lerner, Fair algorithms for maximal link activation in multihop radio networks, IEEE Transactions on Communications 35 (July 1987) 739-746.
8. I. Cidon and M. Sidi, Distributed assignment algorithms for multihop radio networks, IEEE Transactions on Computers 38(10) (October 1989) 1353-1361.
9. W. Diepstraten, G. Ennis and P. Berlanger, DFWMAC: Distributed Foundation Wireless Medium Access Control, IEEE Document P802.11-93/190 (November 1993).
10. A. Ephremedis and T. Truong, Scheduling broadcasts in multihop radio networks, IEEE Transactions on Communications 38 (April 1990) 456-460.
11. 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-73.
12. S. Even, O. Goldreich, S. Moran and P. Tong, On the NP-completeness of certain network testing problems, Networks 14 (1984).
13. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979).
14. B. Hajek and G. Sasaki, Link scheduling in polynomial time, IEEE Transactions on Information Theory 34(5) (September 1988).
15. W.K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68(12) (December 1980).
16. F. Harary, Graph Theory (Addison-Wesley, Reading, MA, 1972).
17. L. Hu, Distributed code assignments for CDMA packet radio networks, in: Proceedings of INFOCOM (1991).
18. J. Jubin and J.D. Tornow, The DARPA packet radio network protocols, Proceedings of the IEEE 75 (1987).
19. R.S. Kahn, J. Gronemeyer, J. Burchfiel and R. Kunzelman, Advances in packet radio technology, Proceedings of the IEEE 66(11) (November 1978).
20. G. Lauer, Packet-radio routing, in: Routing in Communication Networks, ed. M. Steenstrup (Prentice-Hall, Englewood Cliffs, NJ, 1995).
21. E.L. Lloyd and S. Ramanathan, Efficient distributed algorithms for channel assignment in multihop radio networks, Journal of High Speed Networks 2(4) (1993).
22. V.H. MacDonald, The cellular concept, The Bell Systems Technical Journal 44 (1965) 547-588.
23. T. Makansi, Transmitter oriented code assignment for multihop packet radio, IEEE Transactions on Information Theory 34(5) (September 1988).
24. A. Mansfield, Determining the thickness of graphs is NP-hard, Mathematical Proceedings of the Cambridge Philosophical Society 93 (1983) 9-23.
25. T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, Annals of Discrete Mathematics, Vol. 32 (North-Holland, Amsterdam, 1988).
26. C.E. Perkins and P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, in: Proceedings of ACM SIGCOMM, 1994.
27. 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).
28. S. Ramanathan, Scheduling algorithms for multihop radio networks, Ph.D. thesis, University of Delaware (1992).
29. S. Ramanathan and E.L. Lloyd, Scheduling algorithms for multihop radio networks, IEEE/ACM Transactions on Networking 1(2) (April 1993).
30. R. Ramaswami and K.K. Parhi, Distributed Scheduling of Broadcasts in a radio network, in: Proceedings of IEEE INFOCOM (1989).
31. A. Sen and M.L. Huson, A new model for scheduling packet radio networks, in: Proceedings of INFOCOM (1996) pp. 1116-1124.
32. N. Shacham and J. Westcott, Future directions in packet radio architectures and protocols, Proceedings of the IEEE 75(1) (January 1987) 83-99.
33. J.A. Silvester, Perfect scheduling in multi-hop broadcast networks, in: Proceedings of ICCC (1982).