• The Journal of the Korea Contents Association
• /
• v.7 no.4
• /
• pp.49-55
• /
• 2007

Recently, with the IPTV services, e-learning, real-time broadcasting and e-contents, many application services need the multicasting routing protocol. In this paper, the performance of the algorithm to assign the rendezvous router (RP: rendezvous point) in the center-based multicasting mesh network is analyzed. The estimated distance to select RP in the candidate nodes is calculated, and the node minimizing the distance is selected as the optimal RP. We estimate the distance by using the maximum distance, average distance, and mean of the maximum and average distance between the RP and members. The performance of the algorithm is compared with the optimal algorithm of all enumeration. With the assumptions of mesh network and randomly positioned for sources and members, the simulations for different parameters are studied. From the simulation results, the performance deviation between the algorithm with minimum cost and optimal method is evaluated as 6.2% average.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.165-170
• /
• 2007

The main goal of research concerning clustering protocols is to minimize the energy consumption of each node and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols mainly focused on the design and formation of clusters, leaving the consideration of communication between the cluster head and the sink behind. In this paper, we propose efficient multi path routing algorithm by using MAC-NET Cross-layering. multi path needed only one tiny packet from sink to setup. In addition proposed algorithm can be used for any cluster-based hierarchical inter-clustering routing algorithm. The simulation results demonstrate that proposed algorithm extended the overall survival time of the network by reducing the load of cluster heads. The performance of proposed algorithm is less affected by the extension of sensing field than other inter-clustering operation.

• Fire Science and Engineering
• /
• v.23 no.6
• /
• pp.75-81
• /
• 2009

In this paper, USN of wireless communication with easy to install and effectiveness with variety information gathering has been proposed as a alternative of wired-based line for transmission of fire sensing data. But, The sensor node using USN should be considered for wireless transmission range and reliability of information. In this study, the zigbee protocol sensor node was implemented and then tested transmission range of sensor node as 10m interval using voltage information of DC 3V & 5V. Here, maximum transmission distance was confirmed 90m inside-outside. When used mesh routing relay node, distance was not limited. In USN network building, when fire sensing data transmitted, the sensing data same between direct sensing data from sensor and collecting data at USN. Therefore, was confirmed reliability for transmission range and information of proposed zigbee sensor node.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.456-469
• /
• 2009

We develop a new wireless link quality metric, ECOT(Estimated Channel Occupancy Time) that enables a high throughput route setup in wireless mesh networks. The key feature of ECOT is to be applicable to diverse mesh network environments where IEEE 802.11 MAC (Medium Access Control) variants are used. We take into account the exact operational features of 802.11 MAC protocols, such as 802.11 DCF(Distributed Coordination Function), 802.11e EDCA(Enhanced Distributed Channel Access) with BACK (Block Acknowledgement), and 802.11n A-MPDU(Aggregate MAC Protocol Data Unit), and derive the integrated link metric based on which a high throughput end-to-end path is established. Through extensive simulation in random-topology settings, we evaluate the performance of proposed link metric and present that ECOT shows 8.5 to 354.4% throughput gain over existing link metrics.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.11-19
• /
• 2010

ZigBee is a standard for wireless personal area networks(WPANs) based on the IEEE 802.15.4 standard. It has been developed for low cost and low power consumption. There are two alternative routing schemes that have been proposed for the ZigBee standard: Ad-hoc On-Demand Distance Vector(AODV) and tree routing. The tree routing forwards packets from sensors to a sink node based on the parent-child relationships established by the IEEE 802.15.4 MAC topology formation procedure. In order to join the network, a sensor node chooses an existing node with the strongest RSSI(Received signal strength indicator) signal as a parent node. Therefore, some nodes carry a large amount of traffic load and exhaust their energy rapidly. To overcome this problem, we introduce a new metric based on link quality and traffic load for load balancing. Instead of the strength of RSSI, the proposed scheme uses the new metric to choose a parent node during the topology formation procedure. Extensive simulation results using TOSSIM(TinyOS mote SIMulator) show that the CFR scheme outperforms well in comparison to the conventional tree routing scheme.

• International journal of advanced smart convergence
• /
• v.5 no.1
• /
• pp.66-72
• /
• 2016

In this paper, we proposed the clustering algorithm using fuzzy inference system for improving adaptability the cluster head selection of TEEN. The stochastic selection method cannot guarantee available of cluster head. Furthermore, because the formation of clusters is not optimized, the network lifetime is impeded. To improve this problem, we propose the algorithm that gathers attributes of sensor node to evaluate probability to be cluster head.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.4
• /
• pp.15-23
• /
• 1995

In this paper, we evaluate the performance of a transient queueing approximation when it is applied to modeling computer communication networks. An operational computer network that uses the ISO IS-IS(Intermediate System-Intermediate System) routing protocol is modeled as a Jackson network. The primary goal of the approximation pursued in the study was to provide transient queue statistics comparable in accuracy to the results from conventional Monte Carlo simulations. A closure approximation of the M/M/1 queueing system was extended to the general Jackson network in order to obtain transient queue statistics. The performance of the approximation was compared to a discrete event simulation under nonstationary conditions. The transient results from the two simulations are compared on the basis of queue size and computer execution time. Under nonstationary conditions, the approximations for the mean and variance of the number of packets in the queue erer fairly close to the simulation values. The approximation offered substantial speed improvements over the discrete event simulation. The closure approximation provided a good alternative Monte Carlo simulation of the computer networks.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.2
• /
• pp.99-105
• /
• 2007

MANET(Mobile Ad-hoc network) have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of MANET in routing, we consider, in this paper, how to efficiently support applications such as variable geocasting basd on MANET. The goal of a geocasting protocol is deliver data packet to a group of nodes that are located within a specified geocasting region. Previous research that support geocast service in mobilie computing based on MANET have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the mobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance of Accessibility & Network Overhead than previous research.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.417-420
• /
• 2004

Ad hoc network는 유선 백본 없이 이동 노드들로만 구성된 네트워크로서 이동 노드들의 움직임이 빈번히 발생하기 때문에 네트워크의 안정성을 유지하기가 어렵다. 또한 중앙 집중화된 보안 기반구조가 아니기 때문에 보안 공격을 받기가 쉽고 노드들이 쉽게 손상될 수 있다. 기존의 보안 방법 중의 하나인 threshold cryptography는 키의 유지와 분배를 위한 효율적인 구조를 제공하였으나 라우팅의 오버헤드가 증가하였고, 네트워크 전역의 트래픽이 증가되었다. 게다가 서비스 거부 공격과 wormhole과 같은 공격은 ARP 또는 IP spoofing을 통하여 쉽게 받을 수 있다. 본 논문에서는 threshold cryptography에 의해 야기되는 오버헤드를 줄이고 노드간의 인증된 패킷 전달을 돕기 위한 새로운 접근 방법을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.4
• /
• pp.678-683
• /
• 2003

This study presents a result of performance with the design of network topology for voice and data integration under computer network. This network is consisted of FastEthernet, other LANs and ATM WAN(wide area network), and performance evaluation of delay in a PBX+IP network, delay in a VoIP network and delay in a IP+ATM network will be shown. We use parameters including network bandwidth, number of packet, routing protocol(IGRP, OSPF). We simulate integrated of voice and data used PBX. we will study further about the case of integrated of voice and data environments using PBX. and, evaluate IP+ATM WAN average measured network delay and average delay of VoIP network.