• Journal of KIISE:Software and Applications
• /
• v.32 no.4
• /
• pp.247-257
• /
• 2005

Generally, the network topology design problem is characterized as a kind of NP-hard combinatorial optimization problem, which is difficult to solve with the classical method because it has exponentially increasing complexity with the augmented network size. In this paper, we propose the efficient approach with two phase that is comprised of evolutionary computation approach based on Prufer number(PN), which can efficiently represent the spanning tree, and a heuristic method considering 2-connectivity, to solve the highly reliable network topology design problem minimizing the construction cost subject to network reliability: firstly, to find the spanning tree, genetic algorithm that is the most widely known type of evolutionary computation approach, is used; secondly, a heuristic method is employed, in order to search the optimal network topology based on the spanning tree obtained in the first Phase, considering 2-connectivity. Lastly, the performance of our approach is provided from the results of numerical examples.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.6
• /
• pp.571-576
• /
• 2013

Despite the development of the Internet, both in terms of technology and coverage, there are still remote areas and scenarios where connectivity is very difficult to achieve. Pocket Switched Network is a network paradigm that takes the advantage of human mobility to disseminate data. Factors such as mobility of nodes, link failures, discharged batteries, are among the challenges that may compromise connectivity in these networks. This paper presents a performance analysis of existing routing schemes for PSN in terms of delivery probability, overhead ratio, average latency and average residual energy when the number of nodes is increased. We seek to identify a scheme that maximizes data delivery while minimizing communication overhead and thus extending the network lifetime.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.135-138
• /
• 1998

In this paper, we propose an software architecture for home network gateway set-top-box that supports the connectivity between various consumer devices and the Internet simultaneously. To improve the scalability of the software, the proposed architecture uses the abstracted protocol driving structure, and to enhance the user-friendliness, the unified device access and management user interface is implemented using web technology. A prototype for the proposed architecture is implemented for evaluating the usability under the home network test bed.

• Electronics and Telecommunications Trends
• /
• v.38 no.2
• /
• pp.36-45
• /
• 2023

Segment routing (SR) is a source-based routing architecture in which a node steers packets adhering to service and topological requirements. Using programmable segments, SR enables end-to-end service connectivity to satisfy the network constraints of various services. SR can be implemented with both MPLS and IPv6 dataplanes. This survey presents the overview of SR for IPv6 dataplane (SRv6), network programming technologies based on SRv6, and the SR deployment status.

• International Journal of Highway Engineering
• /
• v.11 no.2
• /
• pp.55-66
• /
• 2009

This study examines the consequent impact which Cheonggyechoen restoration project of Seoul makes on pedestrian network structure around the inner city, especially in terms of sustainable developments and the city's balanced development. It identifies variation of Global Integration and Local Integration of the pedestrian networks which is compared by before and after conditions with east-west and south-north walking axis by using Space Syntax. The results show respectively different set of Global and Local Integration. First, Global Integration shows high performance along the east-west axis, while pedestrian spatial networking is balancing through Donhwamunno and Samillo. Second, Local Integration illustrates both performance along both the east-west axis and the south-north axis after restoration of network. It is primarily concentrated in Taepyeongno$\sim$Samillo section(business and commercial-centered) before the restoration. In addition, total integration is holistically improved while the networking in Samillo$\sim$Baeogaegil section(the instrument shopping streets) if almost same as one another Moreover, in Baeogaegil$\sim$Dongdaemun Stadium section(market-centered), the connectivity of Cheonggyechoenro is improved after the restoration. All in all, Cheonggyechoen restoration project of Seoul allows traffics to be equally accessible from the east-west axis and the south-north axis and contributes to the connectivity improvement of the east-west axis as well as the south-north axis.

• Sleep Medicine and Psychophysiology
• /
• v.25 no.2
• /
• pp.82-91
• /
• 2018

Objectives: Synchronous electroencephalogram (EEG) and functional magnetic resonance imaging (fMRI) has been used to explore sleep stage dependent functional brain networks. Despite a growing number of sleep studies using EEG-fMRI, few studies have conducted network analysis on whole night sleep due to difficulty in data acquisition, artifacts, and sleep management within the MRI scanner. Methods: In order to perform network analysis for whole night sleep, we proposed experimental procedures and data processing techniques for EEG-fMRI. We acquired 6-7 hours of EEG-fMRI data per participant and conducted signal processing to reduce artifacts in both EEG and fMRI. We then generated a functional brain atlas with 68 brain regions using independent component analysis of sleep fMRI data. Using this functional atlas, we constructed sleep level dependent functional brain networks. Results: When we evaluated functional connectivity distribution, sleep showed significantly reduced functional connectivity for the whole brain compared to that during wakefulness. REM sleep showed statistically different connectivity patterns compared to non-REM sleep in sleep-related subcortical brain circuits. Conclusion: This study suggests the feasibility of exploring functional brain networks using sleep EEG-fMRI for whole night sleep via appropriate experimental procedures and signal processing techniques for fMRI and EEG.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.8
• /
• pp.215-222
• /
• 2021

In order to alleviate the limited resource problem and interference problem in cellular networks, the dual connectivity technology has been introduced with the cooperation of small cell base stations. In this paper, we design a new efficient and fair resource allocation scheme for the dual connectivity technology. Based on two different bargaining solutions - Generalizing Tempered Aspiration bargaining solution and Gupta and Livne bargaining solution, we develop a two-stage radio resource allocation method. At the first stage, radio resource is divided into two groups, such as real-time and non-real-time data services, by using the Generalizing Tempered Aspiration bargaining solution. At the second stage, the minimum request processing speeds for users in both groups are guaranteed by using the Gupta and Livne bargaining solution. These two-step approach can allocate the 5G radio resource sequentially while maximizing the network system performance. Finally, the performance evaluation confirms that the proposed scheme can get a better performance than other existing protocols in terms of overall system throughput, fairness, and communication failure rate according to an increase in service requests.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.6
• /
• pp.41-49
• /
• 2022

The Internet Engineering Task Force (IETF) has standardized RPL (IPv6 Routing Protocol for Low-power Lossy Network) as a routing protocol for Low Power and Lossy Networks (LLNs), a low power loss network environment. RPL creates a route through an Objective Function (OF) suitable for the service required by LLNs and builds a Destination Oriented Directed Acyclic Graph (DODAG). Existing studies check the residual energy of each node and select a parent with the highest residual energy to build a DODAG, but the energy exhaustion of the parent can not avoid the network disconnection of the children nodes. Therefore, this paper proposes EC-RPL (Enhanced Connectivity-RPL), in which ta node leaves DODAG in advance when the remaining energy of the node falls below the specified energy threshold. The proposed protocol is implemented in Contiki, an open-source IoT operating system, and its performance is evaluated in Cooja simulator, and the number of control messages is compared using Foren6. Experimental results show that EC-RPL has 6.9% lower latency and 5.8% fewer control messages than the existing RPL, and the packet delivery rate is 1.7% higher.

• Journal of Convergence Society for SMB
• /
• v.4 no.1
• /
• pp.7-15
• /
• 2014

In this paper, we propose an efficient routing protocol to achieve an optimal route searching process of the network lifetime by balancing power consumption per node. The proposed protocols aim at finding energy-efficient paths at low protocol power. In our protocol, each intermediate node keeps power level and branch number of child nodes and it transmits the data the nearest neighbor node. Our protocol may minimize the energy consumption at each node, thus prolong the lifetime of the system regardless of the location of the sink outside or inside the cluster. In the proposed protocol for inter-cluster communication, a cluster head chooses a relay node from its adjacent cluster heads according to the node's residual energy and its distance to the base station. Simulation results show that proposed protocol successfully balances the energy consumption over the network, and achieves a remarkable network lifetime improvement as highly as 7.5%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1767-1775
• /
• 2015

There are various kinds of applications for wireless sensor network, and each application has difference requirements such as throughput. Topology control is the key issue to minimize energy consumption by solving communication collision and radio interference. However, existing topology control algorithms cannot support application requirement because communication efficiency and network connectivity are the main issues of topology control. In this paper, we propose a topology control algorithm that support throughput requirement of an application.