• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.7
• /
• pp.1296-1306
• /
• 2015

Nowadays the research of energy saving on the IP networks have been studied the various methods in many research institutes. This paper suggests the energy saving method in IP networks which have the various energy profiles, and analyzes its energy saving characteristics in detail. Especially this paper proposes the energy profile based OSPF routing method which have the selectable weighted value in OSPF metric and energy consumption in IP network. This paper analyzes the energy saving effects of the various situations to minimize the energy consumption using the various weighted value on the proposed scheme. The results show that the energy saving efficiency can get about 67% at in ingress input load ${\rho}=0.5$ by using random energy profiles in IP networks. Although the number of hops is a slight increased due to routing the paths for the minimum energy consumption in the algorithm of this method, the increment hop number is limited the mean 1.4 hops. This paper confirms that the energy profile of core router has the large effects of energy saving than the energy profile of edge router, and the proposed method has the excellent energy saving characteristics in IP networks.

• The Journal of the Korea Contents Association
• /
• v.20 no.1
• /
• pp.356-363
• /
• 2020

As a becoming era of Internet-of-Things, various devices are connected via wire or wirless networks. Although every day life is more convenient, security problems are also increasing such as privacy, information leak, denial of services. Since ECC, a kind of public key cryptosystem, has a smaller key size compared to RSA, it is widely used for environmentally constrained devices. The key of ECC in constrained devices can be exposed to power analysis attacks during scalar multiplication operation. In this paper, a key-randomization method is suggested for scalar multiplication on SECG parameters. It is against differential power analysis and has operational efficiency. In order to increase of operational efficiency, the proposed method uses the property 2^lP=∓cP where the constant c is small compared to the order n of SECG parameters and n=2^l±c. The number of operation for the Coron's key-randomization scalar multiplication algorithm is 21, but the number of operation for the proposed method in this paper is (3/2)l. It has efficiency about 25% compared to the Coron's method using full random numbers.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.4
• /
• pp.143-148
• /
• 2020

In the case of a system that detects and controls the phase of an alternating voltage, the analog control method compensates the phase offset part by filtering for the detected phase and applies it to the control. However, in the digital control method, precise control cannot be achieved due to an error between the operating frequency of the microprocessor or the microcontroller and the input phase time when controlled using such phase detection. In general, when the method used is a certain time, the accumulated error is compensated and adjusted at random. To solve this problem, a method of detecting a zero point in real time and compensating for the operating frequency of the microprocessor is needed. Therefore, the research to be performed in this paper to reduce these errors and apply them to precise digital control is as follows. 1) Research on how to implement Zero Crossing Detection algorithm through simulation modeling to compensate the zero point to match the operating frequency through detection. 2) A study on the method of detecting zero points in real time through the Zero Crossing Detection design using a microcontroller and compensating for the operating frequency of the microprocessor. 3) A study on the estimation of the rotor position of BLDC motors using the Zero Crossing Detection circuit.

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

In wireless mesh networks (WMNs), the end-to-end throughput of a flow decreases drastically according to the traversed number of hops due to interference among different hops of the same flow in addition to interference between hops of different flows with different paths. This paper proposes a distributed multi-channel assignment scheme based on hops (DMASH) to improve the performance of a static WMN. The proposed DMASH is a novel distributed multi-channel assignment scheme based on hops to enhance the end-to-end throughput by reducing interference between channels when transmitting packets in the IEEE 802.11 based multi-interface environments. The DMASH assigns a channel group to each hop, which has no interference between adjacent hops from a gateway in channel assignment phase, then each node selects its channel randomly among the channel group. Since the DMASH is a distributed scheme with unmanaged and auto-configuration of channel assignment, it has a less overhead and implementation complexity in algorithm than centralized multi-channel assignment schemes. Simulation results using the NS-2 showed that the DMASH could improve remarkably the total network throughput in multi-hop environments, comparing with a random channel assignment scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.105-113
• /
• 2008

In Ubiquitous Society, accurate Location Calculation of user's device is required to achieve the need of users. As the location calculation is processed by ranging between transceivers, if some obstacles exist between transceivers, NLoS(Non-line-of-Sight) components of received signal increase along with the reduction of LoS(Line-of-Sight) components. Therefore the location calculation error will increase due to the NLoS effect. The conventional location calculation algorithm has the original ranging error because there is no transformation of ranging information which degrades the ranging accuracy. The Iterative Calculation method which minimizes the location calculation error relys on accurately identifying NLoS or LoS condition of the tested channel. We employ Kurtosis, Mean Excess Delay and RMS Delay spread of the received signal to identify whether the tested channel is LoS or NLoS firstly. Thereafter, to minimize location calculation error, the proposed Iterative Calculation method iteratively select random range and finds the averaged target location which has high probability. The simulation results confirm the enhancement of the proposed method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.54 no.2
• /
• pp.16-27
• /
• 2017

IEEE 802.15.6 standard, a Wireless Body Area Network, aims to transfer not only medical data but also non-medical data, such as physical activity, streaming, multimedia game, living information, and entertainment. Services which transfer those data have very various data rates, intervals and frequencies of continuous access to a medium. Therefore, an efficient anti-collision operations and medium assigning operation have to be carried out when multiple nodes with different data rates are accessing shared medium. IEEE 802.15.6 standard for CSMA/CA medium access control method distributes access to the shared medium, transmits a control packet to avoid collision and checks status of the channel. This method is energy inefficient and causes overhead. These disadvantages conflict with the low power, low cost calculation requirement of wireless body area network, shall minimize such overhead for efficient wireless body area network operations. Therefore, in this paper, we propose a medium access scheduling scheme, which adjusts the time interval for accessing to the shared transmission medium according to the amount of data for generating respective sensor node, and a priority control algorithm, which temporarily adjusts the priority of the sensor node that causes transmission concession due to the data priority until next successful transmission to ensure fairness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2075-2082
• /
• 2006

This paper presents modeling and optimization techniques for hish efficiency solar cell process on single-crystalline float zone (FZ) wafers. Among a sequence of multiple steps of fabrication, the followings are the most sensitive steps for the contact formation: 1) Emitter formation by diffusion; 2) Anti-reflection-coating (ARC) with silicon nitride using plasma-enhanced chemical vapor deposition (PECVD); 3) Screen-printing for front and back metalization; and 4) Contact formation by firing. In order to increase the performance of solar cells in terms of efficiency, the contact formation process is modeled and optimized using neural networks and genetic algorithms, respectively. This paper utilizes the design of experiments (DOE) in contact formation to reduce process time and fabrication costs. The experiments were designed by using central composite design which consists of 24 factorial design augmented by 8 axial points with three center points. After contact formation process, the efficiency of the fabricated solar cell is modeled using neural networks. Established efficiency model is then used for the analysis of the process characteristics and process optimization for more efficient solar cell fabrication.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.447-458
• /
• 2002

In this paper, we design and implement Wireless Transaction Protocol(WTP) and evaluate it for wireless transaction processing in mobile computing environments. The design and implementation of WTP are based on the coroutine model that might be suitable for light-weight portable devices. We test the compatibility between our product and the other products such as Nokia, Kannel and WinWAP For the evaluation of WTP, we use an Internet simulator that can arbitrary generate random wireless errors based on the Gilbert model. In our experiment, the performance of WTP is measured and compared to those of Transmission Control Protocol(TCP) and TCP for Transactions. The experiment shows that WTP outperforms the other two protocols for wireless transaction processing in terms of throughput and delay. Especially, WTP shows much higher performance In ease of high error rate and high probability of burst errors. This comes from the fact that WTP uses a small number of packets to process a transaction compared to the other two protocols and introduces a fixed time interval for retransmission instead of the exponential backoff algorithm. The experiment also shows that the WTP performance is optimized when the retransmission counter is set to 5 or 6 in case of high burst error rate.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.1
• /
• pp.35-46
• /
• 2012

The development of wireless communication systems has resulted in the availability of several access technologies at any geographic area, such as 3G networks, wireless local area networks (WLANs) and wireless broadband networks. The development of these technologies is provided for users who have experienced mobile network environments which are slow or fast-movement environment and change distance between the AP(Access Point). This paper describes network performance issues in various environmental changes. Also, Fuzzy logic is applied to evaluate the performance in vehicle networks around users' environmental factors to focusing on the minimizing of transfer time and costs. First, WLAN and 3G networks fixed distance between AP, Second, WLAN and 3G networks random distance between APs, finally above two environmental with vehicle Ad hoc networks is analyzed. These V2I and V2V environmental condition are assumed. Results which based on Fuzzy logic suggest an optimal performance in vehicle network environments according to vehicle speed and distance between APs. Proposed algorithm shows 21% and 13% improvement of networks performance in V2I and V2V environment.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.149-157
• /
• 2012

In this thesis, the problem of computing approximate answers to continuous sliding-window joins over data streams when the available memory may be insufficient to keep the entire join state. One approximation scenario is to provide a maximum subset of the result, with the objective of losing as few result tuples as possible. An alternative scenario is to provide a random sample of the join result, e.g., if the output of the join is being aggregated. It is shown formally that neither approximation can be addressed effectively for a sliding-window join of arbitrary input streams. Previous work has addressed only the maximum-subset problem, and has implicitly used a frequency based model of stream arrival. There exists a sampling problem for this model. More importantly, it is shown that a broad class of applications for which an age-based model of stream arrival is more appropriate, and both approximation scenarios under this new model are addressed. Finally, for the case of multiple joins being executed with an overall memory constraint, an algorithm for memory allocation across the join that optimizes a combined measure of approximation in all scenarios considered is provided.