This page has only limited features, please log in for full access.

Unclaimed
Hye-Young Kim
School of Game/Game Software, Hongik University, Seoul 04066, Korea

Basic Info

Basic Info is private.

Honors and Awards

The user has no records in this section


Career Timeline

The user has no records in this section.


Short Biography

The user biography is not available.
Following
Followers
Co Authors
The list of users this user is following is empty.
Following: 0 users

Feed

Journal article
Published: 07 November 2020 in Applied Sciences
Reads 0
Downloads 0

Current deep learning convolutional neural network (DCNN) -based hand gesture detectors with acute precision demand incredibly high-performance computing power. Although DCNN-based detectors are capable of accurate classification, the sheer computing power needed for this form of classification makes it very difficult to run with lower computational power in remote environments. Moreover, classical DCNN architectures have a fixed number of input dimensions, which forces preprocessing, thus making it impractical for real-world applications. In this research, a practical DCNN with an optimized architecture is proposed with DCNN filter/node pruning, and spatial pyramid pooling (SPP) is introduced in order to make the model input dimension-invariant. This compact SPP-DCNN module uses 65% fewer parameters than traditional classifiers and operates almost 3× faster than classical models. Moreover, the new improved proposed algorithm, which decodes gestures or sign language finger-spelling from videos, gave a benchmark highest accuracy with the fastest processing speed. This proposed method paves the way for various practical and applied hand gesture input-based human-computer interaction (HCI) applications.

ACS Style

Akm Ashiquzzaman; Hyunmin Lee; Kwangki Kim; Hye-Young Kim; Jaehyung Park; Jinsul Kim. Compact Spatial Pyramid Pooling Deep Convolutional Neural Network Based Hand Gestures Decoder. Applied Sciences 2020, 10, 7898 .

AMA Style

Akm Ashiquzzaman, Hyunmin Lee, Kwangki Kim, Hye-Young Kim, Jaehyung Park, Jinsul Kim. Compact Spatial Pyramid Pooling Deep Convolutional Neural Network Based Hand Gestures Decoder. Applied Sciences. 2020; 10 (21):7898.

Chicago/Turabian Style

Akm Ashiquzzaman; Hyunmin Lee; Kwangki Kim; Hye-Young Kim; Jaehyung Park; Jinsul Kim. 2020. "Compact Spatial Pyramid Pooling Deep Convolutional Neural Network Based Hand Gestures Decoder." Applied Sciences 10, no. 21: 7898.

Journal article
Published: 25 May 2020 in Applied Sciences
Reads 0
Downloads 0

This paper proposes a real-time chain and a novel embedded Markovian queueing model with variable bulk arrival (VBA) and variable bulk service (VBS) in order to establish and assure a theoretical foundation to design a blockchain-based real-time system with particular interest in Ethereum. Based on the proposed model, various performances are simulated in a numerical manner in order to validate the efficacy of the model by checking good agreements with the results against intuitive and typical expectations as a baseline. A demo of the proposed real-time chain is developed in this work by modifying the open source of Ethereum Geth 1.9.11. The work in this paper will provide both a theoretical foundation to design and optimize the performances of the proposed real-time chain, and ultimately address and resolve the performance bottleneck due to the conventional block-synchrony by employing an asynchrony by the real-time deadline to some extent.

ACS Style

Nohpill Park; Abhilash Kancharla; Hye-Young Kim. A Real-Time Chain and Variable Bulk Arrival and Variable Bulk Service (VBAVBS) Model with λF. Applied Sciences 2020, 10, 3651 .

AMA Style

Nohpill Park, Abhilash Kancharla, Hye-Young Kim. A Real-Time Chain and Variable Bulk Arrival and Variable Bulk Service (VBAVBS) Model with λF. Applied Sciences. 2020; 10 (10):3651.

Chicago/Turabian Style

Nohpill Park; Abhilash Kancharla; Hye-Young Kim. 2020. "A Real-Time Chain and Variable Bulk Arrival and Variable Bulk Service (VBAVBS) Model with λF." Applied Sciences 10, no. 10: 3651.

Conference paper
Published: 24 July 2018 in Lecture Notes in Electrical Engineering
Reads 0
Downloads 0

There have been a great deal of researches based on deep neural networks for the network anomalies in the areas of network server workloads. We focus on deep neural networks to deal with huge server loads of network anomalies in a distributed MMOGs (massively multiplayer online games). We present an approach to training deep neural networks to control a loss function optimization, such as hyperparameters, using actor-critic methods from reinforcement learning (RL). Deep RL algorithms have been demonstrated on a range of major challenges: brittle convergence properties such as hyperparameter tuning. We propose an algorithm to automatically optimize the one of hyperparameters, Lagrangian multiplier of the support vector machines (SVM) deep neural networks using actor-critic algorithms. The setting of hyperparameters in the SVM deep neural networks is very important with regard to its accuracy and efficiency. Therefore, we employ the actor-critic algorithm to train Lagrangian multiplier of the SVM deep neural networks. We train a policy network called actor to decide the Lagrangian multiplier at each step during training, and a value network called critic to give feedback about quality of the decision (e.g., the goodness of the Lagrangian multiplier given by the actor) that the actor made. Algorithm comparisons show that our algorithm leads to good optimization of Lagrangian multiplier and can prevent overfitting to a certain extent automatically without human system designers.

ACS Style

ChaYoung Kim; Jung-Min Park; Hye-Young Kim. An Actor-Critic Algorithm for SVM Hyperparameters. Lecture Notes in Electrical Engineering 2018, 653 -661.

AMA Style

ChaYoung Kim, Jung-Min Park, Hye-Young Kim. An Actor-Critic Algorithm for SVM Hyperparameters. Lecture Notes in Electrical Engineering. 2018; ():653-661.

Chicago/Turabian Style

ChaYoung Kim; Jung-Min Park; Hye-Young Kim. 2018. "An Actor-Critic Algorithm for SVM Hyperparameters." Lecture Notes in Electrical Engineering , no. : 653-661.

Conference paper
Published: 24 July 2018 in Lecture Notes in Electrical Engineering
Reads 0
Downloads 0

The setting hyperparameters in the support vector machine (SVM) is very important with regard to its accuracy and efficiency. In this paper, we employ a novel definition of the reinforcement learning state, actions and reward function that allows a deep Q-network (DQN) to learn to control the optimization hyperparameters for the SVM deep neural networks by supervised Big-Data. In this framework, the DQN algorithm with experience replay is based on the off-policy reinforcement learning for the expected discounted return of rewards, or q-values, connected to the actions of adjusting the hyperprameters in the SVM. We propose the two deep neural networks, one with the SVM and the other with Q-network (DQN). The SVM deep neural networks learns a policy for the optimization hyperparameters, but differ in the number of allowed actions. The SVM deep neural networks trains the hyperparameters of the SVM simultaneously such as the Lagrangian multiplier. The proposed algorithm is called a Hybrid DQN combined with SVM deep neural networks. This algorithm could be considered as the classifier in the real-world domains such as network anomalies in the distributed server loads, because the SVM is suitable for the application in a classification, especially for the one-against-the others. Algorithm comparisons show that our proposed algorithm leads to good optimization of the Lagrangian multiplier and can prevent overfitting to a certain extent automatically without human system designers. In terms of the classification performance of the proposed algorithm can be compared to the original LIBSVM with no controls of the hyperparameters.

ACS Style

ChaYoung Kim; Hye-Young Kim. A Hybrid Deep Q-Network for the SVM Lagrangian. Lecture Notes in Electrical Engineering 2018, 643 -651.

AMA Style

ChaYoung Kim, Hye-Young Kim. A Hybrid Deep Q-Network for the SVM Lagrangian. Lecture Notes in Electrical Engineering. 2018; ():643-651.

Chicago/Turabian Style

ChaYoung Kim; Hye-Young Kim. 2018. "A Hybrid Deep Q-Network for the SVM Lagrangian." Lecture Notes in Electrical Engineering , no. : 643-651.

Conference paper
Published: 30 June 2018 in Lecture Notes in Electrical Engineering
Reads 0
Downloads 0

In this study, we developed an integrated monitoring system that can control the odor environment and reduce the odor by using the data from complex sensor devices for reducing odor in livestock facilities in IoT environment.

ACS Style

Hye-Young Kim. Development of Integrated Monitoring System Based on IoT for Odor Reduction. Lecture Notes in Electrical Engineering 2018, 70 -72.

AMA Style

Hye-Young Kim. Development of Integrated Monitoring System Based on IoT for Odor Reduction. Lecture Notes in Electrical Engineering. 2018; ():70-72.

Chicago/Turabian Style

Hye-Young Kim. 2018. "Development of Integrated Monitoring System Based on IoT for Odor Reduction." Lecture Notes in Electrical Engineering , no. : 70-72.

Journal article
Published: 31 October 2017 in Journal of Korea Game Society
Reads 0
Downloads 0
ACS Style

ChaYoung Kim; Jung-Min Park; Hye-Young Kim. Combing data representation by Sparse Autoencoder and the well-known load balancing algorithm, ProGReGA-KF. Journal of Korea Game Society 2017, 17, 103 -112.

AMA Style

ChaYoung Kim, Jung-Min Park, Hye-Young Kim. Combing data representation by Sparse Autoencoder and the well-known load balancing algorithm, ProGReGA-KF. Journal of Korea Game Society. 2017; 17 (5):103-112.

Chicago/Turabian Style

ChaYoung Kim; Jung-Min Park; Hye-Young Kim. 2017. "Combing data representation by Sparse Autoencoder and the well-known load balancing algorithm, ProGReGA-KF." Journal of Korea Game Society 17, no. 5: 103-112.

Article
Published: 12 July 2017 in The Journal of Supercomputing
Reads 0
Downloads 0

The Internet of Things’ contribution lies in the increased value of information created by the number of interconnections among things and the subsequent transformation of processed information into knowledge for the benefit of society. The Internet of Things’ sensors are deployed to monitor one or more events in an unattended environment. A large number of event data will be generated over a period of time in the Internet of Things. In the future, hundreds of billions of smart sensors and devices will interact with one another, without human intervention. Also, they will generate a large amount of data and resolutions, providing humans with information and the control of events and objects, even in remote physical environments. However, the demands of the Internet of Things cause heavy traffic or bottlenecks on particular nodes or on the paths of Internet of Things networks. Therefore, to resolve this issue, we propose an agent, Loadbot, that measures network loads and processes structural configurations by analyzing a large amount of user data and network loads. Additionally, in order to achieve efficient load balancing in the Internet of Things, we propose applying Deep Learning’s Deep Belief Network method. Finally, using mathematical analysis, we address the key functions of our proposed scheme and simulate the efficiency of our proposed scheme.

ACS Style

Hye-Young Kim. A load balancing scheme with Loadbot in IoT networks. The Journal of Supercomputing 2017, 74, 1215 -1226.

AMA Style

Hye-Young Kim. A load balancing scheme with Loadbot in IoT networks. The Journal of Supercomputing. 2017; 74 (3):1215-1226.

Chicago/Turabian Style

Hye-Young Kim. 2017. "A load balancing scheme with Loadbot in IoT networks." The Journal of Supercomputing 74, no. 3: 1215-1226.

Article
Published: 13 February 2017 in The Journal of Supercomputing
Reads 0
Downloads 0

Interconnection of the sensing and actuating devices providing the ability to share information across platform through a unified framework for enabling innovative applications. This is achieved by seamless ubiquitous sensing, data analytics and information representation as the unifying framework. Extending the current internet with interconnected objects and devices and their virtual representation has been a growing trend in recent years. Internet of Things (IoT) services are becoming a popular services. This will be supported challenges in a large of aspects such as smart health, green energy, smart home and personalized applications. So, the IoT plays more and more important issue in lifestyle through entertainment such as Games. As of yet, there has not been much research done on IoT environment games as a service. In this paper, we propose schemes of the design and implantation of IT convergence framework for games as a service of IoT. First of all, we discussed what to consider when design and implementation of IT convergence framework for games through contents using user’s mobile devices and various sensors in IoT environment and suggest related techniques. Then, we showed the possibility of games in the IoT environment by creating games and measuring the interactions of users in the IoT environment.

ACS Style

Hye-Young Kim. A design and implementation of a framework for games in IoT. The Journal of Supercomputing 2017, 74, 6516 -6528.

AMA Style

Hye-Young Kim. A design and implementation of a framework for games in IoT. The Journal of Supercomputing. 2017; 74 (12):6516-6528.

Chicago/Turabian Style

Hye-Young Kim. 2017. "A design and implementation of a framework for games in IoT." The Journal of Supercomputing 74, no. 12: 6516-6528.

Article
Published: 17 November 2016 in Cluster Computing
Reads 0
Downloads 0

Extending the current Internet with interconnected objects and devices and their virtual representation has been a growing trend in recent years. The Internet of Things (IoT) contribution is in the increased value of information created by the number of interconnections among things and the transformation of the processed information into knowledge for the benefit of society. Benefit due to the service controlled by communication between objects is now being increased by people who use these services in real life. The sensors are deployed to monitor one or more events in an unattended environment. A large number of the event data will be generated over a period of time in IoT. Hence, the load balancing protocol is critical considerations in the design of IoT. Therefore, we propose an agent Loadbot that measures network load and process structural configuration by analyzing a large amount of user data and network load, and applying Deep Learning’s Deep Belief Network method in order to achieve efficient load balancing in IoT. Also, we propose an agent Balancebot that processes a neural load prediction algorithm based on Deep Learning’s Q-learning method and neural prior ensemble. We address the key functions for our proposed scheme and simulate the efficiency of our proposed scheme using mathematical analysis.

ACS Style

Hye-Young Kim; Jong-Min Kim. A load balancing scheme based on deep-learning in IoT. Cluster Computing 2016, 20, 873 -878.

AMA Style

Hye-Young Kim, Jong-Min Kim. A load balancing scheme based on deep-learning in IoT. Cluster Computing. 2016; 20 (1):873-878.

Chicago/Turabian Style

Hye-Young Kim; Jong-Min Kim. 2016. "A load balancing scheme based on deep-learning in IoT." Cluster Computing 20, no. 1: 873-878.

Journal article
Published: 30 June 2016 in Journal of Korea Game Society
Reads 0
Downloads 0
ACS Style

Jung-Min Park; Hye-Young Kim. A Study of Smart IT convergence Framework applying a Lego-typed Sensor Module. Journal of Korea Game Society 2016, 16, 87 -96.

AMA Style

Jung-Min Park, Hye-Young Kim. A Study of Smart IT convergence Framework applying a Lego-typed Sensor Module. Journal of Korea Game Society. 2016; 16 (3):87-96.

Chicago/Turabian Style

Jung-Min Park; Hye-Young Kim. 2016. "A Study of Smart IT convergence Framework applying a Lego-typed Sensor Module." Journal of Korea Game Society 16, no. 3: 87-96.

Journal article
Published: 07 January 2016 in Cluster Computing
Reads 0
Downloads 0

The role of load balancing in wireless sensor networks is to provide a constant and reliable service. Applications with periodic data generation for wireless sensor networks require the maximum lifetime of the network. Most research imposes mainly on how to maximize the lifetime of the sensor nodes for the load balancing in order to performance and effeteness in the wireless sensor networks. Because the energy consumption is related to lifetime of the sensor nodes and the energy is a strictly limited resource in wireless sensor networks. Also, energy consumption optimization is required to synchronize the lifetime of the nodes with the whole network lifetime. For this reason, we address the lifetime maximization problem then we improves a novel load balancing scheme that balance the energy consumption of the sensor nodes and maximum network lifetime by load balancing applying the sub-network management in wireless sensor networks. Then, we propose a scheme using analytical models and compare the results with the previous researches. Our simulation result shows that the sensor nodes operate together for full network lifetime and it indicates maximum utilization of the usable energy of the wireless sensor network.

ACS Style

Hye-Young Kim. An energy-efficient load balancing scheme to extend lifetime in wireless sensor networks. Cluster Computing 2016, 19, 279 -283.

AMA Style

Hye-Young Kim. An energy-efficient load balancing scheme to extend lifetime in wireless sensor networks. Cluster Computing. 2016; 19 (1):279-283.

Chicago/Turabian Style

Hye-Young Kim. 2016. "An energy-efficient load balancing scheme to extend lifetime in wireless sensor networks." Cluster Computing 19, no. 1: 279-283.

Journal article
Published: 01 May 2014 in International Journal of Distributed Sensor Networks
Reads 0
Downloads 0

A wireless network consists of a large number of nodes with limited resources. The large number of event data will be generated over a period of time in a wireless network. Also, faced with high resource demand variability and with misfit resource renting policies, the current practices is to overprovision for each game tens of owned data. In a wireless network, the agent node may become easily overloaded by the high demand from the players for updates. So, we propose a hybrid load balancing scheme for games in wireless networks which is based on allocating load on wireless mobile nodes proportionally to each of the agent's capacities. This proposed scheme is a combined dynamic provisioning algorithm based on greedy graph and user-oriented load balancing scheme for maintaining the performance and stability of distributed system in wireless networks. We address the key functions for our proposed scheme and simulate the efficiency of our proposed scheme using mathematical analyses. We then testify that the proposal has best performance compared with previous researches.

ACS Style

Hye-Young Kim; Hwa-Jin Park; Seojeong Lee. A Hybrid Load Balancing Scheme for Games in Wireless Networks. International Journal of Distributed Sensor Networks 2014, 10, 1 .

AMA Style

Hye-Young Kim, Hwa-Jin Park, Seojeong Lee. A Hybrid Load Balancing Scheme for Games in Wireless Networks. International Journal of Distributed Sensor Networks. 2014; 10 (5):1.

Chicago/Turabian Style

Hye-Young Kim; Hwa-Jin Park; Seojeong Lee. 2014. "A Hybrid Load Balancing Scheme for Games in Wireless Networks." International Journal of Distributed Sensor Networks 10, no. 5: 1.

Journal article
Published: 31 December 2013 in The International Journal of Bio-Science and Bio-Technology
Reads 0
Downloads 0
ACS Style

Tae-Gyu Lee; Seong-Hoon Lee; Hye-Young Kim. Dynamic Configuration Method of Process Design in Bio-sensing Information Computing System. The International Journal of Bio-Science and Bio-Technology 2013, 5, 147 -156.

AMA Style

Tae-Gyu Lee, Seong-Hoon Lee, Hye-Young Kim. Dynamic Configuration Method of Process Design in Bio-sensing Information Computing System. The International Journal of Bio-Science and Bio-Technology. 2013; 5 (6):147-156.

Chicago/Turabian Style

Tae-Gyu Lee; Seong-Hoon Lee; Hye-Young Kim. 2013. "Dynamic Configuration Method of Process Design in Bio-sensing Information Computing System." The International Journal of Bio-Science and Bio-Technology 5, no. 6: 147-156.

Journal article
Published: 04 July 2013 in Wireless Personal Communications
Reads 0
Downloads 0

Massively multi-player online role-playing games (MMORPGs) follows a client-server model that has the numerous gaming users with many interactions at the same virtual world, massive loading that result in delays, resource shortages, and other such problems occur. Also, faced with high resource demand variability and with misfit resource renting policies, the current practices is to overprovision for each game tens of owned data. Existing load balancing schemes for distributed virtual environments and multiplayer games try to balance the workload among servers by transferring some workload of an overloaded server to other servers. While load balancing algorithms can minimize the average response time of the system, they may also result in frequent client migrations, which may damage the interactivity of an online games. To solve this, many developers devote research to load-balancing servers, yet due to steady and dynamic map divisions, such research is unreliable. Many developers propose algorithms to distribute the load on the server nodes, but the load is usually defined as the number of players on each server, what is not an ideal results. So, we propose a gaming user-oriented load balancing scheme for the load balancing of MMORPGs servers in this paper. This scheme shows effectiveness at dealing with hot-spots and other gatherings of gaming users at specific servers compared to previous methods.

ACS Style

Hye-Young Kim; Hwa-Jin Park. An Efficient Gaming User Oriented Load Balancing Scheme for MMORPGs. Wireless Personal Communications 2013, 73, 289 -297.

AMA Style

Hye-Young Kim, Hwa-Jin Park. An Efficient Gaming User Oriented Load Balancing Scheme for MMORPGs. Wireless Personal Communications. 2013; 73 (2):289-297.

Chicago/Turabian Style

Hye-Young Kim; Hwa-Jin Park. 2013. "An Efficient Gaming User Oriented Load Balancing Scheme for MMORPGs." Wireless Personal Communications 73, no. 2: 289-297.

Book chapter
Published: 11 December 2012 in Lecture Notes in Electrical Engineering
Reads 0
Downloads 0

MMORPGs (Massively Multi-player Online Role-Playing Games) follows a client–server model that has the numerous gaming users with many interactions at the same virtual world, massive loading that result in delays, resource shortages, and other such problems occur. To solve this, many developers devote research to load-balancing servers, yet due to steady and dynamic map divisions, such research is unreliable. Many developers propose algorithms to distribute the load on the server nodes, but the load is usually defined as the number of players on each server, what is not an ideal results. So, we propose a gaming user-oriented load balancing scheme for the load balancing of MMORPG servers in this paper. This scheme shows effectiveness at dealing with hot-spots and other gatherings of gaming users at specific servers compared to previous methods.

ACS Style

Hye-Young Kim. User-Oriented Load Balancing Scheme for MMORPG. Lecture Notes in Electrical Engineering 2012, 215, 515 -520.

AMA Style

Hye-Young Kim. User-Oriented Load Balancing Scheme for MMORPG. Lecture Notes in Electrical Engineering. 2012; 215 ():515-520.

Chicago/Turabian Style

Hye-Young Kim. 2012. "User-Oriented Load Balancing Scheme for MMORPG." Lecture Notes in Electrical Engineering 215, no. : 515-520.

Conference paper
Published: 10 December 2011 in Lecture Notes in Electrical Engineering
Reads 0
Downloads 0

Massively multiplayer online games (MMOG) are projected to one of the rapidly growing entertainment services that will gain large popularity in near future. When there is a request from the client, we almost apply dynamic method using Accept( ) of looping method; thus, there could be process of connecting synchronously lot of client in most of Online gaming server engine. However, this kind of method causes online gaming server which need to support and process the clients, longer loading and bottlenecking. Therefore we propose the object polling scheme to minimize the memory fragmentation and the load of the initialization to the client using an AcceptEx( ) and static allocation method for an efficient gaming server of the Online in this paper. We design and implement the gaming server applying to our proposed scheme. Also, we show efficiency of our proposed scheme by performance analysis in this paper.

ACS Style

Hye-Young Kim. An Efficient Access Control Scheme for Online Gaming Server. Lecture Notes in Electrical Engineering 2011, 259 -267.

AMA Style

Hye-Young Kim. An Efficient Access Control Scheme for Online Gaming Server. Lecture Notes in Electrical Engineering. 2011; ():259-267.

Chicago/Turabian Style

Hye-Young Kim. 2011. "An Efficient Access Control Scheme for Online Gaming Server." Lecture Notes in Electrical Engineering , no. : 259-267.

Journal article
Published: 22 December 2010 in International Journal of Communication Systems
Reads 0
Downloads 0

With the spread of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements becomes a problem of prime importance. A principal factor of these real‐time applications is to optimize the delay‐ and delay variation‐bounded multicast tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end‐to‐end delay within an upper bound. The DVBMT problem is known as an NP‐complete problem. The representative algorithms are the DVMA, the DDVCA, and the ECS algorithm. In this paper, we show that the proposed ESC algorithm outperforms the DDVCA and the ECS algorithm. The efficiency of our algorithm is verified through performance evaluation and the enhancement is up to about 19.6% in terms of normalized surcharge for multicast delay variation. The time complexity of our algorithm is O(mn2), which is comparable to the well‐known DDVCA. Copyright © 2010 John Wiley & Sons, Ltd.

ACS Style

Moonseong Kim; Matt W. Mutka; Hye-Young Kim. ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints. International Journal of Communication Systems 2010, 24, 40 -52.

AMA Style

Moonseong Kim, Matt W. Mutka, Hye-Young Kim. ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints. International Journal of Communication Systems. 2010; 24 (1):40-52.

Chicago/Turabian Style

Moonseong Kim; Matt W. Mutka; Hye-Young Kim. 2010. "ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints." International Journal of Communication Systems 24, no. 1: 40-52.

Journal article
Published: 17 April 2009 in Personal and Ubiquitous Computing
Reads 0
Downloads 0

The main advantage of a wireless network is user mobility, which calls for efficient routing support at the network layer. An architecture combines hierarchical mobile IPv6 and network mobility for a network mobile and mobile nodes move in tandem and make a hierarchy in the wireless network to management of micro-mobility and seamless handoff. But the capability of the architecture for intra domain route optimization is impaired. So we propose functionality in domain nodes to enable intra domain path optimization for ubiquitous network. It is shown that intra domain cost effect is beneficial in every hierarchical domain that spans mesh network topology. We address the key function for our proposed scheme and analyze the usefulness of our proposed method using mathematically. We show that our proposed scheme performs much better than Network Mobility protocol, especially when the number of mobile nodes or mobile routers or correspondent nodes increases in hierarchically nested in ubiquitous networks.

ACS Style

Hye-Young Kim; Hangbae Chang; Young-Sik Jeong. Intra domain route optimization for ubiquitous network. Personal and Ubiquitous Computing 2009, 13, 449 -455.

AMA Style

Hye-Young Kim, Hangbae Chang, Young-Sik Jeong. Intra domain route optimization for ubiquitous network. Personal and Ubiquitous Computing. 2009; 13 (7):449-455.

Chicago/Turabian Style

Hye-Young Kim; Hangbae Chang; Young-Sik Jeong. 2009. "Intra domain route optimization for ubiquitous network." Personal and Ubiquitous Computing 13, no. 7: 449-455.