• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.7
• /
• pp.1306-1312
• /
• 2017

The route request (RREQ) packet is selectively re-broadcasted in the routing protocols that improve the broadcast storm problem of the ad-hoc on-demand routing protocol (AODV). However, in a low node density scenario, the connectivity of these selective rebroadcast schemes becomes less than that of the AODV. In order to clarify the requirements of these selective re-broadcast routing protocols, it is necessary to investigate the relationship between the node density and the connectivity. In this paper, we drive a probability to preserve the connectivity of the GAODV at an intermediate rebroadcast node. In addition, we present an intuitive method to approximate the end-to-end connectivity of the GAODV. We draw the required node density to guarantee the connectivity of 0.9 and 0.99 through computer simulations, and verify the validity of the derived theoritical connectivity by comparing with the simulation results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.9
• /
• pp.1665-1671
• /
• 2007

Mobile Ad hoc Networks (MANETs) refer to autonomous networks in which wireless data communications are established between multiple nodes in a given coverage area without a base station or centralized administration. Because of node mobility and limited battery life, the network topology may changes frequently. Selecting the most reliable path during route discovery process is important to improve performance in ad-hoc networks. In this study, we proposed an enhanced routing protocol based on AODV by monitoring variation of receiving signal strength. New metric function that consists of node mobility and hops of path is used for routing decision. From extensive experiments by using NS-2, The performance of the proposed routing scheme has been imp개ved by comparison to AODV protocol.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.59-70
• /
• 2014

This paper propose a new wireless multi-hop routing protocol that takes the hierarchical mesh of the hybrid WMN into account. WMN that is possible to provide various applications of wireless networks still has many open issues that should be solved despite the studies carried out over a decade. Especially, in routing protocol area, a problem degrading the routing efficiency by applying one of the routing protocols, which are designed for the MANET, to the hybrid WMN be solved above all. For the improvement of the routing performance, both good routing protocol and metric are essential. However, the recent studies are only concentrated in routing metric by use of the cross-layer design. Therefore, this paper is dedicated to the routing protocol that is essential for the performance of the routing but needed more studies. The proposed protocol in this paper is reactive, and designed to reorganize the hybrid WMN with several pseudo domains, and carry out domain-based route decision. By the simulation result for the performance analysis of the proposed protocol, the average delay for the route decision was decreased by 43% compared to AODV that is the typical reactive protocol.

• International journal of advanced smart convergence
• /
• v.8 no.4
• /
• pp.169-178
• /
• 2019

Due to the characteristics of an ad hoc network without a control center, self-organization, and flexible topology, the trust evaluation of the nodes in the network is extremely difficult. Based on the analysis of ad hoc networks and the blockchain technology, a blockchain-based node-level trust evaluation model is proposed. The concepts of the node trust degree of the HASH list on the blockchain and the perfect reward and punishment mechanism are adopted to construct the node trust evaluation model of the ad hoc network. According to the needs of different applications the network security level can be dynamically adjusted through changes in the trust threshold. The simulation experiments demonstrate that ad-hoc on-demand distance vector(AODV) Routing protocol based on this model of multicast-AODV(MAODV) routing protocol shows a significant improvement in security compared with the traditional AODV and on-demand multipath distance vector(AOMDV) routing protocols.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.167-168
• /
• 2006

Mobile Ad Hoc Networks (MANETs) has the characteristics such as dynamic network topology, constrained power capacity, constrained wireless bandwidth and quality, etc. For MANETs AODV (Ad-Hoc On-Demand Distance Vector) routing protocol has been proposed. However AODV routing protocol has some inefficiency related to re-routing path establishment corresponding to node's failure. In this paper, we propose a Self-Healing Routing Technique for MANETs that uses the one-hop nodes from the failed node to set up the routing path efficiently. We also include simulation results to show the performance of our method.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.303-310
• /
• 2008

To increase the lifetime of ad-hoc networks, a ratio of energy consumption for each node should be kept constant by equally distributing network traffic loads into all of the nodes. In this paper, we propose a modified AODV routing protocol to determine a possible route by considering a remaining battery capacity of a node and the degree of its usage. In addition, to reduce the amount of energy consumption during the path rediscovery process due to the huge amount of the AODV control messages the limited number of possible routes are stored into a routing table of a source node. When some links of a route fail, another possible path can be looked up in the table before the route discovery process should be initiated. We have tested our proposed method with a conventional AODV and a MMBCR method which is one of the power-efficient energy routing protocols based on the three performance metrics, i.e., the total remaining battery capacity, network lifetime and the ratio of data packets received by the destination node to compare their performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.11A
• /
• pp.1173-1181
• /
• 2007

A number of routing algorithms have been studied for wireless mobile ad-hoc network. Among them, the AODV routing algorithm with on-demand method periodically transmits hello message and monitors link state during data transmission in order to maintain routing paths. When a path is disconnected, a node that senses it transmits a RERR packet to the transmitting node or transmits a RREQ locally so that the path could be repaired. With that, the control packet such as a RREQ is broadcast, which causes the consumption of bandwidth and incurs data latency. This paper proposes a LRRLBP algorithm that locally repairs a path by predicting link state before disconnecting the path based on the AODV routing protocol for solving such problems. Intensive simulations with the results using NS-2 simulator are shown for verifying the proposed protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1371-1379
• /
• 2009

In this paper, we propose a new multi-path routing protocol to provide reliable and stable data transmission in MANET that is composed of high-mobility nodes. The new multi-path routing establishes the main route by the mechanism based on AODV, and then finds the backup route that node-disjoint from the main route by making add nodes in the main route not participate in it. The data transmission starts immediately after finding the main route. And the backup route search process is taking place while data is transmitted to reduce the transmission delay. When either of the main route or the backup route is broken, data is transmitted continuously through the other route and the broken route is recovered to node-disjoint route by the route maintenance process. The result of the simulation based on the Qualnet simulator shows that the backup route exists 62.5% of the time when the main route is broken. And proposed routing protocol improved the packet transmission rate by 2~3% and reduced the end-to-end delay by 10% compared with AODV and AODV-Local Repair.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.469-477
• /
• 2008

The standard routing protocol of MANET(Mobile Ad-hoc NETwork), AODV(Ad-hoc On-demand Distance Vector), only considers the shortest path for routing, which may cause traffic concentration to a node at the critical path. Hence, the battery of the node will be dissipated rapidly to reduce the lifetime of the whole network. In this paper, power dissipation considered AODV is proposed for fair energy distribution in MANET, and verified using the computer simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.5
• /
• pp.857-859
• /
• 2015

In this letter, we consider a directional routing protocol that reduces the duplicated packets for AODV-based flooding in the course of establishing the end-to-end route in the multi-hop maritime ad-hoc networks. We propose an adaptive means of reducing the routing overhead subject to the node density and the target probability of successful routing that is analyzed by the stochastic geometry.