• Journal of Korea Society of Industrial Information Systems
• /
• v.6 no.2
• /
• pp.7-15
• /
• 2001

In this paper, we suggest the algorithm that inserts or deletes documents into web sites without creating tag. This algorithm uses tag which links between documents to automatically inset or delete the web documents. This study extracts the texts in the ... tag of the document to put into the structure as a type of graph creating the link as a node m of sub-node. That is, in this case of configurating new link between web documents, this algorithm allows to insert or delete the node to or from the graph without creating the tag. In the case of deleting the document, it removes the broken link connecting the sub-nodes of deleted node newly to its parent node.

• The KIPS Transactions:PartB
• /
• v.13B no.3 s.106
• /
• pp.255-274
• /
• 2006

Moving object boundary is very important for the accurate segmentation of moving object. We extract the moving object boundary from the moving object edge. But the object boundary shows broken boundaries so we develop a novel boundary linking algorithm to link the broken boundaries. The boundary linking algorithm forms a quadrant around the terminating pixel in the broken boundaries and searches for other terminating pixels to link in concentric circles clockwise within a search radius in the forward direction. The boundary linking algorithm guarantees the shortest distance linking. We register the background from the image sequence using the stationary background filtering. We construct two object masks, one object mask from the boundary linking and the other object mask from the initial moving object, and use these two complementary object masks to segment the moving objects. The main contribution of the proposed algorithms is the development of the novel object boundary linking algorithm for the accurate segmentation. We achieve the accurate segmentation of moving object, the segmentation of multiple moving objects, the segmentation of the object which has a hole within the object, the segmentation of thin objects, and the segmentation of moving objects in the complex background using the novel object boundary linking and the background automatically. We experiment the algorithms using standard MPEG-4 test video sequences and real video sequences of indoor and outdoor environments. The proposed algorithms are efficient and can process 70.20 QCIF frames per second and 19.7 CIF frames per second on the average on a Pentium-IV 3.4GHz personal computer for real-time object-based processing.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.879-888
• /
• 2004

Ad Node transmits packets to a destination node using routing function of intermediate nodes on the path in Ad Hoc networks. When the link to a next hop node in a path is broken due to the next hop node's mobility, a new route search process is required for continuing packets transmission. The node which recognizes link fault starts a local route recovery or the source node starts a new route search in the on demand routing protocol AODV. In this case, the new route search or the local route search brings packet delays and bad QoSs by packet delay. We propose RPAODV that the node predicts a link fault selects a possible node in neighbor nodes as a new next hop node for the path. The proposed protocol can avoid path faults and improve QoS.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.81-90
• /
• 2004

A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile nodes dynamically self-organizing in arbitrary and temporary network topologies without the use of any existing network infrastructure. The AODV (Ad Hoc On-Demand Distance Vector) Protocol is one of the typical reactive routing protocols, in that mobile nodes initiate routing activities only in the presence of data packets in need of a route. In this paper, we focus upon the local repair mechanism of AODV. When a link is broken, the upstream node of the broken link repairs the route to the destination by initiating a local route discovery process. The process involves the flooding of AODV control messages in every node within a radius of the length from the initiating node to the destination. In this paper, we propose an efficient local repair scheme for AODV called AFLRS (AODV-based Fast Local Repair Scheme). AFLRS utilizes the existing routing information in the intermediate nodes which have been on the active route to the destination before a link break occurs. AFLRS can reduce the flooding range of AODV control messages and the route recovery time because it can repair route through the intermediate nodes. For the performance evaluation of the proposed AFLRS, we have simulated the local repair mechanisms by using NS2 and AODV-UU. The performance results show that AFLRS can achieve faster route recovery than the local repair mechanism of AODV.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.700-713
• /
• 2015

It is critical to design energy-efficient routing protocols for battery-limited mobile ad hoc networks, especially in which the energy-consuming MIMO techniques are employed. However, there are several challenges in such a design: first, it is difficult to characterize the energy consumption of a MIMO-based link; second, without a careful design, the broadcasted RREP packets, which are used in most energy-efficient routing protocols, could flood over the networks, and the destination node cannot decide when to reply the communication request; third, due to node mobility and persistent channel degradation, the selected route paths would break down frequently and hence the protocol overhead is increased further. To address these issues, in this paper, a novel Greedy Energy-Efficient Routing (GEER) protocol is proposed: (a) a generalized energy consumption model for the MIMO-based link, considering the trade-off between multiplexing and diversity gains, is derived to minimize link energy consumption and obtain the optimal transmit model; (b) a simple greedy route discovery algorithm and a novel adaptive reply strategy are adopted to speed up path setup with a reduced establishment overhead; (c) a lightweight route maintenance mechanism is introduced to adaptively rebuild the broken links. Extensive simulation results show that, in comparison with the conventional solutions, the proposed GEER protocol can significantly reduce the energy consumption by up to 68.74%.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.512-517
• /
• 2008

The brake system is very important part of the machine working. If the machine can't be stopped, it would be serious accident. It is the same as the ship. The mooring winch brake hold the ship in harbor. But sometimes it appeared the excessive stress and brake lining would be broken. So it is necessary to change the shape of brake system with improve the braking power. This study carried out research on optimum design like as moved the position of link pin or modified the thickness of brake band and lining.

• Journal of Korea Multimedia Society
• /
• v.10 no.10
• /
• pp.1347-1355
• /
• 2007

A sensor network is composed of a large number of tiny devices, scattered and deployed in a specified regions. Each sensing device has processing and wireless communication capabilities, which enable it to gather information from the sensing area and to transfer report messages to a base station. The energy-efficient routing paths are established when the base station requests a query, since each node has several characteristics such as low-power, constrained energy, and limited capacity. The established paths are recovered while minimizing the total transmit energy and maximizing the network lifetime when the paths are broken. In this paper, we propose a routing algorithm that each sensor node reports its adjacent link information to the sink node when a sink node broadcasts a query. The sink node manages the total topology and establishes routing paths. This algorithm has a benefit to find an alternative path by reducing the negotiating messages for establishing paths when the established paths are broken. To reduce the overhead of collection information, each node has a link information before reporting to the sink. Because the node recognizes which nodes are adjacent. The proposed algorithm reduces the number of required messages, because sensor nodes receive and report routing messages for establishment at the beginning of configuring routing paths, since each node keeps topology information to establish a routing path, which is useful to report sensing tasks in monitoring environments.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.6
• /
• pp.131-142
• /
• 2011

In this paper, we propose a new multipath routing protocol and compare it with other multipath routing protocols in mobile ad hoc network (MANET) environments. The new multipath routing establishes the main route using a mechanism based on Ad Hoc On-demand Distance Vector(AODV), after which data transmission starts immediately. The backup route search process takes place while data are transmitted, to reduce the transmission delay. The protocol can also operate in a hybrid node-disjoint/link-disjoint mode, where the protocol finds the node-disjoint backup route first; if the node-disjoint does not exist, the protocol discovers the link-disjoint backup route from the main route. When either of the main route or the backup route is broken, data are transmitted continuously through the other route and the broken route is recovered by the route maintenance process. The results of simulations, based on the Qualnet simulator, show that the proposed multipath routing protocol increases the packet transmission success rate and reduces end-to-end delays, when compared with AODV and AOMDV protocols.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.421-425
• /
• 2007

The exponential increase of digital contents brought about the e-Challenge crisis to the librarians. How can all the e-resources be managed effectively? How can we detect all the broken links? How can we assist the users to the right resources? This paper concentrates on building CLICK(Cooperative Link Center in KOREA) as a knowledge compass by collecting diverse science & technology information and creating tight coupled links between information resources for reference linking and providing users with the optimal route for the resource per user. If the publishers, Abstract & Index DB, Searching Portal, Electronic Libraries, Full-text DB and Aggregator can be linked by using a standardized way through a CLICK, the service channels can be diversified. Users can select the channels without rein under according to a use purpose and conditions.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.37 no.1
• /
• pp.19-29
• /
• 2000

Because the previous simulation tool for attitude control of satellite was designed for the modeling of rigid body and PD controller, the attitude error can be made more than the limitation value for keeping for communication link, and then the communication link can be lost at moving of satellite. So, for rapid attitude restoration and design of stable and modernized controller, the modelling of rigid body and flexible body structure for moving GEO and LEO satellites were performed. Also the minimum time controller is designed for the rapid restoration of attitude error at communication broken and to minimize the disconnection period from ground communication system during the satellite stationkeeping. The linear regulator is designed using the space state vector that is better than accuracy and stability of PD controller. Firstly the simulation was performed for comparison of the rigid and stability of PD controller. Firstly the simulation was performed for comparison of the rigid and flexible models using PD controller and the case of the pitch angle changing by ground command, and the case of the periodic north-south stationkeeping are performed for the analysis of response characteristics of each controller when the attitude is changed. As a result, the flexible body model represents more sililar results of real situation than the rigid body model. The minimum time controller can restore 7 times rapidly than PD controller for its lost attitude. The linear regulator has several merits for capability of adaptation against the external disturbance, stability and response time. In future, we can check the estimated results using this satellite model and controller for real operation. Futhermore the development of new controller and training can be supported.