• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.641-649
• /
• 2005

Metro networks use the existing circuit-switching technology like SONET/SDH. Such circuit-switching based networks are inefficient in tarrying Internet traffic with bursty nature. Therefore, metro networks can become a bottleneck In order to resolve this problem, the IEEE 802.17 working group has proposed the RPR (Resilient Packet Ring) technology. In addition to this, the RPR fairness mechanism has been defined to provide fairness among the stations in the RPR network. However, the current RPR fairness mechanism has the problem of inefficient use of the available bandwidth after when the congestion at a node is resolved. In this paper, we propose an improved bandwidth allocation mechanism in which, after the congestion resolution at a node, the node estimates the number of nodes transmitting data and measures the remaining bandwidth and fairly allocates the available bandwidth to active nodes. To show the performance of our proposed mechanism, we have performed simulation and showed that the proposed mechanism offers higher bandwidth utilization.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.132-135
• /
• 2006

Recently, multimedia data service using mobile terminal has been increased according to the development of wireless network technology which can be used in an indoor or outdoor environment. However, the wireless network shares the channel and it has a high error rate because of characteristics of transmission media. Therefore, it has a lot of problems for guaranteeing QoS(Quality of Services) in various requirements. This paper suggests a CSD-WRR(Channel State Dependent-WRR) method for compensating the service rate considering the transmission deadline. Simulation results show that the suggested method outperforms the conventional WRR in the view of the deadline miss rate and fairness.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.3
• /
• pp.219-227
• /
• 2005

In this paper, an optimal power and rate allocation model is mathematically formulated on the forward link of multicell CDMA mobile systems. The model maximizes total utility considering data rates and fairness among cells under delay and PRER (Post RPL Error Rate) constraints. The two-level power and rate allocation scheme is suggested to solve the proposed model. Experimental results show that the proposed scheme provides a good solution in a fast time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.1996-2013
• /
• 2015

This paper considers a scenario that more D2D users exist in the cell, they compete for cellular resources to increase their own data rates, which may cause transmission interference to cellular users (CU) and the unfairness of resource allocation. We design a resource allocation scheme for selfish D2D users assisted by cooperative relay technique which is used to further enhance the users' transmission rates, meanwhile guarantee the QoS requirement of the CUs. Two transmission modes are considered for D2D users: direct transmission mode and cooperative relay transmission mode, both of which reuses the cellular uplink frequency resources. To ensure the fairness of resource distribution, Nash bargaining theory is used to determine the transmission mode and solve the bandwidth allocation problem for D2D users choosing cooperative relay transmission mode, and coalition formation game theory is used to solve the uplink frequency sharing problem between D2D users and CUs through a new defined "Selfish order". Through theoretical analysis, we obtain the closed Nash bargaining solution under CUs' rate constraints, and prove the stability of the formatted coalition. Simulation results show that the proposed resource allocation approach achieves better performance on resource allocation fairness, with only little sacrifice on the system sum rates.

• International journal of advanced smart convergence
• /
• v.9 no.4
• /
• pp.34-41
• /
• 2020

Nowadays, the advanced smart convergences of the artificial intelligence (AI) and the internet of things (IoT) have been more and more important, in the fifth generation (5G) and beyond 5G (B5G) mobile communication. In 5G and B5G mobile networks, non-orthogonal multiple access (NOMA) has been extensively investigated as one of the most promising multiple access (MA) technologies. In this paper, we investigate the achievable data rate for the asymmetric binary pulse amplitude modulation (2PAM), in non-orthogonal multiple access (NOMA). First, we derive the closed-form expression for the achievable data rate of the asymmetric 2PAM NOMA. Then it is shown that the achievable data rate of the asymmetric 2PAM NOMA reduces for the stronger channel user over the entire range of power allocation, whereas the achievable data rate of the asymmetric 2PAM NOMA increases for the weaker channel user improves over the power allocation range less than 50%. We also show that the sum rate of the asymmetric 2PAM NOMA is larger than that of the conventional standard 2PAM NOMA, over the power allocation range larger than 25%. In result, the asymmetric 2PAM could be a promising modulation scheme for NOMA of 5G systems, with the proper power allocation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1733-1751
• /
• 2015

The IEEE 802.15.4 standard not only provides a maximum of seven guaranteed time slots (GTSs) for allocation within a superframe to support time-critical traffic, but also achieves ultralow complexity, cost, and power in low-rate and short-distance wireless personal area networks (WPANs). Real-time wireless body area sensor networks (WBASNs), as a special purpose WPAN, can perfectly use the IEEE 802. 15. 4 standard for its wireless connection. In this paper, we propose an adaptive GTS allocation scheme for real-time WBASN data transmissions with different priorities in consideration of low latency, fairness, and bandwidth utilization. The proposed GTS allocation scheme combines a weight-based priority assignment algorithm with an innovative starvation avoidance scheme. Simulation results show that the proposed method significantly outperforms the existing GTS implementation for the traditional IEEE 802.15.4 in terms of average delay, contention free period bandwidth utilization, and fairness.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2607-2625
• /
• 2014

Previous studies on multiuser multiple-input multiple-output (MIMO) mostly assume a homogeneous signal-to-noise ratio (SNR), where each user has the same average SNR. However, real networks are more likely to feature heterogeneous SNRs (a random-valued average SNR). Motivated by this fact, we analyze a multiuser MIMO downlink with a zero-forcing (ZF) receiver in a heterogeneous SNR environment. A transmitter with Mantennas constructs M orthonormal beams and performs the SNR-based proportional fairness (S-PF) scheduling where data are transmitted to users each with the highest ratio of the SNR to the average SNR per beam. We develop a new analytical expression for the sum throughput of the multiuser MIMO system. Furthermore, simply modifying the expression provides the sum throughput for important special cases such as homogeneous SNR, max-rate scheduling, or high SNR. From the analysis, we obtain new insights (lemmas): i) S-PF scheduling maximizes the sum throughput in the homogeneous SNR and ii) under high SNR and a large number of users, S-PF scheduling yields the same multiuser diversity for both heterogeneous SNRs and homogeneous SNRs. Numerical simulation shows the interesting result that the sum throughput is not always proportional to M for a small number of users.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8A
• /
• pp.858-870
• /
• 2007

TCP is popular protocol for reliable data delivery in the Internet. In recent years, wireless environments with transmission errors are becoming more common. Therefore, there is significant interest in using TCP over wireless links. Previous works have shown that, unless the protocol is modified, TCP may perform poorly on paths that include a wireless link subject to transmission errors. The reason for this is the implicit assumption in TCP that all packet losses are due to congestion which causes unnecessary reduction of transmission rate when the cause of packet losses are wireless transmission errors. In this paper, we propose a new LDA that monitors the network congestion level using ROTT. And we evaluate the performance of our scheme and compare with TCP Veno, Spike scheme with NS2(Network Simulator 2). In the result of our experiment, our scheme reduces the packet loss misclassification to maximum 55% of other schemes. And the results of another simulation show that our scheme raise its transmission rate with the fairness preserved.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1479-1495
• /
• 2012

Spectrum scarcity seems to be the most challenging issue to be solved in new wireless telecommunication services. It is shown that spectrum unavailability is mainly due to spectrum inefficient utilization and inappropriate physical layer execution rather than spectrum shortage. Daily increasing demand for new wireless services with higher data rate and QoS level makes the upgrade of the physical layer modulation techniques inevitable. Orthogonal Frequency Division Multiple Access (OFDMA) which utilizes multicarrier modulation to provide higher data rates with the capability of flexible resource allocation, although has widely been used in current wireless systems and standards, seems not to be the best candidate for cognitive radio systems. Filter Bank based Multi-Carrier (FBMC) is an evolutionary scheme with some advantages over the widely-used OFDM multicarrier technique. In this paper, we focus on the total throughput improvement of a cognitive radio network using FBMC modulation. Along with this modulation scheme, we propose a novel uplink radio resource allocation algorithm in which fairness issue is also considered. Moreover, the average throughput of the proposed FBMC based cognitive radio is compared to a conventional OFDM system in order to illustrate the efficiency of using FBMC in future cognitive radio systems. Simulation results show that in comparison with the state of the art two algorithms (namely, Shaat and Wang) our proposed algorithm achieves higher throughputs and a better fairness for cognitive radio applications.

• Journal of Korea Multimedia Society
• /
• v.4 no.5
• /
• pp.371-376
• /
• 2001

Since continuous media such as video and audio data are displayed within a certain time constraint, their computation and manipulation should be handled under limited condition. Traditional real-time scheduling algorithms cold be directly applicable, because they are not suitable for multimedia scheduling applications which support many clients at the same time. Rate Regulating Proportional Share Scheduling Algorithm based on the stride scheduler is a scheduling algorithm considered the time constraint of the continuous media. The stride schedulers, which are designed to general tasks, guarantee the fairness of resource allocation and predictability. The key concept of RRPSSA is a rate regulator which prevents tasks from receiving more resource than its share in a given period. But this algorithm loses fairness which is a strong point of the stride schedulers, and does not show graceful degradation of performance under overloaded situation. This paper proposes a new modified algorithm, namely Modified Proportional Share Scheduling Algorithm considering the characteristics of multimedia data such as its continuity and time dependency. Proposed scheduling algorithm shows graceful degradation of performance in overloaded situation and it reduces the scheduling violations up to 70% by maintaining the fair resource allocation. The number of context switching is 8% less than RRPSSA and the overall performance is increased.