A reduced-power channel reuse scheme for wireless packet cellular networks
IEEE/ACM Transactions on Networking (TON)
Mobile communications
Introduction to 3G Mobile Communications
Introduction to 3G Mobile Communications
Wireless Personal Communications
Wireless Personal Communications
An Efficient Priority-Based Dynamic Channel Allocation Strategy for Mobile Cellular Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
Application of dynamic channel allocation strategies to the GSM cellular network
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Adaptive antenna array assisted dynamic channel allocation techniques
IEEE Journal on Selected Areas in Communications
Dynamic channel allocation techniques using adaptive modulation and adaptive antennas
IEEE Journal on Selected Areas in Communications
Partially overlapped channels not considered harmful
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Mobile computing: Opportunities for optimization research
Computer Communications
Hi-index | 0.00 |
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.