• Journal of KIISE:Computing Practices and Letters
• /
• v.13 no.1
• /
• pp.1-10
• /
• 2007

An advantage of the mobile ad hoc network (MANET) is that mobile nodes can self-organize the network topology without the help of network infrastructure. However, for the perfect self-organization of the MANET, each mobile node needs to self-configure its address. Even though a mobile node configures a unique address during the booting time, its address may conflict with nodes in other MANETs since MANETs containing the same address can be merged. The address autoconfiguration protocol implemented in this work consists of the strong DAD (Duplicate Address Detection) and the weak DAD. A unique address of a node is assigned by the strong DAD during the booting time and the weak DAD is used to detect address conflict and resolve address conflict during the ad hoc routing. In this work, we have implemented address autoconfiguration in the IPv6-based MANET using AODV as the routing protocol. We describe how the IPv6 address autoconfiguration is implemented and verify our implementation by showing the test scenarios on our testbed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.542-558
• /
• 2016

Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source Routing Protocol (DSR) and on the use of Genetic Algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.79-86
• /
• 2006

This paper proposes a new protocol to enhance the routing performance and applies our proposal to AODV (Ad hoc On-demand Distance Vector routing) protocol, which is a typical on-demand routing protocol in MANET. In general, when a route repair procedure is performed due to the transfer or failure of a node, the source node re-initiate a route discovery procedure in most routing protocols of MANET. This causes to increase the control traffic overhead largely and degrade the routing performance. The main idea of our study is to provide a methodology that can minimize the control traffic overhead and enhance the performance by initiating a route repair procedure at destination node and utilizing the previous routing information maximumly. To evaluate the performance of the our mechanism, we have performed a series of simulations. The simulations include comparisons with AODV and AODV with local repair. The simulations have been executed under simulation environments taking into account mobility speed and network site. The simulation results show that our proposal overall outperforms the existing protocols.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.227-229
• /
• 2011

애드혹 네트워크(Ad-hoc network)는 노드의 이동성으로 인해 토폴로지가 동적으로 변화하여 경로 에러가 빈번하게 발생한다. 그러므로 빠르고 효과적으로 경로를 재설정 하는 것이 중요하다. 본 논문에서는 애드 혹 라우팅 플로토콜 중의 하나인 AODV(Ad-hoc On-Demand Distance Vector) 라우팅 프로토콜에서의 노드 경로 설정 과정을 개선하는데 있어서, 코어(CORE) 노드를 중심으로 다중경로를 설정하여 경로 오류 발생시, 경로 재설정 과정의 시간을 단축시키고 제어 트래픽의 오버헤드를 낮추어 보다 빠르고 효율적인 경로 복구 기법을 제시한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1287-1290
• /
• 2006

무선 네트워크의 전송 방식은 유선 네트워크와 다르며, 따라서 유선 네트워크를 기반으로 설계된 인터넷 프로토콜(TCP/IP)은 무선네트워크 환경에서 불안정 하게 작동한다. 본 논문에서는 기존의 유선 인터넷에 맞춰진 전송 프로토콜인 UDP와 TCP를 802.15.4 MAC기반의 ZigBee Protocol 환경에서 사용되는 특성과 AODV 및 확장 프로토콜인 AOMDV를 통해 인터넷에 결합된 네트워크 인터페이스를 가진 노드들의 특성과 관리의 중요함을 확인한다

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

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.219-226
• /
• 2006

The shortest path is only maintained during short time because network topology changes very frequently and each mobile nodes communicate each other by depending on battery in MANET(Mobile Ad-hoc Network). So many researches that are to overcome a limitation or consider a power have executed actively by many researcher. But these protocols are considered only one side of link stability or power consumption so we can make high of stability but power consumption isn't efficient. And also we can reduce power consumption of network but the protocol can't make power consumption of balancing. For that reason we suggest RBSSPR(Residual Battery Capacity and Signal Strength Based Power-aware Routing Protocol in MANET). The RBSSPR considers residual capacity of battery and signal strength so it keeps not only a load balancing but also minimizing of power consumption. The RBSSPR is based on AODV(Ad-hoc On-demand Distance Vector Routing). We use ns-2 for simulation. This simulation result shows that RBSSPR can extense lifetime of network through distribution of traffic that is centralized into special node and reducing of power consumption.

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

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.10
• /
• pp.2658-2681
• /
• 2023

In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

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