• Journal of Korea Society of Industrial Information Systems
• /
• v.17 no.4
• /
• pp.41-50
• /
• 2012

Network life time is very important issue for wireless sensor network(WSN). It is very important to design sensor networks for sensors to utilize their energies in effective ways. A-PEGASIS that basically bases on PEGASIS and enhances in two aspects-an elegant chain generation algorithm and periodical update of chains. However, it has problems in the chain generation mechanism and some possibility of network partitioning or sensing hole problem in the network, in LEACH related protocols. This dissertation proposes a new clustering protocol to solve the co-shared problems in the previous protocols. The basic idea of our scheme is using the table for node connectivity. The results show that the network life time would be extended in about 1.8 times longer than LEACH and 1.5 times longer than PEGASIS-A.

• Korean Journal of Optics and Photonics
• /
• v.28 no.6
• /
• pp.304-313
• /
• 2017

The finite element analysis for optimizing a mirror system consisting of a large-diameter mirror and flexures requires numerous, repetitive calculations and corrections of the actual model to satisfy the given design conditions. In general, modification of this real model is conducted by reconfiguring nodes of the elements. The reconfiguration is very time-consuming work, to fix the continuity of each of the newly formed component nodes at the interfaces. But the process is a very important factor in determining the analysis time. To save time in modeling and actual computation, and to attain faster convergence, we present a new opto-mechanical analysis using non-shared node connections at each of the interfaces of the optical components. By comparing the results between the new element model and a conventional element model with shared node connections, we found that the opto-mechanical performance was almost the same, but the time to reach the given condition was drastically reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.205-210
• /
• 2017

Wireless sensor networks are useful to various unmanned monitoring application such as monitoring environments, surveillance system, unmanned space exploration, and so on. Due to the inappropriate placement of sensor nodes, there are some problems, for example, low connectivity and high overlapped sensing area. These problems can make it difficult for the data collection and lead to a waste of energy. In this paper, we propose a node relocating method to resolve the inappropriate placement of sensor nodes. Given monitoring area, we place sensor nodes randomly and find redundant nodes and move them to uncovered area. Through the simulation, We show that the proposed method is viable and efficient compared with the existing randomly locating method.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.425-426
• /
• 2016

In this paper, we proposed an algorithm based on movement prediction using Markov chain in delay tolerant networks(DTNs). The existing prediction algorithms require additional information such as a node's schedule and connectivity between nodes. However, network reliability is lowered when additional information is unknown. To solve this problem, we proposed an algorithm for predicting a movement path of the node by using Markov chain. The proposed algorithm maps speed and direction for a node into state, and predict movement path of the node using transition probability matrix generated by Markov chain. As the result, proposed algorithm show that the proposed algorithms has competitive delivery ratio but with less average latency.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.1013-1019
• /
• 2016

This paper describes a novel Context-awareness Markov Chain Prediction (CMCP) algorithm based on movement prediction using Markov chain in Delay Tolerant Network (DTN). The existing prediction models require additional information such as a node's schedule and delivery predictability. However, network reliability is lowered when additional information is unknown. To solve this problem, we propose a CMCP model based on node behaviour movement that can predict the mobility without requiring additional information such as a node's schedule or connectivity between nodes in periodic interval node behavior. The main contribution of this paper is the definition of approximate speed and direction for prediction scheme. The prediction of node movement forwarding path is made by manipulating the transition probability matrix based on Markov chain models including buffer availability and given interval time. We present simulation results indicating that such a scheme can be beneficial effects that increased the delivery ratio and decreased the transmission delay time of predicting movement path of the node in DTN.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.4
• /
• pp.65-71
• /
• 2008

In this study, two residential complexes, both built in the New City area after 2006 and both composed of over 500 households, were selected to estimate an efficient accessibility and connectivity index using accessibility and connectivity theories and methods from previous studies. With architectural blueprints, the nodes and edges of both residential complexes were drawn out and the accessibility matrixes were derived using these nodes and edges. As a result, the connectivity indices of both residential complexes were lower than 1, the accessibility index of Dong-tan was 86.922 being smaller than the accessibility index of Ilsan, 96.199, and the efficiency index of both residential complexes were similar being 0.26. With these indices it is expected to geometrically estimate the residential complexes and predict the pedestrian passing conveniences.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.341-343
• /
• 2008

This letter presents an angular minimum spanning tree (AMST) algorithm for topology control in multi-hop wireless ad hoc networks. The AMST algorithm builds up an MST for every angular sector of a given degree around each node to determine optimal transmission power for connecting to its neighbors. We demonstrate that AMST preserves both local and network-wide connectivity. It also improves robustness to link failure and mitigates transmission power waste.

• 한국정보디스플레이학회:학술대회논문집
• /
• 2006.08a
• /
• pp.739-742
• /
• 2006

In this paper, we propose a method for automatic generation of equivalent circuit for unit cell of LCDTV. In order to extract a circuit model, computer program generates electrical connectivity of resistors and capacitors from the layout through pattern analysis with electrode and port information. For combining two types of independent equivalent circuits, we propose a node insertion algorithm. As a consequence, we can generate an equivalent RC circuit without increasing the capacitive elements.