• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.10a
• /
• pp.623-625
• /
• 2012

The nodes of Ad-hoc network are made up of location registration for sending informations and a great number of packet transmissions to maintain routing route among the nodes. Under this environment, a huge number of traffics would be generated as mobility variable occurs more than in physical network. Hence, in this paper, focused on to study the relationship of nodes to analyze the extent of the traffic in order to control the traffics of the multi-hop in Ad-hoc.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.2
• /
• pp.13-20
• /
• 2005

An ad hoc wireless networks forms temporary network without the aid of fixed networks or centralized administration with a collection of wireless mobile hosts. In this case, it is necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination. This paper presents an efficient cluster-based routing protocol scheme for ad hoc networks. The cluster is used for path setup and data delivery. Our cluster-based routing algorithm is designed for the improvement of the load balance. Our simulation results show the improved performance for low mobility networks comparing with the previous works.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06c
• /
• pp.239-241
• /
• 2012

우리 군은 미래전을 대비하기 위해 각종 전술 응용정보체계의 막힘없는 전송과 통신망간 연동 요구를 충족시키고 미래 전장을 주도할 통신체계 구축을 목표로 전술정보통신체계(TICN) 개발을 추진 중이다. Ad-hoc 네트워크 기술을 사용하는 전술정보통신체계의 부체계인 전투무선체계는 전장 환경에서 운영되는 특수성으로 인해 기존의 전통적인 플랫한 Ad-hoc 네트워크와는 차별화된 계층형 Ad-hoc 네트워크 구조를 가진다. 또한 Ad-hoc 네트워크를 운용하는 환경이 보안성이 극도로 요구되는 전장 환경임을 고려할 때 군 작전의 성공적인 목표 달성을 위한 보안대책은 반드시 필요하다. 특히 전장상황 하에서 유통될 각종 민감 정보들에 대한 기밀성, 무결성 등을 보장하기 위해 정당한 권한을 가진 노드들만이 네트워크에 참여할 수 있는 보안 매커니즘이 적용되어야 하며, 이를 위해선 효율적인 키 관리 기법을 적용해야 한다. 본 논문에서는 비밀키, 노드위치, 해시인증 등의 정보를 이용한 3단계 인증절차 적용으로 Ad-hoc 네트워크 참여 노드의 인증을 강화하고, 통신환경에 따라 3가지 비밀키를 구분 사용하여 계층형 Ad-hoc 네트워크 구조에서 기밀성 보장을 강화하기 위한 키 관리 기법을 제안한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.8
• /
• pp.1401-1406
• /
• 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 Goocasting basd on Ad-hoc networks. The goal of a geocasting uotocol is deliver data packets to a group of nodes that are located within a specified geocasting region. Previous research that support geocast nice 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 nobility of destination node and resource reservation to solve this problem. The experimental results show that our proposed mechanism has improved performance of Connection & Network Overhead than previous research.

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

Many routing algorithms, proposed for ad-hoc wireless networks, we based on source routing scheme and shortest path route has short lifetime especially in highly dense ad-hoc wireless networks. So some routing protocols such as SSA and ABR are considering the link stability and try finding more stable route. In this paper we propose a new routing algorithm considering utilization metric based on SSA routing algerian in Ad-Hoc networks. To reduce the bottleneck by specific metric of SSA, proposed scheme makes load balancing in networks by distributing the connections to several routes. For the evaluation of the performance we compare our scheme with existent routing protocol AODV and SSA. And the results, obtained using the ns-2 network simulation platform, show good performance that reduced the number of reconstructions remarkably by distributing the whole traffic to several routes when there are several stable routes.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.6
• /
• pp.205-212
• /
• 2003

Because a wireless ad hoc network does not have fixed infrastructure, a call admission control approach researched in a wireless network is not feasible to this network. In this paper, we propose call admission control scheme to support this problem and the burst handoff traffic due to group mobility in a wireless ad hoc network. This scheme is an adaptive guard channel scheme which adapt the number of guard channels in each MBS(mobile base station) according to the current estimate of the potential handoff call rate derived from the number of ongoing calls within the coverage area of an MBS that initiate group handoff in a wireless ad hoc network. Our simulation studies are performed for comparisons of the proposed scheme with the other channel allocation schemes. Simulation results show that the proposed scheme efficiently reduces handoff call blocking probability in wireless ad hoc networks.

• 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.

• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.2
• /
• pp.45-52
• /
• 2006

Mobile Ad-hoc Network(MANET) could be applied to various applications by virtue of its characteristics such as self-organizing and infrastructure-free network. This paper proposes a multimedia application service model for MANET, called multi-hop Relay(mRelay) system. It supports a multi-hop communication-based multimedia service interworked with Internet by using an unmanned moving robot with wireless multimedia communication function as a mRelay terminal. The modified AODV routing protocol was applied to the terminal and it was verified that composition and maintenance of mobile Ad-hoc network in mRelay system under the various indoor scenarios were successful and stable multi-hop multimedia services were possible. The mRelay system can be applicable to various application services of mobile Ad-hoc networks.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.141-144
• /
• 2003

The mobile radio networks can be divided into networks that has the base station or the infrastructures like AP(Access Point) and Ad Hoc network that hasn't any infrastructures. As there aren't any fixed infrastructures in Ad Hoc Networks, mobile nodes should transmit the data only among mobile nodes themselves. To supplement these weakpoints of the two networks, many studies about Ad Hocs based on the 802.11 are in progress. In this thesis, we try to propose the efficiency of the suggested protocols by comparing and analyzing power saving protocols according to the Beacon intervals in multi hop Ad Hoc Networks based on IEEE 802.11.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1415-1420
• /
• 2003

The mobile radio networks can be divided into networks that has the base station or the infrastructures like AP(Access Point) and Ad Hoc network that hasn't any infrastructures. As there aren't any fixed infrastructures in Ad Hoc Networks, mobile nodes should transmit the data oかy among mobile nodes themselves. To supplement these weakpoints of the two networks, many studies about Ad Hon based on the 802.11 are in progress. In this thesis, we try to propose the efficiency of the suggested protocols by comparing and analyzing power saving protocols according to the Beacon intervals in multi hop Ad Hoc Networks based on IEEE 802.11.