doi:10.1016/j.comnet.2004.07.017 
Copyright © 2004 Elsevier B.V. All rights reserved.
Repacking on demand for speed-sensitive channel assignment
aQuanta Research Institute, Quanta Computer Inc., No. 4, Wen Ming 1 St., Kuei Shan Hsiang, Tao Yuan Shien, Taiwan
bGraduate Institute of Networking and Multimedia, Department of Computer Science and Information Engineering, National Taiwan University, No. 1, Sec. 4, Roosevelt Rd., Taipei, Taiwan
cDepartment of Computer Science and Information Engineering, National Chiao Tung University, 1001 Ta Hsueh Rd., Hsinchu, Taiwan
dProvidence University, Chung-chi Rd., Shalu Taichung, Taiwan
Received 17 December 2003;
revised 27 July 2004;
accepted 27 July 2004.
Responsible Editor: E. Chong.
Available online 14 October 2004.
References and further reading may be available for this article. To view references and further reading you must
purchase this article.
Abstract
In mobile telecommunications networks, radio channels are limited resources that should be carefully allocated. To increase network capacity, channel assignment can be exercised in a hierarchical cellular network (HCN). By considering the speeds of MSs, we propose an HCN channel assignment approach called repacking on demand (RoD). A simulation model is developed to investigate the performance of RoD and some previously proposed approaches for HCN. Our study quantitatively shows that RoD significantly outperforms the previous proposed approaches.
Keywords: Channel assignment; Channel repacking; Hierarchical cellular network; Repacking on demand
Fig. 1. Hierarchical cellular network architecture with two macrocells.
Fig. 2. No repacking for slow MSs.
Fig. 3. No repacking for fast MSs.
Fig. 4. Channel repacking procedures for AR (a) M-to-m repacking procedure for AR (b) m-to-M repacking procedure for AR.
Fig. 5. RoD I: RoD for slow MSs.
Fig. 6. RoD II: RoD for fast MSs.
Fig. 7. Hierarchical cellular network with wrapped mesh configuration.
Fig. 9. Effects of macrocell channel number C on (a) force-termination probability Pff of fast calls, (b) new call blocking probability Pb, (c) force-termination probability Pf and (d) incomplete probability Pnc.
Fig. 10. Effects of the macrocell channel number C on (a) expected number Hmm of microcell to microcell handoffs, (b) expected number HmM of microcell to macrocell handoffs, (c) expected number HR of repackings and (d) expected number H of handoffs.
Fig. 11. Effects of the proportion f of fast MSs on incomplete probability Pnc.
Fig. 12. Effects of MS mobility on incomplete probability Pnc.
Fig. 13. Effects of the arrival rate λ on incomplete probability Pnc.
Fig. 14. Effects of the variance Vc for the call holding times on (a) incomplete probability Pnc and (b) expected number H of handoffs.
Fig. 15. Effects of variance Vm,s for microcell residence times on (a) incomplete probability Pnc and (b) expected number H of handoffs.
Fig. 16. Simulation flow chart for RoD-R.
Fig. 17. Flow chart of algorithm A.
Table 1.
Notation
Abstract
Purchase PDF (1364 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (1)
Purchase PDF (302 K)
