• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10A
• /
• pp.838-846
• /
• 2003

In Bluetooth networks, the scatternet is defined as the internetworking of multiple piconets. Currently, Bluetooth standardization does not include the formation issue of scatternet by piconets. The existing formation algorithms of scatternet do not support the features of ad-hoc networks, which cause the performance degradation of systems when the nodes have certain degree of mobility. Therefore, as the formation of scatternet gets complicated, the throughput is lowered and the delay increases due to the inefficient architectural problems. In this paper, we propose the distributed formation scheme for bluetooth in scatternet, in which the nodes are spread out to form scatternet. Simulation results show that the proposed algorithm outperforms the conventional schemes.

• KIEAE Journal
• /
• v.17 no.5
• /
• pp.87-94
• /
• 2017

Purpose: Prefabricated modular space such as a container construction has recently been interested unlike the conventional construction method, and their scale have expanded from small buildings such as cafes, houses and pensions to shopping centers, complex cultural spaces where shows and exhibitions are possible doing. In this way, the container is in the spotlight as an advantage such as mobility, flexibility, correspondence, economic efficiency, recyclability and so on. However, there are no specific guidelines and standard design methods in aspects of structural calculation, functional insulation and environmental configuration. Therefore, as the first step to resolve these problems, this study has focused on the field of environmental performance of container construction, presented appropriate guidelines and searched ways to improve performances. Method: For this study, seven types of the modular building were chosen and compared, and their energy performances have been analyzed using a proven simulation tool. Essential methodology and terminology were examined to estimate and judge their efficiency. Result: In conclusion, energy performances depend on specific configuration of combined unit spaces, and design guidelines cold be set up for promoting their use in the practical field.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.1
• /
• pp.83-104
• /
• 2011

Mobile grid is a combination of grid computing and mobile computing to build grid systems in a wireless mobile environment. The development of network technology is assisting in realizing mobile grid. Mobile grid based on established grid infrastructures needs effective resource management and reliable job scheduling because mobile grid utilizes not only static grid resources but also dynamic grid resources with mobility. However, mobile devices are considered as unavailable resources in traditional grids. Mobile resources should be integrated into existing grid sites. Therefore, this paper presents a mobile grid middleware interconnecting existing grid infrastructures with mobile resources and a mobile service agent installed on the mobile resources. This paper also proposes a mobile resource reliability-based job scheduling model in order to overcome the unreliability of wireless mobile devices and guarantee stable and reliable job processing. In the proposed job scheduling model, the mobile service agent calculates the mobile resource reliability of each resource by using diverse reliability metrics and predicts it. The mobile grid middleware allocated jobs to mobile resources by predicted mobile resource reliability. We implemented a simulation model that simplifies various functions of the proposed job scheduling model by using the DEVS (Discrete Event System Specification) which is the formalism for modeling and analyzing a general system. We also conducted diverse experiments for performance evaluation. Experimental results demonstrate that the proposed model can assist in improving the performance of mobile grid in comparison with existing job scheduling models.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3889-3903
• /
• 2017

Fast and accurate localization of randomly deployed nodes is required by many applications in wireless sensor networks (WSNs). However, mobile nodes localization in WSNs is more difficult than static nodes localization since the nodes mobility brings more data. In this paper, we propose a Range-based Monte Carlo Box (RMCB) algorithm, which builds upon the Monte Carlo Localization Boxed (MCB) algorithm to improve the localization accuracy. This algorithm utilizes Received Signal Strength Indication (RSSI) ranging technique to build a sample box and adds a preset error coefficient in sampling and filtering phase to increase the success rate of sampling and accuracy of valid samples. Moreover, simplified Particle Swarm Optimization (sPSO) algorithm is introduced to generate new samples and avoid constantly repeated sampling and filtering process. Simulation results denote that our proposed RMCB algorithm can reduce the location error by 24%, 14% and 14% on average compared to MCB, Range-based Monte Carlo Localization (RMCL) and RSSI Motion Prediction MCB (RMMCB) algorithm respectively and are suitable for high precision required positioning scenes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.5
• /
• pp.2029-2043
• /
• 2018

In this paper, we propose a novel inter-cell handover approach from a new perspective in dense Heterogeneous and Small Cell Networks (HetSNets). We first devise a cell selection mechanism to choose a proper candidate small cell for the UEs that tend to implement inter-small cell handover (ICH). By exploiting the property of a typical non-concentric circle, i.e., circle of Apollonius, we then propose a novel analytical method for modeling inter-cell handover regions and present mathematical derivation to prove that the inter-small cell handover issues fit the property of the circle of Apollonius. We design an inter-cell handover algorithm (ICHA) by means of our proposed handover model to dynamically configure hysteresis margin and properly implement handover decision in terms of UE's mobility. Simulation results demonstrate that the proposed ICHA yields lower call drop rate and radio link failure rate than the conventional methods and hence achieve high Handover Performance Indicator (HPI).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.383-403
• /
• 2021

With the development of mobile edge computing (MEC), some late-model application technologies, such as self-driving, augmented reality (AR) and traffic perception, emerge as the times require. Nevertheless, the high-latency and low-reliability of the traditional cloud computing solutions are difficult to meet the requirement of growing smart cars (SCs) with computing-intensive applications. Hence, this paper studies an efficient offloading decision and resource allocation scheme in collaborative vehicular edge computing networks with multiple SCs and multiple MEC servers to reduce latency. To solve this problem with effect, we propose a context-aware offloading strategy based on differential evolution algorithm (DE) by considering vehicle mobility, roadside units (RSUs) coverage, vehicle priority. On this basis, an autoregressive integrated moving average (ARIMA) model is employed to predict idle computing resources according to the base station traffic in different periods. Simulation results demonstrate that the practical performance of the context-aware vehicular task offloading (CAVTO) optimization scheme could reduce the system delay significantly.

• Journal of IKEEE
• /
• v.24 no.4
• /
• pp.1017-1021
• /
• 2020

In the V2X communications, each vehicle periodically broadcasts a message, called a beacon, so that its neighbor vehicles can accurately predict the near-future positions of the sending vehicle. In particular, the mobility-adaptive beacon broadcast (MAB2) scheme keeps the tracking error of a sending vehicle below a fixed threshold within a few consecutive beacon losses. In this paper, we present a random-early beacon broadcast (REB2) scheme that addresses the beacon aging problem of the MAB2 scheme. The simulation results show that, for a neighbor vehicle within 100 m distance, the tracking failure probability of REB2 scheme can be reduced to less than 1/10 of that of MAB2 scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4584-4599
• /
• 2021

In IEEE 802.11p-based wireless access in vehicular environments (WAVE) communication systems, channel estimation (CE) is one of the important issues to provide stable communication service. It is hard to apply conventional CE schemes based on data pilot to real systems, because error propagation occurs in high mobility and modulation order environments, resulting in degrading the CE performance. In this paper, we propose one data pilot using multiple receive antennas (ODPM) CE scheme based on the weighted sum using update matrix (WSUM) with time-domain averaging (TDA) to overcome this problem. Within the process of WSUM-TDA in the proposed scheme, the maximum ratio combining (MRC) technique is applied so as to create more accurate one data pilot. Moreover, a new reliability test criterion is proposed as the fashion of utilizing MRC, which makes it possible to apply selective TDA that guarantees performance improvement. In simulation results, the packet error rate (PER) performance of the proposed ODPM is compared with that of conventional CE methods and its superiority is demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.12
• /
• pp.4364-4384
• /
• 2021

The dynamic network state and the mobility of the terminals make the service function chain (SFC) orchestration mechanisms based on static and deterministic assumptions hard to be applied in SDN/NFV mobile edge computing networks. Designing dynamic and online SFC orchestration mechanism can greatly improve the execution efficiency of compute-intensive and resource-hungry applications in mobile edge computing networks. In order to increase the overall profit of service provider and reduce the resource cost, the system running time is divided into a sequence of time slots and a dynamic orchestration scheme based on an improved column generation algorithm is proposed in each slot. Firstly, the SFC dynamic orchestration problem is formulated as an integer linear programming (ILP) model based on layered graph. Then, in order to reduce the computation costs, a column generation model is used to simplify the ILP model. Finally, a two-stage heuristic algorithm based on greedy strategy is proposed. Four metrics are defined and the performance of the proposed algorithm is evaluated based on simulation. The results show that our proposal significantly provides more than 30% reduction of run time and about 12% improvement in service deployment success ratio compared to the Viterbi algorithm based mechanism.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2606-2626
• /
• 2022

In this paper, a unmanned aerial vehicle (UAV) access deployment algorithm is proposed, which is based on an improved virtual force model to solve the poor coverage quality of UAVs caused by limited number of UAVs and random mobility of users in the deployment process of UAV base station. First, the UAV-adapted Harris Hawks optimization (U-AHHO) algorithm is proposed to maximize the coverage of users in a given hotspot. Then, a virtual force improvement model based on user perception (UP-VFIM) is constructed to sense the mobile trend of mobile users. Finally, a UAV motion algorithm based on multi-virtual force sharing (U-MVFS) is proposed to improve the ability of UAVs to perceive the moving trend of user equipments (UEs). The UAV independently controls its movement and provides follow-up services for mobile UEs in the hotspot by computing the virtual force it receives over a specific period. Simulation results show that compared with the greedy-grid algorithm with different spacing, the average service rate of UEs of the U-AHHO algorithm is increased by 2.6% to 35.3% on average. Compared with the baseline scheme, using UP-VFIM and U-MVFS algorithms at the same time increases the average of 34.5% to 67.9% and 9.82% to 43.62% under different UE numbers and moving speeds, respectively.