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

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

• The Journal of the Korea Contents Association
• /
• v.10 no.4
• /
• pp.55-65
• /
• 2010

We present a method for increasing network lifetime without link failure due to lack of battery capacity of nodes in wireless ad-hoc networks with low mobility. In general, a node with larger remaining battery capacity represents the one with lesser traffic load. Thus, a modified AODV routing protocol is proposed to determine a possible route by considering a remaining battery capacity of a node. Besides, the total energy consumption of all nodes increase rapidly due to the huge amount of control packets which should be flooded into the network. To reduce such control packets efficiently, a source node can store information about alternative routes to the destination node into its routing table. When a link failure happens, the source node should retrieve the route first with the largest amount of the total remaining battery capacity from its table entries before initiating the route rediscovery process. To do so, the possibility of generating unnecessary AODV control packets should be reduced. The method proposed in this paper increases the network lifetime by 40% at most compared with the legacy AODV and MMBCR.

• Journal of Internet Computing and Services
• /
• v.2 no.3
• /
• pp.9-17
• /
• 2001

Ad-Hoc networks consist of a set of mobile hosts that communicate using wireless links, without the use of other communicate support facilities (such as base stations). The topology of an Ad-Hoc network changes due to the movement of mobile host. which may lead to sudden packet loss. Recently, a large amount of research has focused on the routing protocols needed in such an environment. but researches about Internet traffic performance analysis were unexhausted. Accordingly, we have simulated Ad-Hoc mobile network that using AODV routing protocol and Ad-Hoc mobile network topology size and node speed as simulation estimation-factor to analysis traffic performance. As the result of the simulation, we identify that TCP /Reno was more sensitive than TCP/Sack about node speed and a number of the node.

• Structural Engineering and Mechanics
• /
• v.49 no.4
• /
• pp.509-521
• /
• 2014

In this paper two protocols of Wireless Sensor Networks (WSN) are examined through both a simulation and a case study. The simulation was performed with the optimized network (OPNET) simulator while comparing the performance of the Ad-Hoc on demand Distance Vector (AODV) and the Dynamic Source Routing (DSR) protocols. This is compared and shown with real-world measurement of deflection from eight wireless sensor nodes. The wireless sensor response results were compared with accelerometer sensors for validation purposes. It was found that although the computer simulation suggests the AODV protocol is more accurate, in the case study no distinct difference was found. However, it was shown that AODV is still more beneficial in the field as it has a longer battery life enabling longer surveying times. This is a significant finding as a large factor in determining the use of wireless network sensors as a method of assessing structural response has been their short battery life. Thus if protocols which enhance battery life, such as the AODV protocol, are employed it may be possible in the future to couple wireless networks with solar power extending their monitoring periods.

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.65-71
• /
• 2011

In this paper, the RFID / USN-based ad-hoc network structure is presented for efficient operation of a container terminal yard. Communication between fixed or mobile devices in the container terminal yard is accomplished through the ad-hoc node, to collect the status information of a container in real time. Any outside shipper of the container as well as central server allows to share the status information of a container through ad-hoc communication. In addition, to predict the maximum wireless transmission range of nodes by RFID tag position in the yard, LAODV (Location based AODV) routing protocol is proposed. The validity is proved by performance evaluation via computer simulation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.5
• /
• pp.574-580
• /
• 2019

Conventional energy efficient routing protocols apply high weight to energy among routing metrics, causing nodes to concentrate on energy efficient paths and quickly exhaust energy on those paths. The unbalanced energy consumption of these wireless sensor networks causes network division and malfunction, and reduces network lifetime. Therefore, in this paper, it proposes a link cost based routing protocol to solve the unbalanced energy consumption of wireless sensor networks. The proposed routing protocol calculates the link cost by applying the weight of the routing metric differently according to the network problem situation and selects the path with the lowest value. As a result of the performance analysis, it confirmed that the proposed routing protocol has 22% longer network life, 2% energy consumption standard deviation and 2% higher data reception rate than the existing AODV protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.11
• /
• pp.2205-2217
• /
• 2015

Bio-inspired routing protocol uses a principle of swarm intelligence, which finds the optimal path to the destination in a distributed and autonomous way in dynamic environments, so that it can maximize routing performances, reduce control overhead, and recover a path failure quickly according to the change of network topology. In this paper, we propose a bio-inspired routing protocol for mobile ad hoc networks. The proposed scheme uses a function of overhearing via wireless media in order to obtain the routing information without additional overhead. Through overhearing, the pheromone is diffused around the shortest path between the source and destination. Based on this diffused pheromone, a probabilistic path exploration is executed and the useful alternative routes between the source and destination are collected. Therefore, the proposed routing protocol can ensure the up-to-date routing information while reducing the control overhead. The simulation results show that the proposed scheme outperforms the typical AODV and AntHocNet protocols in terms of routing performances and significantly decreases the routing overhead against the AntHocNet.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.12
• /
• pp.2293-2300
• /
• 2008

In ad-hoc sensor network, AODV routing information is disclosed to other nodes because AODV protocol doesn't have any security mechanisms. The problem of AODV is that an attacker can falsify the routing information in RREQ packet. If an attacker broadcasts the falsified packet, other nodes will update routing table based on the falsified one so that the path passing through the attacker itself can be considered as a shortest path. In this paper, we design the routing-information-spoofing attack such as falsifying source sequence number and hop count fields in RREQ packet. And we suggest an efficient scheme for detecting the attackers and isolating those nodes from the network without extra security modules. The proposed scheme doesn't employ cryptographic algorithm and authentication to reduce network overhead. We used NS-2 simulation to evaluate the network performance. And we analyzed the simulation results on three cases such as an existing normal AODV, AODV under the attack and proposed AODV. Simulation results using NS2 show that the AODV using proposed scheme can protect the routing-information-spoofing attack and the total n umber of received packets for destination node is almost same as the existing norm at AODV.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1B
• /
• pp.11-16
• /
• 2007

This paper describes the design and performance of a secure routing protocol with time-space cryptography for mobile ad-hoc networks. The proposed time-space scheme works in the time domain for key distribution between source and destination as well as in the space domain for intrusion detection along the route between them. For data authentication, it relies on the symmetric key cryptography due to high efficiency and a secret key is distributed using a time difference from the source to the destination. Also, a one-way hash chain is formed on a hop-by-hop basis to prevent a compromised node or an intruder from manipulating the routing information. In order to evaluate the performance of our routing protocol, we compare it with the existing AODV protocol by simulation under the same conditions. The proposed protocol has been validated using the ns-2 network simulator with wireless and mobility extensions.

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