• Journal of Korea Society of Industrial Information Systems
• /
• v.9 no.2
• /
• pp.65-73
• /
• 2004

By the progress of communication and hardware technology, It is possible to organize wireless sensor nodes using the tiny sensor in recently. It is a critical aspect to minimize energy consumption for long-term lively sensor because wireless sensor nodes are associated with the available resources. The wireless sensor network is restricted in communication, exhaustion of power, and computation but it is very similar an Ad-Hoc network. Each sensor node products a few data and application layer of each sensor has slow transmitting feature. Unlike Ad-hoc, which is usually source or sink, base station of the each senor nodes works as sink and the other nodes except sink node works as source. Generally, wireless sensor network keep staying fixed state and observing circumstances continuously after setting up. It doesnt fit for the wireless sensor networks under functioning of existing ad-hoc networks because original Ad-Hoc network routing protocol couldnt operate for wireless sensor network features. This thesis propose the effective routing protocol way in the filed of the expanded routing protocol based on tree with considering on the characteristic of wireless sensor networks pattern.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.535-542
• /
• 2005

This paper proposes an on-demand ad hoc routing protocol, Node Density Based Routing (NDBR), which enhances the routing performance applying a new method to establish alternate patlis. It is important to reserve alternate paths for the route from source to destination in mobile ad hoc networks that are susceptible to failure due to the movement or the power exhaustion of mobile nodes. NDBR aims to establish a route that contains more alternate paths toward the destination by involving intermediate nodes with relatively more adjacent nodes in a possible route, and introduces a new routing criterion called 'node density.' This approach can localize the effects of route failures, and reduce control traffic overhead and route reconfiguration time by enhancing the reachability to the destination node without source-initiated route re-discoveries at route failures. This paper describes the route setup procedure using node density and the route re-configuration procedures employing alternate path information at the intermediate nodes. We show the performance of our routing schemes through a series of simulations using the Network Simulator 2 (ns-2).

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.67-74
• /
• 2001

In this paper, we propose a new method to improve tile processing of route recovery of the existing DSR algorithm on detection of route error. In mobile ad hoc networks, mobile nodes themselves have routing capability. Thus, a well-defined routing protocol is required for route set-up between two mobile nodes. However, the existing DSR routing protocol has problem with dropping of packets due to the recovery delay when a route error occurs. In order to alleviate tile problem, we propose an enhanced DSR protocol to reduce the route error recovery tine and evaluate the protocol through simulation. As tile result of evaluation, we found the proposed DSR protocol provided about 4 to 30 times faster route error recovery time according to the test scenario than the existing DSR protocol.

• 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 Institute of Electronics Engineers of Korea TC
• /
• v.43 no.7 s.349
• /
• pp.41-49
• /
• 2006

Wireless AD-hoc network can construct a network itself without any arbitrator. Therefore, it is difficult to make preparation for disguised assault from an illegal node, and because lots of packets from disguised assault spread over whole network, it influences the network usability and livability. This thesis proposed a safe IPv6 tunnel broker (TB) based on TSP (Tunnel Setup Protocol) to improve safety of the wireless Ad-hoc network, and to solve security problem of a tunnel broker that makes a linkage IPv4 and IPv6. To communicate between client and the tunnel broker, proposed method does not base on HTTP, but S-HTTP (Secure-HTTP) and it uses encryption/decryption to send and receive XML document. Finally, this method encrypts (decrypts) important information by applying IPSec between client and TS (Tunnel Server).

• Journal of Internet Computing and Services
• /
• v.5 no.2
• /
• pp.75-84
• /
• 2004

Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

• Information and Communications Magazine
• /
• v.21 no.12
• /
• pp.89-101
• /
• 2004

모바일멀티미디어연구센터는 이동적응망의 기반기술 및 응용시스템 개발을 통한 산업화 기여와 무선통신, 네트워크 프로토콜, 응용 소프트웨어 기술들을 통합적으로 습득한 고급 인력 양성을 목적으로 2001년 11월에 정보통신부의 ITRC로 선정되었다. 본 센터에서는 별도의 인프라 기반 망의 지원 없이, 사용자 각자가 보유한 정보통신기기틀이 서로 협조하여 필요한 망을 즉석에서 형성하는 이동적응망(Ad Hoc Network) 관련기술들을 연구개발 하고 있다. 총괄과제 책임자인 마중수교수를 중심으로 4개 대학(ICU, KAIST, 아주대, 연세대) 8명의 효수와 70여명의석/박사과정 학생들과 참여 연구기관들이 협력하여 유기적이면서 통합적인 방식으로 연구를 진행하고 있다 본 고에서는 연구센터의 개요, 연구목표, 추진체계 및 전략, 그리고 진행중인 연구과제에 대한 내용을 소개한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.409-411
• /
• 2004

최근 무선 네트워크 환경이 확대됨에 따라 전송률 향상을 위해 MANET(Mobile Ad Hoc Networks)에 관한 연구가 활발하게 진행되고 있다. 기존 TCP 프로토콜은 전송오류가 거의 발생하지 않는 유선망에서 효율적인 동작을 하도록 설계되었기 때문에 MANET에 적용하기에는 어렵다. 무선망에서는 경로손실, 페이딩. 간섭 등의 영향에 의해 유선망에 비해 전송오류 발생률이 훨씬 높기 때문이다. 이런 문제점을 해결하기 위한 전송률 향상에 대한 접근뿐만 아니라 이동성과 휴대성을 갖는 우선 단말의 에너지 효율 역시 고려한 접근 방법이 관심을 받고 있다. 본 논문에서는 TCP-Probing을 개선하여 ad hoc 망에 적합하도록 적용함으로써 전송률뿐만 아니라 에너지 효율을 향상시키기 위한 방법을 제안한다. 또한 NS-2시뮬레이터를 이용한 실험을 통해 TCP의 성능 및 에너지 효율이 개선됨을 확인하였다.

• Journal of Digital Convergence
• /
• v.10 no.11
• /
• pp.365-369
• /
• 2012

M2M has shown the advantages of better coverage and lower network deployment cost. Intelligent vehicle section shows severe changes in position between vehicles and has numerous large scales of networks in its components, therefore, it is required to provide safety by exchanging information between vehicles equipped with wireless communication function via biometric information in VANET(Vehicular Ad hoc Network). This thesis is to propose scheme that mutually authenticates between vehicles by composing vehicle movement as biometric information.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9B
• /
• pp.795-801
• /
• 2008

Wireless Mesh Networks (WMNs) are popular due to their low cost and rapid deployment. Currently, many WMN researchers often considers the use of ad-hoc routing protocols because WMNs are similar to the ad-hoc networks. Some of currently deployed WMNs consider to use on-demand routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). But, AODV are not appropriate for Wireless Mesh Networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose a directional AODV (D-AODV) routing protocol based on hop count to a gateway. We implement the D-AODV routing protocol and evaluate the performance of the D-AODV on the testbed. The measurement results show that the D-AODV can enhance the network throughput by reducing the routing overhead.