• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.211-232
• /
• 2024

In this paper, we consider the resource allocation and offloading decisions of device-to-device (D2D) cooperative UAV-assisted mobile edge computing (MEC) system, where the device with task request is served by unmanned aerial vehicle (UAV) equipped with MEC server and D2D device with idle resources. On the one hand, to ensure the fairness of time-delay sensitive devices, when UAV computing resources are relatively sufficient, an optimization model is established to minimize the maximum delay of device computing tasks. The original non-convex objective problem is decomposed into two subproblems, and the suboptimal solution of the optimization problem is obtained by alternate iteration of two subproblems. On the other hand, when the device only needs to complete the task within a tolerable delay, we consider the offloading priorities of task to minimize UAV computing resources. Then we build the model of joint offloading decision and power allocation optimization. Through theoretical analysis based on KKT conditions, we elicit the relationship between the amount of computing task data and the optimal resource allocation. The simulation results show that the D2D cooperation scheme proposed in this paper is effective in reducing the completion delay of computing tasks and saving UAV computing resources.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5B
• /
• pp.498-508
• /
• 2009

In wireless mobile environments, large bandwidth and high QoS (Quality of Service) are recently required to support the increased demands for multimedia services. LTE (Long Term Evolution) is one of the promising solutions for the next generation broadband wireless access systems. To efficiently use downlink resource and effectively support QoS, packet scheduling algorithm is one of the important features in LTE system. In this paper, we proposed DAPS (Delay-Aware Packet Scheduling) algorithm to consider QoS requirements of delays for various traffic classes as well as channel condition and fairness. To reflect delay experiences at scheduling instance, DAPS observes how queue waiting time of packet is closed to maximum allowable delay. The simulation results show that the DAPS algorithm yields better performance for delay experience by increasing the number of transmitted packets with satisfying the required delay time compared with existing scheduling algorithms.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1013-1017
• /
• 2005

This paper proposes an effective algorithm, P-DCF(Polling DCF) to satisfy real-time requirements in the industrial environments, based on 802.11 DCF protocols. Theoretical analysis and actual experiments are carried out, which shows that the proposed P-DCF brings several benefits: 1) it reduces the time delay for frame transmission 2)it guarantees bounded upper limit of maximum transmission delay 3) it maintains fairness

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.6 no.6
• /
• pp.513-520
• /
• 2005

High-speed Portable Internet system provides 1-3 Mbps data transmission speed to terminals moving up to 60 km/sec. Since High-speed Portable Internet system supports services requiring different QoS, it needs an efficient scheduling method based on those different QoSs. This paper shows the performance comparisons of several different packet scheduling schemes for minimizing the mean delay over the downlink of High-speed Portable Internet system to support the packet data service. Simulation results show that proposed scheme superior to other schemes at side throughput and data loss rate.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.1-19
• /
• 2003

This paper studies power and rate control for data users on the forward link of CDMA system with two cells. The QoS for data users is specified by delay and error rate constraints as well as a family of utility functions representing system throughput and fairness among data users. Optimal power and rate allocation problem is mathematically formulated as a nonlinear programming problem, which is to maximize total utility under delay and error rate constraints, and optimal power and rate allocation scheme (OPRAS) is proposed to obtain a good solution in a fast time. Computational experiments show that the proposed scheme OPRAS works very well and increases total utility compared to the separate power and rate allocation scheme (SPARS) which considers each cell individually.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.11b
• /
• pp.1121-1124
• /
• 2003

스케줄링은 네트워크상의 공유된 자원을 보다 효과적으로 이용하기 위한 것으로서 delay, delay jitter, packet loss rate, throughput과 같은 서비스 값들의 QoA(Quality of Service)를 보장하기 위한 핵심 요소이다. 유선망에서의 스케줄링은 이미 익숙한 영역으로 많은 발전이 되어왔지만, 무선채널의 불안정성이나 사용자의 움직임으로 인해 발생하는 다양한 링크 에러율과 용량 때문에 무선망에서의 직접적용은 많은 문제를 일으키게 된다. 이 논문에서는 기존에 나와 있는 여러 무선 스케줄링 기법중 채널 보상 모델을 이용하여 서비스 차별화(Service Differentiation)와 공평성(Fairness)에 초점을 맞춘 QoS제공 성능향상 스케줄링 알고리즘을 제안하였다.

• Journal of the Korea Society for Simulation
• /
• v.8 no.1
• /
• pp.51-61
• /
• 1999

A cell scheduling method of Queue for the ATM switch is proposed and simulated. In this paper, we present the cell scheduling method proper to the proposed queue and the improved queue with Queue Sharing(QS) structure for CBR, VBR, ABR traffic. The proposed QS structure minimizes the CLS(Cell Loss Ratio) of ABR traffic and decreases the CLR of bursty VBR traffic. Also we propose a cell scheduling method using VRR(Variable Round Robin) scheme proper to the high-speed(ATM) switch. The VRR scheme provides a fairness in terms of service chance for the queues in the ATM switch as well as QOS of their cell delay characteristic of CBR and VBR traffic, QOS of ABR CLR. The simulation results show the proposed method achieves excellent CLR and average cell delay performance for the various ATM traffic services in the Queue Sharing structure.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1482-1484
• /
• 2010

A new TCP protocol can succeed for large bandwidth delay product when it meets network bandwidth utilization efficiency and fair sharing. We introduce a novel congestion control algorithm which employs queueing delay information in order to calculate the amount of congestion window increment in increase phase, and reduces congestion window to optimal estimated bound as packet loss occurs. Combination of such methods guarantees that the proposal utilizes fully network bandwidth, recovers quickly from packet loss in wireless link, and preserves fairness for competing flows mixed short RTT and long RTT. Our simulations show that features of the proposed TCP meet the desired requirements.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.10
• /
• pp.2191-2204
• /
• 1997

An efficient packet transmit scheduling algorithm should be able to allocate the resource to each connection fairly based on the bandwidth and quality of service requirements negotiated during the call admission procedure and it should be able to isolate the effects of users that are behaving badly. In this paper, we propose an effective round-robin packet transmit scheduling mechanism, which we call the delay tolerant packet reserving scheme (DTPRS) based on delay QoS requirments. The proposed scheme can not only provide fairness and but also reduce delay, delay variation, and packet loss rate by reserving output link time slots of delay tolerant packets and assigning the reserved slotsto delay urgent packets. Our scheme is applicable to high speed networks including ATM network because it only requires O(1) work to process a packet, and is simple enough to implement.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.2
• /
• pp.130-139
• /
• 2013

In recent, the communication networks of wind power farm are becoming crucial technologies for monitoring and controlling the large-scale offshore wind power farm. In this paper, EPON based communication network architectures are proposed in order to combat the problems of conventional Ethernet based communication network such as delay, data processing overhead and the fairness of data transmission among turbines in offshore wind power farm. The proposed architecture constructs the point to multi-point network by using OLT and ONUs installed in central control center and wind turbines respectively. The EPON based communication network architecture has low cost, high reliability, and fair transmission capability. To evaluate the performance of proposed architectures, the wind power farm based on IEC 61850 is modelled by using OPNET The simulation results are analyzed and compared with conventional Ethernet based communication network in terms of the overhead, delay and fairness of data transmission.