| 摘要(英) |
The use of OVSF codes in the WCDMA system can provide variable data rates to flexibly
support applications with different bandwidth requirements. However, there are some
constraints when using the OVSF codes, such as code blocking and exponentially quantized
data rates. Code blocking, which is defined as the condition that a new call is rejected even
though the system has enough bandwidth, induces external fragmentation of an OVSF code
tree. Exponentially quantized data rates, resulting from the exponentially decreased spreading
factors, induces internal fragmentations for requests. Both external and internal fragmentations
waste the precious wireless bandwidth. In this dissertation, the effects of these
constraints are investigated and several strategies are provided to eliminate such limitations.
Two important issues on such an environment are the code assignment problem and code
reassignment problem. The former may have significant impact on code utilization and thus
code blocking probability, while the latter may affect the code reassignment cost if dynamic
code assignment is to be conducted. The general objective is to make the OVSF code tree
as compact as possible so as to support more new calls by incurring less blocking probability
and less reassignment costs. Earlier studies about these two problems either do not
consider the structure of the OVSF code tree or cannot utilize the OVSF codes efficiently.
Two code assignment and reassignment strategies, leftmost and crowded-first, are proposed
in this dissertation to solve these problems. Simulation results show that the crowded-first
scheme increases the OVSF code tree utilization significantly.
To reduce internal fragmentation, it is suggested to use multiple codes to support a call.We show how using multiple codes can reduce internal fragmentation of a OVSF code tree.
The tradeoff between bandwidth utilization and hardware complexity of a multi-code system
is analyzed. The result shows that using 2 or 3 codes will be quite cost-effective. Several
multi-code assignment and reassignement strategies, namely random, leftmost, crowded-
first-space, and crowded-first-code, are also proposed based on such environment.
In order to further increase the bandwidth utilization, strategies that utilize time-shared
OVSF codes are proposed to enhance statistical multiplexing. In particular, we propose to
allow a user to simultaneously use multiple OVSF codes in a time-sharing manner, which
we call a multi-code, shared model. Using multiple codes allows us to compensate those
users suffering from communication interferences or even errors. The proposed schemes
can tolerate a multi-state link condition (compared to the typically assumed two-state, or
good-or-bad, link condition) by adjusting the spreading factors of OVSF codes. Through
theoretical analyses and computer simulations, the proposed strategies are verified to be
efficient and cost-effective. It is expected that the capacity of WCDMA systems can be
effectively utilized when the strategies proposed in this dissertation are applied. |
| 參考文獻 |
[1] Third Generation Partnership Project; Technical Specification Group Radio Access
Network. Spreading and Modulation (FDD), http://www.3gpp.org, 1999.
[2] F. Adachi, MSawahashi, and K. Okawa. ”Tree-structured Generation of Orthogonal
Spreading Codes with Different Lengths for Forward Link of DS-CDMA Mobile Radio”.
Electron. Lett., 33:27–28, Jan., 1997.
[3] F. Adachi, M. Sawahashi, and H. Suda. ”Wideband DS-CDMA for Next-Generation
Mobile Communications Systems”. IEEE Commun. Mag., 36:56–69, Sept., 1998.
[4] R. Assarut, K. Kawanishi, U. Yamamoto, Y. Onozato, and Masahiko. ”Region Division
Assignment of Orthogonal Variable-Spreading-Factor Codes inW-CDMA”. IEEE VTC
2001 Fall, pages 1884–1888, 2001.
[5] A. Baier, U.-C. Fiebig, W. Granzow, W. Koch, P. Teder, and J. Thielecke. ”Design
Study for a CDMA-Based Third-Generation Mobile Radio System”. IEEE Journal on
Selected Areas in Communications, 12(4):733–743, May, 1994.
[6] Y. Cao and V. O. Li. ”Scheduling Algorithms in Broad-Band Wireless Networks”.
Proceedings of the IEEE INFOCOM, 89(1):76–87, Jan, 2001.
[7] C.-M. Chao, Y.-C. Tseng, and L.-C. Wang. ”Reducing Internal and External Fragmentations
of OVSF Codes in WCDMA Systems With Multiple Codes”. IEEE WCNC,
pages 693–698, 2003.
[8] W.-T. Chen, Y.-P. Wu, and H.-C. Hsiao. ”A Novel Code Assignment Scheme for WCDMA
Systems”. IEEE VTC 2001 Fall, pages 1182–1186, 2001.
[9] R.-G. Cheng. ”A Code Managemant Mechanism for WCDMA Mobile Communication
Networks”, June, 1999. International Workshop on Mobile Communications.
[10] R.-G. Cheng and P. Lin. ”OVSF Code Channel Assignment for IMT-2000”. IEEE VTC
2000 Spring, 3:2188–2192, May, 2000.
[11] E. Dahlman, B. Gudmundson, M. Nilsson, and J. Skold. ”UMTS/IMT-2000 Based on
Wideband CDMA”. IEEE Commun. Mag., 36:70–80, Sept., 1998.
[12] E. Dahlman and K. Jamal. ”Wide-Band Services in a DS-CDMA Based FPLMTS
System”. IEEE VTC 1996, pages 1656–1660, 1996.
[13] D. Eckhardt and P. Steenkiste. ”Effort-Limited Fair (ELF) Scheduling for Wireless
Networks”. IEEE INFOCOM, pages 1097–1106, 2000.
[14] ETSI TS 125 301. Universal Mobile Telecommunications Systems (UMTS): Radio
Interface Protocol Architecture (3GPP TS 25.301 version 5.1.0 Release 5). June, 2002.
[15] R. Fantacci and S. Nannicini. ”Multiple Access Protocol for Integration of Variable
Bit Rate Multimedia Traffic in UMTS/IMT-2000 Based on Wideband CDMA”. IEEE
Journal on Selected Areas in Communications, 18(8):1441–1454, Aug., 2000.
[16] V. K. Garg. IS-95 CDMA and CDMA2000. N.J.: Prentice Hall, 2000.
[17] J. Gomez, A. T. Campbell, and H. Morikawa. ”The Havana Framework for Supporting
Application and Channel Dependent QoS in Wireless Networks”. ICNP, pages 235–
244, 1999.
[18] O. Gurbuz and H. Owen. ”Dynamic Resource Scheduling for Variable QoS Traffic in
W-CDMA”. Proceedings of the IEEE ICC’99, 2:703–707, June, 1999.
[19] H. Holma and A. Toskala. WCDMA for UMTS. John Wiley & Sons, 2000.
[20] C. L. I and D. Gitlin. ”Multi-code CDMA Wireless Personal Communications Networks”.
Proceedings ICC’95, pages 1060–1064, June 1995.
[21] C.-L. I et al. ”IS-95 Enhancements for Multimedia Services”. Bell Labs. Tech. J., pages
60–87, Autumn, 1996.
[22] J. G. Proakis. Digital Communications. Boston: McGraw-Hill, forth ed., 2001.
[23] M. S. K. Ohno and F. Adachi. ”Wideband Coherent DS-CDMA”. IEEE VTC 1995,
pages 779–783, 1995.
[24] A. Z. Kam, T. Minn, and K.-Y. Siu. ”Supporting Rate Guarantee and Fair Access
for Bursty Data in W-CDMA”. IEEE Journal on Selected Areas in Communications,
19(12):2121–2130, Nov., 2001.
[25] D. Kandlur, K. Shin, and D. Ferrari. ”Real-Time Communication in Multi-Hop Networks”.
ACM SIGCOMM, pages 300–307, 1991.
[26] C.-L. Liu. Introduction to Combinatorial Mathematics. New York: McGraw-Hill,
McGraw-Hill, 1968.
[27] S. Lu and V. Bharghavan. ”Fair Scheduling in Wireless Packet Networks”. IEEE/ACM
Trans. Networking, 7(4):473–489, 1999.
[28] T. Minn and K.-Y. Siu. ”Dynamic Assignment of Orthogonal Variable-Spreading-
Factor Codes in W-CDMA”. IEEE Journal on Selected Areas in Communications,
18(8):1429–1440, Aug., 2000.
[29] T. S. E. Ng, I. Stoica, and H. Zhang. ”Packet Fair Queueing Algorithms for Wireless
Netowrks with Location-Dependent Errors”. INFOCOM, pages 1103–1111, 1998.
[30] K. Pahlavan and A. H. Levesque. Wireless Information Networks. New York: John
Wiley and Sons, 1995.
[31] A. Parekh and R. G. Gallager. ”A Generalized Processor Sharing Approach to Flow
Control in Integrated Services Netowrks: The Single-Node Case”. IEEE/ACM Trans.
Networking, 1:334–357, 1993.
[32] J. G. Proakis. Digital Communications. McGraw-Hill, 1995.
[33] P. Ramanathan and P. Agrawal. ”Adapting Packet Fair Queueing Algorithms to Wireless
Netowrks”. ACM/IEEE MOBICOM, pages 1–9, 1998.
[34] F. Shueh, Z.-E. P. Liu, and W.-S. E. Chen. ”A Fair, Efficient, and Exchangeable Channelization
Code Assignment Scheme for IMT-2000”. IEEE ICPWC 2000, pages 429–
433.
[35] T. S. Rappaport. Wireless Communications: Principles and Practice. N.J.: Prentice
Hall, 1996.
[36] A. S. Tanenbaum. Modern Operating Systems. N.J.: Prentice Hall, 1992.
[37] Y.-C. Tseng and C.-M. Chao. ”Code Placement and Replacement Strategies for Wideband
CDMA OVSF Code Tree Management”. IEEE Trans. on Mobile Computing,
1(4):293–302, Oct.-Dec. 2002.
[38] A. J. Viterbi. CDMA Principles of Spread Spectrum Communications. Addision-
Wesley, 1995.
[39] J. Wang, M. A. Elicin, and J. C. L. Liu. ”Multimedia Support for Wireless W-CDMA
with Dynamic Spreading”. Wireless Network, 8:355–370, July, 2002.
[40] L. Xu, X. Shen, and J.W. Mark. ”Dynamic Bandwidth Allocation with Fair Scheduling
for WCDMA Systems”. IEEE Wireless Communications, 9(2):26–32, April, 2002.
[41] Y. Yang and T.-S. P. Yum. ”Nonrearrangeable Compact Assignment of Orthogonal
Variable-Spreading-Factor Codes for Multi-Rate Traffic”. IEEE VTC 2001 Fall, pages
938–942, 2001.
[42] L. Zhang. ”Virtual Clock: A New Traffic Control Algorithm for Packet Switching
Netowrks”. ACM SIGCOMM, pages 19–29, 1990. |
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit