Advertisement

Wireless Networks

, Volume 5, Issue 2, pp 81–94 | Cite as

A unified framework and algorithm for channel assignment in wireless networks

  • S. Ramanathan
Article

Abstract

Channel assignment problems in the time, frequency and code domains have thus far been studied separately. Exploiting the similarity of constraints that characterize assignments within and across these domains, we introduce the first unified framework for the study of assignment problems. Our framework identifies eleven atomic constraints underlying most current and potential assignment problems, and characterizes a problem as a combination of these constraints. Based on this framework, we present a unified algorithm for efficient (T/F/C)DMA channel assignments to network nodes or to inter-nodal links in a (multihop) wireless network. The algorithm is parametrized to allow for tradeoff-selectable use as three different variants called RAND, MNF, and PMNF. We provide comprehensive theoretical analysis characterizing the worst-case performance of our algorithm for several classes of problems. In particular, we show that the assignments produced by the PMNF variant are proportional to the thickness of the network. For most typical multihop networks, the thickness can be bounded by a small constant, and hence this represents a significant theoretical result. We also experimentally study the relative performance of the variants for one node and one link assignment problem. We observe that the PMNF variant performs the best, and that a large percentage of unidirectional links is detrimental to the performance in general.

Keywords

Wireless Network Large Percentage Relative Performance Assignment Problem Network Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • S. Ramanathan
    • 1
  1. 1.BBN Technologies DivisionGTE InternetworkingCambridgeUSA

Personalised recommendations