• Journal of Communications and Networks
• /
• v.7 no.2
• /
• pp.178-191
• /
• 2005

Fourth-generation (4G) wireless networks will be the IP-based cellular networks integrating Internet with the existing cellular networks. Two important issues should be concerned in the IP-based cellular networks, IP mobility, and quality-of-service (QoS) guarantees. In this paper, we proposed two mechanisms to solve the problems with IP mobility and RSVP-based QoS provisioning. First, virtual-IP (VIP) allocation scheme in areas with a large rate of handoff can minimize the wireless signaling overhead due to IP mobility. The access routers (ARs) create dynamically the VIP zone by using the measured handoff rate derived from the history of the handoff into neighboring ARs. We show that VIP allocation scheme reduces the binding update messages in the wireless link than hierarchical mobile IPv6. Second, the new advance resource reservation protocol called proportional aggregate RSVP (PA-RSVP) can minimize waste of bandwidth and soft state refresh overhead due to IP mobility. It allocates the bandwidth in advance between the mobility anchor point and neighboring ARs using proportional aggregate reservation. We also show that PA-RSVP provides an improved performance over existing protocols.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3203-3215
• /
• 2015

Due to the high growth of SNS population, service scalability is one of the critical issues to be addressed. The cloud environment provides the flexible computing and storage resources for services deployment, which fits the characteristics of scalable SNS deployment. However, if the SNS related information is not properly placed, it will cause unbalance load and heavy transmission cost on the storage virtual machine (VM) and cloud data center (CDC) network. In this paper, we characterize the SNS into a graph model based on the users' associations and interest correlations. The node weight represents the degree of associations, which can be indexed by the number of friends or data sources, and the link weight denotes the correlation between users/data sources. Then, based on the SNS graph, the two-step algorithm is proposed in this paper to determine the placement of SNS related data among VMs. Two k-means based clustering schemes are proposed to allocate social data in proper VM and physical servers for pre-configured VM and dynamic VM environment, respectively. The experimental example was conducted and to illustrate and compare the performance of the proposed schemes.

• Journal of Communications and Networks
• /
• v.9 no.4
• /
• pp.473-481
• /
• 2007

Energy efficiency is one of the most critical concerns for wireless sensor networks. By allowing sensor nodes in close proximity to cooperate in transmission to form a virtual multiple-input multiple-output(MIMO) system, recent progress in wireless MIMO communications can be exploited to boost the system throughput, or equivalently reduce the energy consumption for the same throughput and BER target. However, these cooperative transmission strategies may incur additional energy cost and system overhead. In this paper, assuming that data collectors are equipped with antenna arrays and superior processing capability, energy efficiency of relevant traditional and cooperative transmission strategies: Single-input-multiple-output(SIMO), space-time block coding(STBC), and spatial multiplexing(SM) are studied. Analysis in the wideband regime reveals that, while receive diversity introduces significant improvement in both energy efficiency and spectral efficiency, further improvement due to the transmit diversity of STBC is limited, as opposed to the superiority of the SM scheme especially for non-trivial spectral efficiency. These observations are further confirmed in our analysis of more realistic systems with limited bandwidth, finite constellation sizes, and a target error rate. Based on this analysis, general guidelines are presented for optimal transmission strategy selection in system level and link level, aiming at minimum energy consumption while meeting different requirements. The proposed selection rules, especially those based on system-level metrics, are easy to implement for sensor applications. The framework provided here may also be readily extended to other scenarios or applications.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.3-9
• /
• 2015

We investigate rate scheduling and power allocation problem for a delay constrained CDMA systems. Specifically, we determine an energy efficient scheduling policy, while each user maintains the short term (n time slots) average throughput. We consider a multirate CDMA system where multirate is achieved by multiple codes. Each code can be interpreted as a virtual user. The aim is to schedule the virtual users into each time slot, such that the sum of transmit energy in n time slots is minimized. We then show that the total energy minimization problem can be solved by a shortest path algorithm. We compare the performance of the optimum scheduling with that of TDMA-type scheduling.

• KIPS Transactions on Computer and Communication Systems
• /
• v.5 no.11
• /
• pp.385-392
• /
• 2016

Recently, Expectation Area-based Real-time Routing (EAR2) protocol has been proposed to support real-time routing in wireless sensor networks. EAR2 considers the expectation area of a mobile sink and uses flooding within the expectation area. However, flooding leads to excessive energy consumption and causes long delay against real-time routing. Moreover, since EAR2 uses single path to the expectation area, it is difficult to support reliable routing in sensor networks with high link failures. Thus, to overcome these limitation of EAR2, this paper proposes a reliable and real-time routing protocol based on virtual grids and multipath for mobile sinks. To support real-time routing, the proposed protocol considers expectation grids belonged to the expectation area. Instead of flooding within the expectation area, the proposed protocol uses multicasting to the expectation grids and single hop forwarding in an expectation grid because the multicasting can save much energy and the single hop forwarding can provide short delay. Also, the proposed protocol uses multipath to the expectation grids to deal with link failures for supporting reliable routing. Simulation results show that the proposed protocol is superior to the existing protocols.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.3
• /
• pp.643-650
• /
• 2017

The control of flexible joint robot is getting more attentions because its applications are more frequently used for robot systems in these days. This paper proposes a robust impedance controller for the flexible joint robot by using integral sliding mode control and backstepping control. The sliding mode control decouple disturbances completely but requires matching condition for disturbances. The dynamic model of flexible joint robot is divided into motor side and link side and the disturbance of the link side does not satisfy matching condition and cannot be decoupled directly by the actual input in the motor side. To overcome this difficulty, backstepping control technique is used with sliding mode control. The mismatched disturbance in the link side is changed into matched one in the respect to virtual control input which is the state controlled by actual input in the motor side. Integral sliding mode control is used to preserve the impedance control performance and the improved robustness at the same time.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.4
• /
• pp.339-346
• /
• 2012

In this paper, equivalent models for active control devices are proposed so that building structures with such devices are analyzed using commercial structural analysis programs for the assessment of the structural members under active vibration control. Equivalent link models represent active control device with a virtual linear spring and dashpot, and equivalent force models are control force history acting at the installation point in structural models. Active controllers are designed based on the reduced-order models for a vertical cantilever model and a high-rise building model and corresponding equivalent models are determined from control gain matrices. Based on acceleration, displacement and member force responses, the effectiveness of the equivalent models is verified. As a result, proposed equivalent models, of which equivalent link model showed better performance, appear to enable detailed investigation of structural behavior to the extent of member force level.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.31 no.4
• /
• pp.173-181
• /
• 2018

Recently composite materials have dominated most engineering fields, owing to their better performance, increased durability and flexibility to be customized and designed for a specific required property. This has given them unprecedented superiority over conventional materials. With the help of the ever increasing computational capabilities of computers, researchers have been trying to develop accurate material models for the complex and integrated properties of these composites. This has led to advances in virtual testing of composite materials as a supplement or a possible replacement of laboratory experiments to predict the properties and responses of composite materials and structures. This paper presents a review on the complex multi-scale modelling framework of the virtual testing machines, which involve computational mechanics at various length-scales starting with nano-mechanics and ending in structure level computational mechanics, with a homogenization technique used to link the different length scales. In addition, the paper presents the features of some of the biggest integrated virtual testing machines developed for study of concrete, including a multiscale modeling scheme for the simulation of the constitutive properties of nanocomposites. Finally, the current challenges and future development potentials for virtual test machines are discussed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2003.05a
• /
• pp.183-197
• /
• 2003

This paper introduces the public-oriented e-Hub construction for strategic alliances in the community. The public-oriented e-Hub can link with all Participating internet firms on the ba business models, and consequently help them share their core competence, management resource Based upon this perspective, this paper presents the procedures corresponding with social network strategic alliances of small and medium internet firms. In addition, this paper tries to analyze th among degree of competition, potential of strategic alliance, and financial performance. The resu the firms with more easily accepting various strategic alliances make higher financial performance competitive environment. This suggests that strategic alliances through the public-oriented e-Hub virtual community provide the internet firms with various opportunities