• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.905-916
• /
• 2004

Self-organizing hierarchical ad hoc network (SOHAN) is a new ad-hoc network architecture designed to improve the scalability properties of conventional 'flat' ad hoc networks. This network architecture consists of three tiers of ad-hoc nodes, i.e.. access points, forwarding nodes and mobile nodes. This paper presents a topology discovery and routing protocol for the self-organization of SOHAN. We propose a cross-layer path metric based on link quality and MAC delay which plays a key role in producing an optimal cluster-based hierarchical topology with high throughput capacity. The topology discovery protocol provides the basis for routing which takes place in layer 2.5 using MAC addresses. The routing protocol is based on AODV with appropriate modifications to take advantage of the hierarchical topology and interact with the discovery protocol. Simulation results are presented which show the improved performance as well as scalability properties of SOHAN in terms of through-put capacity, end-to-end delay, packet delivery ratio and control overhead.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1561-1567
• /
• 2015

Nodes of Mobile ad-hoc network usually use the energy-limited battery. Balanced energy consumptionis important to maintain path's stability. In this paper, we focus on improving the stability of the routing path in mobile ad-hoc networks. For that purpose, we propose a new routing protocol to find the highest minimum node residual energy path among shortest paths. The largest path of minimum value of the remain energy has a longer life than other paths to improve the reliability to data-transmission. Using ns-3 simulator, we show that the proposed routing protocol can provide more long-life stable routing path than AODV and EA-AODV.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2013.06a
• /
• pp.27-28
• /
• 2013

본 논문에서는 간섭 제한 적인 상황에서 지정된 채널을 추정해야 하는 실제적인 무선 애드혹 네트워크에서 비모수 선형 MMSE 필터 기반의 간섭 제어 채널 추정 기법을 사용하여 네트워크 성능을 개선시키는 새로운 기법을 제안한다. 제안하는 채널 추정 기법은 간섭의 정도에 따라 노드를 활성화 시키고 지정된 채널 추정을 한다. 실제적인 무선 애드혹 네트워크 모의실험을 통해 제안된 기법이 기존의 채널 추정 기법에 비해 상당한 전송 캐패시티 이득을 얻을 수 있음을 확인할 수 있다.

• Journal of KIISE:Information Networking
• /
• v.37 no.3
• /
• pp.198-203
• /
• 2010

In this paper, a new routing protocol is proposed to manage selfish nodes which make a strategic choice to maximize only their own profits. To provide incentives to nodes on the path, VCG mechanism is introduced. Therefore, based on the collaborative actions among nodes, the entire network performance can be improved. With a simulation study, the proposed scheme can approximate an optimized solution while ensuring a well-balanced network performance under widely diverse network environments.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.07a
• /
• pp.107-108
• /
• 2012

본 논문에서는 수신단에서 간섭 단말들의 채널상태정보가 불완전한 무선 애드혹 네트워크에서 비모수 선형 MMSE 수신기를 사용하여 네트워크 전송 용량을 향상시키는 기법을 제안한다. 비모수 선형 MMSE 수신기는 수신신호의 자기 상관을 이용한다. 지정된 채널정보를 간섭과 잡음으로만 이루어진 관측들에 포함시킴으로써, 제안된 기법은 최적의 MMSE 전송 용량의 상당한 부분을 달성한다. 실제적인 애드혹 네트워크 시스템의 전송용량 모의실험을 통해 제안된 기법이 기존의 수신 알고리즘에 비해 상당한 성능 이득을 얻을 수 있음을 확인하였다.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.31-41
• /
• 2014

This paper proposes a virtual mobile ad-hoc network (VMANET) model that automatically divides heterogeneous mobile devices of a MANET into a number of network groups depending on the communication capacity(data rate) of different network operational models such as IEEE 802.11g, IEEE 802.11b, and Frequency Hopping. In addition, it supports a distinct routing protocol for each network group of VMANETs, resulting in running multiple routing protocols concurrently on different groups of VMANETs. To reduce the network congestion and improve the network load balance, a default MANET gateway is configured in each VMANET and these gateways are responsible for integrating the MANET and IP networks. Experiment results show that the proposed model outperforms the conventional IMANET by significantly increasing throughput and reducing network congestion and network delay.

• Proceedings of the Safety Management and Science Conference
• /
• 2002.11a
• /
• pp.261-267
• /
• 2002

화재나 긴급상황이 발생하였을 때 임시적으로 네트워크를 구성할 수 있는 애드혹 네트워크분야에서 DSR, AODV, TORA, ZRP 라우팅 프로토콜의 연구가 활발하며 이에 대한 여러가지 개발이 이루어지고 있다. 본 논문에서는 AODV 라우틸 프로토콜을 이 용하여 다양한 네트워크 환경에서 AODV 라우팅 프로토콜의 성능평가와 함께 AODV 라우팅 프로로콜의 문제점을 수정하여 개선하여 실질적인 MANET 통신에서 사용될수 있는 라우팅 프로토콜을 제안한다.

• Journal of KIISE:Information Networking
• /
• v.34 no.3
• /
• pp.218-225
• /
• 2007

As the research on home network technologies, sensor network technologies, and ubiquitous network technologies makes rapid progresses, wireless ad-hoc network have attracted a lot of attention. A wireless mobile ad-hoc network is a temporary network formed by a collection of wireless mobile nodes without the aid of any existing network infrastructure or centralized administration, and it is suitable for ubiquitous computing environments. In this paper, we suggest an extension scheme of a wireless mobile ad-hoc network based on limited multiple paths source routing protocol. This scheme reduces the overhead of route re-establishment and re-registration by maintaining link/node non-disjoint multiple paths between mobile hosts in a wireless mobile ad-hoc network or a mobile host in a wireless mobile ad-hoc network and a base station supporting fixed network services. By maintaining multiple paths, our scheme provides short end-to-end delay and is reliable extension scheme of a wireless mobile ad-hoc network to a fixed network. In this paper, our simulations show that our scheme outperforms existing schemes with regards to throughput and end-to-end delay. Also we show that our scheme outperforms multi-paths approach using disjoint routes with regards to routing overhead.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.40-48
• /
• 2008

Security of self organized mobile ad hoc networks is an important issue because administration information in the networks is managed by the constituent nodes. Especially authentication mechanism is necessary for trust setup between newly joining nodes and the network. The authentication models and protocols which are based on the wireline infrastructure could not be practical for mobile ad hoc network. Although public key algorithm-based method is widely used for authentication, it is not easy to be applied to mobile ad hoc networks because they do not have infrastructure such as centralized CA which is needed for certificate verification. In this paper, we consider the public key based random CA group method proposed in [1] to provide efficient authentication scheme to mobile ad hoc networks and analyze the performance of the method, which is then compared to the home CA method. From the analysis results, we see that the random CA method where the function of CA is distributed to some mobile nodes and the authentication information is propagated to randomly chosen CAs shows higher reliability and lower cost than home CA method.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.7
• /
• pp.845-851
• /
• 2019

We design, implement, and evaluate a user-level ad hoc network routing protocol on the COTS (commercial off-the-shelf) mobile devices. In situations such as disaster recovery, emergency communication between mobile devices is necessary. For wide deployability and usability of such a system, we design and implement the networking protocols on the user level instead of modifying the kernel of mobile devices. In order to support reliable data transfer in high mobility scenarios, we selected to implement AODV (Ad Hoc On-Demand Distance Vector) as the routing protocol and TCP as the transport layer protocol. With our implementation of ad hoc networking stack on COTS smartphones, we conducted experiments in various networking environments. Our experimental results show that ad hoc networking is possible in up to 12 hops in a line topology and 5 concurrent devices in a star topology.