• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.32-38
• /
• 2007

Wireless Ad-Hoc network which doesn't utilize any established infrastructure requires different communication protocols. Among them, Flooding algorithm is generally used in wireless Ad-Hoc network for packet transmission. However, Flooding algorithm has many drawbacks such as energy consumption according to the increase of nodes. Therefore, a modified flooding algorithm which can effectively overcome the aforementioned drawbacks is proposed in this paper. The performance of the proposed scheme is shown by various simulation studies.

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

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.63-64
• /
• 2016

Ad-hoc Network는 노드의 이동성과 제한된 배터리 수명에 의해 Network 토폴로지가 자주 교체되며 이런 연유로 적합한 Routing Protocol을 선택하는 것도 매우 중요한 과제이다. 본 논문에서는 자주 변화하는 Ad-hoc Network에 적합한 Routing Protocol을 선정하기 위해서 OMNeT++을 이용해 시뮬레이션 환경을 설정하고 각 Routing Protocol 특성을 파라미터 화시켜 적용, 요소별 수치를 비교 분석하여 성능평가를 하였다.

• Convergence Security Journal
• /
• v.9 no.4
• /
• pp.29-34
• /
• 2009

The many transaction occurs because of service will not be able to trust in mobile Ad-hoc Network. Overcomes like this problem point with the plan for, This paper proposes the trust evaluation mechanism which is the possibility becoming the standard of the node selection which provides a better service by using the transaction message which is basic occurs from within the mobile Ad-hoc network and in the transaction message which is additional. At last, this paper embodies the trust mechanism which proposes, confirms the trust value which is evaluated with NS2 simulator.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.436-438
• /
• 2003

Ad hoc Network에서 효율적인 데이터 트래픽의 전송을 위하여 AODV 라우팅 알고리즘을 보안한 DM-AODV(Disjoint Multipath AODV)와 이를 활용하여 Qos율 높인 트래픽 분산 알고리즘인 TPA(Traffic Partitioning Algorithm)을 제안한다. 첫째, dynamic한 Ad hoc network환경에서 사용될 수 있는 DM-AODV을 사용하여 중복 노드가 없는 multipath들과 그 경로 각각의 최소 대역폭(bandwidth)을 구하고 둘째, 소스 노드에 들어오는 트래픽의 요구 대역폭과 TPA을 사용하여, 네트워크가 정상 일 때 전달 될 main path들과 네트워크 장애 시 할당 될 alternative path들에 들어오는 트래픽을 dynamic하게 분산시킴으로써 어플리케이션이 요구하는 높은 대역폭의 트래픽 수용 가능성을 높이고, 들어오는 트래픽의 안정적인 대역폭 보장과 속도의 향상, 폭주(congestion)의 감소 효과를 나타낸다. 또한 Main path에 장애 발생시, 미리 계산된 alternative Path에 트래픽을 전송함으로서 들어오는 패킷의 손실을 최소한으로 한다. 본 논문에서는 Ad hoc network에서의 QoS를 높이는 두 알고리즘을 소개하고, 동작 원리를 알아본다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.917-918
• /
• 2009

This study evaluated the level of performance improvement in the form of a simulated experiment by adding fixed node in the middle of the network as a way to improve mobile ad.hoc network performance. The result showed that the performance level was much higher when fixed node was used together than when mobile node was used only, and the comparison of the mobile speed of mobile node also showed that use of fixed node together had higher performance. Moreover, the evaluation in accordance with the number of fixed node showed that more number of fixed node had shorter time delay. Further study following this on how many fixed node should be added on the ad.hoc network will ensure establishment of more reliable ad.hoc network.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.601-603
• /
• 2013

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.

• 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 IEEK Conference
• /
• summer
• /
• pp.143-146
• /
• 2004

Differentiated services (DiffServ) has been widely accepted as the service model to adopt for providing quality-of­service (QoS) over the next-generation IP networks. There is a growing need to support QoS in mobile ad hoc networks. Supporting DiffServ in mobile ad hoc networks, however, is very difficult because of the dynamic nature of mobile ad hoc networks, which causes network congestion. The network congestion induces long transfer packet delay and low throughput which make it very difficult to support QoS in mobile ad hoc networks. We propose DiffServ module to support differentiated service in mobile ad hoc networks through congestion control. Our DiffServ module uses the periodical rate control for real time traffic and also uses the best effort bandwidth concession when network congestion occurs. Network congestion is detected by measuring the packet transfer delay or bandwidth threshold of real time traffic. We evaluate our mechanism via a simulation study. Simulation results show our mechanism may offer a low and stable delay and a stable throughput for real time traffic in mobile ad hoc networks.