Single-frequency packet network using stack algorithm and multiple base stations | SpringerLink
Skip to main content
Springer Nature Link
Log in

Single-frequency packet network using stack algorithm and multiple base stations

  • Conference paper
  • First Online:
Broadband Communications Networks, Services, Applications, Future Directions (IZS 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1044))

Included in the following conference series:

  • 146 Accesses

Abstract

This paper evaluates a new method to combine contiguous frequency reuse with random access in wireless packet-switched networks. We consider a radio network with two base stations receiving packets transmitted by a large population of mobile users. Both stations share the same channel and therefore transmissions to one base station in one cell interfere with transmissions to the other base station in the other cell. A simulation of a two-cell system is performed, to study the interaction of retransmission traffic in two cells. To consider the performance of such system analytically, we model a one-cell system with time-varying channel properties: if only one station is receiving messages from its cell, the channel is assumed to be in ”good state”; if terminals in both cells are busy the channels are assumed to be in ”bad state”. For conflict resolution, the stack-algorithm is used. The packet delay is calculated. Our results confirm that in wireless packet networks, it is advantageous to allow neighbouring cells to share the same channel.

Her work on this paper was partly sponsored by Netherlands Organization for Scientific Research NWO 713-229 and by the Russian MINNAUKA under the Project ”Dostup”.

Previously he was with the T.V.S. group at T.U. Delft.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. D. Vvedenskaya and B. S. Tsybakov, “Packet delay with multi-access stack-algorithm,” Problems of Information Transmission, 2, v.16, (1984).

    Google Scholar 

  2. N. D. Vvedenskaya, “Multiple access stack-algorithm with imperfect feedback,” Tr. of Fifth IEEE Int.Symposium on PIMRC'94, 4, 1126–1128 (1994).

    Google Scholar 

  3. N. D. Vvedenskaya, J. C. Arnbak, B. S. Tsybakov, “Improved Performance of mobile data networks using stack-algorithms and receiver capture,” March 1994 Int.Zurich Seminar on Digital Communications, Springer-verlag, Lecture Notes in Computer Sci., 783, 464–475 (1994).

    Google Scholar 

  4. J. P. M. G. Linnartz and N. D. Vvedenskaya, “Optimizing delay and throughput in packet switched CDMA network with collision resolution using stack-algorithm,” Electronics letters, 1st Sept., 30, No.18, 1470–1471.

    Google Scholar 

  5. J. P. M. G. Linnartz, Narrowband Landmobile Radio Networks, Artech House, Boston, 1993.

    Google Scholar 

  6. W. C. Jakes, Jr, Microwave Mobile Communication, New York: J. Wiley and Sons, 1978.

    Google Scholar 

  7. MULTIPLE ACCESS COMMUNICATIONS. Foundations for Emerging Technologies, Edited by N. Abramson, IEEE Press,1993.

    Google Scholar 

  8. A.B. Carleial and M.E. Hellman, ”Bistable behavior of ALOHA-type systems”, IEEE Tr. in Comm., Vol. COM-23, No. 4, Apr. 1975, pp. 401–410.

    Article  Google Scholar 

  9. L. Kleinrock and S. S. Lam, ”Packet switching in a multiaccess broadcast channel-performance evaluation”, IEEE Tr. on Comm., Vol. COM-23, No. 4, Apr. 1975, pp. 410–423.

    Article  Google Scholar 

  10. S. Ghez, S. Verdu and S. C. Schwartz, ”Stability properties of slotted ALOHA with multipacket reception capability”, IEEE Tr. Automatic Control, Vol. 33, No.7, July 1988, pp. 640–649.

    Article  Google Scholar 

  11. C. van der Plas and J. P. M. G. Linnartz, ”Stability of mobile slotted ALOHA network with Rayleigh fading, shadowing and near-far effect”, IEEE Tr. Veh. Tech., Vol. 39, No. 4, November 1990, pp 359–366.

    Article  Google Scholar 

  12. J.L. Massey, ”Collision-resolution algorithms and random access communication in multi user communications”, New York, Springer-Verlag, 1981, pp. 73–137.

    Google Scholar 

  13. J.I. Capetanakis, ”Tree algorithms for packet broadcast channels”, IEEE Tr. I.T., Vol. IT-25, 1979, pp. 505–515.

    Google Scholar 

Download references

Author information

Author notes

  1. J. P. M. G. Linnartz

    Present address: Philips Natuurkundig Lab (Philips Research), mailstop WY 8.1, Holstlaan 4, 5656, AA Eindhoven, the Netherlands

Authors and Affiliations

  1. Institute for Information Transmission Problems, 19 Bol'shoi Karetnyi, 101447, GSP-4, Moscow, Russia

    N. D. Vvedenskaya

Authors
  1. N. D. Vvedenskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. P. M. G. Linnartz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Plattner

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Vvedenskaya, N.D., Linnartz, J.P.M.G. (1996). Single-frequency packet network using stack algorithm and multiple base stations. In: Plattner, B. (eds) Broadband Communications Networks, Services, Applications, Future Directions. IZS 1996. Lecture Notes in Computer Science, vol 1044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022234

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60895-0

  • Online ISBN: 978-3-540-49669-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation