• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.16-26
• /
• 2024

Mobile edge computing (MEC) plays a crucial role in improving the performance of resource-constrained mobile devices by offloading computation-intensive tasks to nearby edge servers. However, existing methods often neglect the critical consideration of future task requirements when making offloading decisions. In this paper, we propose an innovative approach that addresses this limitation. Our method leverages recurrent neural networks (RNNs) to predict task sizes for future time slots. Incorporating this predictive capability enables more informed offloading decisions that account for upcoming computational demands. We employ genetic algorithms (GAs) to fine-tune fitness functions for current and future time slots to optimize offloading decisions. Our objective is twofold: minimizing total processing time and reducing energy consumption. By considering future task requirements, our approach achieves more efficient resource utilization. We validate our method using a real-world dataset from Google-cluster. Experimental results demonstrate that our proposed approach outperforms baseline methods, highlighting its effectiveness in MEC systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5B
• /
• pp.753-761
• /
• 2010

In this paper, we propose a novel tag collection algorithm to improve tag collection performance in active RFID systems. In the proposed algorithm, the reader detects the occurrence of empty slots and collided slots through the identified slot scan process and reduces the time wasted by empty slots and collided slots, resulting in improvement of tag collection performance. To evaluate the performance improvement by the proposed tag collection algorithm via the experiments in a real-world environment, we implemented an active RFID reader and tags. The experimental results with the reader and 60 tags showed that the proposed algorithm could reduce the average tag collection time by 21.7% and improve the average identification throughput by 28.3%, compared with the standard tag collection algorithm in ISO/IEC 18000-7. In addition, the proposed algorithm reduced the average battery consumption on tags by 22.7% in the battery consumption experiment with 20 tags.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.3029-3045
• /
• 2017

The main processes of a cognitive radio system include spectrum sensing, spectrum decision, spectrum sharing, and spectrum conversion. Experimental results show that these stages introduce a time delay that affects the spectrum sensing accuracy, reducing its efficiency. To reduce the time delay, the frequency spectrum prediction was proposed to alleviate the burden on the spectrum sensing. In this paper, the deep recurrent neural network (DRNN) was proposed to predict the spectrum of multiple time slots, since the existing methods only predict the spectrum of one time slot. The continuous state of a channel is divided into a many time slots, forming a time series of the channel state. Since there are more hidden layers in the DRNN than in the RNN, the DRNN has fading memory in its bottom layer as well as in the past input. In addition, the extended Kalman filter was used to train the DRNN, which overcomes the problem of slow convergence and the vanishing gradient of the gradient descent method. The spectrum prediction based on the DRNN was verified with a WiFi signal, and the error of the prediction was analyzed. The simulation results proved that the multiple slot spectrum prediction improved the spectrum efficiency and reduced the energy consumption of spectrum sensing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.8
• /
• pp.1517-1530
• /
• 2017

Traditional anti-collision algorithms determine slot size of initial frame based on the information of number of collision slots, idle slots, and success slots. Since there is no information about collision at the beginning of tag information collection, traditional anti-collision algorithms can not determine the initial frame size. Considering that performance of anti-collision algorithm is very sensitive to initial slot size traditional anti-collision algorithms need some improvements. In this study two methods are proposed to determine slot size of initial frame efficiently, through which we can improve the performance of dynamic frame slotted aloha algorithm. To verify the performance of proposed algorithms, 2.4GHz RFID system is used. Throughput and delay time are derived through simulation, which is developed using JAVA. We have seen that proposed algorithm improves throughput by 9.6% and delay time by 9.8%.

• Journal of Fashion Business
• /
• v.10 no.1
• /
• pp.148-163
• /
• 2006

The purpose of this study is to examine differences in university students' spatial behavior and time for purchasing weekdays or weekends according to trading areas they use to purchase casual wears. Theoretical background examined trading areas, in Busan, consumers' spatial behavior. An empirical research developed a questionnaire as a measuring tool to conduct a preliminary survey and a main survey. Data collection was implemented with 507 students from four universities in Busan; and for data analysis, descriptive statistics, cross-tabulation analysis, correspondence analysis, and McNemar test were carried out by using the SPSS for Windows 12.0K program. This study obtained the main results as follows: The characteristics of university students' spatial behavior according to trading areas show significant difference in reasons of trading area selection, time slots for visiting. University students who visited the Seomyeon trading area were found to consider comparison-based purchasing and prominence of the trading area, regardless of the time for purchasing weekdays or weekends. As for trading areas around Busan National University, visits were mainly due to accessibility. Students visited trading areas in Nampo-Gwangbok-dong regardless of the time for purchasing in diverse reasons of trading area selection, time slots. As for trading areas around Kyungsung University, students were visited due to accessibility.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1948-1959
• /
• 1999

The error rate performance of the proposed $\pi$/4-differential quadructure phase shift keying( $\pi$/4-DQPSK) with nonredundant multiple error correction is analyzed for Nakagami fading channel. The scheme for differential detection of $\pi$/4-QPSK with nonredundant multiple error correction utilizes the output that employ the received signal delayed by more than two time slots. It was observed that the performance increased as the error correction capability increased.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.956-958
• /
• 2010

The paper considers MIMO two-way scheme to optimize the end to end capacity in local wireless mesh network. The basic idea is to perform data transmission via intermediate cooperative nodes and cooperative relay therefore higher throughput can be achieved. Each node is equipped with multiple antennas, and has two time slots one for transmission (Tx) and the other is reception (Rx), which are arranged alternatively in the network. In the conventional SISO network, it takes at least four time slots to accomplish the function of two-way relay. Moreover, cooperative technique is used in order to enhance multiplexing of forward and backward streams.

• Journal of Magnetics
• /
• v.20 no.3
• /
• pp.273-283
• /
• 2015

In this study, we propose an analytical model for studying magnetic fields in radial-flux permanent-magnet eddy-current couplings by considering the effects of slots and iron-core protrusions on the eddy currents. We focus on the analytical prediction of the air-gap field by considering the influence of eddy currents induced in conducting bars. In the proposed model, the permanent magnet region is treated as the source of a time-varying magnetic field and the moving-conductor eddy current problem is solved based on the resolution of time-harmonic Helmholtz equations. The spatial harmonics in the air gap and in slots, as well as the time harmonics are all considered in the analytical calculation. Based on the proposed field model, the electromagnetic torque is computed by using the Maxwell stress tensor method. Nonlinear finite element analysis is performed to validate the analytical model. The proposed model can be used for permanent-magnet eddy-current couplings with any slot-pole combination.

• Journal of information and communication convergence engineering
• /
• v.11 no.3
• /
• pp.153-166
• /
• 2013

A hierarchical time division multiple access (HTDMA) medium access control (MAC) protocol is proposed for clustered mobile underwater acoustic networks. HTDMA consists of two TDMA scheduling protocols (i.e., TDMA1 and TDMA2) in order to accommodate mobile underwater nodes (UNs). TDMA1 is executed among surface stations (e.g., buoys) using terrestrial wireless communication in order to share mobility information obtained from UNs which move cluster to cluster. TDMA2 is executed among UNs, which send data to their surface station as a cluster head in one cluster. By sharing mobility information, a surface station can instantaneously determine the number of time slots in a TDMA2 frame up to as many as the number of UNs which is currently residing in its cluster. This can enhance delay and channel utilization performance by avoiding the occurrence of idle time slots. We analytically investigate the delay of HTDMA, and compare it with that of wellknown contention-free and contention-based MAC protocols, which are TDMA and Slotted-ALOHA, respectively. It is shown that HTDMA remarkably decreases delay, compared with TDMA and Slotted-ALOHA.