• Journal of Electrical Engineering and Technology
• /
• v.3 no.3
• /
• pp.354-362
• /
• 2008

In this paper, a new algorithm of optimal voltage control is proposed for the Distribution Automation System (DAS) based on constants of four terminal network modeling. In the proposed method, the voltage profiles along feeders are estimated from the measurement of the current and power factor by a Feeder Remote Terminal Unit (FRTU) installed at each node. Whenever the voltage profile violates the restriction, the voltage control strategy is applied to keep the voltage levels along the feeders within the pre-specified range through the modification and coordination of the transformer under-load tap changers (ULTC), step voltage regulator (SVR), as well as shunt condenser. In the case studies, the estimation and control of the voltages have been testified in a radial distribution system with 11 nodes.

• The Journal of the Korea Contents Association
• /
• v.18 no.11
• /
• pp.655-664
• /
• 2018

Retina transforms the external light into electrical signal that stimulates visual cortex of the brain. Electrical modeling of the retina is useful to understand its structure and action that is a prerequisite to implement the retina as a hardware device. This paper introduces a 2-D electrical network model of vertebrate's retina considering signal pathway of retinal cells and synapses. We implemented a simulator of the retina based on the electrical network model to analyze its operation under various circumstances. Compared to the prior studies, It might contribute designing of artificial retina device in terms of that this study specifically observed input and output reactions of each cell and synapse node under various light intensity on the retina.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.12
• /
• pp.98-106
• /
• 2013

The duty-cycle synchronization among mobile sensor nodes with energy-harvesting is very important. The nodes should keep their duty-cycle same to others as much as possible because they have to cooperate each other and to consume energy efficiently. The distribution of node position in network affects not only node connectivity but also the active time of synchronized nodes, and it relates to network life-time finally. In this paper, we introduce a network topology change algorithm (TCA) for energy-harvesting mobile sensor networks based on self-synchronized duty-cycling. The algorithm tries to change a network topology into a balanced topology where the mobile sensor nodes are unified according to the density of the number of nodes. For TCA, both fluid flow algorithm and flock dispersion algorithm are proposed and they are evaluated through the simulation in agent based modeling language. TCA is applied to the energy-harvesting mobile sensor networks to improve the synchronization of duty-cycle and to reduce the variation of energy consumption among nodes.

• KIISE Transactions on Computing Practices
• /
• v.23 no.2
• /
• pp.116-121
• /
• 2017

In wireless sensor networks, the multipath prefers energy efficient routing method due to the characteristic of low-power sensor which uses geographic method to transmit data packet through information of the neighbor nodes. However, when multipath meets the routing fail area called hole area, path overlap problem can occur, resulting in failed maintenance of disjoint multipath. To solve this problem, multipath research studies have been performed to exploit the modeling and detouring method in routing fail area by keeping the disjoint multipath. However, in an energy point of view, additional method like modeling can lead to a lot of energy consumption of sensor node. Moreover, lots of energy consumption of sensor node can shorten the life span of sensor network. In this study, we proposed an energy efficient geographic routing by keeping the disjoint multipath in routing fail area. The proposed scheme exploited the face routing using the geographic recovery method without additional method like modeling.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.1
• /
• pp.99-105
• /
• 2012

Given the numbers of smartphones, tablets and other mobile devices shipped every day, more and more users are relying on the cloud as the main driver for satisfying their computing needs, whether it is data storage, applications or infrastructure. Mobile cloud computing is simply cloud computing in which at least some of the devices involved are mobile. Each node is owned by a different user and is likely to be mobile. Using mobile hardware for cloud computing has advantages over using traditional hardware. These advantage include computational access to multimedia and sensor data without the need for large network transfer, more efficient access to data stored on other mobile devices and distributed ownership and maintenance of hardware. It is important to predict job execution time in mobile cloud computing because there are many mobile nodes with different capabilities. This paper analyzes the job execution time for mobile cloud computing in terms of network environment and heterogeneous mobile nodes using a mathematical model.

• Journal of the military operations research society of Korea
• /
• v.24 no.1
• /
• pp.110-131
• /
• 1998

A stochastic modeling of combat that takes more realistic situations into account has been studied with deep concern. Either the firing strategies or network formations are very important elements in the analysis of combat. The first objective of this study is to evaluate how the different strategies affect the outcomes of combat. An analytical approach has been used in an attempt to understand a small-sized battle. The results are validated and compared with existing simulation models. Extending to the moderate size of battle may be achieved with ease. Secondly, an attempt has been made to study and investigate a way to solve combat in a different fashion. We divided a two-on-two battle into two separate one-on-one battles and connected them into a network. New elements considered such as delay time of starting a firefight on a particular node or search time for the next target when a kill occurs are defined and used as the input parameters. The discussions are made to validate the hypothesized model and ask if the results are meaningful and useful in the analysis of combat operations or not.

• Journal of Korean Society of Environmental Engineers
• /
• v.36 no.6
• /
• pp.421-428
• /
• 2014

For the analysis of water supply network, demand-driven and pressure-driven analysis methods have been proposed. Of the two methods, demand-driven analysis (DDA) can only be used in a normal operation condition to evaluate hydraulic status of a pipe network. Under abnormal conditions, i.e., unexpected pipe destruction, or abnormal low pressure conditions, pressure-driven analysis (PDA) method should be used to estimate the suppliable flowrate at each node in a network. In order to carry out the pressure-driven analysis, head-outflow relationship (HOR), which estimates flowrate at a certain pressure at each node, should be first determined. Most previous studies empirically suggested that each node possesses its own characteristic head-outflow relationship, which, therefore, requires verification by using actual field data for proper application in PDA modeling. In this study, a model pipe network was constructed, and various operation scenarios of normal and abnormal conditions, which cannot be realized in real pipe networks, were established. Using the model network, data on pressure and flowrate at each node were obtained at each operation condition. Using the data obtained, previously proposed HOR equations were evaluated. In addition, head-outflow relationship at each node was analyzed especially under multiple pipe destruction events. By analyzing the experimental data obtained from the model network, it was found that flowrate reduction corresponding to a certain pressure drop (by pipe destruction at one or multiple points on the network) followed intrinsic head-outflow relationship of each node. By comparing the experimentally obtained head-outflow relationship with various HOR equations proposed by previous studies, the one proposed by Wagner et al. showed the best agreement with the exponential parameter, m of 3.0.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.11 no.4
• /
• pp.227-236
• /
• 1986

In this paper, an integrated voice/data packet network with window flow control is modeled by a colsed multichain queueing system, and its performance is analyzed by the mean value analysis method. Particularly, for the analysis of a packet network having various kinds of messages with different priority classes, we introduce an approach based on the mean value analysis and the concept of effective capacity. By the mathematical analysis and computer simulation, we obtain the following network statistics in the steady state: Mean buffer occupancy at each node, utilization of link throughput of a virtual channel, and mean delay time of each message. Our iterative analysis method can predict the link data status in most cases within about 10 percent of accurady, and the statistics of voice messages and external data within 5 percent as compared to simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.4B
• /
• pp.422-428
• /
• 2011

In this paper, we introduce system and channel modeling for an underwater ad hoc acoustic network with n regularly located nodes， and then analyze capacity scaling laws based on the model. A narrow-band model is assumed where the carrier frequency is allowed to scale as a function of n. In the network, we characterize in attenuation parameter that depends on the frequency scaling as well as the transmission distance. A cut-set upper bound on the throughput scaling is then derived in extended networks having unit node density. Our result indicates that the upper bound is inversely proportional to the attenuation parameter, thus resulting in a power-limited network. Furthermore, we describe an achievable scheme based on the simple nearest-neighbor multi-hop (MH) transmission. It is shown under extended networks that the MH scheme is order-optimal for all the operating regimes expressed as functions of the attenuation parameter.

• Journal of Computing Science and Engineering
• /
• v.4 no.3
• /
• pp.225-239
• /
• 2010

This paper introduces a new approach to modeling relative distance among nodes under a variety of communication rates, due to node's mobility in Mobile Ad-hoc Networks (MANETs). When mobile nodes move to another location, the relative distance of communicating nodes will directly affect the data rate of transmission. The larger the distance between two communicating nodes is, the lower the rate that they can use for transferring data will be. The connection certainty of a link also changes because a node may move closer to or farther away out of the communication range of other nodes. Therefore, the stability of a route is related to connection entropy. Taking into account these issues, this paper proposes a new routing metric for MANETs. The new metric considers both link weight and route stability based on connection entropy. The problem of determining the best route is subsequently formulated as the minimization of an object function formed as a linear combination of the link weight and the connection uncertainty of that link. The simulation results show that the proposed routing metric improves end-to-end throughput and reduces the percentage of link breakages and route reparations.