• Journal of KIISE:Information Networking
• /
• v.31 no.2
• /
• pp.224-232
• /
• 2004

To guarantee the reliability in multicast transmission, researches providing reliability through hierarchical control tree which is independent on data channel tree are known to provide high scalability. However, the logical control tree in transport layer constructed without topology information of the corresponding network layer tree may inefficiently use the network resources because the logical control tree is not closely related to the tree topology of the network layer. A router assisted control tree mechanism presented in this paper would improve the efficiency of the link as well as it would remove the replicated data. In addition, it requires to a router a small change which examines the message type of the control tree.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.171-192
• /
• 2017

The change of any element in the network is possible to cause performance degradation of the multicast network. So it is necessary to optimize the topology path through the multicast update strategy, which directly affects the performance and user experience of the overlay multicast. In view of the above, a new multicast tree update strategy based on perturbation theory Musp (Multicast Update Strategy based on Perturbation theory) is proposed, which reduces the data transmission interruption caused by the multicast tree update and improves user experiences. According to the multicast tree's elements performance and the topology structure, the Musp strategy defines the multicast metric matrix and based on the matrix perturbation theory it also defines the multicast fluctuation factor. Besides it also demonstrates the calculability of the multicast fluctuation factor presents the steps of the Musp algorithm and calculates the complexity. The experimental results show that compared with other update strategies, as for the sensitivity of the multicast fluctuation factor's energized multicast tree to the network disturbance, the maximum delay of the Musp update strategy is minimal in the case of the local degradation of network performance.

• Proceedings of the KIPE Conference
• /
• 2008.06a
• /
• pp.193-195
• /
• 2008

This paper proposed dc-dc converter with continuous output current for battery charger. If we charge energy storage device by conventional boost converter, current flows into the discontinuous and as a result reduces the life-time of battery. The output voltage of dc-dc converter should be higher than voltage of across the battery, specially if charging by PV there is a fluctuation of voltage due change of insolation and temperature, therefore will boost and regulate this voltage. The proposal converter includes forward converter and the output voltage of the proposal converter looks like an input voltage and forward output voltage's add. This topology was tested on simulation and experimentation. Simulation and experimentation results indicated that the proposal topology is useful for battery charging because the output current of the converter flows continuously and perfectly.

• Convergence Security Journal
• /
• v.13 no.1
• /
• pp.19-24
• /
• 2013

MANET has a highly dynamic topology because it consists of only mobile nodes. Various attacks using these characteristics exist. Among them, damage of the attacks based flooding such as DoS or DDos is large and traceback of the attack node is not easy. It is because route information by moving of intermediate nodes which pass the data changes frequently. In this paper, we propose table-based traceback technique to perform efficient traceback although route information by moving of nodes changes frequently. Cluster head manages route management table in order to form cluster status table and network topology snapshot for storing the location information of mobile nodes when cluster member nodes change. Also, bloom filter is used to reduce the amount of storing route information. The performance of the proposed technique is confirmed through experiment.

• Journal of Information Technology Services
• /
• v.11 no.4
• /
• pp.195-213
• /
• 2012

In ubiquitous environments, the Intelligent Transportation System (ITS) protocol is a typical service used to improve the quality of life for humans. The Vehicular Ad-hoc Network (VANET) protocol, a part of ITS, needs further study with regards to its support for high reliability, high speed mobility, data transmission efficiency, and so on. The IEEE 802.11 standard provides a high data rate channel, but it was designed for peer-to-peer network protocols. IEEE 802.11p also provides a high data rate channel, however, it only facilitates communication between roadside and on-board equipment. A VANET has characteristics that enable its topology to change rapidly; it can also be expanded to a multi-hop range network during communication. Therefore, the VANET protocol needs a way to infer the current topology information relating to VANET equipped vehicles. In this paper, we present the Multi-Beacon MAC Protocol, and propose a method to resolve the problem of beacon collisions in VANET through the use of this Multi-Beacon MAC protocol. Evaluation of the performance of Multi-Beacon MAC protocol by means of both mathematical analyses and simulation experiments indicate that the proposed method can effectively reduce beacon collisions and improve the throughput and the delay between vehicles in VANET systems.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.10a
• /
• pp.1051-1054
• /
• 2005

On this study, we optimized minimizing the characteristic function for mixed result of the structural contact analysis and the buckling analysis according to the pin jig initial model's level change using mixed the table of orthogonal away and ANOM, Pin jig's weight is reduced up to 20 percent considering constraint conditions. Also we optimized reducing 20 percent weight of pin jig model using topology optimization.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.277-280
• /
• 2009

Mobile Ad-hoc Network(MANET) could provide the reliable monitoring and control of a variety of environments for remote place. Mobility of MANET would require the topology change frequently compared with a static network. To improve the routing protocol in MANET, energy efficient routing protocol would be required as well as considering the mobility would be needed. In this paper, we propose a new method that the CACH(Context-aware Clustering Hierarchy) algorithm, a hybrid and clustering-based protocol that could analyze the link cost from a source node to a destination node. The proposed analysis could help in defining the optimum depth of hierarchy architecture CACH utilize. The proposed CACH could use localized condition to enable adaptation and robustness for dynamic network topology protocol and this provide that our hierarchy to be resilient.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.40-48
• /
• 2007

MANET constructs a network that is free and independent between sensor nodes without infrastructure. Also, there are a lot of difficulties to manage data process, control etc.. back efficiently from change of topology by transfer of sensor node that compose network. Especially, because each sensor node must consider mobility certainly, problem about energy use happens. To solve these problem, mechanisms that compose cluster of cluster header and hierarchic structure between member were suggested. However, accompanies inefficient energy consumption because sensing power level of sensor node is fixed and brings energy imbalance of sensor network and shortening of survival time. In this paper, I suggested intelligent clustering mechanism for efficient energy management to solve these problem of existent Clustering mechanism. Proposed mechanism corresponds fast in network topology change by transfer of sensor node, and compares in existent mechanism in circumstance that require serial sensing and brings elevation survival time of sensor node.Please put the abstract of paper here.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.1
• /
• pp.39-48
• /
• 2013

This paper develops a 2-D moving least squares(MLS) difference method for Stefan problem by extending the 1-D version of the conventional method. Unlike to 1-D interfacial modeling, the complex topology change in 2-D domain due to arbitrarily moving boundary is successfully modelled. The MLS derivative approximation that drives the kinetics of moving boundary is derived while the strong merit of MLS Difference Method that utilizes only nodal computation is effectively conserved. The governing equations are differentiated by an implicit scheme for achieving numerical stability and the moving boundary is updated by an explicit scheme for maximizing numerical efficiency. Numerical experiments prove that the MLS Difference Method shows very good accuracy and efficiency in solving complex 2-D Stefan problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.219-224
• /
• 2008

In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.