• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.25-31
• /
• 2022

In ultra dense networks (UDNs), macro user equipments (MUEs) have significant interference from small-cell access points (SAPs) since a number of SAPs are deployed in the coverage of macro base stations of 5G mobile communication systems. In this paper, we propose a dynamic channel assignment scheme to increase the performance of MUEs for the uplink of UDNs even though the number of SAPs is increased. The target of the proposed dynamic channel assignment scheme is that the signal-to-interference and noise ratio (SINR) of MUEs is above a given SINR threshold assigning different subchannels to SUEs from those of MUEs. Simulation results show that the proposed dynamic channel assignment scheme outperforms others in terms of the mean MUE capacity even though the mean SUE capacity is decreased a little lower.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.5
• /
• pp.59-68
• /
• 1998

This paper proposes a neural network algorithm for a channel assignment in cellular mobile communications. The proposed algorithm is developed base on hopfield neural network in order to minimize the number of channel without a confliction between cells. To compare the performance of the proposed algorithm, we used seven benchmark problems selected from kunz's and funabiki's papers. Experimental results show that the convergence times are reduced form 27% to 66% compared with Kunz's and funabiki's algorithm and vonvergence rates are improved to 100%.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.37 no.2
• /
• pp.62-68
• /
• 2000

The Dynamic Channel Assignment have a detect which satisfy lots of conditions. It makes system efficiency depreciate because the Dynamic Channel Assignment executes computation process of several steps that demands lots of time. In this paper, we have proposed a traffic control algorithm which makes simple computation process for improving the detect.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.1075-1082
• /
• 1997

In this paper, we propose a channel assignment scheme for reducing call blocking rate in a base station(BS) of DS-CDMA cellular systems. The proposed scheme can e applied to the case where the capacity of reverse radio link is enough, but not are the available traffic channels performing the digital modulation and demodulation functions between a mobile station and the base station. The proposed scheme takes advantage of the feature of soft handoff in which a mobile station keeps its communication link even if one of the two communication links is released. The scheme estimates the mean and variance of the received power level measured at the base station before assigning a traffic channel for a new call request. The BS makes decision based on the estimated balues whether the new call request will be accepted or not. If it is decided that the capacity of reverse radio link is enough, but all traffic channels are not available, then the BS increases the soft handoff parameter T_DROP to release the traffic channels of mobile stations loactedin soft handoff area. The BS assigns the released traffic channel to anew call or a handoff call. The performance of the proposed channel assignment scheme is evaluated by computer simulation. The results show that the call blocking rate for new calls and handoff calls is reduced.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.87-93
• /
• 2009

Wireless mesh networks (WMNs) are emerging technologies that provide ubiquitous environments and wireless broadband access. The aggregate capacity of WMNs can be improved by minimizing the effect of channel interference. The IEEE 802.11b/g standard which is mainly used for the network interface technology in WMNs provides 3 multiple channels. We must consider the channel scanning delay and the channel dependency problem to effectively assign channels in like these multi-channel WMNs. This paper proposes a cluster-based channel assignment (CB-CA) algorithm for multi-channel WMNs to solve such problems. The CB-CA does not perform the channel scanning and the channel switching through assigning co-channel to the inter-cluster head (CH) links. In the CB-CA, the communication between the CH and cluster member (CM) nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-CA can minimize the interference within multi-channel environments. Our simulation results show that CB-CA can improve the performance of WMNs.

• ETRI Journal
• /
• v.25 no.4
• /
• pp.211-218
• /
• 2003

This paper presents a dynamic resource allocation algorithm with multi-frequency time-division multiple access for the return link of interactive satellite multimedia networks such as digital video broadcasting return channel via satellite systems. The proposed timeslot assignment algorithm, called the very efficient dynamic timeslot assignment (VEDTA) algorithm, gives an optimal assignment plan within a very short period. The optimality and computational efficiency of this algorithm demonstrate that it will be useful in field applications.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.146-170
• /
• 2017

Joint channel assignment and routing is a well-known problem in multi-radio wireless mesh networks for which optimal configurations is required to optimize the overall throughput and fairness. However, other objectives need to be considered in order to provide a high quality service to network users when it deployed with high traffic dynamic. In this paper, we propose a re-configuration optimization model that optimizes the network throughput in addition to reducing the disruption to the mesh clients' traffic due to the re-configuration process. In this multi-objective optimization model, four objective functions are proposed to be minimized namely maximum link-channel utilization, network average contention, channel re-assignment cost, and re-routing cost. The latter two objectives focus on reducing the re-configuration overhead. This is to reduce the amount of disrupted traffic due to the channel switching and path re-routing resulted from applying the new configuration. In order to adapt to traffic dynamics in the network which might be caused by many factors i.e. users' mobility, a centralized heuristic re-configuration algorithm called State-Aware Joint Routing and Channel Assignment (SA-JRCA) is proposed in this research based on our re-configuration model. The proposed algorithm re-assigns channels to radios and re-configures flows' routes with aim of achieving a tradeoff between maximizing the network throughput and minimizing the re-configuration overhead. The ns-2 simulator is used as simulation tool and various metrics are evaluated. These metrics include channel-link utilization, channel re-assignment cost, re-routing cost, throughput, and delay. Simulation results show the good performance of SA-JRCA in term of packet delivery ratio, aggregated throughput and re-configuration overhead. It also shows higher stability to the traffic variation in comparison with other compared algorithms which suffer from performance degradation when high traffic dynamics is applied.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.173-182
• /
• 1997

In this paper, an efficient dynamic channel assignment scheme is suggested, which consists of two types of channel allocation strategies : ordinary channel allocation strategy and channel reallocation strategy. An analysis on the handoff probabilities of handoff and new calls is also performed, and using the analyzed handoff probability, the presented scheme is compared with other existing schemes in terms of three types of blocking probabilities- new call blocking probability, handoff call blocking probability, and network blocking probability (incomplete service probability). Simulation results show that the presented scheme significantly reduces those blocking probabilities over the existing schemes. Furthermore, the scheme has much smaller number of reallocation than other schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.11B
• /
• pp.1031-1037
• /
• 2003

A new scheduling scheme, which uses channel quality information of each flow in Bluetooth system of ad-hoc network for effective bandwidth assignment, has been proposed in this paper. By an effective bandwidth assignment, QoS (Quality of Service) could have been ensured in case of asymmetric data traffic, mixed data transmission, and congested data transmission in a specific channel. The scheduling algorithm determines channel weights using partial channel information of flows. Case studies conducted by NS-2 (Network Simulator 2) and Bluehoc simulator has been presented to show the effectiveness of the proposed scheduling scheme.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.156-160
• /
• 2002

In this paper, we have estimated by means of the theoretical analysis and the simulation of FCA(Fixed Channel Assignment) and CB(Channel Borrowing) in order to consider the CB as a technique to meet ducting interference from adjacent countries. Also, we assumed that the receiving power level of ducting interference with time rate can be characterized by the normal distribution due to the previous measured results, and the ducting interferences which are exceeding the reference power level can be regarded as calls. These calls can be processed by CR assignment and by which sharing channels between cells brings to us the method of meeting the ducting interference to use spectrum resources effectively. However, the spectrum frequency reusing and the interference effects between channels should be considered in CB simulation in the future.