• ETRI Journal
• /
• v.45 no.1
• /
• pp.45-59
• /
• 2023

In this paper, to optimize the average delay and power allocation (PA) for system users, we propose a resource scheduling scheme for wireless networks based on Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) according to the first fifth-generation standards. For delay minimization, we solve a throughput maximization problem that considers CPOFDM systems with carrier aggregation (CA). Regarding PA, we consider an approach that involves maximizing goodput using an effective signal-to-noise ratio. An algorithm for jointly solving delay minimization through computation of required user rates and optimizing the power allocated to users is proposed to compose the resource allocation approach. In wireless network simulations, we consider a scenario with the following capabilities: CA, 256-Quadrature Amplitude Modulation, millimeter waves above 6 GHz, and a radio frame structure with 120 KHz spacing between the subcarriers. The performance of the proposed resource allocation algorithm is evaluated and compared with those of other algorithms from the literature using computational simulations in terms of various Quality of Service parameters, such as the throughput, delay, fairness index, and loss rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.877-886
• /
• 2005

Various frame recovery algorithms have been suggested to overcome the communication quality degradation problem due to Internet-typical impairments on Voice over IP(VoIP) communications. In this paper, we propose a new receiver-based recovery method which is able to enhance recovered speech quality with almost free computational cost and without an additional increment of delay and bandwidth consumption. Most conventional recovery algorithms try to recover the lost or erroneous speech frames by reconstructing missing coefficients or speech signal during speech decoding process. Thus they eventually need to modify the decoder software. The proposed frame recovery algorithm tries to reconstruct the missing frame itself, and does not require the computational burden of modifying the decoder. In the proposed scheme, the Vector Quantization(VQ) codebook indices of the erased frame are directly estimated by referring the pre-computed VQ Codebook Index Interpolation Tables(VCIIT) using the VQ indices from the adjacent(previous and next) frames. We applied the proposed scheme to the ITU-T G.723.1 speech coder and found that it improved reconstructed speech quality and outperforms conventional G.723.1 loss recovery algorithm. Moreover, the suggested simple scheme can be easily applicable to practical VoIP systems because it requires a very small amount of additional computational cost and memory space.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2013.05a
• /
• pp.10-11
• /
• 2013

Green Frame is a column-beam system formed by composite precast concrete column and beam connected with steel buried in both members. During the installation of Green columns, the columns of Green Frame, covering 3 floors per each piece and beams, the eccentricity can be observed due to the construction error and the weight of beam itself. Such eccentricity may have a little influence on a single frame, yet, it can develop critical issues to the installation of subsequent beams or beams on the upper floors in the context of a building as a whole that has multiple frames. These issues lead to delay in frame installation, decrease of productivity and increase of cost, etc. Therefore, this study presents a steel-joint connection method in order to solve the issues. The steel-joint connection method exists on slope plane and reinforcing plate in steel frame buried in composite PC members. Through this method, the issues can be resolved without requiring additional equipment or manpower.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.9
• /
• pp.1569-1574
• /
• 2008

Almost all the RFID systems in the 13.56MHz ISM band adopt the FSA algorithm as the anti-collision algorithm. The FSA algorithm is based on the slotted ALOHA with a fixed frame size. The FSA, though simple, has a disadvantage that when the number of tags is variable, the system performance degrades because of the fixed frame size. Therefore, this paper proposes a new OFSA. The proposed OFSA algorithm dynamically allocates the optimal frame size at every frame based on the number of tags in the reader's identification range. According to the simulation results, the system efficiency of the proposed algorithm should be maintained optimally. Also, the proposed algorithm always obtained the minimum tag identification delay.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.687-695
• /
• 2002

Media-specific FEC techniques, suggested to confront with VoIP speech packet loss, improve speech quality at the expense of generating additional one-frame delay. In this paper, we suggest new media-specific FEC, i.e, LSF FEC technique which is able to improve speech quality with much shortened additional delay. In the proposed technique, the LSF parameters of the future frame are utilized to recover a lost packet. To evaluate performance of the proposed technique, we use ITU-T G.723.1 and G.729 Codec and apply Gilbert packet loss model and estimate MOS per every packet loss rate using PESQ speech quality estimation algorithm. The proposed technique has effect of shortening delay over from 6.5ms to 27ms compared with existing media-specific FEC techniques. Simulation results for comparison of reconstructed speech quality show this novel technique improves the MOS over 0.1 in practical lossy environment of 5 % packet loss rate.

• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.83-102
• /
• 2005

The problem of video scheduling is analyzed in the framework of divisible load scheduling. A divisible load can be divided into any number of fractions (parts) and can be processed/computed independently on the processors in a distributed computing system/network, as there are no precedence relationships. In the video scheduling, a frame can be split into any number of fractions (tiles) and can be processed independently on the processors in the network, and then the results are collected to recompose the single processed frame. The divisible load arrives at one of the processors in the network (root processor) and the results of the computation are collected and stored in the same processor. In this problem communication delay plays an important role. Communication delay is the time to send/distribute the load fractions to other processors in the network. and the time to collect the results of computation from other processors by the root processors. The objective in this scheduling problem is that of obtaining the load fractions assigned to each processor in the network such that the processing time of the entire load is a minimum. We derive closed-form expression for the processing time by taking Into consideration the communication delay in the load distribution process and the communication delay In the result collection process. Using this closed-form expression, we also obtain the optimal number of processors that are required to solve this scheduling problem. This scheduling problem is formulated as a linear pro-gramming problem and its solution using neural network is also presented. Numerical examples are presented for ease of understanding.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.4
• /
• pp.855-860
• /
• 2017

One of the most important issues in Wireless Sensor Networks is to save energy of the sensor node. But transmission latency is also the problem to solve for some applications such as military surveillance, object tracking. In these applications sensor node needs to send lots of data in limited time when an even such as object appearance occurs. So a delay efficient data transmission method is required. In this paper we propose a MAC protocol adequate for those applications. This paper proposed a low delay data transmission mechanism for military surveillance in wireless sensor networks. In the MAC protocol, a receiver node sends another beacon frame to sender node after receiving data packet. Using this second beacon frame, fast hop-to-hop transmission can be performed. Results have shown that the proposed MAC control mechanism outperformed RI-MAC protocol in the terms of latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.495-507
• /
• 2006

In wireless local area networks (WLANs), the successful design of scheduling algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a multipolling-based dynamic scheduling algorithm for providing delay guarantees to multimedia traffics such as MPEG streams. The dynamic algorithm exploits the characteristics of MPEG stream, and uses mini frames for feedback control in order to deliver dynamic parameters for channel requests from stations to the point coordinator (PC) operating at the access point (AP). In this scheme, the duration of channel time allocated to a station during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to conventional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.10
• /
• pp.3-10
• /
• 2012

The visible light communication takes advantages of LED and PD for communication and is considered as a next generation wireless communication technology. It can support variety indoor applications. Especially, Visible LAN service has drawn much attention due to high data rate and no interference with existing WPAN system as well as high efficiency in illumination. However, existing MAC protocol occurs a high communication delay due to uplink collision and backoff time. In this paper, to reduce packet delay, we propose an enhanced MAC protocol based on FDD where the time difference between uplink frame and downlink frame transmission is utilized. Through computer simulations, we verified that the proposed MAC protocol outperforms the existing MAC protocol in terms of average packet delay.

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

This paper introduces waiting time based periodic packet discard policy for frame based scheduler. This policy can be used with conventional packet discard policy or buffer management schemes, such as drop-tail or random early detection. Proposed discard policy discards packets, which are stayed in the buffer longer than threshold, at every period of scheduling. This decision of discard is based on waiting time of packet. In this paper, mathematical analysis is performed with situation of network congestion. Also, the simulation is performed to evaluate the performance of proposed discard policy. In the result, proposed discard policy can limit queuing delay by threshold. Also, if the packet discard is performed before scheduling and threshold is set with smaller value than frame length, it can limit the throughput of traffic.