• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1387-1390
• /
• 2008

In a wireless network, handover latency is very important in supporting user mobility with the required quality of service (QoS). In view of this many schemes have been developed which aim to reduce the handover latency. The Hierarchical Mobile IPv6 (HMIPv6) approach is one such scheme which reduces the high handover latency that arises when mobile nodes perform frequent handover in Mobile IPv6 wireless networks. Although HMIPv6 reduces handoff latency, failures in the mobility anchor point (MAP) results in severe disruption or total disconnection that can seriously affect user satisfaction in ongoing sessions between the mobile and its correspondent nodes. HMIPv6 can avoid this situation by using more than one mobility anchor point for each link. In [3], an improved Robust Hierarchical Mobile IPv6 (RH-MIPv6) scheme is presented which enhances the HMIPv6 method by providing a fault-tolerant mobile service using two different MAPs (Primary and Secondary). It has been shown that the RH-MIPv6 scheme can achieve approximately 60% faster recovery times compared with the standard HMIPv6 approach. However, if mobile nodes perform frequent handover in RH-MIPv6, these changes incur a high communication overhead which is configured by two local binding update units (LBUs) as to two MAPs. To reduce this communication overhead, a new cost-reduced binding update scheme is proposed here, which reduces the communication overhead compared to previous schemes, by using an increased number of MAP switches. Using this new proposed method, it is shown that there is a 19.6% performance improvement in terms of the total handover latency.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.1
• /
• pp.9-15
• /
• 2021

Recently, it is increasingly necessary to run high-end neural network applications with huge computation overhead on top of resource-constrained embedded systems, such as wearable devices. While the huge computational overhead can be alleviated by distributed neural networks running on multiple separate devices, existing distributed neural network techniques suffer from a large traffic between the devices; thus are very vulnerable to communication failures. These drawbacks make the distributed neural network techniques inapplicable to wearable devices, which are connected with each other through unstable and low data rate communication medium like human body communication. Therefore, in this paper, we propose a distributed neural network partitioning technique that is resilient to communication failures. Furthermore, we show that the proposed technique also improves the inference accuracy even in case of no communication failure, thanks to the improved network partitioning. We verify through comparative experiments with a real-life neural network application that the proposed technique outperforms the existing state-of-the-art distributed neural network technique in terms of accuracy and resiliency to communication failures.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.39 no.2
• /
• pp.191-197
• /
• 2015

The message passing interface (MPI) and hybrid programming models for the parallel computation of a pressure equation were compared in a distributed memory system. Both models were based on domain decomposition, and two numbers of the sub-domain were selected by considering the efficiency of the hybrid model. The parallel performances for various problem sizes were measured using up to 96 threads. It was found that in addition to the cache-memory size, the overhead of the MPI communication/OpenMP directives affected the parallel performance. For small problems, the parallel performance was low because the percentage of the overhead of the MPI communication/OpenMP directives increased as the number of threads increased, and MPI was better than the hybrid model because it had a smaller communication overhead. For large problems, the parallel performance was high because, in addition to the cache effect, the percentage of the communication overhead was relatively low compared to that for small problems, and the hybrid model was better than MPI because the communication overhead of MPI was more dominant than that of the OpenMP directives in the hybrid model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.8
• /
• pp.981-987
• /
• 2019

In this paper, we propose a new SC-FDE (single carrier frequency domain equalization) structure to cope with narrow band interference signals or jammers and reduce pilot overhead. The conventional SC-FDE structure has a problem that the receiver performance degrades severely due to difficulty in time-domain channel estimation when narrow band jammers exist. In addition, the spectral efficiency is lowered by transmitting pilot at every SC-FDE block to estimate channel response. In order to overcome those problems, the proposed structure is devised to estimate frequency domain channel directly without time domain channel estimation. To reduce the pilot overhead, several data blocks are transmitted between two pilots. The channel estimate of each data block is found through linear interpolation of two channel estimates at two pilots. By performing frequency domain channel equalization using this channel estimate, the distortion by the channel is well compensated when narrow band jammers exist. The performance of the proposed structure is confirmed by computer simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.3
• /
• pp.1249-1272
• /
• 2016

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.3
• /
• pp.331-337
• /
• 2014

The Korean distribution system consists of overhead ground wire (OHGW), phase conductors and neutral wire. Especially, OHGW is installed over the phase conductors to protect distribution system from the lightning surge. The flashover rate and the magnitude of lightning overvoltage on distribution system can be affected by grounding condition of OHGW such as grounding resistance and grounding interval. In this paper, we conduct an analysis of lightning overvoltage and flashover rate according to the grounding condition of OHGW. The distribution system and lightning surge are modeled by using ElectroMagnetic Transient Program (EMTP). Also, the Monte Carlo method is applied to consider random characteristics of lightning, and the flashover rate is calculated based on IEEE std. 1410. The simulations are performed by changing the grounding resistance and interval of OHGW and the simulation results are analyzed.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.1
• /
• pp.167-174
• /
• 2016

The Korean distribution line currently consists of overhead ground wires (OHGW), overhead distribution lines, neutral wires (NW), and messenger wires (MW). The MW is installed under the NW. The lightning protection system in Korea is focused on OHGW and lightning arrester and the MW are not considered. Therefore, this paper proposes the applicability of MW for purpose of lightning protection. For this, we analyzed the effects of lightning overvoltage according to the existence of OHGW and MW and the grounding conditions of the MW in the Korean distribution system. The grounding conditions of the MW that we took into consideration were the common or separate grounding of the MW and NW. The analysis based on the equivalent circuit of the distribution pole at each condition was performed. The distribution lines and lightning were modeled using the Electromagnetic Transients Program (EMTP). For each of the installation conditions of the OHGW and MW, the various lightning conditions were simulated and analyzed for both direct and indirect lightning. The simulation results showed that, if the OHGW was not installed in the Korean distribution system, the lightning overvoltage could be reduced by the common grounding of the MW and NW.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.9-17
• /
• 2009

A Mobile Ad hoc network(MANET) is a network consisting of a set of wireless mobile nodes, which communicate with each other without centralized control or established infrastructure. In this paper, to obtain a better understanding of AODV(Ad hoc On-Demand Distance Vector Routing Protocol)and OLSR(Optimized Link State Routing Protocol) routing protocols, different performances are simulated and analyzed using OPNET modeler 14.5 with the various performance metrics, such as packet delivery ratio, end-to-end delay and routing overhead. As a conclusion, in static analysis, the routing overhead of OLSR is affected by the number of nodes, but not data traffic. In AODV case, it is affected by both data traffic and number of nodes. In mobility analysis, routing overhead is not greatly affected by mobility speed in AODV and OLSR, and the PDR(Packet Delivery Ration) of OLSR is decreased as the node speed increased, while AODV is not changed. AS to delay, AODV is always higher than OLSR in both static and nobility cases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.4
• /
• pp.87-97
• /
• 2009

A Mobile Ad hoc Network (MANET) is characterized by multi-hop wireless connectivity, frequently changing network topology with mobile nodes and the efficiency of the dynamic routing protocol plays an important role in the performance of the network. In this paper, the performance of five routing protocols for MANET is compared by using OPNET modeler: AODV, DSR, GRP, OLSR and TORA. The various performance metrics are examined, such as packet delivery ratio, end-to-end delay and routing overhead with varying data traffic, number of nodes and mobility. In our simulation results, OLSR shows the best performance in terms of data delivery ratio in static networks, while AODV has the best performance in mobile networks with moderate data traffic. When comparing proactive protocols (OLSR, GRP) and reactive protocols (AODV, DSR) with varying data traffic in the static networks, proactive protocols consistently presents almost constant overhead while the reactive protocols show a sharp increase to some extent. When comparing each of proactive protocols in static and mobile networks, OLSR is better than GRP in the delivery ratio while overhead is more. As for reactive protocols, DSR outperforms AODV under the moderate data traffic in static networks because it exploits caching aggressively and maintains multiple routes per destination. However, this advantage turns into disadvantage in high mobility networks since the chance of the cached routes becoming stale increases.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.3
• /
• pp.13-18
• /
• 2023

As the number of mobile applications increases rapidly, the overhead of swapping in smartphone memory systems keeps increasing. Unlike desktop or server systems, the basic setting of smartphones does not support swapping, so applications are killed when available memory is exhausted. This is because swapping in smartphones incurs excessive storage I/O overhead. In this article, we propose a swapping policy for smartphones, which significantly reduces storage I/Os. The proposed policy categorizes mobile applications based on their functional characteristics, and controls the number of applications to be swapped based on application priorities and memory situations. Measurement experiments with Android reference devices show that the proposed swapping policy dramatically reduces the overhead of swapping in various mobile applications.