Skip to main content
SpringerLink
Log in

A Multiple Access Scheme Using Split and Merge Algorithm for Contention/Reservation-Based Wireless MAC Protocols

  • Conference paper
Advanced Parallel Processing Technologies (APPT 2003)

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

Included in the following conference series:

  • 533 Accesses

Abstract

Split Algorithm (SA) is one of the most prominent collision resolution algorithms that have been proposed recently. Our Split and Merge Algorithm (SMA) moderates the number of colliding packets that should be resolved adaptively to the traffic load to enhance the performance of SA. The predicted results indicate that the SMA offers a better performance than the SA. The analytical results are compared with simulated data and good agreement is reported.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Petras, D., Krämling: Fast Collision Resolution in Wireless ATM Networks. In: 2nd MATHOD (1997)

    Google Scholar 

  2. Verikoukis, C.V., Olmos, J.J.: Up-link performance of the DQRUMA MAC protocol in a realistic indoor environment for W-ATM networks. Communications and Vehicular Technology 4, 1650–1655 (2000)

    Google Scholar 

  3. Karaoguz, J.: High-Rate Wireless Personal Area Networks. IEEE Communications Magazine 39(12), 96–102 (2001)

    Article  Google Scholar 

  4. Flikkema, P.G.: On multiple access and capacity in frequency-selective channels. In: Proceedings. International Conference on Information Technology: Coding and Computing, pp. 178–182 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Kyungpook National University,  

    Min-Su Kim & Ki-Jun Han

  2. School of Computer and Electronic Engineering, Gyeongju University,  

    Tae-Young Byun

Authors
  1. Min-Su Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tae-Young Byun
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ki-Jun Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. PDL, National University of Defense Technology, 410073, Changsha, China

    Xingming Zhou

  2. Department of Network Engineering, School of Computer Science, National University of Defense Technology, 410073, Changsha, China

    Ming Xu

  3. Fraunhofer FIRST, Kekuléstr. 7, D-12489, Berlin, Germany

    Stefan Jähnichen

  4. Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong, China

    Jiannong Cao

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, MS., Byun, TY., Han, KJ. (2003). A Multiple Access Scheme Using Split and Merge Algorithm for Contention/Reservation-Based Wireless MAC Protocols. In: Zhou, X., Xu, M., Jähnichen, S., Cao, J. (eds) Advanced Parallel Processing Technologies. APPT 2003. Lecture Notes in Computer Science, vol 2834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39425-9_59

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39425-9_59

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20054-3

  • Online ISBN: 978-3-540-39425-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation