Repacking on demand for speed-sensitive channel assignment

  • Authors:
  • Hsien-Ming Tsai;Ai-Chun Pang;Yung-Chun Lin;Yi-Bing Lin

  • Affiliations:
  • Quanta Research Institute, Quanta Computer Inc., No. 4, Wen Ming 1 St., Kuei Shan Hsiang, Tao Yuan Shien, Taiwan;Graduate Institute of Networking and Multimedia, Department of Computer Science and Information Engineering, National Taiwan University, No. 1, Sec. 4, Roosevelt Rd., Taipei, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, 1001 Ta Hsueh Rd., Hsinchu, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, 1001 Ta Hsueh Rd., Hsinchu, Taiwan and Providence University, Chung-chi Rd., Shalu Taichung, Taiwan

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.