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

Smart packet agent is an application that is proposed to provide routing protocol and service module in ubiquitous network environment. However, it uses multi-hop broadcast, thus it causes increasing network traffic, low-speed data transmission, and the unnecessary joining nodes. In this paper, a transmit technique that uses unicast-based multi-hop to have lower network traffic and faster transmission time than the multi-hop broadcast technique. In our scheme, u-Zone Master establishes temporary routing paths by calculating moving nodes' hop-counter. Therefore, it reduces smart packet agent's network traffic and retransmission rate. Besides, this paper proposed an UDP transmission that bases on sliding window. Hence, the Stop & Wait transmission speed is improved. The results, which are taken by analyzing performance prove that the proposed scheme has better performance.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.6
• /
• pp.52-59
• /
• 2008

Most pier performance analysis results for ad-hoc routing protocols have been based upon the model which each node in the network moves independently without restriction. In most real environments, however, it is very common for a group or multiple groups to move under the direction of group leader or group leaders instead of each node's independent movement. This paper presents the performance analysis of routing protocols for mobile ad-hoc network under group mobility environment. The comparative simulations have been made between a table-driven protocol, DSDV, and two on-demand protocols, AODV and DSR, under a group mobility model, RPGM, which is suitable for the practical applications such as military tactical operation. Multiple group movements are also included. The results show that the protocol performances for single group movement are very similar to node independent movement case. However some differences have been observed by varying pause time and connectivity.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.127-132
• /
• 2008

Wireless sensor network technologies applicable to various industrial fields are rapidly growing. Because it is difficult to change a battery for the once distributed wireless sensor network, energy efficient design is very critical. In order to achieve this purpose in network design, a number of studies have been examining the energy efficient routing protocol. The sensor network consumes energy in proportion to the distance of data transmission and the data to send. Cluster-based routing Protocols such as LEACH-C achieve energy efficiency through minimizing the distance of data transmission. In LEACH-C, however, the total distance between the nodes consisting the clusters are considered important in constructing clustering. This paper examines the cluster-head-selection-algorithm that reflect the distance between the base station and the cluster-head having a big influence on energy consumption. The Proposed method in this paper brought the result that the performance improved average $4{\sim}7%$ when LEACH-C and the base station are located beyond a certain distance. This result showed that the distance between cluster-head and the base station had a substantial influence on lifetime performance in the cluster-based routing protocol.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.303-310
• /
• 2008

To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.5
• /
• pp.482-486
• /
• 2008

When we design a sensor nodes, a energy-consumption of sensor nodes centers on design concerns to prolong lifetime of sensor network. In recent year, many researches have attempted to study this issue. One of that is TTDD(Two-Tier Data Dissemination approach) proposed to support a sensor network which includes several mobile sensor nodes. But it gives rise to a problem which increasing control packet for the formation and maintenance a grid structure. Therefore, we proposed a Energy-Efficient Routing Protocol used a permanent grid structure for reducing control packets in a sensor network.

• The KIPS Transactions:PartC
• /
• v.17C no.3
• /
• pp.259-270
• /
• 2010

In this paper, a Location Information-based Gradient Routing (LIGR) algorithm is proposed for setting up routing path based on physical location information of sensor nodes in wireless ad-hoc networks. LIGR algorithm reduces the unnecessary data transmission time, route search time, and propagation delay time of packet by determining the transmission direction and search range through the gradient from the source node to sink node using the physical location information. In addition, the low battery nodes are supposed to have the second or third priority in case of forwarding node selection, which reduces the possibility of selecting the low battery nodes. As a result, the low battery node functions as host node rather than router in the wireless sensor networks. The LIGR protocol performed better than the Logical Grid Routing (LGR) protocol in the average receiving rate, delay time, the average residual energy, and the network processing ratio.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.2
• /
• pp.216-220
• /
• 2008

Sensor nodes in wireless network have several limitations such as lack of energy resource and network bandwidth. There are many researches to extend lifetime of sensor network and enhance availability. However, most of the previous researches didn't consider the mobile sink node. Those researches aren't suitable in the environment having mobile sinks. In this paper. we propose a scheme that reduces communication overheads and energy consumptions and improves reliability in routing path setup. Proposed scheme has excellent scalability without degrading performance in environment where many sink nodes exist and/or the network size is huge. Proposed scheme saves the energy consumption up to 70% in comparison with the previous grid-based and cluster-based protocol. As a result, proposed scheme increases the lifetime of sensor network and enhances availability of wireless sensor network.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.67-78
• /
• 2003

As optical network technology advances and high bandwidth Internet is demanded for the exponential growth of internet traffic volumes, the Dense-Wavelength Division Multiplexing (DWDM) networks have been widely accepted as a promising approach to the Next Generation Optical Internet (NGOI) backbone networks for nation wide or global coverage. Important issues in the NGOI based on DWDM networks are the Routing and Wavelength Assignment(RWA) problem and survivability. Especially, fault/attack detection, localization and recovery schemes in All Optical Transport Network(AOTN) is one of the most important issues because a short service disruption in DWDM networks carrying extremely high data rates causes loss of vast traffic volumes. In this paper, we suggest a fault/attack management model for NGOI through analyzing fault/attack vulnerability of various optical backbone network devices and propose fault/attack recovery procedure considering Extended-LMP(Link Management Protocol) and RSVP-TE+(Resource Reservation Protocol-Traffic Engineering) as control protocols in IP/GMPLS over DWDM.

• International journal of advanced smart convergence
• /
• v.3 no.2
• /
• pp.1-5
• /
• 2014

Sensor nodes depend on batteries for energy source in Wireless Sensor Networks (WSNs). Low Energy Adaptive Clustering Hierarchy (LEACH) is a representative cluster-based routing protocol designed to ensure energy use efficiency whereas the virtual cluster exchange routing (VCR) information only with its closest node to build a network. In this paper, a protocol scheme was proposed wherein member nodes are designed to compare the currently sensed data with the previously sensed one and to switch to sleep mode when a match is achieved. The design is to help improve the transmission energy efficiency too.

• Journal of Internet Computing and Services
• /
• v.7 no.5
• /
• pp.25-31
• /
• 2006

According to the development of a mobile node and the increase of number of its users, the demands for connecting to the networks beyond the spaces through the existing wire or wireless communications have abruptly been increasing, which not only allows the ad hoc networks to be developed actively but also makes us consider the routing policy to transfer data safely. In this thesis, the routing protocol to send data stably by improving the route stability in the ad hoc networks is proposed, and its performance is analyzed through the simulations.