• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.12
• /
• pp.291-306
• /
• 2020

Nowadays, Data-Network-AI (DNA)-based intelligent services and applications have become a reality to provide a new dimension of services that improve the quality of life and productivity of businesses. Artificial intelligence (AI) can enhance the value of IoT data (data collected by IoT devices). The internet of things (IoT) promotes the learning and intelligence capability of AI. To extract insights from massive volume IoT data in real-time using deep learning, processing capability needs to happen in the IoT end devices where data is generated. However, deep learning requires a significant number of computational resources that may not be available at the IoT end devices. Such problems have been addressed by transporting bulks of data from the IoT end devices to the cloud datacenters for processing. But transferring IoT big data to the cloud incurs prohibitively high transmission delay and privacy issues which are a major concern. Edge computing, where distributed computing nodes are placed close to the IoT end devices, is a viable solution to meet the high computation and low-latency requirements and to preserve the privacy of users. This paper provides a comprehensive review of the current state of leveraging deep learning within edge computing to unleash the potential of IoT big data generated from IoT end devices. We believe that the revision will have a contribution to the development of DNA-based intelligent services and applications. It describes the different distributed training and inference architectures of deep learning models across multiple nodes of the edge computing platform. It also provides the different privacy-preserving approaches of deep learning on the edge computing environment and the various application domains where deep learning on the network edge can be useful. Finally, it discusses open issues and challenges leveraging deep learning within edge computing.

• The KIPS Transactions:PartD
• /
• v.12D no.6 s.102
• /
• pp.915-920
• /
• 2005

In this paper we expanded a existing web based B2B system to support users in low speed network. To guarantee shared dat a consistency between clients and a server, we proposed a method of data change detection by using a time stamp tree and the performance analysis of the proposed method was proved by a simulation. Under the worst condition that leaf nodes of a times tamp tree were changed uniform distribution, the simulation result showed that the proposed method was more efficient than a sequential detection until the percentage of changed nodes were below $15\%$. According to our observation, the monthly average of data change was below $7\%$ on a web-based construction MRO B2B system or a company A from April 2004 to August 2004. Therefore the Proposed method improved performance of data change detection in practice. The proposed method also reduced storage consumption in a server because it didn't require a server to store replicated data for every client.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.11A
• /
• pp.870-877
• /
• 2011

IEEE 802.11 devices are widely used, and terminals can be equipped with multiple IEEE 802.11 interfaces as low-cost IEEE 802.11 devices are deployed. The off-the-shelf IEEE 802.11 devices provide multiple channels and multiple data rates. In practical multi-channel networks, since there is channel heterogeneity which indicates that channels have different signal characteristics for the same node, channels should be efficiently assigned to improve network capacity. In addition, in multi-rate networks, low-rate links severely degrade the performance of high-rate links on the same channel, which is known as performance anomaly. Therefore, in this paper, we propose a heterogeneity aware channel assignment (HACA) algorithm that improves network performance by reflecting channel heterogeneity and performance anomaly. Through NS-2 simulations, we validate that the HACA algorithm shows improved performance compared with existing channel assignment algorithms that do not reflect channel heterogeneity.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.584-587
• /
• 2012

MANET, which can be constructed with only terminal devices, has structural advantages of ease installation and operation, also has environmental change of rapid supply of smart phone, it's usage can be extended to application area likes as emergency communication, leasure, exploration and investigations. But, as one characteristic of MANET, no use of communicaton infrastructure caused disadvantage of weakness for information intrusion which is frequently occurred, nowadays. In this paper, the effects of IDS(Intrusion Detection System), one of defence tools for information intrusion, is analyzed for transmission performance. Blackhole attack is assumed as a type of intrusion, MANET defence with IDS from intrusions. Computer simulation based on NS-2 used for performance measurement. In this paper, performance measurement is done for application service to analyze application level effects of IDS. VoIP service is used as application service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.1A
• /
• pp.82-89
• /
• 2011

The Proxy Mobile IPv6 is a network-based localized mobility management protocol. In the PMIPv6, Mobile Nodes are topologically anchored at a Local Mobility Anchor, which forwards all data packets for registered Mobile Nodes. Since all data packets destined for the Mobile Nodes a1ways traverse the Mobile Nodes's Local Mobility Anchor, the LMA might be bottleneck and the end-to-end de1ay are increased. Therefore, in this paper, we proposed an enhanced Route Optimization scheme in Multiple Local Mobility Anchors environment. In order to rapid1y detect Route Optimization, we designed Domain Information Table in Mobility Access Gateway. Furthermore, we use Correspondent Binding Cache in Local Mobility Anchor to maintain Route Optimization information during Mobile Nodes's handover. To solve packet loss and reodering problems during handover, we propose a new buffering and forwarding scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.4 s.346
• /
• pp.13-21
• /
• 2006

An mobile ad hoc network(MANET) is a collection of wireless computers (nodes), communicating among themselves over multi-hop paths, without the help of any infrastructure such as base stations or access points. Prior research in MANET has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we design and evaluate the Secure Zone Routing Protocol(T-ZRP), a secure ad hoc network routing protocol is based on the design of the hash chain. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and don't use asymmetric cryptographic operations in the protocol. Proposed algorithm can safely send to data through authentication mechanism and integrity about routing establishment.

• The Journal of the Korea Contents Association
• /
• v.9 no.2
• /
• pp.67-75
• /
• 2009

The growing need for the mobility supportable networks induces the IP-based mobility management protocols. Though HMIPv6 which manages the micro-mobility of mobile nodes using MAPs suggests an effective method for mobility-support for mobile nodes within the domain that is managed by MAP. There is a problem that traffic may be concentrated on MAPs. In this paper, therefore, we proposed a method that can effectively distribute the traffic which is concentrated on a MAP under phased Mobile IPv6. In our proposed method, two or more MAPs are required and classified as an 'Active MAP' or a 'Passive MAP'. In addition, we defined the state of transition events between Active MAP and Passive MAP and the operations among MAPs for load distribution when an overload condition is occurred at some MAPs by traffic congestion. We compared the performance of our proposed method with its phased Mobile IPv6 to prove the propriety of our proposed method. As a result, we showed that our proposed method can provide an enhanced performance by about 12 percentages in view of packet throughput at the node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.728-735
• /
• 2003

It is a mainly issue that provide mobility smoothly in Mobile IP networks. The IP mobility support being standardized in the IETF utilized tunneling of IP packets from a home agent to foreign agent and utilized reverse tunneling of IP packets from foreign agent to home agent. In this paper, We propose that solve the triangular routing problem in IP mobility and that lessen the messages about IETF routing optimization. Through the Mobile Routing Table on the edge router, agent process the message instead of a end node when handoff occur and that lessen the routing path length by sending directly from FA to to Correspond Node's router. This action lessen the message occurrence frequency and the packet drop. We compare the standard IP, Routing Optimization of Mobile IP, Wu's method and the proposed algorithm. Finally, the simulation results are presented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.12B
• /
• pp.719-727
• /
• 2007

The Wireless Mesh Network technology is able to provide an infrastructure for isolated islands, in which it is difficult to install cables or wide area such as battlefield of armed forces. Therefore, Wireless Mesh Network is frequently used to satisfy needs for internet connection and active studies and research on them are in progress However, as a result of increase in number of hops under hop-by-hop communication environment has caused a significant decrease in throughput and an increase in delay. Considering the heavy traffic of real-time data, such as voice or moving pictures to adaptive WMN, in a military environment, it is restricted for remote units to have their Mesh Node to get real-time services. Such phenomenon might cause an issue in fairness. In order to resolve this issue, the Location-based Packet Scheduling Scheme, which can provide an fair QoS to each mesh node that is connected to each echelon's AP and operates based on WRR method that gives a priority to emergency message and control packet. The performance of this scheme is validated.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.1-7
• /
• 2009

When constructing various mobile networks including sensor networks, the problem of finding the layout or graph to interconnect the terminals or nodes of the network may come up. Providing a common scheme that can be applied to the kind of problems, and formulating the bounds of the run time and the result of the algorithm from the scheme, one may evaluate precisely the plan of constructing analogous network systems. This paper, dealing with EMST(Euclidean Minimum Spanning Tree) that represents such problems, provides the scheme for constructing EMST by parallel processing over distributed environments, and the ground for determining the maximum difference of the layout or the graph produced from the scheme: the difference from EMST. In addition, it provides the upper bound of the run time of the algorithm from the scheme.