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

Wireless mobile communication systems in subway tunnels have been widely researched these years, due to increased demand for the communication applications. As a result, an accurate model is essential to effectively evaluate the communication system performance. Thus, a neoteric three-dimensional (3D) geometry-based stochastic model (GBSM) is proposed for the massive multiple-input multiple-output (MIMO) fading channels in tunnel environment. Furthermore, the statistical properties of the channel such as space-time correlation, amplitude and phase probability density are analyzed and compared with those of the traditional two-dimensional (2D) model by numerical simulations. Finally, the ergodic capacity is investigated based on the proposed model. Numerical results show that the proposed model can describe the channel in tunnels more practically.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3551-3567
• /
• 2016

The Low Earth Orbit satellite network has the unique characteristics of the non-uniform and time-variant traffic load distribution, which often causes severe link congestion and thus results in poor performance for delay-sensitive flows, especially when the network is heavily loaded. To solve this problem, a novel adaptive routing algorithm, referred to as the delay-oriented adaptive routing algorithm (DOAR), is proposed. Different from current reactive schemes, DOAR employs Destination-Sequenced Distance-Vector (DSDV) routing algorithm, which is a proactive scheme. DSDV is extended to a multipath QoS version to generate alternative routes in active with real-time delay metric, which leads to two significant advantages. First, the flows can be timely and accurately detected for route adjustment. Second, it enables fast, flexible, and optimized QoS matching between the alternative routes and adjustment requiring flows and meanwhile avoids delay growth caused by increased hop number and diffused congestion range. In addition, a retrospective route adjustment requesting scheme is designed in DOAR to enlarge the alternative routes set in the severe congestion state in a large area. Simulation result suggests that DOAR performs better than typical adaptive routing algorithms in terms of the throughput and the delay in a variety of traffic intensity.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4305-4323
• /
• 2014

In this paper, we investigate the degrees of freedom (DOF) of the Y channel consisting of three single-antenna users and a two-antenna common access relay, where each user intends to exchange independent messages with the other two users with the assistance of the relay. We show that the DOF of this particular scenario is 1.5. In order to prove this result, we firstly derive a DOF upper bound based on cut-set bound by allowing cooperation among users, which shows that the total DOF is upper bounded by 1.5. Then we propose a novel transmission scheme based on asymmetric signal space alignment (ASSA) to demonstrate the achievability of the upper bound. Theoretical evaluation and numerical results confirm that the upper bound can be achieved by utilizing ASSA, which also proves the optimality of the ASSA-based scheme in terms of DOF. Combining the upper bound and achievability, we conclude that the exact DOF is 1.5. Moreover, we present a novel iterative joint beamforming optimization (I-JBO) algorithm to further improve the sum rate. Numerical simulations have been provided to demonstrate the convergence speed and performance advantage of the I-JBO algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권12호
• /
• pp.4345-4363
• /
• 2021

Deep Learning as a Service (DLaaS), utilizing the cloud-based deep neural network models to provide customer prediction services, has been widely deployed on mobile cloud computing (MCC). Such services raise privacy concerns since customers need to send private data to untrusted service providers. In this paper, we devote ourselves to building an efficient protocol to classify users' images using the convolutional neural network (CNN) model trained and held by the server, while keeping both parties' data secure. Most previous solutions commonly employ homomorphic encryption schemes based on Ring Learning with Errors (RLWE) hardness or two-party secure computation protocols to achieve it. However, they have limitations on large communication overheads and costs in MCC. To address this issue, we present LeHE4SCNN, a scalable privacy-preserving and communication-efficient framework for CNN-based DLaaS. Firstly, we design a novel low-expansion rate homomorphic encryption scheme with packing and unpacking methods (LeHE). It supports fast homomorphic operations such as vector-matrix multiplication and addition. Then we propose a secure prediction framework for CNN. It employs the LeHE scheme to compute linear layers while exploiting the data shuffling technique to perform non-linear operations. Finally, we implement and evaluate LeHE4SCNN with various CNN models on a real-world dataset. Experimental results demonstrate the effectiveness and superiority of the LeHE4SCNN framework in terms of response time, usage cost, and communication overhead compared to the state-of-the-art methods in the mobile cloud computing environment.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.559-562
• /
• 1999

In this paper, we developed on internet based assembly information display system for the blind. The system is consist of hardware and software. The hardware is consist of a voice synthesis device and a tactile display for character information, and the software is consist of internet web browser for the blind and braille program. The tactile-device system consists of a control unit, pin array, pin generator, serial port, and a power supply. The pin exerted by a electromagnetic method, solenoid. The internet web browser separates the character and image from internet web page, and character information in the web page is converted to braille and fed to sound system. Also the image in the web page can be printed developed tactile display. As the results of experiment, the blind could access the internet web site by using this system and understand various internet information.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 1999년도 Proceedings of International Symposium on Remote Sensing
• /
• pp.165-170
• /
• 1999

Previous technology of remote sensing was focused on analyzing raster image and gaining information through image processing. But now it has extended to diverse fields like automatic map generation, material exploitation or monitoring environmental changes with effort to utilizing practical usage. And with rapid expansion of information exchange on Internet and high-speed network, the demand of public which want to utilize remotely sensed image has been increased. This makes growth of service on acquisition and processing remotely sensed image. GeoNet is a Java-based remotely sensed image processing system. It is based on Java object-oriented paradigm and features cross-platform, web-based execution and extensibility to client/server remotely sensed image processing model. Remotely sensed image processing software made by Java programming language can suggest alternatives to meet readily demand on remotely sensed image processing in proportion to increase of remotely sensed data. In this paper, we introduce GeoNet and explain its architecture.

• 한국컴퓨터정보학회논문지
• /
• 제22권9호
• /
• pp.91-97
• /
• 2017

IoT (Internet of Things) systems are based on heterogeneous hardware systems of different types of devices interconnected each other, ranging from miniaturized and low-power wireless sensor node to cloud servers. These IoT systems composed of heterogeneous hardware utilize data sets collected from a particular set of sensors or control designated actuators when needed using open APIs created through abstraction of devices' resources associated to service applications. However, previously existing IoT services have been usually developed based on vertical platforms, whose sharing and exchange of data is limited within each industry domain, for example, healthcare. Such problem is called 'data silo', and considered one of crucial issues to be solved for the success of establishing IoT ecosystems. Also, IoT services may need to dynamically organize their services according to the change of status of connected devices due to their mobility and dynamic network connectivity. We propose a way of dynamically composing IoT services under the concept of WoT (Web of Things) where heterogeneous devices across different industries are fully integrated into the Web. Our approach allows developers to create IoT services or mash them up in an efficient way using Web objects registered into multiple standardized horizontal IoT platforms where their resources are discoverable and accessible. A Web-based service composition tool is developed to evaluate the practical feasibility of our approach under real-world service development.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권9호
• /
• pp.4087-4107
• /
• 2016

The current cloud computing paradigm is still vulnerable to a significant number of system failures. The increasing demand for fault tolerance and resilience in a cost-effective and device-independent manner is a primary reason for creating an effective means to address system dependability and availability concerns. This paper focuses on online failure prediction for cloud computing systems using system runtime data, which is different from traditional tolerance techniques that require an in-depth knowledge of underlying mechanisms. A 'failure prediction' approach, based on Cloud Theory (CT) and the Hidden Markov Model (HMM), is proposed that extends the HMM by training with CT. In the approach, the parameter ω is defined as the correlations between various indices and failures, taking into account multiple runtime indices in cloud computing systems. Furthermore, the approach uses multiple dimensions to describe failure prediction in detail by extending parameters of the HMM. The likelihood and membership degree computing algorithms in the CT are used, instead of traditional algorithms in HMM, to reduce computing overhead in the model training phase. Finally, the results from simulations show that the proposed approach provides very accurate results at low computational cost. It can obtain an optimal tradeoff between 'failure prediction' performance and computing overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4552-4567
• /
• 2014

A (n,t,n) secret sharing scheme is to share a secret among n group members, where each member also plays a role of a dealer,and any t shares can be used to recover the secret. In this paper, we propose a strong (k,t,n) verifiable multi-secret sharing scheme, where any k out of n participants operate as dealers. The scheme realizes both threshold structure and adversary structure simultaneously, and removes a trusted third party. The secret reconstruction phase is performed using an additive homomorphism for decreasing the storage cost. Meanwhile, the scheme achieves the pre-verification property in the sense that any participant doesn't need to reveal any information about real master shares in the verification phase. We compare our proposal with the previous (n,t,n) secret sharing schemes from the perspectives of what kinds of access structures they achieve, what kinds of functionalities they support and whether heavy storage cost for secret share is required. Then it shows that our scheme takes the following advantages: (a) realizing the adversary structure, (b) allowing any k out of n participants to operate as dealers, (c) small sized secret share. Moreover, our proposed scheme is a favorable candidate to be used in many applications, such as secure multi-party computation and privacy preserving data mining, etc.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권9호
• /
• pp.3016-3033
• /
• 2014

The downlink performance of distributed antenna systems (DAS) with antennas selection is investigated in Rayleigh fading multicell environment, and the corresponding system capacity and bit error rate (BER) analysis are presented. Based on the moment generating function, the probability density function (PDF) and cumulative distribution function (CDF) of the effective signal to interference plus noise ratio (SINR) of the system are first derived, respectively. Then, with the available CDF and PDF, the accurate closed-form expressions of average channel capacity and average BER are further derived for exact performance evaluation. To simplify the expression, a simple closed-form approximate expression of average channel capacity is obtained by means of Taylor series expansion, with the performance results close to the accurate expression. Besides, the system outage capacity is analyzed, and an accurate closed-form expression of outage capacity probability is derived. These theoretical expressions can provide good performance evaluation for DAS downlink. It can be shown by simulation that the theoretical analysis and simulation are consistent, and DAS with antenna selection outperforms that with conventional blanket transmission. Moreover, the system performance can be effectively improved as the number of receive antennas increases.