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

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.943-953
• /
• 2013

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.9A
• /
• pp.844-851
• /
• 2010

Recently, AODV routing protocol which one of the table driven method for the purpose data transmission between nodes has been broadly used in mobile wireless sensor networks. An existing AODV has a little overhead of routing packets because of keeping the routing table for activity route and re-routes to recovery the routes in route discontinuation. However that has faults in that excesses useless of the network bandwidth to recovery the route and takes a lone time to recovery the route. This paper proposes an efficient route recovery method for AODV based on wireless sensor networks in connection breaks. The proposed method. The propose method controls the number of RREQ message considering the energy's node and distance between nodes to restrict the flooding range of RREQ message while expanding the range of local repair. In test results, the proposed method are compared to existing method, the number of drops decrease 15.43% and the delay time for re-route decrease 0.20sec.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.2
• /
• pp.459-465
• /
• 2014

Recently, multimedia data transmission becomes important issues in the wireless sensor network. For the multimedia data transmission in wireless sensor network, QoS (Quality of service) is an important factor to determine the system performance. AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment. In AODV, the destination node selects the route with the smallest hop count. Since AODV only considers the hop count, the selected route could have low channel condition, and degrade QoS. In this paper, we propose a modified AODV algorithm that considers the successful transmission rate of each link. The proposed algorithm regards the number of retransmission which can be obtained from the successful transmission rate as the hop count, and applies the modified hop count to AODV. The advantage of the proposed algorithm is that the modified AODV can support QoS without significant change of the conventional algorithm.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.429-436
• /
• 2005

A mobile ad hoc network (MANET) is a collection of mobile nodes without any fixed infrastructure or my form of centralized administration such as access points and base stations. The ad hoc on-demand distance vector routing (AODV) protocol is an on-demand routing protocol for MANETs, which is one of the Internet-Drafts submitted to the Internet engineering task force (IETF) MANET working group. This paper proposes a new multipath routing protocol called maximally disjoint multipath AODV (MDAODV), which exploits maximally node- and link-disjoint paths and outperforms the conventional multipath protocol based on AODV as well as the basic AODV protocol. The key idea is to extend only route request (RREQ) message by adding source routing information and to make the destination node select two paths from multiple RREQs received for a predetermined time period. Compared to the conventional multipath routing protocol, the proposed MDAODV provides more reliable and robust routing paths and higher performance. It also makes the destination node determine the maximally node- and link-disjoint paths, reducing the overhead incurred at intermediate nodes. Our extensive simulation study shows that the proposed MDAODV outperforms the conventional multipath routing protocol based on AODV in terms of packet delivery ratio and average end-to-end delay, and reduces routing overhead.

• Annual Conference of KIPS
• /
• 2003.05b
• /
• pp.1381-1384
• /
• 2003

본 논문에서는 ad hoc 네트워크의 성능 향상을 위해서 두개의 네트워크 인터페이스를 갖는 이질적인 노드를 활용하여 구성한 계층적인 ad hoc 네트워크(HANA)를 소개한다. HANA 는 두 계층으로 구성되며, 하위계층을 구성하는 노드(TN)들은 ad hoc 네트워크의 대표적 라우팅 프로토콜인 AODV를 수행하고, 상위계층을 구성하는 백본 노드(BN)는 두개의 네트워크 인터페이스를 갖고 자동 구성(auto-configuration)을 통해서 토폴로지 등 네트워크를 초기화한다. 또한, 본 논문에서는 HANA 구조를 효율적으로 활용하기 위해서 상위계층에서 운용할 라우팅 프로토콜(Extended-AODV)을 제안한다. BN 은 하위계층의 노드들이 발생시키는 AODV 메시지를 통해서 자신이 관할하는 지역에 있는 TN노드의 정보를 얻어내며, 확장된 AODV 메시지를 통해서 BN 상호간 정보를 교환하여 Proactive한 라우팅 정보를 수집한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.423-428
• /
• 2007

본 논문에서는 센서 네트워크 환경에, MANET기반의 라우팅 프로토콜인 AODV[1]를 적용하여 실험한 내용에 대해 소개한다. AODV는 RREQ, RREP 그리고 RERR등의 제어 메시지를 이용하여, 데이터를 전송하기 위한 망을 동적으로 구성하는 특징을 갖는다. MANET환경에 비해서 센서네트워크 환경은 에너지 사용 혹은 네트워크 망 구성에 있어서 많은 제약조건을 갖고 있다. 이러한 센서 네트워크 망에 AODV를 적용하였을 경우 어떠한 특성이 나타나는지 문제점을 분석하였다. 시뮬레이션 환경으로는 NS-2 시뮬레이터를 이용하여 구성하였으며 AODV 라우팅 프로토콜을 이용하여 싱크 수 증가, 소스 수 증가와 S-MAC을 적용함에 따른 평균 메시지 Delay, 평균 소비 에너지, 평균 데이터 전송률 등이 어떻게 변화하는지 살펴보았으며 센서 네트워크 환경에서의 성능을 확인하였다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.22 no.1
• /
• pp.1-9
• /
• 2017

With the Development of Wireless Network Technology and Wireless Link Technology, Wireless Mesh Network (WMN) is Attracting Attention as a Key Technology to Construct the Wireless Transit Network. The WMN has been Studied for a Long Time in Various Fields, however there are still many Problems that have not been solved yet. One of them is the Routing Problem to find an Optimal path in a Multi-hop Network Composed of Wireless Links. In the Hybrid-WMN, which is one of the Three Types of WMN, Optimal Path Selection Requires Research on Path Search Protocols that Effectively use the Infrastructure Mesh as a Transit Network, Together with Research for a Routing Metric with Excellent Performance. Therefore, this Paper Proposes a Dual Mode-AODV(Ad hoc On-demand Distance Vector) for Hybrid-WMN. Simulation result shows that the Path Selection Delay was Reduced by 52% than AODV when the Proposed Dual Mode-AODV was applied.

• The KIPS Transactions:PartC
• /
• v.15C no.3
• /
• pp.213-220
• /
• 2008

A MANET is an autonomous, infrastructureless system that consists of mobile nodes. In MANET, on-demand routing protocols are usually used because network topology changes frequently. The current approach in case of broken routes is to flag an error and re-initiate route discovery either at the source or at the intermediate node. Repairing these broken links is a costly affair in terms of routing overhead and delay involved. Therefore, this paper propose a NAODV(Neighbor-aware AODV) protocol that stands on the basis of an AODV. It sets up the route rapidly if it operates for setting the route directly by using sequence number of neighbor nodes without re-search the route when the route to destination node is broken. Also, it reduces loss of packets. We use NS-2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio and average end-to-end delay. Also, when the proposed protocol is applied to the large ad-hoc network with multiple nodes, the performance is more efficient.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.849-864
• /
• 2010

This paper proposes a multipath routing protocol called cross-layer multipath AODV (CM-AODV) for wireless ad hoc networks, which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (Ad hoc On-demand Distance Vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and is contained in the RREQ header. While achieving robust packet delivery, the proposed CM-AODV is amenable to immediate implementation using existing technology by neither defining additional packet types nor increasing packet length. Compared to the conventional multipath version of AODV (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CM-AODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, and results in less routing overhead.