• Journal of IKEEE
• /
• v.25 no.4
• /
• pp.598-606
• /
• 2021

In this paper, we presents a new service binding and resource management model for context based services in mobile edge computing (MEC) networks. The proposed control is composed of two layers: MEC service bindng control layer (MCL) and user context control layer (UCL). The MCL manages service binding construction, resource allocation, and service policy construction from a system point of view; and the UCL manages real-time service adaptation using meta-objects. Through simulations, we confirmed that the proposed control offers enhanced throughput and content transfer time when it is compared to the legacy computing and control models. The proposed control model can be employed as a key component for the context based various internet-of-things (IoT) services in MEC environments.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.593-602
• /
• 2005

Overlay multicast delivery method is a new approach in which multicast functionality is implemented at the end-hosts application layer in the timing of sparse deployment of IP multicast. However, existing overlay multicast protocols are not being standardization and many restrictions occur when delivering high capacity contents. Therefore, new delivery mechanism is required for the overlay multicast based high capacity contents delivery. In this paper. we separate group management and delivery management of overlay multicast and describe a capable group management. We also defined high speed delivery method better than that of existing overlay multicast through use of collaborated distribute downloading. This improved efficiency of massive contents transmission.

• Smart Media Journal
• /
• v.2 no.4
• /
• pp.51-59
• /
• 2013

With increasing transmission speed of backbone networks, it is getting to provide enough available bandwidth. However, the bandwidth is not effectively utilized in volumetric data transfer. This mainly comes from the transmission protocol, TCP, which is used for most applications. TCP is inherently difficult to adapt the available bandwidth because of it's own characteristic of transfer mechanism. UDT is a prominent application level data transfer protocol which is targeting high speed network. In this paper, we propose UDT parallel transfer technologies which is adaptive to network status and then evaluate their performance in two points of view. Firstly, we measure data transfer rate of UDT with rate congestion control methods, and compare them with basic UDT. Secondly, we apply parallel transfer technologies adapted to network status, and measure their performance. Experimental results showed that UDT rate congestion control method outperforms UDT with 106% improvement in RTT 100ms section set with jitter 30ms. In addition, performance of parallel transfer with rate congestion control method showed 107% improvement than that of parallel transfer in RTT 400ms section set with jitter 20ms.

• Journal of Korea Multimedia Society
• /
• v.12 no.9
• /
• pp.1297-1308
• /
• 2009

The life time of a wireless sensor network composed of numerous sensor nodes depend on ones of its sensor nodes. The energy efficiency operation of nodes, therefore, is one of the crucial factors to design the network. Researches based on the hierarchical network topology have been proposed and evolved in terms of energy efficiency. However, in existing researches, application layer data obtained from sensor nodes are not considered properly to compose cluster, including issue that nodes communicate with their cluster heads in TDMA scheduling. In this paper, we suggest an energy-efficient topology control scheme based on application layer data in wireless sensor networks. By using application layer data, sensor nodes form a section which is defined as the area of adjacent nodes that retain similar characteristics of application environments. These sections are further organized into clusters. We suggest an algorithm for selecting a cluster head as well as a way of scheduling to reduce the number of unnecessary transmissions from each node to its cluster head, which based on the degree and the duration of similarity between the node's data and its head's data in each cluster without seriously damaging the integrity of application data. The results show that the suggested scheme can save the energy of nodes and increase the life time of the entire network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.84-94
• /
• 2006

In this paper, we propose the algorithm to reduce guard time of UWB MAC time slot for throughput gain. In the proposed draft by multiband ofdm alliance (MBOA), Guard time of each medium access slot (MAS) is composed of shortest inter-frame space (SIFS) and MaxDrift which is the time caused by maximum frequency offset among devices. In this paper, to reduceguard time means that we nearly eliminate MaxDrift term from guard time. Each device of a piconet computes relative frequency offset from the device initiating piconet using periodically consecutive transferred beacon frames. Each device add or subtract the calculated relative frequency offset to the estimated each MAS starting point in order to synchronize with calculated MAS starting point of the device initiating piconet. According to verification of simulations, if the frequency offset estimator is implemented with 8 decimal bit, the ratio of the wasted time to Superframe is always less than 0.0001.

• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.289-298
• /
• 2006

Algorithms for application-level multicast often use trees to deliver data from the source to the multiple receivers. With the tree structure, the throughput experienced by the descendant nodes will be determined by the performance of the slowest ancestor node. Furthermore, the failure of an ancestor node results in the suspension of the session of all the descendant nodes. This paper focuses on the transmission of data using multiple virtual forwarders, and suggests a scheme to overcome the drawbacks of the plain tree-based application layer multicast schemes. The proposed scheme elects multiple forwarders other than the parent node of the delivery tree. A receiver receives data from the multiple forwarders as well as the parent node and it can increase the amount of receiving data per time unit. The multiple forwarder helps a receiver to reduce the impact of the failure of an ancestor node. The proposed scheme suggests the forwarder selection algorithm to avoid the receipt of duplicate packets. We implemented the proposed scheme using MACEDON which provides a development environment for application layer multicast. We compared the proposed scheme with Bullet by applying the implementation in PlanetLab which is a global overlay network. The evaluation results show that the proposed scheme enhanced the throughput by 20 % and reduced the control overhead over 90 % compared with Bullet.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.2
• /
• pp.55-65
• /
• 2004

In this paper, An efficient non-scan DFT method for datapaths described in RTL is proposed. The proposed non-scan DFT method improves testability of datapaths based on hierarchical testability analysis regardless to width of the datapath. It always guarantees higher fault efficiency and faster test pattern generation time with little hardware overhead than previous methods. The experimental result shows the superiority of the proposed method of test pattern generation time, application time, and area overhead compared to the scan method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.7
• /
• pp.747-749
• /
• 2016

We consider a time-division multiple-access relay channel (MARC), in which two source nodes (SNs) transmit data with different data rate to a destination node (DN) with the help of a relay node (RN) using network coding (NC). However, due to its asymmetric data rate, the RN cannot combine the received bits by XOR NC. In this paper, we compare with the problem of asymmetric data rates by using zero padding and hierarchical 16QAM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.4B
• /
• pp.424-434
• /
• 2004

Ubiquitous network consists of various devices using several heterogeneous protocols and requires seamless communication between devices. This paper proposes a new hierarchical event service and multiple event server architecture to implement the service under ubiquitous environment. The proposed event service classifies devices by logical and physical location to abstract the idiosyncrasy of used protocols, and reduces network load. Due to the design consideration, the proposed architecture removes transfer of duplicated event data effectively. As a result, we can guarantee the reliable event delivery. The prototype multiple event server architecture was implemented according to the proposed idea and evaluated its performance under a home network test bed.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.49-54
• /
• 2018

In this paper, we study the secrecy outage probability when using cooperative diversity and jammer in a relay system based on decode-and-forward. MRC method is used in receiver and eavesdroppers to obtain cooperative diversity. To use the MRC technique, direct links between the sender and receiver, and between the sender and the eavesdropper are used, respectively. Jammers are used to generate intentional noise siganls to increase security capacity. Jammers generate intentional noise, degrading the channel quality of the eavesdropper and helping physical layer security be realized. The secrecy outage probability is used to evaluate security performance. Assume that the system is under the Rayleigh fading channel.