• Proceedings of the KIEE Conference
• /
• 1994.11a
• /
• pp.36-38
• /
• 1994

A novel UHS relaying algorithm using reflection coefficients estimation is proposed. Based on a travelling ware approach the algorithm can determine the fault location in a travelling time of the protected lone. The discrimation of the reflected wave from others is possible observing the difference of two coefficients. The algorithm is tested using results determined by EMTP.

• Proceedings of the KIEE Conference
• /
• 2004.11b
• /
• pp.243-245
• /
• 2004

This paper proposes the discrimination method for the fault location, whether it is within the line where the distributed generation(DG) is integrated or out of the line (but sharing the same bus of the substation). In general, DG has to be disconnected from the grid when the fault occurs on the interconnected distribution feeder as soon as possible. However, the faults occured on the neighboring feeder would mistakenly cause the disconnection of the DG. For reliable operation of DG, DG should be sustained at the fault occurred on neighboring distribution feeders. The proposed identification method utilizes the impedance monitored from the DG and examines the coordination of overcurrent relay of the distribution system. This paper describes how the proposed method to identify the faulted feeder and how the method can be utilized.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.103-113
• /
• 2010

In this paper, a tradeoff between the total energy consumption-per-bit and the end-to-end rate under spatial reuse in wireless multi-hop network is developed and analyzed. The end-to-end rate of the network is the number of information bits transmitted (end-to-end) per channel use by any node in the network that is forwarding the data. In order to increase the bandwidth efficiency, spatial reuse is considered whereby simultaneous relay transmissions are allowed provided there is a minimum separation between such transmitters. The total energy consumption-per-bit includes the energy transmitted and the energy consumed by the receiver to process (demodulate and decoder) the received signal. The total energy consumption-per-bit is normalized by the distance between a source-destination pair in order to be consistent with a direct (single-hop) communication network. Lower bounds on this energy-bandwidth tradeoff are analyzed using convex optimization methods. For a given location of relays, it is shown that the total energy consumption-per-bit is minimized by optimally selecting the end-to-end rate. It is also demonstrated that spatial reuse can improve the bandwidth efficiency for a given total energy consumption-per-bit. However, at the rate that minimizes the total energy consumption-per-bit, spatial reuse does not provide lower energy consumption-per-bit compared to the case without spatial reuse. This is because spatial reuse requires more receiver energy consumption at a given end-to-end rate. Such degraded energy efficiency can be compensated by varying the minimum separation of hops between simultaneous transmitters. In the case of equi-spaced relays, analytical results for the energy-bandwidth tradeoff are provided and it is shown that the minimum energy consumption-per-bit decreases linearly with the end-to-end distance.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.5
• /
• pp.47-53
• /
• 2007

The purpose of IEEE 802.16j is to extend coverage and to enhance throughput by using relay station additionally to conventional IEEE 802.16e . The cellular system experiences performance degradation at the cell edge due to pathloss, shadow and multipath fading. We can get advantage of spatial diversity gain by using relays more than two cooperatively in the IEEE 802.16j system. Cooperative relaying using space-time code provides better performance under multipath fading and has more robustness against the shadow fading than single relaying. In this paper, we investigate the performance of IEEE 802.16j using cooperative relaying by link level simulation. We also show that the cooperative relaying system achieves better performance than the conventional single relaying system. We apply realistic shadow model considering correlations between shadow fadings of different relaying paths. It is shown that the performance of the system depends highly on the spatial location of relay stations.

• Journal of Convergence for Information Technology
• /
• v.11 no.4
• /
• pp.26-34
• /
• 2021

In the era of the Fourth Industrial Revolution, the future battlefield will carry out multi-area operations with hyper-connected, high-speed and mobile systems. In order to prepare for changes in the future, the Korean military intends to develop various weapons systems and form a multi-layer tactical network to support On The Move communication. However, current tactical networks are limited in support of On The Move communications. In other words, the operation of multi-beam antennas is necessary to efficiently construct a multi-layer tactical network in future warfare. Therefore, in this paper, we look at the need for multi-beam antennas through the operational scenario of a multi-layer tactical network. In addition, based on development consideration factors, features of rotary-wing and fixed-wing aircraft, we present the location and operation of airborne relay drone installations of multi-beam antennas.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.7-13
• /
• 2010

For swiftness and economic feasibility of parcel delivery, optimal location of mail exchanging centers considering not only section delivery distance but also some weights like the number of delivery vehicles are necessary. In this paper, a mechanism with section delivery distance and vehicle number for locating of mail distribution centers which connect some mail centers of major cities in Republic Korea by applying GOSST theory is proposed. This mechanism for locating mail exchange centers can make the total delivery distance of postal matters less than not only present method which assigns Daejun as mail exchange center, but also Steiner tree method which does not consider weights like number of delivery vehicles. The mechanism is good for protecting the environment as well as rapid and economic delivery. In experiment, the proposed mechanism could curtail total delivery distance by 2.52 percentages compared with Steiner tree method and by 6.66 percentages compared with present method. The mechanism may be used in electric power transmission routing, distribution line topology design, power relay station locating where various voltages and other weights should be considered.

• Journal of Digital Convergence
• /
• v.14 no.1
• /
• pp.171-179
• /
• 2016

The energy consumption problem in wireless sensor networks is investigated. The problem is to expend as little energy as possible receiving and transmitting data, because of constrained battery. In this paper, in order to extend the lifetime of the network, we proposed a location-based clustering algorithm for wireless sensor network with skewed-topology. The proposed algorithm is to deploy multiple child nodes at the sink to avoid bottleneck near the sink and to save energy. Proposed algorithm can reduce control traffic overhead by creating a dynamic cluster. We have evaluated the performance of our clustering algorithm through an analysis and a simulation. We compare our algorithm's performance to the best known centralized algorithm, and demonstrate that it achieves a good performance in terms of the life time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4B
• /
• pp.191-199
• /
• 2007

Mobile node has to register its current location to Home Agent when it moves to another network while away from home. However, the registration procedure cannot be completed successfully when Home Agent is protected by the VPN gateway which guards MN's home network and discards the unauthorized packets incoming from outside as a lack of security association(SA) between the Care-of address and security policy of the home network so that the binding registration message without SA is discarded smoothly by the VPN gateway. This paper presents the authentication and key exchange scheme using the AAA infrastructure for a user in Internet to access the home network behind the VPN gateway. By defining the role of authentication and tunnel processing for each agent or relay entity, this paper presents the procedure to register the current location to its Home Agent with secure manner. Performance result shows cost improvement up to 40% comparing with existing scheme in terms of the packet loss cost, the property of mobility and traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.2
• /
• pp.189-197
• /
• 2016

Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

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