• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04a
• /
• pp.583-585
• /
• 2002

Mobile Ad Hoc Network에서는 무선으로 연결된 호스트들이 쉽게 이동할 수 있으며 미리 설치된 유선망을 이용하는 셀롤러망과 달리 이동 호스트 사이의 통신만으로 이루어진 망이다. Mobile Ad Hoc Network에서는 각각의 노드들의 이동성이 높기 때문에 이 각각의 노드들의 라우팅 경로를 결정하는 것이 중요하다. 이에 따라 Mobile Ad Hoc Network를 위한 많은 라우팅 프로토콜이 제안되었다. 본 논문에서는 기존에 제안된 Cluster Based Routing Protocol(CBRP)극 변형하여 마치 셀롤러망에서의 셀과 같이 고정된 위치를 하나의 셀로 정의하고 그 하나의 셀이 클러스터를 형성하여 라우팅 오버 헤드를 줄일 수 있는 기법을 제안한다.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1059-1062
• /
• 2005

A hybrid ad-hoc network consists of a wired network and a mobile ad-hoc network connected by the internet gateway. To provide seamless service for internet user in hybrid ad-hoc network, an efficient internet gateway selection technique and a fast handover technique are needed. In this paper, we propose a seamless handoff technique for providing mobility of mobile hosts in hybrid ad-hoc networks. The proposed technique improves general handoff performance by an internet gateway re-registration algorithm for ad-hoc networks. Moreover, it reduces handoff processing time in the range of certain region by using mobility management agent (MMA) and also the packet loss when handoff occurs out of the range of MMA by tunneling technique.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.195-201
• /
• 2006

This thesis proposes hybrid routing protocol that mix proactive routing protocol and reactive routing protocol used in Ad hoc network. Proposed method is that establish special node offering network service of nods which construct Ad hoc network and do routing different from existing hybrid routing protocol, ZRP. Special node doing these parts is called C-node. Routing using C-node can accompany efficient routing by decreasing path institution time and flooding time than existing routing protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.713-716
• /
• 2004

In this paper we challenge the user Authentication using Kerberos V5 authentication protocol in Ad-hoc network environment. Ad-hoc network is a collection of wireless mobile nodes without the support of a stationary infrastructure. and DSR routing protocol, which is one of famous mobile ad-hoc routing protocols, has the following network path problem. this paper is the security structure that defined in a mobile network and security and watches all kinds of password related technology related to the existing authentication system. It looks up weakness point on security with a problem on the design that uses Ad-hoc based structure and transmission hierarchical security back of a mobile network, and a server-client holds for user authentication of an application level all and all, and it provides one counterproposal.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.223-226
• /
• 2003

In this paper, we propose new agent discovery and route discovery schemes to support Mobile IP (MIP) in Ad Hoc networks with wireless backbone. The wireless backbone consisting of stationary wireless routers and Internet gateways (IGs) is a kind of wireless access network of IP-based core network. The proposed scheme utilizes favorable features of wireless backbone such as stable links and no energy constraints. In the agent discovery scheme, backbone-limited periodic Agent Advertisement (AA) and proxy-AA messages are used, which reduce network-wide broadcasting overhead caused by AA and Agent Solicitation messages and decentralize MIP processing overhead in IGs. In order to reduce delay time and control message overhead during route discovery far the destination outside Ad Hoc network, we propose a cache-based scheme which can be easily added to the conventional on-demand routing protocols. The proposed schemes can reduce control overhead during agent discovery and route discovery, and efficiently support MIP in Ad Hoc network with wireless backbone.

• The KIPS Transactions:PartC
• /
• v.9C no.5
• /
• pp.647-654
• /
• 2002

Ad-hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other supporting communication facilities (such as base stations, etc.). Therefore, the topology of an Ad-hoc network frequently changes due to the movement of mobile host, which nay lead to sudden packet loss. Recently, the large amount of research has focused on the routing protocols needed in such an environment. In this paper, TCP Reno, Sack, and Tahoe versions are analysed using DSR protocol which is the representative On-Demand routing protocol in Ad-hoc wireless network. As the result of this simulation, we know that TCP Reno relatively has higher throughput than that of Sack and Tahoe, and TCP Reno has more stable performance than that of TCP Tahoe and Sack, regardless of the speed of mobile node and the size of topology.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.6 s.348
• /
• pp.39-45
• /
• 2006

n a hybrid ad-hoc network, wired network and a mobile ad-hoc network are connected by the internet gateway. To provide seamless service for internet users in the hybrid ad-hoc network, an efficient internet gateway selection technique and a fast handover technique are needed. In this paper, we propose a seamless handoff technique for providing mobility of mobile hosts in hybrid ad-hoc networks. The proposed internet gateway re-registration algorithm improves general handoff performance. Moreover, the handoff processing time within certain range of area is reduced by using mobility management agent(MMA). In addition the packet loss is reduced when handoff occurs out of the range of MMA by tunneling technique.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1654-1662
• /
• 2006

An ad hoc network is multi-hop network composed of radio links. and the transmission quality of a radio link is more unstable than that of a wired circuit. Packet loss thus occurs frequently in an ad hoc network, and the consequent connection failure results in a severe deterioration of TCP performance. TCP performance also deteriorates because of the collision of data packets and ACK packets in the radio channel. In this paper we study to improve the performance of the Mobile Ad-hoc network by using Delayed ACK algorithm with our proposed ODA(Ordering-Delayed ACK) method. The proposed ODA algorithm increases the number of the data packets orderly at the receiver side which is going to be applied for the Mobile Ad-hoc network. We accomplished a computer simulation using NS-2. From the simulation results, we find the proposed ODA algorithm obviously enlarge the channel capacity and improve the network performance at the situation of multi-hop of ad-hoc network than the existing Delayed ACK algorithm.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.11a
• /
• pp.219-223
• /
• 2003

A lot of researches have been done on supporting QoS in the mobile networks and ad hoc network architectures, but most of them are not suitable in the static ad hoc environment. Most Research in mobile ad hoc networks has been devoted to routing protocol since they are fundamantal to the technology for improving QoS. In mobile ad hoc networks, QoS means not only fast speed and reliable transmission but reliable node. Needless to say, general QoS is serious question. In this paper, we enunciate the proposition to reduce network load and prevent node expire using buffer node.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8A
• /
• pp.639-648
• /
• 2005

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 ad-ministration. Numerous routing protocols have been developed for changing messages among the nodes in a wireless ad-hoc network. Some multi-path routing protocols have also been proposed to support load balancing and QoS for wireless ad-hoc networks. In this paper, we propose not only an efficient routing algorithm for wireless ad-hoc net-worts but also a protocol that can improve data transmission rate and reduce end-to-end delay. In our protocol, each mobile node need not broadcast routing messages periodically and the mobile node that wants to send data packets initiates route request and route establishment procedure. 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.