• Journal of Korea Multimedia Society
• /
• 제21권6호
• /
• pp.667-677
• /
• 2018

Since sensor networks consist of sensor nodes with limited energy resources, so efficient energy use of sensor nodes is very important in the design of sensor networks. Sensor nodes consume a lot of energy for data transmission. Clustering technique is used to efficiently use energy in data transmission. Recently, mobile sink techniques have been proposed to reduce the energy load concentrated on the cluster header near a sink node. The CMS(Cluster-based Mobile sink) technique minimizes the generation of control messages by creating a data transmission path while creating clusters, and supports the inter-cluster one-hop transmission. But, there is a case where there is no connectivity between neighbor clusters, it causes a problem of having a long hop data transmission path regardless of local distance. In this paper, we propose a SCBC(Strong connection balancing cluster) to support the path of the minimum number of hops. The proposed scheme minimizes the number of hops in the data transmission path and supports efficient use of energy in the cluster header. This also minimizes a number of hops in data transmission paths even when the sink moves and establishes a new path, and it supports the effect of extending the life cycle of the entire sensor network.

• Journal of Electrical Engineering and Technology
• /
• 제5권4호
• /
• pp.511-521
• /
• 2010

This paper presents a new algorithm to determine accurate bus-wise transmission loss allocation utilizing path-integrals dictated by the transaction strategy. For any transaction strategy, the total sum of the allocated transmission losses of all buses is equal to the actual loss given by the AC power-flow calculation considering the distributed slack. In this paper, the bus-wise allocation of the transmission loss is calculated by integrating the differential loss along a path determined by the transaction strategy. The proposed algorithm is also compared with Galiana's method, which is the well-known transmission loss allocation algorithm based on integration. The performance of the proposed algorithm is evaluated by case studies carried out on the WSCC 9-bus, IEEE 14-bus, New England 39-bus, and IEEE 118-bus systems. The simulation results show that the proposed algorithm is fast and accurate with a large step size.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 한국소음진동공학회 2007년도 추계학술대회논문집
• /
• pp.644-647
• /
• 2007

In this paper, we present our method of controlling the transmission path of compressor vibration to reduce the vibroacoustic of refrigerator. Firstly, to reduce the vibroacoustic radiated from compressor _ mount system, main transmission path was found experimentally and applied partial contact to transmission path to minimize the transmissibility from compressor operation to base plate. In order to verify our method, we designed changing of the connection part between grommet and base plate. Through experiment with modified connection part, we certificate experimentally the noise reduction of refrigerator. Finally, we apply previous connection part to grommet inner shape to enhance the effect of the system. From experimental results, we make certain the possibility of noise reduction of refrigerator through this approach.

• Journal of the Korea Society for Simulation
• /
• 제22권2호
• /
• pp.53-62
• /
• 2013

Cloud environment is one in the field of distributed computing and it consists of physical nodes and virtual nodes. In distributed cloud environment, an optimal path search is that each node to perform a search for an optimal path. Synchronization of each node is required for the optimal path search via fast data transmission because of real-time environment. Therefore, a quantization technique is required in order to guarantee QoS(Quality of Service) and search an optimal path. The quantization technique speeds search data transmission of each node. So a main server can transfer data of real-time environment to each node quickly and the nodes can perform to search optimal paths smoothly. In this paper, we propose the quantization technique to solve the search problem. The quantization technique can reduce the total data transmission. In order to experiment the optimal path search system which applied the quantized data transmission, we construct a simulation of cloud environment. Quantization applied cloud environment reduces the amount of data that transferred, and then QoS of an application for the optimal path search problem is guaranteed.

• Journal of Information Processing Systems
• /
• 제7권2호
• /
• pp.241-260
• /
• 2011

In earlier days, most of the data carried on communication networks was textual data requiring limited bandwidth. With the rise of multimedia and network technologies, the bandwidth requirements of data have increased considerably. If a network link at any time is not able to meet the minimum bandwidth requirement of data, data transmission at that path becomes difficult, which leads to network congestion. This causes delay in data transmission and might also lead to packet drops in the network. The retransmission of these lost packets would aggravate the situation and jam the network. In this paper, we aim at providing a solution to the problem of network congestion in mobile ad hoc networks [1, 2] by designing a protocol that performs routing intelligently and minimizes the delay in data transmission. Our Objective is to move the traffic away from the shortest path obtained by a suitable shortest path calculation algorithm to a less congested path so as to minimize the number of packet drops during data transmission and to avoid unnecessary delay. For this we have proposed a protocol named as Congestion Aware Selection Of Path With Efficient Routing (CASPER). Here, a router runs the shortest path algorithm after pruning those links that violate a given set of constraints. The proposed protocol has been compared with two link state protocols namely, OSPF [3, 4] and OLSR [5, 6, 7, 8].The results achieved show that our protocol performs better in terms of network throughput and transmission delay in case of bulky data transmission.

• Journal of information and communication convergence engineering
• /
• 제4권3호
• /
• pp.97-100
• /
• 2006

In this paper, the transmission service for medical image is proposed via IEEE 802.15.4a on WPAN environment. Also, transmission and receiving performance of medical image using TH UWB-IR system is evaluated on indoor multi-path fading environment. On the results, the proposed scheme can solve the problem of interference from the medical equipment in same frequency band, and minimize the loss due to the indoor multi-path fading environment. Therefore, the transmission with low power usage is possible.

• Journal of KSNVE
• /
• 제11권3호
• /
• pp.401-409
• /
• 2001

Passive type mufflers installed on every car haute inherent problem of lowering engine power and fuel efficiency caused by backpressure which is byproduct of complex internal structure. Recent improvements like installing a calve to change exhaust gas path depending on power requirement and rpm have only marginally improved performance. Tremendous amount of recent research works on active exhaust noise control have failed to commercialize because of numerous physical and economical reasons. In this paper, a unique seal-active muffler using difference of transmission paths is presented. In this system exhaust pipe is divided into two and joined again downstream. Exhaust noise is reduced by destructive interference when two-divided noise join again with transmission paths'difference which is half of the wavelength of a main noise frequency. One divided path has a sliding mechanism to change length thereby transmission path length difference is adjusted to entwine rpm change. The proposed system has minimal backpressure and does not need a secondary sound source like a speaker so it can overcome many problems of failed active noise control methods. We have verified proposed system's superior performance by simulation and comparison experiment with passive mufflers.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.223-226
• /
• 2004

This paper analyzes the accuracy of free space path loss and matched filter gain approximated by using a passband rectangular pulse for ultra wideband (UWB) radio systems. The example causal signal, a modulated Gaussian pulse with the same center frequency and frequency bandwidth of the passband rectangular pulse, is used to consider the accuracy. The path loss and matched filter gain of the modulated Gaussian pulse are simulated for the reference results. The UWB free space path loss is shown and is compared with that obtained from simulation and Friis' transmission formula. The UWB matched filter gain is shown and compared with simulation results. From the results, we can see that the UWB path loss formula is more accurate than the Friis' transmission formula. The results from the UWB free space path loss and matched filter gain formulas agree with the simulation. Then, these free space path loss and matched filter gain formulas approximated by using a passband rectangular pulse are appropriate for UWB system.

• Journal of Korean Society for Quality Management
• /
• 제26권1호
• /
• pp.192-200
• /
• 1998

The quickest path problem is one of the important things for quality of services in communication networks. It is to find a path to send a given amount of data from the source to the sink with minimum transmission time, where the transmission time is dependent on both the capacities and the traversal times of the arcs in the network. This is found under the networks that the capacity and the lead time of each ring are predetermined. It is general to solve the quickest path problem using shortest path algorithms. The relevant algorithms proposed till now are based on the capacity of rings in distributed environments. When the configuration of networks is changed, there can be two a, pp.oaches to find the quickest paths. The one is to find new quickest paths, and the other is to update the current quickest paths. As one of the algorithms for the latter, the distributed quickest path update algorithm was proposed. This paper aims to propose the distributed algorithm a, pp.icable to find the quickest path, when the configuration of networks is changed, using the quickest path tree update altorithm, and to verify its possibility of a, pp.ication by analyzing the transmission amount of data from one node to another from the theoretical point of view.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• 제57권6호
• /
• pp.924-931
• /
• 2008

This paper presents a buswise transmission loss allocation algorithm utilizing the transaction strategy. We prove that whatever calculated by any transaction strategy, the total of the allocated transmission losses of each bus, including no-load loss allocation, almost equals the total loss of AC power flow algorithm and the loss is perfectly slackbus-independent. In this paper, the allocated transmission losses of each bus is calculated by the method of integrating loss sensitivities using by the load level parameter ${\lambda}$. The performance of the proposed algorithm is evaluated by the case studies carried out on the WSCC 9-bus and IEEE 14-bus systems.