• Proceedings of the Korean Geotechical Society Conference
• /
• 2010.09a
• /
• pp.638-645
• /
• 2010

This study introduces a reinforcement work case using Twin-Jet Method. The area is located behind the abutment of the bridges built on soft clay along the $\bigcirc\bigcirc$ Express Highway. Its foundation was constructed by installing EPS blocks on the original ground to reduce the embankment load under the highway. However, the ground deformation has continuously occurred due to the settlement of the foundation soft cohesive soils. The amounts of subsidences at the surface turned out to be 20~30.0mm, After the pavement patch work on April 23, 2009, a drastic subsidence occurred together with 10mm swell, For this reason, Twin-Jet grout column construction was applied by passing through the EPS banking blocks without closing traffic flows on the express highway. The outcomes of core sample tests after reinforcing the ground turned out to be TCR 92.5%, RQD 64.6% and unconfined compressive strength 2.3~8.6Mpa. The test results showed that the condition of the ground foundation had improved using Twin-Jet grouting in most layers of ground including the cobble and gravel layer.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.5
• /
• pp.799-806
• /
• 2020

The rapid growth of smartphone-to-Internet of Things (IoT) connections and the explosive demand for data usage centered on mobile video are increasing day by day, and this increase in data usage creates many problems in the IP system. In a full-based environment, in which information requesters focus on information providers to receive information from specific servers, problems arise with bottlenecks and large data processing. To address this problem, CCN networking technology, a future network technology, has emerged as an alternative to CCN networking technology, which reduces bottlenecks that occur when requesting popular content through caching of intermediate nodes and increases network efficiency, and can be applied to military information and communication networks to address the problem of traffic concentration and the use of various surveillance equipment in full-based networks, such as scientific monitoring systems, and to provide more efficient content.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.1
• /
• pp.70-75
• /
• 2018

Smart Factory is an intelligent factory that can enhance productivity, quality, customer satisfaction, etc. by applying information and communications technology to the entire production process including design & development, manufacture, and distribution & logistics. The precise amount of data generated in a smart factory varies depending on the factory's size and state of facilities. Regardless, it would be difficult to apply traditional production management systems to a smart factory environment, as it generates vast amounts of data. For this reason, the need for a distributed big-data processing system has risen, which can process a large amount of data. Therefore, this article has designed a Gluster File System (GlusterFS)-based distributed big-data processing system that can be used in a smart factory environment. Compared to existing distributed processing systems, the proposed distributed big-data processing system reduces the system load and the risk of data loss through the distribution and management of network traffic.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.279-286
• /
• 2013

The recent power shortages due to surge in demand for electricity highlights the importance of smart grid technologies for efficient use of power. The experimental content for vulnerability against availability of smart meter, an essential component in smart grid networks, has been reported. Designing availability protection mechanism to boost the realization possibilities of the secure smart grid is essential. In this paper, we propose a mechanism to detect the availability infringement attack for smart meter and also to find anomaly nodes through analyzing smart grid structure and traffic patterns. The proposed detection mechanism uses approximate entropy technique to decrease the detection load and increase the detection rate with few samples and utilizes the signal information(CIR or RSSI, etc.) that the anomaly node can not be changed to find the anomaly nodes. Finally simulation results of proposed method show that the detection performance and the feasibility.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.543-550
• /
• 2005

Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.8
• /
• pp.683-691
• /
• 2013

This paper address a new scheme that alleviates the packet collision problem caused by contentions among nearby coordinators (CNs) in IEEE 802.15.4 meshed sensor networks. In existing studies, the number of retransmissions is reduced by adjusting the proper backoff period (BP) of sensor nodes, or unnecessary energy consumption is diminished by increasing channel utilization efficiently based on traffic load. In contrast, the proposed scheme avoids contentions among nearby CNs, thereby it enhances the energy efficiency of sensor nodes. To achieve this, the proposed scheme separates the starting points of CNs' contention periods and reduces contentions and collisions among overlapping CNs. According to our simulation results, the proposed scheme shows improved performance in terms of energy consumption, throughput, the number of collisions, and average delay for all conditions.

• The KIPS Transactions:PartC
• /
• v.8C no.5
• /
• pp.637-646
• /
• 2001

The multicasting telecommunication is an important research as an applicable technique in the development of adaptable technique for modern mobile computing and mobile IP, because that is supposed to be a solution for transferring the large-size information on the mobile and wireless network with the narrow bandwidth. This paper will suggest one solution for the bidirectional tunneling and the local re-registration problems to support transferring mobile multicasting datagram by the partitioned network. The bidirectional tunneling technique is in use for mobile host moving around in a region and the local re-registration technique for crossing regions to reduce traffic load caused by transferring datagram along a long distance, and we compare those models with our suggested model by simulation.

• The KIPS Transactions:PartA
• /
• v.14A no.5
• /
• pp.269-278
• /
• 2007

Caching in a cache sorrel cluster environment has an advantage that minimizes the request and response tine of internet traffic and web user. Then, one of the methods that increases the hit ratio of cache is using the hash function with cooperative caching. It is keeping a fixed size of the total cache memory regardless of the number of cache servers. On the contrary, if there is no cooperative caching, the total size of cache memory increases proportional to the number of cache sowers since each cache server should keep all the cache data. The disadvantage of hashing method is that clients' requests stress a few servers in all the cache servers due to the characteristics of hashing md the overall performance of a cache server cluster depends on a few servers. In this paper, we propose the method that distributes uniformly client requests between cache servers using dynamic server information. We performed experiments using 16 PCs. Experimental results show the uniform distribution o

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.513-522
• /
• 2008

Efficient data dissemination is one of the important subjects for sensor networks. High accessibility of the sensed data can be kept by deploying the data centric storage approach in which data is stored over the nodes in the sensor network itself rather than external storages or systems. The advantage of this approach is its direct accessibility in a real-time without the severe burden on delay and power dissipation on the data path to the external storages or systems. However, if the queries from many users are concentrated to the few nodes with data, then the response time could be increased and it could lead to the reduction of network life time by rapid energy dissipation caused by concentrated network load. In this paper, we propose a adaptive data centric storage scheme based on proxy trajectory (APT) mechanism. We highlight the data centric storage mechanism by taking account of supporting large number of users, and make it feasible to provide high-performance accessibility when a non-uniform traffic pattern is offered. Storing data around the localized users by considering spatial data-access locality, the proxy trajectory of APT provides fast response for the users. The trajectory, furthermore, may help the mobile users to roams freely within the area they dwell.

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.573-581
• /
• 2004

Recently, the rapid growth of Internet technology and the deployment of high speed networks make many kinds of multimedia services possible. Preexisting multimedia services are designed based on the client/server model which has the problems such as the network failure and the low speed communication due to the high load on the central server. In order to solve these problems, peer-to-peer networks are introduced and expanded through Internet environments. In this paper, we propose a pure peer-to-peer network based resource discovery mechanism for multimedia services. In the proposed scheme, each host maintains the location information of resources which are recently requested by other hosts as well as that oi the replicas of local resources. The proposed scheme has the faster response time and incurs the smaller traffic than the preexisting discovery schemes in pure peer-to-peer network environments. Also, by decentralizing the location information and differentiating the reply path, our proposed scheme can solve the search result loss problem that occurs when the network is unsettled.