Prioritized channel borrowing without locking: a channel sharing strategy for cellular communications

Jiang, Hua; Rappaport, S.S.

doi:10.1109/90.490744

Cited by 33 publications

(22 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Most of the existing DCS strategies [4], [5], [9], [12]- [14], [18], [22] need up-to-date information to calculate channel priority. This can be easily implemented in centralized algorithms, since the MSC monitors every release and acquisition of channels, and hence it has the up-to-date information.…”

Section: B the Complete Channel Allocation Algorithmmentioning

confidence: 99%

Distributed fault-tolerant channel allocation for cellular networks

Cao

Singhal

2000

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

Abstract-A channel allocation algorithm includes a channel acquisition algorithm and a channel selection algorithm. Most of the previous work concentrates on the channel selection algorithm since early channel acquisition algorithms are centralized and rely on a mobile switching center (MSC) to accomplish channel acquisition. Recently, distributed channel acquisition algorithms have received considerable attention due to their high reliability and scalability. However, in these algorithms, a borrower needs to consult with its interference neighbors in order to borrow a channel. Thus, the borrower fails to borrow channels when it cannot communicate with any interference neighbor. In real-life networks, under heavy traffic load, a cell has a large probability to experience an intermittent network congestion or even a communication link failure. In existing distributed algorithms, since a cell has to consult with a large number of interference neighbors to borrow a channel, the failure rate will be much higher under heavy traffic load. Therefore, previous distributed channel allocation algorithms are not suitable for real-life networks. In this paper, we first propose a fault-tolerant channel acquisition algorithm which tolerates communication link failures and node (MH or MSS) failures. Then, we present a channel selection algorithm and integrate it into the distributed acquisition algorithm. Detailed simulation experiments are carried out in order to evaluate our proposed methodology. Simulation results show that our algorithm significantly reduces the failure rate under network congestion, communication link failures, and node failures compared to nonfault-tolerant channel allocation algorithms. Moreover, our algorithm has low message overhead compared to known distributed channel allocation algorithms, and outperforms them in terms of failure rate under uniform as well as nonuniform traffic distribution.

show abstract

Section: B the Complete Channel Allocation Algorithmmentioning

confidence: 99%

Distributed fault-tolerant channel allocation for cellular networks

Cao

Singhal

2000

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

show abstract

“…In CBWL the complexity o f base stations is less. Without channel locking and directional lending, channel reuse distance can always be kept at a desired minimu m. Thus, the CBW L scheme g ives better performance under light as well as heavy communications traffic loads [56][57][58].…”

Section: Channel-borr Owing Wi Thout Locking (Cbwl) [56-58]mentioning

confidence: 99%

“…This limitation arises because a channel can be borrowed by a cell only when it is idle in all of the cells within the required channel reuse distance of the borrowing cell. Another disadvantage of channel locking is the difficulty in maintaining co-channel reuse distance at the minimu m required value everywhere in the system [56][57].…”

Section: Channel-borr Owing With Locking (Cbwl)[56-57]mentioning

confidence: 99%

“…In this scheme the co-channel interference wh ich occurs due to channel borrowing is eliminated by co-channel locking. In HCA, channel locking is used to prevent the increase in co-channel interference [56][57]. If a channel is locked then, cells within the required min imu m channel reuse distance fro m a cell that borrows this channel cannot use the same channel.…”

Section: Channel-borr Owing With Locking (Cbwl)[56-57]mentioning

confidence: 99%

“…Power control technique works by reducing the power transmission on borrowed channels, hence removing the need for locking co-channels of the borrowed channel. CBW L scheme uses the borrowed channel under less power [56][57][58]. CBW L uses a power limitat ion to control interference generated by use of borrowed channels.…”

Section: Channel-borr Owing Wi Thout Locking (Cbwl) [56-58]mentioning

confidence: 99%

See 2 more Smart Citations

Survey of Channel Allocation Algorithms Research for Cellular Systems

Mishra¹,

Saxena²

2012

IJNC

View full text Add to dashboard Cite

In recent years, we have witnessed a huge interest in the study of channel allocation and handoff strategies for cellu lar systems to ensure continuous services that guarantee QoS to mobile users. In this paper, we have a detailed d iscussion of different categories of wireless channel allocation schemes. The basic purpose of the study is to provide a comprehensive review of d ifferent categories of channel allocation algorith ms in cellu lar systems and to recommend future direct ions of research in the area. The paper g ives a survey of published papers for discussing channel allocation schemes for cellular system. The QoS is always a major concern fo r the services offered through cellular systems and it is observed that there are always trade-offs among various parameters of the QoS of these services. There are many published papers which have taken care of d ifferent QoS parameters such as call b locking probability, call dropping probability along with other performance parameters. This paper provides details of the d ifferent categories of channel allocation schemes including static channel allocation, dynamic channel allocation and hybrid channel allocation studied in literature. A lso in this paper, we explore the different channel allocation strategies, including the scenarios in which channel allocation strategies based on centralized channel control, distributed channel control, mutual exclusion algorith ms and genetic algorith ms, are used. Also, we have summarizes trade-offs between different channel allocation schemes in terms of their co mplexity and performance. In this paper, channel allocation in different context of co mple x situations such as the ones arising in offering mu ltimed ia based services and other arising in the channel allocation for mobile base station systems and use of power management in channel allocation are exp lained. This paper also examines different handoff handling provision and prioritizat ion schemes proposed in the literature for cellu lar systems.

show abstract

An Adaptive Distributed Channel Allocation Strategy for Mobile Cellular Networks

Singhal¹

2000

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Prioritized channel borrowing without locking: a channel sharing strategy for cellular communications

Cited by 33 publications

References 16 publications

Distributed fault-tolerant channel allocation for cellular networks

Distributed fault-tolerant channel allocation for cellular networks

Survey of Channel Allocation Algorithms Research for Cellular Systems

An Adaptive Distributed Channel Allocation Strategy for Mobile Cellular Networks

Contact Info

Product

Resources

About