Skip to main content
Log in

OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading-factor CDMA code. Thus, it provides a means of supporting of variable rate data service at low hardware cost. However, assigning OVSF-CDMA codes to wireless ad hoc nodes posts a new challenge since not every pair of OVSF-CDMA codewords are orthogonal to each other. In an OVSF-CDMA wireless ad hoc network, a code assignment has to be conflict-free, i.e., two nodes can be assigned the same codeword or two non-orthogonal codewords if and only if their transmission will not interfere with each other. The throughput (resp., bottleneck) of a code assignment is the sum (resp., minimum) of the rates of the assigned codewords. The max-throughput (resp., max-bottleneck) conflict-free code assignment problem seeks a conflict-free code assignment which achieves the maximum throughput (resp., bottleneck). In this paper, we present several efficient methods for conflict-free code assignment in OVSF-CDMA wireless ad hoc networks. Each method is proved to be either a constant-approximation for max-throughput conflict-free code assignment problem, or a constant-approximation for max-bottleneck conflict-free code assignment problem, or constant-approximations for both problems simultaneously.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adachi, F., Sawahashi, M., Okawa, K.: Tree-structured generation of orthogonal spreading codes with different lengths for the forward link of DS-CDMA mobile radio. IEE Electron. Lett. 33(1), 27–28 (1997)

    Article  Google Scholar 

  2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  3. Dell’ Amico, M., Merani, M.L., Maffioli, F.: Efficient algorithms for assignment of OVSF codes in wideband CDMA. In: Proc. ICC’02 (2002)

  4. Bar-Noy, A., Bellare, M., Halldórsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140, 183–202 (1998)

    Article  MATH  Google Scholar 

  5. Cheng, R.G., Lin, P.: OVSF code channel assignment for IMT-2000. In: IEEE Vehicular Technology Conference, vol. 3, pp. 2188–2192 (2000)

  6. Chlamtac, I., Farago, A.: Making transmission schedules immune to topology changes in multi-hop packet radio networks. IEEE/ACM Trans. Netw. 2(1), 23–29 (1994)

    Article  Google Scholar 

  7. Chlamtac, I., Kutten, S.: A spatial reuse TDMA/FDMA for mobile multihop radio networks. In: IEEE INFOCOM, pp. 389–394 (March 1985)

  8. Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86, 165–177 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ephremides, A., Truong, T.V.: Scheduling broadcasts in multihop radio networks. IEEE Trans. Commun. 38(4), 456–460 (1990)

    Article  Google Scholar 

  10. Fantacci, R., Nannicini, S.: Multiple access protocol for integration of variable bit rate multimedia traffic in UMTS/IMT-2000 based on wideband CDMA. IEEE J. Sel. Areas Commun. 18(8), 1441–1454 (2000)

    Article  Google Scholar 

  11. Garcia-Luna-Aceves, J.J., Raju, J.: Distributed assignment of codes for multihop packet-radio networks. In: Proc. IEEE MILCOM (1997)

  12. Krumke, S.O., Marathe, M.V., Ravi, S.S.: Models and approximation algorithms for channel assignment in radio networks. Wirel. Netw. 7(6), 567–574 (2001)

    Article  Google Scholar 

  13. Kubicka, E., Schwenk, A.J.: An introduction to chromatic sums. In: Proc. of ACM Computer Science Conference, pp. 39–45 (1989)

  14. Li, X.-Y., Wang, Y.: Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks. In: ACM DialM (2002)

  15. Matula, D.W., Beck, L.L.: Smallest-last ordering and clustering and graph coloring algorithms. J. Assoc. Comput. Mach. 30(3), 417–427 (1983)

    MATH  MathSciNet  Google Scholar 

  16. Minn, T., Siu, K.-Y.: Dynamic assignment of orthogonal variable spreading factor codes in W-CDMA. IEEE J. Sel. Areas Commun. 18(8), 1429–1440 (2000)

    Article  Google Scholar 

  17. Nelson, R., Kleinrock, L.: Spatial-TDMA: a collision-free multihop channel access protocol. IEEE Trans. Commun. 33(9), 934–944 (1985)

    Article  MathSciNet  Google Scholar 

  18. Ramanathan, S., Lloyd, E.L.: Scheduling algorithms for multi-hop radio networks. IEEE/ACM Trans. Netw. 1, 166–172 (1993)

    Article  Google Scholar 

  19. Ramaswami, R., Parhi, K.K.: Distributed scheduling of broadcasts in a radio network. In: IEEE INFOCOM, pp. 497–504 (1989)

  20. Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. ACM/Baltzer J. Wirel. Netw. 3, 71–82 (1997)

    Article  Google Scholar 

  21. Sen, A., Malesinska, E.: Approximation algorithms for radio network scheduling. In: Proceedings of 35th Allerton Conference on Communication, Control and Computing, Champaign, IL, pp. 573–582 (October 1997)

  22. Stevens, D.S., Ammar, M.H.: Evaluation of slot allocation strategies for TDMA protocols in packet radio networks. In: IEEE Military Communications Conference, pp. 835–839 (1990)

  23. Wan, P.-J., Yi, C.W., Jia, X., Kim, D.: Approximation algorithms for conflict-free channel assignment in wireless ad hoc networks. Wirel. Commun. Mobile Comput. 6(2), 201–211 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiang-Yang Li.

Additional information

The work of Peng-Jun Wan and Xiang-Yang Li is partially supported by NSF CCR-0311174.

The preliminary version of the paper first appeared in ACM DIAL M-POMC 2004, workshop of ACM MobiCom 2004.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wan, PJ., Li, XY. & Frieder, O. OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks. Algorithmica 49, 264–285 (2007). https://doi.org/10.1007/s00453-007-9094-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-007-9094-6

Keywords

Navigation