• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.4
• /
• pp.385-398
• /
• 2009

This paper aims to find a suitable solution to joint allocation of sub-channel and transmit power for multiple users in an IEEE 802.16e OFDMA/TDD cellular system. We propose the FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm, which is a dynamic channel allocation algorithm that considers all of the users' channel state information conditionally in order to maximize throughput while taking into account fairness. A dynamic power allocation algorithm, i.e., an improved CHC algorithm, is also proposed in combination with the FASA algorithm. It collects the extra downlink transmit power and re-allocates it to other potential users. Simulation results show that the joint allocation scheme with the improved CHC power allocation algorithm provides an additional increase of sector throughput while simultaneously enhancing fairness. Four frames of time delay for CQI feedback and scheduling are considered. Furthermore, by addressing the difference between uplink and downlink scheduling in an IEEE 802.16e OFDMA TDD system, we can employ the uplink channel information directly via channel sounding, resulting in more accurate uplink dynamic resource allocation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.3A
• /
• pp.247-260
• /
• 2007

This paper solves the problem of finding a suitable sub-channel and power joint allocation method for multiple users in 802.16e OFDMA/TDD cellular systems. The joint allocation is thatfirstly the sub-channel is allocated to the users and then suitable power is allocated. We propose a FASA (Fairness insured Aggressive Sub-channel Allocation) algorithm which is a dynamic channel allocation algorithm considering all users' channel state information conditionally to maximize fairness and throughput. The improved CHC algorithm, which is dynamic power allocation algorithm, is also proposed in this paper The Improved CHC algorithm collects the extra of the downlink transmit power and then re-allocates it to other users. Simulation results show that the proposed improved CHC algorithm additionally increases the fairness and sector throughput.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.240-242
• /
• 2004

A channel allocation algorithm of multi-user OFDM(orthogonal frequency division multiplexing) system is presented. The proposed algorithm is to reduce the complexity of the system, using the GNN(gradual neural network) with gradual expansion scheme and the algorithm attempts to allocate channel with good channel gain to each user. The method has lower computational complexity and less iteration than other algorithms.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.771-774
• /
• 2012

Typical channel allocation algorithms for secondary users do not include processes to reduce the frequency of switching from one channel to another caused by random interruptions by primary users, which results in high packet drops and delays. In this letter, with the purpose of decreasing the number of switches made between channels, we propose a nonparametric channel allocation algorithm that uses robust kernel density estimation to effectively schedule idle channel resources. Experiment and simulation results demonstrate that the proposed algorithm outperforms both random and parametric channel allocation algorithms in terms of throughput and packet drops.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.651-669
• /
• 2013

In this paper, we study a novel routing algorithm based on load balancing for multi-channel wireless mesh networks. In order to increase the network capacity and reduce the interference of transmission streams and the communication delay, on the basis of weighted cumulative expected transmission time (WCETT) routing metric this paper proposes an improved routing metric based on load balancing and channel interference (LBI_WCETT), which considers the channel interference, channel diversity, link load and the latency brought by channel switching. Meanwhile, in order to utilize the multi-channel strategy efficiently in wireless mesh networks, a new channel allocation algorithm is proposed. This channel allocation algorithm utilizes the conflict graph model and considers the initial link load estimation and the potential interference of the link to assign a channel for each link in the wireless mesh network. It also utilizes the channel utilization percentage of the virtual link in its interference range as the channel selection standard. Simulation results show that the LBI_WCETT routing metric can help increase the network capacity effectively, reduce the average end to end delay, and improve the network performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6A
• /
• pp.617-626
• /
• 2006

In this paper, we propose an ASA(Aggressive Subchannel Allocation) algorithm, which is an effective dynamic channel allocation algorithm considering all user's channel state to maximize downlink sector throughput in OFDMA system. We compare an ASA algorithm with Round Robin, ACG(Amplitude Craving Greedy), RCG(Rate Craving Greedy) and GPF(General Proportional Fair) in the 2-tier environment of FRF(Frequency Reuse Factor) 1 and then analyze the performance of each algorithms, through compute simulation. Simulation results show that the proposed ASA algorithm gets 58 %, 190 %, 130 % and 8.5 % better sector throughput compared with the Round Robin, ACG, RCG and GPF respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2240-2254
• /
• 2021

We investigate the channel allocation problem in an ultra-dense device-to-device (D2D) enabled cellular network in underlaying mode where multiple D2D users are forced to share the same channel. Two kinds of low complexity solutions, which just require partial channel state information (CSI) exchange, are devised to resolve the combinatorial optimization problem with the quality of service (QoS) guaranteeing. We begin by sorting the cellular users equipment (CUEs) links in sequence in a matric of interference tolerance for ensuring the SINR requirement. Moreover, the interference quota of CUEs is regarded as one kind of communication resource. Multiple D2D candidates compete for the interference quota to establish spectrum sharing links. Then base station calculates the occupation of interference quota by D2D users with partial CSI such as the interference channel gain of D2D users and the channel gain of D2D themselves, and carries out the channel allocation by setting different access priorities distribution. In this paper, we proposed two novel fast matching algorithms utilize partial information rather than global CSI exchanging, which reduce the computation complexity. Numerical results reveal that, our proposed algorithms achieve outstanding performance than the contrast algorithms including Hungarian algorithm in terms of throughput, fairness and access rate. Specifically, the performance of our proposed channel allocation algorithm is more superior in ultra-dense D2D scenarios.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2A
• /
• pp.179-187
• /
• 2007

As wireless networks evolve to orthogonal frequency division multiple access(OFDMA) systems, inter-cell interference control becomes a critical issue in radio resource management. The allocation of the same channels in neighbor cells cause inter-cell interference, so the channel allocation needs to be taken carefully to lower the inter-cell interference. In distributed channel allocation, each cell independently tries to allocate channels that suffer low interference level. In this paper, under the assumption of static users, we introduce the concept of interference range and use it in designing our two algorithms; basic and combined. The basic algorithm performs interference range detection and determines whether to use the considered channel, while the combined algorithm checks the channel quality in addition to detecting the interference range. The two algorithms dynamically perform channel allocation with low complexity and show good throughput and fairness performance.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.21-27
• /
• 2008

In this paper, we design and implement the upstream packet bandwidth allocation algorithm on OPNET-based DOCSIS 3.0 simulator including channel-bonding CM (Cable Modem)s. Previous DOCSIS CM could not support channel bonding, it has problem in upstream bandwidth allocation and determine the contention area. The proposed upstream bandwidth allocation algorithm has been improved the queuing time and success rate. For the simulation, we design the MAC frame structure with channel bonding supported CM and not. And then, this paper design and implement the CMTS node model, CM node model, CMTS process model, and CM process model.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9A
• /
• pp.888-897
• /
• 2007

In this paper, we propose an uplink dynamic resource allocation algorithm to increase sector throughput and fairness among users in 802.16e OFDMA TDD system. In uplink, we address the difference between uplink and downlink channel state information in 802.16e OFDMA TDD system. The simulation results show that not only an increment of 10% of sector throughput but higher level of fairness is achieved by round-robin using the FLR and the rate / margin adaptive inner closed-loop power control algorithm. The FLR algorithm determines the number of sub-channels to be allocated to the user according to the user's position. Also, we get 31.8% more sector throughput compared with the round-robin using FLR by FASA algorithm using uplink channel state information. User selection, sub-channel allocation, power allocation algorithms and simulation methodology are mentioned in Part I.