• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.8 no.2
• /
• pp.86-100
• /
• 2015

Cloud computing is a computing term that evolved in the late 2000s, based on utility and consumption of computer resources. Google say that "Cloud computing involves deploying groups of remote servers and software networks that allow different kinds of data sources be uploaded for real time processing to generate computing results without the need to store processed data on the cloud. Cloud computing relies on sharing of resources to achieve coherence and economies of scale, similar to a utility (like the electricity grid) over a network. At the foundation of cloud computing is the broader concept of converged infrastructure and shared services. Cloud computing, or in simpler shorthand just "the cloud", also focuses on maximizing the effectiveness of the shared resources." The cloud service is a smart and/or intelligent service to save private files in any device, anytime, anywhere. Dropbox, OAuth, PAClous are required that the accumulated user's data are archives with cloud service. Currently we suggest an implementation technique to process many tasks to the cloud server with a thread pooling. Thread pooling is one of efficient implementating technique for client and service environment. In this paper, to present the implementation technique we suggest three diagrams in the consideration of software engineering.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.22 no.3
• /
• pp.527-533
• /
• 2018

Recently, the device-to-device (D2D) communication has been conceived as the key technology for the next-generation mobile communication systems. The neighbor discovery in which the nearby users are found, is essential for the proper operation of the D2D communication. In this paper, we propose new neighbor discovery scheme based on deep learning technology which has gained a lot of attention recently. In the proposed scheme, the neighboring users can be found using the uplink pilot transmission of users only, unlike conventional neighbor discovery schemes in which direct pilot communication among users is required, such that the signaling overhead can be greatly reduced in our proposed scheme. Moreover, the neighbors with different proximity can also be classified accordingly which enables more accurate neighbor discovery compared to the conventional schemes. The performance of our proposed scheme is verified through the tensorflow-based computer simulations.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.56-70
• /
• 2005

The results of location-dependent queries(LDQ) generally depend on the current locations of query issuers. Many mechanisms, e.g. broadcast scheme, hoarding, or racking policy, have been developed to improve the system peformance and provide better services, which are specialized for LDQs. Considering geographical adjacency of data and characteristics oi target area, caching policy and broadcast scheme affect the overall performance in LDQ. For this reason, we propose both the caching policy and broadcast scheme, which these features are reflected in. Based on the adjacency of data in LDQ, our broadcast scheme use Hilbert curve to cluster data. Moreover, in order to develop the caching policy suitable for LDQ on urban area, we apply the moving distance of a MH(Mobile Host) to our caching policy We evaluate the performance of the caching policy measuring the workload of MHs and the correctness of LDQ results and the performance of the broadcast scheme measuring the average setup-time of MHs in our experiments. Finally, we expect that our caching policy Provides more correct answers when executing LDQ in focal cache and leads significant improvement of the performance of MHs. It also seems quite probable that our broadcast scheme leads improvement of battery life of the MH.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.2
• /
• pp.47-56
• /
• 2015

In an energy saving server cluster environment, the power modes of servers are controlled according to load situation, that is, by making ON only minimum number of servers needed to handle current load while making the other servers OFF. This algorithm works well under normal circumstances, but does not guarantee QoS under abnormal circumstances such as sharply rising or falling loads. This is because the number of ON servers cannot be increased immediately due to the time delay for servers to turn ON from OFF. In this paper, we propose a new prediction algorithm of the power consumption for improving QoS under not only normal but also abnormal circumstances. The proposed prediction algorithm consists of two parts: prediction based on the conventional time series analysis and prediction adjustment based on trend analysis. We performed experiments using 15 PCs and compared performance for 4 types of conventional time series based prediction methods and their modified methods with our prediction algorithm. Experimental results show that Exponential Smoothing with Trend Adjusted (ESTA) and its modified ESTA (MESTA) proposed in this paper are outperforming among 4 types of prediction methods in terms of normalized QoS and number of good reponses per power consumed, and QoS of MESTA proposed in this paper is 7.5% and 3.3% better than that of conventional ESTA for artificial load pattern and real load pattern, respectively.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.2
• /
• pp.57-64
• /
• 2015

At the case of peak threshold algorithm, 3-axes data should sample step data over 20 Hz to get sufficient accuracy. But most of the digital sensors like 3-axes accelerometer have very low sampling rate caused by low data communication speed on limited SPI or $I^2C$ bandwidth of the low-cost MPU for ubiquitous devices. If the data transfer rate of the 3-axes accelerometer is getting slow, the sampling rate also slows down and it finally degrades the data accuracy. In this study, we proved there is a distinct functional relation between the sampling rate and threshold on the peak threshold step detection algorithm under the 20Hz frequency, and made a threshold function through the experiments. As a result of experiments, when we apply threshold value from the threshold function instead of fixed threshold value, the step detection error rate can be lessen about 1.2% or under. Therefore, we can suggest a peak threshold based new step detection algorithm with threshold function and it can enhance the accuracy of step detection and step count. This algorithm not only can be applied on a digital step counter design, but also can be adopted any other low-cost ubiquitous sensor devices subjected on low sampling rate.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.7
• /
• pp.159-172
• /
• 2016

This paper presents a novel algorithm for searching evacuation paths in indoor disaster environments. The proposed method significantly improves the time complexity to find the paths to the evacuation exit by introducing a light-weight Disaster Evacuation Graph (DEG) for a building in terms of the size of the graph. With the DEG, the method also considers load balancing and bottleneck capacity of the paths to the evacuation exit simultaneously. The behavior of the algorithm consists of two phases: horizontal tiering (HT) and vertical tiering (VT). The HT phase finds a possible optimal path from anywhere of a specific floor to the evacuation stairs of the floor. Thus, after finishing the HT phases of all floors in parallel the VT phase begins to integrate all results from the previous HT phases to determine a evacuation path from anywhere of a floor to the safety zone of the building that could be the entrance or the roof of the building. It should be noted that the path produced by the algorithm. And, in order to define the range of graph to process, tiering scheme is used. In order to test the performance of the method, computing times and evacuation times are compared to the existing path searching algorithms. The result shows the proposed method is better than the existing algorithms in terms of the computing time and evacuation time. It is useful in a large-scale building to find the evacuation routes for evacuees quickly.

• KIPS Transactions on Computer and Communication Systems
• /
• v.3 no.8
• /
• pp.261-270
• /
• 2014

As Internet traffic increases recently, much effort has been put on improving the performance of a web server. In addition to hardware side solutions such as replacement by high-end hardware or expansion of the number of servers, there are software side solutions to improve performance. Recent studies on these software side solutions have been actively performed. In this paper, we identify performance degradation problems occurring in a conventional TCP networking reception process and propose a way to solve them. We improve performance by combining three kinds of existing methods for Linux Networking Performance Improvement and two kinds of newly proposed methods in this paper. The three existing methods include 1) an allocation method of a packet flow to a core in a multi-core environment, 2) ITR(Interrupt Throttle Rate) method to control excessive interrupt requests, and 3) sk_buff data structure recycling. The two newly proposed methods are fd data structure recycling and epoll_event data structure recycling. Through experiments in a web server environment, we verify the effect of our two proposed methods and its combination with the three existing methods for performance improvement, respectively. We use three kinds of web servers: a simple web server, Lighttpd generally used in Linux, and Apache. In a simple web server environment, fd data structure recycling and epoll_event data structure recycling bring out performance improvement by about 7 % and 6%, respectively. If they are combined with the three existing methods, performance is improved by up to 40% in total. In a Lighttpd and an Apache web server environment, the combination of five methods brings out performance improvement by up to 36% and 20% in total, respectively.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.12
• /
• pp.455-462
• /
• 2016

Wireless sensor networks have been researched to gather data about events on sensor fields from sources at sinks. Multipath routing is one of attractive approaches to reliably send data against the problem of frequent breakages on paths from sources to sinks due to node and link failures. As mobile events such as humans, animals, and vehicles are considered, sources may be continuously generated according to the movement of the mobile event. Thus, mobile events provide new challenging issue in multipath routing. However, the research on multipath routing mainly focus on both efficient multipath construction from sources to static sinks and fast multipath reconstruction against path breakages. Accordingly, the previous multipath routing protocols request each source continuously generated by a mobile event to construct individual multipath from the source to sinks. This induces the increase of multipath construction cost in the previous protocols in proportion to the number of source. Therefore, we propose efficient multipath routing protocol for supporting continuous sources generated by mobile events. In the proposed protocol, new source efficiently reconstructs its multipath by exploiting the existing multipath of previous sources. To do this, the proposed protocol selects one among three reconstruction methods: a local reconstruction, a global partial one, and a global full one. For a selection decision, we provide an analytical energy consumption cost model that calculates the summation of both the multipath reconstruction cost and the data forwarding cost. Simulation results show that the proposed protocol has better performance than the previous protocol to provide multipath routing for mobile events.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.12
• /
• pp.447-454
• /
• 2016

The research on multipath routing has been studied to solve the problem of frequent path breakages due to node and link failures and to enhance data delivery reliability in wireless sensor networks. In the multipath routing, mobile sinks such as soldiers in battle fields and rescuers in disaster areas bring about new challenge for handling their mobility. The sink mobility requests new multipath construction from sources to mobile sinks according to their movement path. Since mobile sinks have continuous mobility, the existing multipath can be exploited to efficiently reconstruct to new positions of mobile sinks. However, the previous protocols do not address this issue. Thus, we proposed an efficient multipath reconstruction protocol called LGMR for mobile sinks in wireless sensor networks. The LGMR address three multipath reconstruction methods based on movement types of mobile sinks: a single hop movement-based local multipath reconstruction, a multiple hop movement-based local multipath reconstruction, and a multiple hop movement-based global multipath reconstruction. Simulation results showed that the LGMR has better performance than the previous protocol in terms of energy consumption and data delivery delay.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.4
• /
• pp.155-162
• /
• 2013

Routing protocol in ad hoc mobile networking has been an active research area in recent years. However, the environments of ad hoc network tend to have vulnerable points from attacks, because ad hoc mobile network is a kind of wireless network without centralized authentication or fixed network infrastructure such as base stations. Also, existing routing protocols that are effective in a wired network become inapplicable in ad hoc mobile networks. To address these issues, several secure routing protocols have been proposed: SAODV and SRPTES. Even though our protocols are intensified security of networks than existing protocols, they can not deal fluidly with frequent changing of wireless environment. Moreover, demerits in energy efficiency are detected because they concentrated only safety routing. In this paper, we propose an energy efficient secure routing protocol for various ad hoc mobile environment. First of all, we provide that the nodes distribute security information to reliable nodes for secure routing. The nodes constitute tree-structured with around nodes for token escrow, this action will protect invasion of malicious node through hiding security information. Next, we propose multi-path routing based security level for protection from dropping attack of malicious node, then networks will prevent data from unexpected packet loss. As a result, this algorithm enhances packet delivery ratio in network environment which has some malicious nodes, and a life time of entire network is extended through consuming energy evenly.