• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.344-357
• /
• 2015

With the increase in a number of access technologies and data rates, a continuous connection among different networks is demand of the future wireless networks. In the last decade, user connectivity among different access networks remained a challenging job. Therefore, in this article, we proposed a user-centric and user-perspective based network selection mechanism for fast handover management in heterogeneous wireless networks. The proposed scheme selects the most appropriate network among available networks on the basis of resources i.e. cost, data rate, and link quality. Initially, we load the Media Independent Information Service (MIIS) with the information of cost and data rate provided by different network operators. Similarly, Mobile Node (MN) is also loaded with the user preferred cost and data rate for different applications. The MN obtains the information of cost and data rate from MIIS server upon a predefined threshold, and make a decision for handover according to its current cost and data rate. Furthermore, we employ an optimal threshold mechanism for initiation of the handover execution phase to minimize false handover indications. The proposed scheme is based on a survey for network selection and its implementation in C programming language to validate its performance and accuracy. The simulation result shows that the proposed scheme performs superior then the schemes present in the current literature.

• 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.

• The KIPS Transactions:PartC
• /
• v.10C no.3
• /
• pp.367-376
• /
• 2003

This study deals with the DCMST (Delay constrained Capacitated Minimum Spanning Tree) problem applied in the topological design of local networks or finding several communication paths from root node. While the traditional CMST problem has only the traffic capacity constraint served by a port of root node, the DCMST problem has the additional mean delay constraint of network. The DCMST problem consists of finding a set of spanning trees to link end-nodes to the root node satisfying the traffic requirements at end-nodes and the required mean delay of network. The objective function of problem is to minimize the total link cost. This paper presents two-phased heuristic algorithm, which consists of node exchange, and node shift algorithm based on the trade-off criterions, and mean delay algorithm. Actual computational experience and performance analysis show that the proposed algorithm can produce better solution than the existing algorithm for the CMST problem to consider the mean delay constraint in terms of cost.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• Journal of Korean Society of Transportation
• /
• v.17 no.3
• /
• pp.117-130
• /
• 1999

Earthquakes damage roadway bridges and structures, resulting in significant impacts on transportation system Performance and regional economy. Seismic risk analysis (SRA) procedures establish retrofit priorities for vulnerable highway bridges. SRA procedures use average daily traffic volumes to determine the relative importance of a bridge. This research develops a cost-effective transportation network analysis (TAN) procedure for evaluating numerous traffic flow analyses in terms of the additional system cost due to failure. An important feature of the TNA Procedure is the use of an associative memory (AM) approach in the artificial intelligence held. A simple seven-zone network is developed and used to evaluate the TNA procedure. A subset of link failure system states is randomly selected to simulate synthetic post-earthquake network flows. The performance of different AM model is evaluated. Results from numerous link-failure scenarios demonstrate the applicability of the AM models to traffic flow estimation.

• International journal of advanced smart convergence
• /
• v.6 no.1
• /
• pp.76-81
• /
• 2017

This paper presents a low cost and flexible IoT enabled smart LED controller using Arduino that is used for emergency exit signs. The Internet of Things (IoT) is become a global network that put together physical objects using network communications for the purpose of inter-communication of devices, access information on internet, interaction with users as well as permanent connected environment. A crucial point in this paper, is underlined on the potential key points of applying the Arduino platform as low cost, easy to use microcontroller with combination of various sensors applied in IoT technology to facilitate and establishment of intelligent products. To demonstrate the feasibility and effectiveness of the system, devices such as LED strip, combination of various sensors, Arduino, power plug and ZigBee module have been integrated to setup smart emergency exit sign system. The general concept of the proposed system design discussed in this paper is all about the combination of various sensor such as smoke detector sensor, humidity, temperature sensor, glass break sensors as well as camera sensor that are connected to the main controller (Arduino) for the purpose of communicating with LED exit signs displayer and dedicated PC monitors from integrated system monitoring (controller room) through gateway devices using Zig bee module. A critical appraisal of the approach in the area concludes the paper.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.2
• /
• pp.154-162
• /
• 2007

In this paper, we propose a new AC-DC converter control method to comply with harmonics regulation(IEC 61000-3) effective for the inverter system of an air conditioner whose power consumption is less than 2,500W. There are many different ways of AC-DC converter control, but this paper focuses on the converter control method that is adopting an input reactor with low cost silicon steel core to strengthen cost competitiveness of the manufacturer. The proposed control method controls input current every half cycle of the line frequency to get unit power factor and at the same time to reduce switching loss of devices and acoustic noise from reactor. This kind of converter is known as a Partial Switching Converter(PSC). In this study, theoretical analysis of the PSC has been performed using Matlab/Simulink while a 16-bit micro-processor based converter has been used to perform the experimental analysis. In the theoretical analysis, electrical circuit models and equations of the PSC are derived and simulated. In the experiments, micro-processor controls input current to keep the power factor above 0.95 by reducing the phase difference between input voltage and current and at the same time to maintain a reference DC-link voltage against voltage drop which depends on DC-link load. Therefore it becomes possible to comply with harmonic regulations while the power factor is maximized by optimizing the time of current flow through the input reactor for every half cycle of line frequency.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.39 no.2
• /
• pp.9-18
• /
• 1997

Abstract This paper presents a heuristic method for optimal design of water distribution system with multiple sources and potential links. In multiple source pipe network, supply rate at each source node affects the total cost of the system because supply rates are not uniquely determined. The Linear Minimum Cost Flow (LMCF) model may be used to a large scale pipe network with multiple sources to determine supply rate at each source node. In this study the heuristic method based on the LMCF is suggested to determine supply rate at each source node and then to optimize the given layout. The heuristic method in turn perturbs links in the longest path of the network to obtain the supply rates which make the optimal design of the pipe network. Once the best tree network is obtained, the frequency count of reconnecting links by considering link failure is in turn applied to form loop to enhance the reliability of the best tree network. A sample pipe network is employed to test the proposed method. The results show that the proposed method can yield a lower cost design than the LMCF alone and that the proposed method can be efficiently used to design irrigation systems or rural water distribution systems.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.806-817
• /
• 2016

Opportunistic routing (OR) has been proposed as a viable approach to improve the performance of wireless multihop networks with lossy links. However, the exponential growth of the bandwidth-sensitive mobile traffic (e.g., mobile video streaming and online gaming) poses a great challenge to the performance of OR in term of bandwidth guarantee. To solve this problem, a novel mechanism is proposed to opportunistically forwarding data packets and provide bandwidth guarantee for the bandwidth-sensitive traffic. The proposal exploits the broadcast characteristic of wireless transmission and reduces the negative effect of wireless lossy links. First, the expected available bandwidth (EAB) and the expected transmission cost (ETC) under OR are estimated based on the local available bandwidth, link delivery probability, forwarding candidates, and prioritization policy. Then, the policies for determining and prioritizing the forwarding candidates is devised by considering the bandwidth and transmission cost. Finally, bandwidth-aware routing algorithm is proposed to opportunistically delivery data packets; meanwhile, admission control is applied to admit or reject traffic flows for bandwidth guarantee. Extensive simulation results show that our proposal consistently outperforms other existing opportunistic routing schemes in providing performance guarantee.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.3
• /
• pp.132-139
• /
• 2002

The implementation of passive optical network in the access network will result in design of the network that have characteristics of broadband, long distance transmission, transparency. Particularly, optical technologies of WDM and WGR have made a new access network of WDM-PON. This paper proposes the algorithm that determines structural elements of a survivable optical access network, and simulates the cost of various scheme of proposed network architectures. Our results show that multistage star is the most cost effective scheme than the other architectures and show that network architecture designed by proposed algorithm provides survivability with single link and 1st node failure.