• Journal of Korea Water Resources Association
• /
• v.54 no.7
• /
• pp.475-484
• /
• 2021

The optimal design for water distribution system (WDS) is not only satisfying the minimum required water pressure of the nodes, but also minimizing pipe cost, etc. The number of designs of WDS increases exponentially due to the arrangement of various pipes. Various optimization algorithms were applied to propose an optimized design of WDS. In this study, Modified Hybrid Vision Correction Algorithm (MHVCA) with improved self-adapting parameter was applied to optimal design of WDS. The performance was improved by changing the Hybrid Rate (HR) of the existing Hybrid Vision Correction Algorithm (HVCA) to nonlinear HR. To verify the performance of the proposed MHVCA, it applied to mathematical problems consisting of 2 and 30 decision variables and constrained mathematical problems. In order to review the application results of MHVCA, it was compared with Harmony Search (HS), Improved Harmony Search (IHS), Vision Correction Algorithm (VCA) and HVCA. Finally, MHVCA was applied to the optimal design problem of WDS and the results were compared with other algorithms. MHVCA showed better results than other algorithms in mathematical problems and WDS problem. MHVCA will be able to show good results by applying to various water resource engineering problems as well as problems applied in this study.

• Journal of Satellite, Information and Communications
• /
• v.12 no.1
• /
• pp.49-53
• /
• 2017

In this paper we present the combination of location based mobile advertisement services and dynamic digital signage markets has been developing recent days to provide consumer admired visual mobile advertisement on all kind transportation vehicles. In spite of that, the digital signage advertisement content management is still not that easy to manage the content dynamically as well operation is most time consuming to handle the contents dynamically in digital signage business. As location based services is most impactful service in shopping, the location responsive advertisement on vehicle signage will be most desirable mobile advertisement to help people migrate from one place to another place for travel or stay. This paper propose a mobile location responsive digital signage system for vehicles using the GPS and wireless infrastructure integrated with digital signage system. This proposed research use the centralized digital signage system architecture for the mobile advertisement application and this system can be expanded to different vehicles for digital advertisement including buses, trucks, train, air vehicle and any other form of mobile advertising vehicles. Also, this present an effective advertisement recommendation algorithm, by which the advertisement can be selected broadcasted for the right advertisement ventures more effectively as the service requested from advertiser. This paper present the emulated experimental result to evidence the proposed dynamic vehicle signage system performed better than compared with traditional signage random advertising. The emulated result proves that the advertisement recommendation algorithm can effectively works out the targeted key audiences in location responsive region the algorithm evaluated.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1542-1555
• /
• 1999

This paper proposes an algorithm for class hierarchies which can optimize member data and member function. This algorithm considers single/multiple inheritance, static/dynamic binding, overloading/overriding, pure virtual/virtual function, and constructor on the hierarchy of C++ class. We need to eliminate unused function that possesses many component element, because the program uses a limited of function in class hierarchies. Previous works on slicing mainly focused on selecting output data and including the related program statement. It was consists of structured programming language and also centralized on error detection, maintenance, and flexible testing. In this paper, we extend to the object-oriented language, makes a linked-table for objects to raise the efficiency of information management, and proposes necessary algorithm for optimizing system Through this process, we can obtain the simplification of program code and the progress of system performance by eliminating unused member data and member function.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1178-1190
• /
• 2009

IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To efficiently assign resource for VBR traffic, in this paper, we propose TXOP algorithm based on dual leaky bucket using average resource allocation and peak resource allocation. The minimum TXOP of each station is obtained by using statistical approach to maximize number of stations of which performance satisfy QoS target. Simulation results show that the proposed algorithm has much higher performance compared with reference scheduler in terms of throughput and delay.

• Journal of Communications and Networks
• /
• v.14 no.6
• /
• pp.662-671
• /
• 2012

Plug-in hybrid electric vehicles (PHEVs) will be widely used in future transportation systems to reduce oil fuel consumption. Therefore, the electrical energy demand will be increased due to the charging of a large number of vehicles. Without intelligent control strategies, the charging process can easily overload the electricity grid at peak hours. In this paper, we consider a smart charging and discharging process for multiple PHEVs in a building's garage to optimize the energy consumption profile of the building. We formulate a centralized optimization problem in which the building controller or planner aims to minimize the square Euclidean distance between the instantaneous energy demand and the average demand of the building by controlling the charging and discharging schedules of PHEVs (or 'users'). The PHEVs' batteries will be charged during low-demand periods and discharged during high-demand periods in order to reduce the peak load of the building. In a decentralized system, we design an energy cost-sharing model and apply a non-cooperative approach to formulate an energy charging and discharging scheduling game, in which the players are the users, their strategies are the battery charging and discharging schedules, and the utility function of each user is defined as the negative total energy payment to the building. Based on the game theory setup, we also propose a distributed algorithm in which each PHEV independently selects its best strategy to maximize the utility function. The PHEVs update the building planner with their energy charging and discharging schedules. We also show that the PHEV owners will have an incentive to participate in the energy charging and discharging game. Simulation results verify that the proposed distributed algorithm will minimize the peak load and the total energy cost simultaneously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1395-1404
• /
• 2000

In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.315-323
• /
• 2001

The concept of vertical partitioning has been discussed so far in an objective of improving the performance of query execution and system throughput. It can be applied to the areas where the match between data and queries affects performance, which includes partitioning of individual files in centralized environments, data distribution in distributed databases, dividing data among different levels of memory hierarchies, and so on. In general, a vertical partitioning algorithm should support n-ary partitioning as well as a globally optimal solution for the generation of all meaningful fragments. Most previous methods, however, have some limitations to support both of them efficiently. Because the vertical partitioning problem basically includes the fuzziness property, the proper management is required for the fuzziness problem. In this paper we propose an efficient vertical $\alpha$-partitioning algorithm which is based on the fuzzy theory. The method can not only generate all meaningful fragments but also support n-ary partitioning without any complex mathematical computations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.577-594
• /
• 2020

Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2534-2553
• /
• 2018

Source routing is the routing scheme that arranges the whole path from source to target at the origin node that may suit the requirements from the upper layer applications' perspective. The centralized control in SDN (Software-Defined Networking) networks enables the awareness of the global topology at the controller. Therefore, augmented source routing schemes can be designed to achieve various purposes. This paper proposes a source routing scheme that conducts the top-K QoS-aware paths discovery in SDN. First, the novel non-invasive QoS over LLDP scheme is designed to collect QoS information based on LLDP in a piggyback fashion. Then, variations of the KSP (K Shortest Paths) algorithm are derived to find the unconstrained/constrained top-K ranked paths with regard to individual/overall path costs, reflecting the Quality of Service. The experiment results show that the proposed scheme can efficiently collect the QoS information and find the top-K paths. Also, the performance of our scheme is applicable in QoS-sensitive application scenarios compared with previous works.

• Journal of information and communication convergence engineering
• /
• v.7 no.4
• /
• pp.475-479
• /
• 2009

In ad hoc network, the scarce energy management of the mobile devices has become a critical issue in order to extend the network lifetime. Current research activity for the Minimum Energy Multicast (MEM) problem has been focused on devising efficient centralized greedy algorithms for static ad hoc networks. In this paper, we consider mobile ad hoc networks(MANETs) that could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method, the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient. As a result, our simulation results would show that CACH could find energy efficient depth of hierarchy of a cluster.