• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1975-1988
• /
• 2019

Short-term traffic flow prediction plays an important role in intelligent transportation systems (ITS) in areas such as transportation management, traffic control and guidance. For short-term traffic flow regression predictions, the main challenge stems from the non-stationary property of traffic flow data. In this paper, we design an ensemble cascading prediction framework based on extremely randomized trees (extra-trees) using a boosting technique called EET to predict the short-term traffic flow under non-stationary environments. Extra-trees is a tree-based ensemble method. It essentially consists of strongly randomizing both the attribute and cut-point choices while splitting a tree node. This mechanism reduces the variance of the model and is, therefore, more suitable for traffic flow regression prediction in non-stationary environments. Moreover, the extra-trees algorithm uses boosting ensemble technique averaging to improve the predictive accuracy and control overfitting. To the best of our knowledge, this is the first time that extra-trees have been used as fundamental building blocks in boosting committee machines. The proposed approach involves predicting 5 min in advance using real-time traffic flow data in the context of inherently considering temporal and spatial correlations. Experiments demonstrate that the proposed method achieves higher accuracy and lower variance and computational complexity when compared to the existing methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.3000-3022
• /
• 2019

Full-duplex (FD) technologies enable wireless nodes to simultaneously transmit and receive signal using the same frequency-band. The FD modes could improve their physical layer throughputs. However, in the wireless ad hoc networks, the FD communications also produce new interference risks. On the one hand, the interference ranges (IRs) of the nodes are enlarged when they work in the FD mode. On the other hand, for each FD pair, the FD communication may cause the potential hidden terminal problems to appear around the both sides. In this paper, to avoid the interference risks, we first model the IR of each node when it works in the FD mode, and then analyze the conditions to be satisfied among the transmission ranges (TRs), carrier-sensing ranges (CSRs), and IRs of the FD pair. Furthermore, in the media access control (MAC) layer, we propose a specific method and protocol for collision avoidance. Based on the modified Omnet++ simulator, we conduct the simulations to validate and evaluate the proposed FD MAC protocol, showing that it can reduce the collisions effectively. When the hidden terminal problem is serious, compared with the existing typical FD MAC protocol, our protocol can increase the system throughput by 80%~90%.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권6호
• /
• pp.2838-2858
• /
• 2019

Traditional channel models for vehicle-to-vehicle (V2V) communication usually assume fixed velocity in static scattering environment. In the realistic scenarios, however, time-variant velocity for V2V results in non-stationary statistical properties of wireless channels. Dynamic scatterers with random velocities and directions have been always utilized to depict the non-stationary statistical properties of the channel. In this paper, a non-stationary geometry-based cooperative scattering channel model is proposed for multiple-input multiple-output (MIMO) V2V communication systems, where a birth-death process is used to capture the appearance and disappearance dynamic properties of moving scatterers that reflect the time-variant time correlation and Doppler spectrum characteristics. Moreover, our model has more straight and concise to study the impact of the vehicular traffic density on channel characteristics and thus avoid complicated procedure in deriving the analytical expressions of the channel parameters and functions. The numerical results validate our analysis and demonstrate that setting important parameters of our model can appropriately build up more purposeful measurement campaigns in the future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권7호
• /
• pp.2650-2667
• /
• 2021

In this paper, we derive the expression of the cache hitting probability with random caching policy and propose the joint optimization algorithm based on difference of convex algorithm (DCA) in the three-tier caching heterogeneous cellular network assisted by macro base stations, helpers and users. Under the constraint of the caching capacity of caching devices, we establish the optimization problem to maximize the cache hitting probability of the network. In order to solve this problem, a convex function is introduced to convert the nonconvex problem to a difference of convex (DC) problem and then we utilize DCA to obtain the optimal caching probability of macro base stations, helpers and users for each content respectively. Simulation results show that when the density of caching devices is relatively low, popular contents should be cached to achieve a good performance. However, when the density of caching devices is relatively high, each content ought to be cached evenly. The algorithm proposed in this paper can achieve the higher cache hitting probability with the same density.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2007년도 가을 학술발표논문집 Vol.34 No.2 (D)
• /
• pp.514-519
• /
• 2007

본 논문에서는 최근 IETF에서 표준화되고 있는 네트워크 기반 IPv6 이동성 프로토콜인 Proxy Mobile IPv6 (PMIPv6)를 IEEE 802.16e 네트워크에 적용할 때에 고속으로 핸드오버를 처리함과 동시에 패킷 버퍼링을 통하여 패킷의 손실과 순서의 어긋남 문제를 해결하여 단말 사용자가 서로 다른 IP 네트워크를 옮겨다니더라도 그에 따르는 패킷손실이나 세션 끊김 현상을 최소화하는 기법을 제안한다.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 1999년도 KOBA 방송기술 워크샵 KOBA Broadcasting Technology Workshop
• /
• pp.23.1-28
• /
• 1999

InterSpaceTM is an advanced networked virtual reality system that presents shared three-dimensional computer graphics (CG) worlds via the Internet where multiple users can enjoy synchronous communications with voice, video and text. Users can control their avatars as a surrogate interface. In InterSpace users can walk around and interact with other people and interact with contents. In this paper, we describe the function-distributed architecture used in InterSpace. The architecture enables flexible configuration of server functions and load distribution. It also allows users to select media and client PCs to switch servers dynamically.

• Journal of information and communication convergence engineering
• /
• 제11권4호
• /
• pp.253-257
• /
• 2013

Mobile computers can process large amounts of data at high speeds, and it is feasible and easy to implement a remote monitoring system utilizing mobile computers. Because of their portability and convenience, these computers have been employed in various research areas to develop such monitoring systems. Existing monitoring system is a bit difficult to real time monitoring the scattered offshore facilities. So this paper compensate the existing system by using mobile computers such as a tablet PC-based monitoring system. Also, the scattered offshore facilities can be monitored in real-time through the tablet PC. The developed monitoring system is a fully Internet-based monitoring platform that enables one to monitor and control remote oceanic applications at any time and any place where it is possible to access the Internet. It can be applied to many oceanic applications as well as the unmanned systems and remote monitoring systems on land.

• Journal of Power Electronics
• /
• 제10권6호
• /
• pp.635-642
• /
• 2010

The paper presents a multimedia educational program of DC servo drives for distant learning with a special emphasis on sliding mode control. The program contains of three parts: animation, simulation and internet based measurement. The animation program explains the operation of DC motors, gives its time- and frequency-domain equations, transfer functions and the theoretical background necessary for controller design for DC servo motors. The simulation model of the DC servo motor and the controller can be designed by the students based on the animation program. The students can also test their controllers through the internet based measurement, which is the most important part from engineering point of view. After the measurements are executed, the students can download the measured data and compare them to the simulation results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권2호
• /
• pp.428-439
• /
• 2011

The main challenge in building efficient broadcast systems is to encrypt messages with short ciphertexts. In this paper, we present a new construction based on the identity. Our construction contains the desirable features, such as constant size ciphertexts and private keys, short public keys and not fixing the total number of possible users in the setup. In addition, the proposed scheme achieves the full security which is stronger than the selective-identity security. Furthermore we show that the proof of security does not rely on the random oracles. To the best our knowledge, it is the first efficient scheme that is full security and achieves constant size ciphertexts and private keys which solve the trade-off between the ciphertext size and the private key size.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권2호
• /
• pp.871-891
• /
• 2019

Visual tracking is a challenging task that needs learning an effective model to handle the changes of target appearance caused by factors such as pose variation, illumination change, occlusion and motion blur. In this paper, a novel tracking algorithm based on weighted local sub-space reconstruction error is presented. First, accounting for the appearance changes in the tracking process, a generative weight calculation method based on structural reconstruction error is proposed. Furthermore, a template update scheme of occlusion-aware is introduced, in which we reconstruct a new template instead of simply exploiting the best observation for template update. The effectiveness and feasibility of the proposed algorithm are verified by comparing it with some state-of-the-art algorithms quantitatively and qualitatively.