Skip to main content
SpringerLink
Log in

Scheduling multihop CDMA networks in the presence of secondary conflicts

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

This paper presents an algorithm for producing near-optimal conflict-free schedules for networks operating under code division multiple access (CDMA). A procedure for finding a lower bound on the length of such schedules is also presented. The presence of both primary and secondary conflicts (due to imperfectly orthogonal CDMA codes) are accounted for by these algorithms. The complexity of both algorithms is analyzed and computational experience with both procedures is presented. Using the lower bound, it is shown that the heuristic is effective. The complexity analysis demonstrates that it is efficient enough to use in networks of realistic size, even when the schedules must be produced in real time.

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

Access this article

Log in via an institution

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. B. Hajek and G. Sasaki, Link Scheduling in Polynomial Time,IEEE Trans. Inform. Theory, to appear.

  2. W. H. Kohler and K. Steiglitz, Enumerative and Iterative Computational Approaches, inComputer and Job Shop Scheduling Theory (E. Coffman, ed.), New York, Wiley, 1976.

    Google Scholar 

  3. R. G. Ogier, A Decomposition Method for Optimal Link Scheduling,Proc. 24th Allerton Conf., Oct. 1986.

  4. M. J. Post, P. E. Sarachik, and A. S. Kershenbaum, A Biased Greedy Algorithm for Scheduling Multi-Hop Radio Networks,Proc. 1985 Conf. Inform. Sci. and Systems, Mar. 1985, pp. 564–572.

  5. M. J. Post, A. S. Kershenbaum, and P. E. Sarachik, A Distributed Evolutionary Algorithm for Reorganizing Network Communications,Proc. MILCOM, Sept. 1986, pp. 133–139.

  6. J. E. Wieselthier and A. Ephremides, A Distributed Reservation Scheme for Spread Spectrum Multiple Access Channels,GLOBCOM, 1983.

  7. J. E. Wieselthier, A. Ephremides, and J. A. B. Tarr, A Distributed Reservation-Based CDMA Protocol That Does Not Require Feedback Information,IEEE Trans. Comm., to appear.

Download references

Author information

Authors and Affiliations

  1. Polytechnic University, 11201, Brooklyn, NY, USA

    M. J. Post, A. S. Kershenbaum & P. E. Sarachik

Authors
  1. M. J. Post
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. S. Kershenbaum
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. E. Sarachik
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by Israel Cidon and Inder S. Gopal.

This work was sponsored in part by the Naval Research Laboratory under Contract N00014-84-K-2011 and by the New York State Foundation for Science and Technology as part of its Centers for Advanced Technology Program.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Post, M.J., Kershenbaum, A.S. & Sarachik, P.E. Scheduling multihop CDMA networks in the presence of secondary conflicts. Algorithmica 4, 365–393 (1989). https://doi.org/10.1007/BF01553897

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01553897

Key words

Search

Navigation