• 정보처리학회논문지C
• /
• 제11C권2호
• /
• pp.203-212
• /
• 2004

최근 이동통신 네트워크에서 채널의 수요는 폭발적으로 증가하고 있다. 그렇지만 수요에 맞는 충분한 채널을 제공하기는 힘든 것이 현실이다. 이러한 수요를 충족시키기 위하여는 채널들을 간섭 현상이 없도록 재사용 함으로써 효율적으로 이용할 수 있도록 각 셀의 수요에 맞게 최적으로 할당하는 것이 요구된다. 본 논문의 목적은 이동통신 서비스 지역에 따라 채널 수요에 대한 변화가 불확실하고, 시간에 따라 변화가 심한 이동통신 네트워크에서 각 셀이 채널을 필요로 할 때 필요한 채널 수만큼을 동적으로 빠른 시간에 최적 할당하는 것이다. 이 목적을 달성하기 위하여 휴리스틱 알고리즘(Heuristic Algerian)을 사용하여 채널간의 간섭 정도를 최소화하는 동적 채널 할당방법을 개발하였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.321-333
• /
• 2005

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. As demand for services has expanded in the cellular segment, sever innovations have been made in order to increase the utilization of bandwidth. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. Hierarchical network design holds the public eye because of increasing demand and quality of service to mobile users. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. In addition, we know the avenue and demand as an assumption. We propose the network about the profit maximization. This study can apply to GSM(Global System for Mobile Communication) which has 70% portion in the world. Hierarchical network design using GA(Genetic Algorithm) is the first three-tier (Macro, Micro, Pico) model, We increase the reality through applying to EMC (Electromagnetic Compatibility Constraints). Computational experiments on 72 problem instances which have 15${\sim}$40 candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers more than 90% of the demand.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권4호
• /
• pp.1535-1554
• /
• 2016

This paper proposes a novel channel assignment scheme called multi-cluster based dynamic channel assignment (MC-DCA) to improve system performance for the downlink of dense femtocell networks (DFNs) based on orthogonal frequency division multiple access (OFDMA) and frequency division duplexing (FDD). In order to dynamically assign channels for femtocell access points (FAPs), the MC-DCA scheme uses a heuristic method that consists of two steps: one is a multiple cluster assignment step to group FAPs using graph coloring algorithm with some extensions, while the other is a dynamic subchannel assignment step to allocate subchannels for maximizing the system capacity. Through simulations, we first find optimum parameters of the multiple FAP clustering to maximize the system capacity and then evaluate system performance in terms of the mean FAP capacity, unsatisfied femtocell user equipment (FUE) probability, and mean FAP power consumption for data transmission based on a given FUE traffic load. As a result, the MC-DCA scheme outperforms other schemes in two different DFN environments for commercial and office buildings.

• 대한전자공학회논문지
• /
• 제26권3호
• /
• pp.1-7
• /
• 1989

본 논문에서는 대용량 셀룰러 이동통신 시스템에 있어 새로운 채널할당 알고리듬을 제안하였다. 새로 제안된 채널할당 알고리듬은, 고정배치된 채널이 모두 사용중인 Cell에 요구된 Call의 서비스를, Idle한 채널이 있는 인접 Cell에서 대행하도록 하였으며, 채널의 순서적인 할당, 채널의 재할당 및 지향성 안테나의 사용등의 기법을 이용하였다. 49개의 Cell로 구성된 시스템에 본 알고리듬을 Simulation 한 결과 고정채널 할당방식에 비해 18~38%의 높은 채널이용율을 나타내었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1884-1903
• /
• 2019

Device-to-Device (D2D) communications can provide proximity based services in the future 5G cellular networks. It allows short range communication in a limited area with the advantages of power saving, high data rate and traffic offloading. However, D2D communications may reuse the licensed channels with cellular communications and potentially result in critical interferences to nearby devices. To control the interference and improve network throughput in overlaid D2D cellular networks, a novel channel assignment approach is proposed in this paper. First, we characterize the performance of devices by using Poisson point process model. Then, we convert the throughput maximization problem into an optimal spectrum allocation problem with signal to interference plus noise ratio constraints and solve it, i.e., assigning appropriate fractions of channels to cellular communications and D2D communications. In order to mitigate the interferences between D2D devices, a cluster-based multi-channel assignment algorithm is proposed. The algorithm first cluster D2D communications into clusters to reduce the problem scale. After that, a multi-channel assignment algorithm is proposed to mitigate critical interferences among nearby devices for each D2D cluster individually. The simulation analysis conforms that the proposed algorithm can greatly increase system throughput.

• 전자공학회논문지B
• /
• 제30B권10호
• /
• pp.86-94
• /
• 1993

This paper presents the two-stage neural network method for efficient channel assignment of cellular mobile radio network. The first stage decomposes the region into non-adjacent groups of cells and the second stage assigns channels to the decomposed groups. The neural network model is tested with an experimental system of eighteen channels dedicated for nineteen hexagonal-cell region. When radom call requests of average density of 2 Erl/Cell to 8 Erl/Cell are presented, the real-time channel assignment method reduces the call-blocking rate up to 16% against the existing SCA(Static Channel Assignment) method.

• 디지털산업정보학회논문지
• /
• 제6권3호
• /
• pp.103-109
• /
• 2010

Total performance is improved by minimizing the channel interference between links in wireless mesh networks (WMNs). The paper refines on the CB-CA [1] to be suitable for multi-radio multi-channel (MRMC) WMNs. The CB-CA is the cluster-based channel assignment algorithm for one radio three channel WMN based on IEEE 802.11b/g. The CB-CA does not perform the channel scanning and the channel switching between the cluster heads (CHs) and the edge gateway nodes (EGs). However, the use of co-channel for links between CHs and EGs brings the problem of channel interference among many nodes. We propose and evaluate an improved CB-CA algorithm to solve this problem in MRMC WMNs. The proposed algorithm discriminates between transmission channel and receive channel and assigns channels to each interface randomly and advertises this information to neighbor clusters in order to be assigned no-interference channel between clusters. Therefore, the proposed algorithm can minimize the interference between clusters and also improve QoS, since it can use multiple interfaces and multiple channels.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2012년도 한국컴퓨터종합학술대회논문집 Vol.39 No.1(D)
• /
• pp.300-302
• /
• 2012

In this paper, we investigate the performance of multi-channel cognitive radio networks (CRNs) by taking into consideration the problem of channel assignment and link scheduling. We assume that secondary nodes are equipped with multiple radios and can switch among multiple channels. How to allocate channels to links and how much power used on each channel to avoid mutual interference among secondary links are the key problem for such CRNs. We formulate the problem of channel assignment and link scheduling as a combinatorial optimization problem. Then, we propose a the optimal solution and show that it converges to maximum optimum in some iterations by using numerical results.

• 한국통신학회논문지
• /
• 제21권11호
• /
• pp.2817-2827
• /
• 1996

In this paper, we propose a new channel assignment scheme considering traffic characteristics in the CDMA cellular system. The object of proposed method is to reduce the hard handoff of data calls which are very sensitive to transmission errors. In this algorithm, we use three channel assignment policies. First, all of the data calls are assigned to the primary CDMA channel if possible. Second, priority for primary CDMA channel is given to data calls by assigning some primary CDMA traffic channels exclusively for data calls. Third, data calls are assigned to the CDMA channel most served by neighbor cells, when all of the primary CDMA traffic channels are used. A performance analysis shows the minimum soft handoff probability of data calls in handoff which is guarantied any cellconfiguration is increased above 40% by the adopting proposed algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권2호
• /
• pp.628-646
• /
• 2016

This paper proposes a novel channel assignment scheme that is based on finite projective plane (FPP) theory. The proposed scheme involves using a Markov chain model to allocate N channels to N users through intermixed channel group arrangements, particularly when channel resources are idle because of inefficient use. The intermixed FPP-based channel group arrangements successfully related Markov chain modeling to punch through ratio formulations proposed in this study, ensuring fair resource use among users. The simulation results for the proposed FPP scheme clearly revealed that the defined throughput increased, particularly under light traffic load conditions. Nevertheless, if the proposed scheme is combined with successive interference cancellation techniques, considerably higher throughput is predicted, even under heavy traffic load conditions.