Kshirasagar Naik
ABSTRACT
A radio spectrum is a shared, limited, and expensive resource in cellular networks. A network allocates a channel from this spectrum to provide connectivity to a user. With the ever increasing number of users, it is a challenge and a business opportunity to support as many simultaneous users as possible. Hence, designing better channel assignment algorithms remains a topic of continued research interest. In this paper, we propose a new technique to reduce the failure rates of a class of dynamic channel assignment algorithms, namely, channel assignment without measurement (CAWM). The technique is in the form of assuming that all the base stations in a network are synchronized. By synchronized base stations, we mean the channels on different used carriers in all the cells have the same start time. This assumption allows a base station to acquire one channel when there is a need, rather than acquire all the channels on a carrier when there is a need for just one channel. This is expected to lead to better availability of channels in the entire network when there is a need, because channels are not held up without any use. By using this assumption, we have redesigned four dynamic channel assignment algorithms, namely, the Nanda-Goodman strategy, the Geometric strategy, the bidirectional channel locking (BDCL) strategy, and the two-step dynamic priority (TSDP) strategy. Simulation results confirm our initial expectation. There is significant improvement in the failure rates of the Nanda-Goodman and the TSDP strategies, whereas the Geometric and the BDCL strategies show significant improvements up to certain call arrival rates.
- 3gpp ts 25.331 (2000-12 version), rrc protocol specification (release 1999).Google Scholar
- Wcdma network deployments: Asynchronous vs. synchronous. In QUALCOMM CDMA Technologies, White Paper, 2001, http://www.cdmatech.com/resources/pdf/wcdma asynch wp 9-01.pdf.Google Scholar
- A. Baiocchi, N. P. Magnani, V. Palestini, and F. Sestini. Application of dynamic channel allocation strategies to the gsm cellular network. IEEE JSAC, Vol. 15, pages 1558--1567, Oct., 1997. Google ScholarDigital Library
- A. Baiocchi, F. D. Priscoli, F. Grilli, and F. Sestini. The geometric dynamic channel allocation as a practical strategy in mobile networks with bursty user mobility. IEEE Trans. on Vehicular Technology, Vol. 44, no. 1, pages 14--23, Feb., 1995.Google ScholarCross Ref
- R. Beck and H. Panzer. Strategies for handover and dynamic channel assignment allocation in micro-cellular mobile radio systems. Proceedings of the IEEE Vehicular Technology Conference, May, 1989.Google Scholar
- J. S. Blogh, P. J. Cherriman, and L. Hanzo. Adaptive antenna array assisted dynamic channel allocation techniques. IEEE Journal on Selected Areas in Communications, Vol. 19, No. 2, pages 305--311, Feb., 2001. Google ScholarDigital Library
- J. S. Blogh, P. J. Cherriman, and L. Hanzo. Dynamic channel alocation techniques using adaptive modulation and adaptive antennas. IEEE Journal on Selected Areas in Communications, Vol. 19, No. 2, pages 312--321, Feb., 2001. Google ScholarDigital Library
- S. T. Stanley Chia and W. C. Y. Lee. A synchronized radio system without stable clock sources. IEEE Personal Communications Magazine, April, 2001.Google Scholar
- J. Chuang and R. Sollenberger. Performance of autonomous dynamic channel assignment and power control for tdma/fdma wireless access. IEEE JSAC, Vol. 12, pages 1314--1323, Oct., 1994.Google ScholarCross Ref
- X. Dong and T. H. Lai. An efficient priority-based dynamic channel allocation strategy for mobile cellular networks. In IEEE INFOCOM'97, 1997. Google ScholarDigital Library
- S. M. Elnoubi, R. Singh, and S. C. Gupta. A new frequency channel assignment algorithm in high capacity mobile communication systems. IEEE Transactions on Vehicular Technology, vol. VT-31, no. 3, pages 125--131, August 1982.Google Scholar
- M. Frodigh. Performance bounds for power control supported dca algorithms in highway microcellular radio systems. IEEE Trans. on Vehicular Technology, Vol. 44, pages 238--243, May, 1995.Google ScholarCross Ref
- D. Goodman. Wireless Personal Communications Systems. Reading, MA: Addison-Wesley Publishing Co., 1997. Google ScholarDigital Library
- D. Grace, T. C. Tozer, and A. G. Burr. Reducing call dropping in distributed dynamic channel assignment algorithms by incorporating power control in wireless ad hoc networks. IEEE Journal on Selected Areas in Communications, Vol. 18, No. 11, pages 2417--2428, Nov., 2000. Google ScholarDigital Library
- R. Guerin. Queueing-blocking system with two arrival streams and guard channels. IEEE Trans. on Comm., Vol. 36, No. 2, pages 153--163, Feb., 1988.Google ScholarCross Ref
- I. Katzela and M. Naghshineh. Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey. IEEE Personal Communications, pages 10--31, June 1996. Google ScholarDigital Library
- J. Korhonen. Introduction to 3G Mobile Communications. Artech House, Inc., 2001. Google ScholarDigital Library
- W. K. Lai and G. G. Coghill. Channel assignment through evolutionary optimization. IEEE Trans. on Vehicular Technology, Vol. 45, No. 1, pages 91--95, Feb., 1996.Google ScholarCross Ref
- J. Li, N. B. Shroff, and E. K. P. Chong. A reduced-power channel reuse scheme for wireless packet cellular networks. IEEE Trans. on Networking, Vol. 7, No. 6, pages 818--832, Dec., 1999. Google ScholarDigital Library
- Y-B. Lin, S. Mohan, and A. Noerpel. Queueing priority channel assignment strategies for pcs hand-off and initial access. IEEE Trans. on Vehicular Tech., Vol. 43, No. 3, pages 704--712, August, 1994.Google ScholarCross Ref
- Y-B. Lin, A. R. Noerpel, and D. J. Harasty. The sub-rating channel assignment strategy for pcs hand-offs. IEEE Trans. on Vehicular Technology, Vol. 45, No. 1, pages 122--130, Feb., 1996.Google ScholarCross Ref
- V.H. MacDonald. The cellular concept. Bell syst. Tech. J., vol. 58, pages 15--41, Jan. 1979.Google Scholar
- K. Naik and D. S. L. Wei. Call-on-hold for improving the performance of dynamic channel assignment strategies in cellular networks. IEEE Transactions on Vehicular Technology, Vol. 53, No. 6, pages 1780--1793, Nov. 2004.Google ScholarCross Ref
- S. Nanda and D. Goodman. Dynamic resource acquisition: Distributed carrier allocation for tdma cellular systems. In Globecom'91, pages 883--889, 1991.Google ScholarCross Ref
- A. M. Safwat. On cac, dca, and scheduling in tdd multi-hop 4g wireless networks. In Proc. of IEEE Intl. Conference on Performance, Computing and Communications, pages 541--546, April, 2004.Google Scholar
- A. M. Safwat. Aca: Channel assignment in ad hoc, 4g and beyond wireless networks with directional antennas. In Proc. of IEEE Intl. Conference on Communications, pages 3143--3147, June, 2004.Google ScholarCross Ref
- J. Schiller. Mobile Communications (Chapter 4). Addison-Wesley, 2000. Google ScholarDigital Library
- J. Tajima and K. Imamura. A strategy for flexible channel assignment in mobile communication systems. IEEE Trans. on Vehicular Tech., Vol. 37, May, 1988.Google ScholarCross Ref
- C. Wheatley. Self-synchronizing a cdma cellular network. Micorwave Journal, May, 1999.Google Scholar
- J. Zander. Asymptotic bounds on the performance of a class of dynamic channel assignment algorithms. IEEE JSAC, Vol. 11, pages 926--933, 1993.Google ScholarCross Ref
- M. Zhang and T.-S. Yum. Comparisons of channel assignment strategies in cellular mobile telephone systems. IEEE Trans. on Vehicular Technology, Vol. 38, no. 4, pages 211--215, Nov., 1989.Google ScholarCross Ref
Index Terms
- Channel assignment in cellular networks with synchronous base stations
Recommendations
Utilizing the synchrony among base stations for better performance of channel assignment algorithms
A radio spectrum is a shared, limited, and expensive resource in cellular networks. A network allocates a channel from the spectrum to provide connectivity to a user. With the ever increasing number of users, it is a challenge and a business opportunity ...
Channel Assignment for Multihop Cellular Networks: Minimum Delay
Multihop cellular networks (MCNs) enhance the capacity and coverage and alleviate the dead-spot and hot-spot problems of cellular networks. They also allow faster and cheaper deployment of cellular networks. A fundamental issue of these networks is ...
A New Heuristic Channel Assignment in Cellular Networks
CSIE '09: Proceedings of the 2009 WRI World Congress on Computer Science and Information Engineering - Volume 07In this paper, the problem of assigning channels to calls in a cellular mobile communication by finding the minimum number of channels required to obtain an interference-free assignment, is considered. To speed up the results and getting interference ...
Comments