A Dynamic Optimum Time Allocation Method in Partial Relay Systems 


Vol. 34,  No. 10, pp. 746-751, Oct.  2009


PDF
  Abstract

We propose a dynamic time allocation method in cooperative multiplexing with partial relaying system. This method uses a linear programming and considers protocol that is based on relaying of partial information bits followed by cooperative multiplexing. In this protocol, regardless of the location of relay, the allocation time for each transmission time slots are constant. Using a dynamic time allocation method with considering the location of relay, we can find optimal transmission time slots, and show that the system capacity is optimized.

  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]

J. Cho, Y. Kwon, N. Kim, J. Chung, "A Dynamic Optimum Time Allocation Method in Partial Relay Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 10, pp. 746-751, 2009. DOI: .

[ACM Style]

Jung-il Cho, Yang-soo Kwon, Nam-ri Kim, and Jae-hak Chung. 2009. A Dynamic Optimum Time Allocation Method in Partial Relay Systems. The Journal of Korean Institute of Communications and Information Sciences, 34, 10, (2009), 746-751. DOI: .

[KICS Style]

Jung-il Cho, Yang-soo Kwon, Nam-ri Kim, Jae-hak Chung, "A Dynamic Optimum Time Allocation Method in Partial Relay Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 34, no. 10, pp. 746-751, 10. 2009.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880