A Multiple Access Scheme Using Split and Merge Algorithm for Centralized Wireless MAC Protocols 


Vol. 31,  No. 8, pp. 757-763, Aug.  2006


PDF
  Abstract

In this paper, a novel multiple access scheme using SMA(Split and Merge Algorithm) is proposed to reduce the accessdelay of wireless MAC protocols. The key idea of the SMA is to dynamically split and merge the contending terminals depending on their traffic loads for effective control of access to the channels. The SMA divides the collided terminals into several sub-groups if a collision occurs and merges the idle terminals of the split sub-groups into their original group. The merge algorithm can be used to resolve collision and split operation can be used to dynamic group management. The simulation results indicate that our algorithm may provide a higher throughput and a lower collision rate than the existing algorithms, especially under heavy traffic loads.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Kim and T. Byun, "A Multiple Access Scheme Using Split and Merge Algorithm for Centralized Wireless MAC Protocols," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 8, pp. 757-763, 2006. DOI: .

[ACM Style]

Min-su Kim and Tae-young Byun. 2006. A Multiple Access Scheme Using Split and Merge Algorithm for Centralized Wireless MAC Protocols. The Journal of Korean Institute of Communications and Information Sciences, 31, 8, (2006), 757-763. DOI: .

[KICS Style]

Min-su Kim and Tae-young Byun, "A Multiple Access Scheme Using Split and Merge Algorithm for Centralized Wireless MAC Protocols," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 8, pp. 757-763, 8. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880