• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1059-1067
• /
• 2006

AODV(Ad-hoc On-demand Distance Vector) routing protocol was devised for use of mobile nodes in Ad-hoc network. When we use the AODV routing protocol in Ad-hoc networks with high mobility, disturbance of optimized route path and link break occur. In order to solve the shortcomings, this paper proposes a new routing protocol in which new routing control messages are added to the existing AODV. The proposed protocol minimizes link break and transmission delay while is able to secure the optimized route path constantly in changes of network topology The performance of the proposed routing protocol was evaluated by using us2 network simulator. The actual Ad-hoc network test bed provides us the most reliable experimental data for Ad-hoc networks. In order to support this experimental environment, the dissertation also developed an efficient embedded system on which AODV routing protocol, NAT, Netfilter can run and other event message can be verified without declining efficiency. The correct operation of AODV routing protocol has been verified in both the Ad-hoc network test bed in which the embedded system was used, and Ad-hoc networks linked with Ethernet backbone network.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.3
• /
• pp.397-404
• /
• 2010

Recently, there is on-going research about tactical data link system based on the legacy radio. Tactical data link based on legacy radio is operated mostly in narrow bandwidth under 25khz. Communicating traffics in nodes participated at network need to be minimized for distributing tactical data in narrow bandwidth. In addition, the data distributing structure is necessary for distributing tactical informations such as a situation awareness and so on to war fighters. However, conventional server-client system wastes a lot of time to obtain information for war fighters as user uses pull system to gather necessary information by seeking it one by one. Especially, the fighter pilot is supposed to dedicate into a situation awareness and fight mission in every seconds but seeking information of a user terminal while aircraft maneuvering affects as obstacle to concentrate engaging hostiles. therefore, push technology, the tactical data distributing system, is necessary for war fighters to receive fixed tactical data automatically without putting attention to it. This paper propose the UMPC tactical data link push framework. the UMPC tactical data link is a tactical data link system based on the legacy radio. Proposed push framework is verified by composing experiment environment and testing.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.6B
• /
• pp.728-737
• /
• 2011

For the real time monitoring and tracking of shipping container which is one of the core objects for global logistics, Wireless Ad-Hoc Network technology might be needed in stacking environments such as ports, yards and ships. In this paper, we propose a container network routing protocol suitable for port or yard stacking environments which include some constraints such as shadow area problem from metal material, frequent movement of container, etc. With this protocol in which a mesh network algorithm is applied, every container data packet can be delivered to the sink node reliably even with frequent join/leave of container nodes. As soon as a node on path gets malfunction, alternative backup path is supported with notice to neighbor node, which makes constant total optimal path. We also verified that the performance of proposed protocol is better than AODV, one of previous major MANet(Mobile Ad-Hoc Network) protocol with a function for alternative path, which says the proposed protocol is better for frequent join/leave and variable link quality.

• KIPS Transactions on Computer and Communication Systems
• /
• v.1 no.3
• /
• pp.219-228
• /
• 2012

As the wireless Internet become more widely accessible, variety of Internet services can be used without limitation of location. However, existing mobility management methods such as MIP and PMIP of IETF requires the load of heavy protocol stack on the mobile nodes or the addition of components such as LMA and MAG. In this paper, we proposed the location management technique in the PMIPv6 and Fast Handover technique. according to the moving pattern of the node, the location management technique proposed in order to adjust the paging area dynamically. The Fast Handover technique applied MIH technology and it reduced the handover signal processing time between heterogeneous network. The location management cost in the environment which the node moves in order to evaluate this and handover delay time was calculate. The proposal technique was efficiently more evaluated than PMIPv6 with the smallest 29% and maximum 83%.

• The Journal of the Korea Contents Association
• /
• v.13 no.9
• /
• pp.20-27
• /
• 2013

In recently years, with the growth of social media and the development of mobile devices, the data have been significantly increased. MapReduce is an emerging programming model that processes large amount of data. However, since MapReduce evenly places the data in the dedicated distributed computing environment, it is not suitable to the non-dedicated distributed computing environment. The data replacement algorithms were proposed for performance optimization of MapReduce in the non-dedicated distributed computing environments. However, they spend much time for date replacement and cause the network load for unnecessary data transmission. In this paper, we propose an efficient data replacement algorithm for the performance optimization of MapReduce in the non-dedicated distributed computing environments. The proposed scheme computes the ratio of data blocks in the nodes based on the node availability model and reduces the network load by transmitting the data blocks considering the data placement. Our experimental results show that the proposed scheme outperforms the existing scheme.

• Journal of Broadcast Engineering
• /
• v.13 no.2
• /
• pp.245-250
• /
• 2008

Efficient service discovery mechanism is a crucial feature for the usability of a wireless ad-hoc network. A wireless ad-hoc network is a temporal network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration. We propose an efficient service discovery mechanism using non-disjoint multi-path routing protocol for a wireless ad-hoc network. Our scheme has advantages of not only multi-path routing protocol but also cross-layer service discovery. By simulation, we showed that faster route recovery is possible by maintaining multiple routing paths in each node, and the route maintenance overhead can be reduced by limiting the number of multiple routing paths and by maintaining link/node non-disjoint multi-path.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.11
• /
• pp.2113-2119
• /
• 2006

In this paper, we design the r-Sensor protocol for reliable data transmission in the Intelligent Home Service based on the wireless sensor network environment. The r-Sensor protocol improve the reliability of data transmission and node fairness using simple routing algorithm, congestion control, and loss recovery method that minimize the load of relay node. Reposed routing algorithm find out upstream and downstream nodes using the Network Management packet. Meanwhile, loss recovery algorithm uses the Aggregated-Nack. To apply supposed algorithm, the IHS-AMR(Intelligent Home Service - Automatic Meter Reader) and sensor node are designed and implemented in hardware. The IHS-AMR provides remote metering service and also offers home safety service by internetworking with sensor network, mobile phone network and internet.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.510-513
• /
• 2006

Mobile Ad-hoc networks have recently attracted a lot of attention in the research community as well as in industry. Although the previous research mainly focused on various of Ad-hoc in routing we consider, in this paper, how to efficiently support applications such as variable Geocasting basd on Ad-hoc networks. The goal of a geocasting protocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast service in mobilie computing based on Ad-hoc have the non-optimization problem of data delivery path, overhead by frequent reconstruction of the geocast tree, and service disruption problem. In this paper, we propose the mobility pattern based geocast technique using variable service range according to the mobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance than previous research.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.886-889
• /
• 2010

Power consumption measurement in sensor network is difficult to proceed by survey in real field. Thus, through simulation, the power consumption is estimated and replacement time of nodes are decided. A simulation tool simulates various facts such as power consumption, packet transmission traffic, network topology and etc. In this paper, it suggests sensor node power model to simulate power consumption which has large importance among simulation facts in sensor network. This model omits calculating expressions that the data originally surveyed can substitute with, according to power consumption property of each functions in sensor node in order to minimize calculations in simulation. In this case accuracy of power consumption estimation will be reduced, but can simulate it faster due to reduced calculation. Suggested model is fitted to analyze power consumption difference between two or more sensor network algorithms with rapid simulation speed rather than accurate simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.233-241
• /
• 2013

One fundamental issue in ad hoc networks is the alternative node election problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we proposed EEAP(Energy-Efficient Alternative Paths). This is a method of selecting an alternative node for path routing management. When some node disconnection on the path routing, using pre-selected backup node provides immediately recover the path recovery. When selecting an alternative node of Step-Parents head node on the path management, the node's energy level and distance information are cared in context-awareness. This is not only increased the system's capacity cost effectively, but also reduce transmission power entire nodes consume energy. As a result, each node could efficiently management and improves the life time for mobile host and extends system coverage.