Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey

Katzela, I.; Naghshineh, M.

doi:10.1109/98.511762

Cited by 1,011 publications

(158 citation statements)

References 64 publications

Supporting

Mentioning

153

Contrasting

Unclassified

Order By: Relevance

“…Figure 8 shows the P b for the seven-cell cMCN with different (N 0 , N 1 ). The performance of cMCN with (10,10) has the same P b compared to the SCN, where the cell has the same coverage area as the macrocell, with ten channels. This is expected because in the cMCN, every multihop call in the surrounding six virtual microcells will require one channel from the central microcell to access to the BS.…”

Section: Numerical Results and Discussionmentioning

confidence: 79%

See 1 more Smart Citation

Performance analysis of multihop cellular network with fixed channel assignment

Chong

2008

Wireless Netw

View full text Add to dashboard Cite

Multihop cellular network (MCN) has been proposed to incorporate the flexibility of ad hoc networks into traditional single-hop cellular networks (SCNs). The performance analysis of MCN through analytical models is not trivial because the classic Erlang B formula no longer applies to MCN where multihop transmission is allowed. In this paper, we first propose a clustered MCN (cMCN) architecture with the use of dedicated information ports (DIPs), which are deployed wireless ports functioning as central controllers for multihop users. The proposed cMCN can be considered as a complement of the existing cellular network. Then, we study the feasibility of modeling time division multiple access (TDMA)-based cMCN with fixed channel assignment (FCA) scheme for uplink transmission. An exact multi-dimensional Markov chain model to analyze the performance of cMCN with FCA is developed. Furthermore, an approximated model which results in reduced complexity is also presented. The analytical results from both models are matched with the simulation results closely. The results show that cMCN with the proposed FCA scheme can reduce the call blocking probability significantly as compared to SCNs with either the conventional FCA or a dynamic channel assignment (DCA) scheme.

show abstract

Section: Numerical Results and Discussionmentioning

confidence: 79%

“…For cellular networks, fixed channel assignment (FCA) and dynamic channel assignment (DCA) are the two fundamental channel assignment schemes [10,11]. For ad hoc networks, there are also two basic channel assignment schemes, namely static channel assignment and dynamic channel assignment [12].…”

Section: Introductionmentioning

confidence: 99%

Performance analysis of multihop cellular network with fixed channel assignment

Chong

2008

Wireless Netw

View full text Add to dashboard Cite

show abstract

“…Graph coloring for channel allocation has been investigated extensively in cellular networks, where each base-station is to be allocated with a non-interfering channel [20] with respect to its neighboring base-stations. Graph coloring is known to be an N P complete problem [7].…”

Section: Graph-theoretic Techniques For Spectrum Allocationmentioning

confidence: 99%

Allocation of Opportunistic Spectrum in Cognitive Radio Ad Hoc Networks

Rao

Prasad

Yadati

et al. 2010

2010 7th IEEE Consumer Communications and Networking Conference

View full text Add to dashboard Cite

Cognitive Radios (CRs) address the problems of spectrum scarcity and under-utilization of the spectrum. However, realizing a CR network is neither easy nor straight-forward. The link layer in CR Ad hoc Networks is responsible for allocating suitable channels, out of the currently available channels. It is also responsible for setting up communication between nodes. Further, the spectrum efficiency should be maximized in a fair way.The problem of spectrum allocation can be modeled as a graph-theoretic problem. The selection of channels amongst the CR nodes in the network is an N P class problem. We prove this is, in fact, an N P complete problem. We propose a time-slotted system. In such a system, the schedule length needs to be kept to a minimum for higher spectrum utilization. We analyze the problem to determine conditions for an optimal allocation. We use edge coloring as a tool to analyze and propose heuristics. In ad hoc networks, distributed solutions are preferred due to the lack of infrastructure. We propose two distributed algorithms: (i) clique based, and (ii) localized heuristic algorithms. We compare the results of these heuristics with the algorithm proposed in literature. We also find the worst case bounds for these algorithms.For efficiency purposes, it is required to have a constant number of slots per frame. In such cases, producing a valid schedule is not enough since unfairness of allocation will eventually arise. To address this issue, we modify the edge coloring and clique based heuristics to produce valid fair schedules.Finally, we briefly consider the advantages of having a joint spectrum sensing-allocation scheme at the link layer. When the spectrum sensing scheme at the PHY layer is not completely reliable, a link layer scheme can help in reducing the false alarms and missdetections. We, further constrain the system by limiting the number of channels that can be sensed within a frame. We present the spectrum utilization with this joint sensingallocation policy.

show abstract

“…After locating the pool of spectrum holes, these are shared among CR users. In [10], spectrum allocation algorithm is described based on the call request control mechanism. The probability of call blocking is reduced significantly because of the call request control mechanism.…”

Section: Related Studymentioning

confidence: 99%

Fair, efficient, and power-optimized spectrum sharing scheme for cognitive radio networks

Aslam

Lee

2011

J Wireless Com Network

View full text Add to dashboard Cite

The cognitive radio network (CRN) is a promising solution to the problem of spectrum scarcity. To achieve efficient spectrum utilization, cognitive radio requires a robust spectrum sensing and spectrum sharing scheme. Therefore, spectrum sharing scheme plays a key role in achieving the optimal utilization of the available spectrum. The spectrum sharing in CRN is more challenging than traditional wireless network. The main factors besides throughput and fairness which need to be addressed in spectrum sharing of CRN are primary user (PU) activity, transmission power, and variations in the radio environment. In this article, we propose fair, efficient, and poweroptimized (FEPO) spectrum sharing scheme that will incorporate all critical factors mentioned above to maximize the spectrum utilization. Simulation results show that FEPO scheme outperforms in terms of transmission power by reducing the number of retransmissions and guarantees required level of throughput and fairness. Moreover, periodic monitoring helps to reduce the number of collisions with PUs.

show abstract

Channel assignment schemes for cellular mobile telecommunication systems: a comprehensive survey

Cited by 1,011 publications

References 64 publications

Performance analysis of multihop cellular network with fixed channel assignment

Performance analysis of multihop cellular network with fixed channel assignment

Allocation of Opportunistic Spectrum in Cognitive Radio Ad Hoc Networks

Fair, efficient, and power-optimized spectrum sharing scheme for cognitive radio networks

Contact Info

Product

Resources

About