Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Optimal Soft-combine Zone Configuration in a Multicast CDMA Network

멀티캐스트 CDMA 네트워크에서의 Soft-combine을 지원할 기지국의 선정

  • Published : 2006.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper we deal with a cell planning issue arisen in a CDMA based multicast network. In a CDMA based wireless network, a terminal can significantly reduce the bit error rate via the cohesion of data streams from multiple base stations. In this case, multiple base stations have to be operated according to a common time line. The cells whose base stations are operated as such are called soft-combined cells. Therefore, a terminal can take advantage of error rate reduction, if the terminal is in a soft-combined cell and at least one neighboring cell is also soft-combined. However, as soft-combining operation gives heavy burden to the network controller, the limited number of cells can be soft-combined. Our problem us to find a limited number of soft-combined cells such that the benefit of the soft-combining operation is maximized.

Keywords

References

  1. 3GPP TR 25.803 S-CCPCH performance for MBMS, Sep. 2005
  2. 3GPP TS 22.146 Multimedia Broadcast/Multicast Service: Stagel , 3GPP, Mar. 2003
  3. Balakrishnan, A., T.L. Magnanti and R.T. Wong, 'A dual-ascent procedure for largescale uncapacitated network design,' Operations Research, Vol.37(1989), pp.716-740 https://doi.org/10.1287/opre.37.5.716
  4. Boni, A. et al., 'Multimedia Broadcast Multicast Service - Technology Overview and Service Aspects,' Fifth lEE International Conference on 3G Mobile Communication Technologies, 2004
  5. Broadcast-Multicast Service (BCMCS) Framework Draft Document, 3GPP2, 2003
  6. CDMA2000 High Rate Broadcast-Multicast Packet Data Air Interface Specification, 3GPP2 TSG-C SWG2.5, Aug. 2003
  7. Chudak, F., T. Roughgarden, and D.P. Williamson, 'Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation,' Mathematical Programming, Vol100(2004), pp.411-421 https://doi.org/10.1007/s10107-003-0479-2
  8. Erlenkotter, D., 'A dual based procedure for uncapacitated facility location,' Operations Research, Vol.26(1978), pp.992-1009 https://doi.org/10.1287/opre.26.6.992
  9. Fischetti, M., H. Hamacher, K. Jornsten, and F. Maffioli, 'Weighted k-Cardinality Trees:Complexity and Polyhedral Structure,' Networks, Vol.24(1994), pp.1l-21 https://doi.org/10.1002/net.3230240103
  10. Garey, M.R. and D.S. Johnson, Computers and intractability : a Guide to the theory of NP-completeness, W.H. Freeman, San Francisco, 1979
  11. Garg, N., 'A 3-Approximation for the Minirrn.nn Tree Spanning k Vertices,' Proceedings of the 37th Annual Symposium on Foundations of Computer Science, (1996), pp.302-309
  12. Holma, H. and A. Toskala, WCDMA for UMTS, Wiley, 2000
  13. Tatesh, S. and S.K. Palat, 'Future Evolution of 3G Networks,' International Conference on Information and Communication Technologies : From Theory to Applications, 2004
  14. Wang, J., R. Sinnarajah, T. Chen, Y. Wei, and E. Tiedemann, 'Broadcast and Multicast Services in cdma 2000,' IEEE communications magazine, 2004
  15. Wong, R.T., 'A dual ascent approach for Steiner tree problems on a directed graph,' Mathematical Programming, Vol.28(1984), pp.271-287 https://doi.org/10.1007/BF02612335