• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1541-1548
• /
• 2012

This paper proposes a new multipath-based routing protocol on MANETs with Fast-Recovery of failures. The proposed protocol establishes the primary and secondary paths between a source and a destination considering the end-to-end packet reception reliability of routes. The primary path is used to transmit messages, and the secondary path is used to recover the path when detecting failures on the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to recover locally the route failure, the proposed protocol can reduce the number of packet loss and the amount of control packets for setting up new paths. The simulation result using QualNet simulator shows that the proposed protocol was about 10-20% higher than other protocols in terms of end-to-end message delivery ratio and the fault recovery time in case of link fault was about 3 times faster than the other protocols.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.215-219
• /
• 2005

Generally, the mobile nodes in MANET have the limited power capacity available for actual communications. Thus, the power management is very important for packet routing or forwarding. Although MTPR, MBCR and MMBCR are proposed to treat the problem of power consumption, there have been few researches resolving the link breakdown that is occurred by the power exhaustion during transmission. In this sense, the reliable scheme should be required to ensure the routing connectivity. In this paper, we propose three schemes to enforce the routing connectivity. If the signal strength is dropped below a signal threshold, the candidate route is previously selected to prepare the link breakdown. Also, on multi-channel, we propose the lifetime increment scheme of a node that it manage its available power to the needed power of a new link. The simulation results show the enforcement of the link connectivity and the performance improvements of the delay time through the effective connection management.

• Journal of Korea Water Resources Association
• /
• v.33 no.3
• /
• pp.341-350
• /
• 2000

The objectives of this study are to develop a state-space form of stochastic dynamic storage function routing model and to test the model performance for real-time flow forecast. The selected study area is the main Han River starting from Paldang Dam site to Indogyo station and the 13 flood events occurred from 1987 to 1998 are selected for computing model parameters and testing the model performance. It was shown that the optimal model parameters are quite different depending on Hood events, but the values used on field work also give reasonable results in this study area. It is also obvious that the model performance from the stochastic-dynamic model developed in this study gives more accurate and reliable results than that from the existing deterministic model. Analysis for allowable forecast lead time leads that under the current time step the reasonable predicted downstream flows in 5 hours time advance are obtained from the stochastic dynamic model on relatively less lateral inflow event in the study area.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.8
• /
• pp.5559-5564
• /
• 2015

A variety of routing protocols targeted specifically at mobile ad-hoc network environments have been developed. Mobile ad-hoc network is a self-organizing temporary network, operating without the aid of any established wired infrastructure. The proposed protocol supports seamless communication services between the mobile hosts within a mobile ad-hoc network environments. In particular, our protocol makes faster route re-establishment possible by maintaining multiple paths in each mobile host, and also, the protocol provides reliable communication environments. We compare the performance of RWP model with that of LW model. This paper shows delivery ratio with single path and non-disjoint multiple path according to mobility model and node numbers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3A
• /
• pp.276-287
• /
• 2004

An ad hoc network is infra(Base Sstation or Access Point) free wireless mobile communication technology. Mobile nodes function as routers and servers in ad hoc networks. Many routing protocols for ad hoc network have been proposed. If any route is broken owing to moving node, source must repair broken route again. But route repair technology after route collapses is not suitable to transmit real-time data packet for QoS guarantee. So this paper presents route repair technology that prevents route from breaking. If intermediate node moves to critical section, the node issues handoff packet and sends the packet to the next node. After next node receives handoff packet, the node broadcasts route request packet to the previous node for intermediate node. Finally, even if intermediate node moves out of the routing region, the source can continuously transmit data packets to the destination through the new path.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.68-76
• /
• 2002

Multicast in mobile host has the problem of hast mobility, multicast decision, triangle routing, tunnel convergence, implosion of retransmission, and bandwidth waste. In particular, the bandwidth waste in radio is a definite factor that decreases transmission rate. To solve the problems, this paper proposes a new multicast transmission protocol called FIM(Forward Error Correction Integrated Multicast), which supports reliable packet recovery mechanism by integrating If Mobility Support for the host mobility, IGMP(Interned Group Management Protocol) for the group management, and DVMRP(Distance Vector Multicast Routing Protocol) for the multicast routing, and it also uses FEC and the local recovery method based on receiver. The performance measurement is performed by dividing the losses into the homogeneous independent loss, the heterogeneous independent loss, and the shared source link loss model.. The result shows that the performances improves in proportion to the size of local areal group when the size of transmission group exceeds designated size. This indicates FIM is effective in the environment where there are much of data and many receivers in the mobile host.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.10
• /
• pp.116-123
• /
• 2013

In mobile healthcare applications, the reliable transmission of the bio-data is very important. In this article, we present a reliable bio-data transmission technique for mobile healthcare monitoring service at 6LoWPAN multi-hop wireless networks. In particular, we expand IEEE 11073-20601 protocol, and propose the reliable path construction for 6LoWPAN aimed to reliably provide mobile healthcare service over wireless sensor network, using IPv6 network. 6LoWPAN is recognized possibility because it is agree with sensor network by raising Adaptation layer on the MAC layer to transmit IPv6 packets. In this article proposed minimize the algorithm complexity and reliability routing protocol because the 6LoWPAN devices are suitable for low cost, small size and battery that can be used to health care system environment. And detailed procedures and algorithms are presented. We the proposed method to prove the superiority of using NS-3 for compareing with AODV protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1171-1180
• /
• 2010

In wireless sensor networks, reliable event detection is one of the most important research issues. For the reliable event detection, previous works usually assume the events are only individual objects such as tanks and soldiers. Recently, many researches focus on detection of continuous objects such as wild fire and bio-chemical material, but they merely aim at methods to reduce communication costs. Hence, we propose a reliable continuous object detection scheme. However, it might not be trivial. Unlike individual objects that could be referred as a point, a continuous object is shown in a dynamic two-dimensional diagram since it may cover a wide area and it could dynamically alter its own shape according to physical environments, e.g. geographical conditions, wind, and so on. Hence, the continuous object detection reliability can not be estimated by the indicator for individual objects. This paper newly defines the reliability indicator for continuous object detection and proposes an error recovery mechanism relying on the estimation result from the new indicator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1371-1379
• /
• 2009

In this paper, we propose a new multi-path routing protocol to provide reliable and stable data transmission in MANET that is composed of high-mobility nodes. The new multi-path routing establishes the main route by the mechanism based on AODV, and then finds the backup route that node-disjoint from the main route by making add nodes in the main route not participate in it. The data transmission starts immediately after finding the main route. And the backup route search process is taking place while data is transmitted to reduce the transmission delay. When either of the main route or the backup route is broken, data is transmitted continuously through the other route and the broken route is recovered to node-disjoint route by the route maintenance process. The result of the simulation based on the Qualnet simulator shows that the backup route exists 62.5% of the time when the main route is broken. And proposed routing protocol improved the packet transmission rate by 2~3% and reduced the end-to-end delay by 10% compared with AODV and AODV-Local Repair.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12C
• /
• pp.1123-1130
• /
• 2009

The advances in networking technology and importance of multimedia communication require real time transaction. In many applications, high reliable real-time communications are required more frequently. In this paper, we propose a reliable communication in cube-based multi -computer using the safety vector. Each node in a cube-based n dimensional multi-computer is associated with a safety vector of n bits, which is an approximated measure of the number and distribution of faults in the neighborhood. We propose an algorithm that can establish detour paths using the safety vector. The established detour paths are disjoint with the primary real-time channel. Therefore, our algorithm is more efficient than earlier proposed algorithms.