• Journal of information and communication convergence engineering
• /
• 제9권5호
• /
• pp.610-614
• /
• 2011

Nowadays Mobile Ad Hoc Networks (MANETs) are a very popular and emerging technology in the world. MANETs helps mobile nodes to communicate with each other anywhere without using infrastructure. For this purpose we need good routing protocols to establish the network between nodes because mobile nodes can change their topology very fast. Mobile node movements are very important features of the routing protocol. They can have a direct effect on the network performance. In this paper, we are going to discuss random walk and random waypoint mobility models and their effects on routing parameters. Previously, mobility models were used to evaluate network performance under the different routing protocols. Therefore, the network performance will be strongly modeled by the nature of the mobility pattern. The routing protocols must rearrange the changes of accurate routes within the order. Thus, the overheads of traffic routing updates are significantly high. For specific network protocols or applications, these mobility patterns have different impacts.

• Journal of Information Technology Applications and Management
• /
• 제10권2호
• /
• pp.61-71
• /
• 2003

Ad-hoc networks are characterized by multi-hop wireless links, frequently changing network topology and the need for efficient dynamic routing protocols. In an Ad-hoc network, each host assumes the role of a router and relays packets toward final destinations Because a packet is broadcast to all neighboring nodes, the optimality criteria of wireless network routing is different from that of wired network routing. tn this paper 1 point out the more important cost factor than the number of links in the Ad-hoc network. A class routing protocols called on-demand protocols has recently found attention because of their low routing overhead since it performs a blind flooding to look for a path. In this paper, 1 propose the method which reduces overhead by using the information of neighboring nodes and doing a selective flooding. Simulation results demonstrate better reduction of routing overheads with this scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권9호
• /
• pp.3639-3662
• /
• 2020

The network capability to accomplish its functions in a timely fashion under failures and attacks is known as survivability. Ad hoc routing protocols have been studied and extended to various domains, such as Intelligent Transport Systems (ITSs), Unmanned Aerial Vehicles (UAVs), underwater acoustic networks, and Internet of Things (IoT) focusing on different aspects, such as security, QoS, energy. The existing solutions proposed in this domain incur substantial overhead and eventually become burden on the network, especially when there are fewer attacks or no attack at all. There is a need that the effectiveness of these routing protocols be analyzed in the presence of Denial of Service (DoS) attacks without any intrusion detection or prevention system. This will enable us to establish and identify the inherently stable routing protocols that are capable to survive longer in the presence of these attacks. This work presents a DoS attack case study to perform theoretical analysis of survivability on node and network level in the presence of DoS attacks. We evaluate the performance of reactive and proactive routing protocols and analyse their survivability. For experimentation, we use NS-2 simulator without detection or prevention capabilities. Results show that proactive protocols perform better in terms of throughput, overhead and packet drop.

• 정보처리학회논문지C
• /
• 제15C권4호
• /
• pp.289-296
• /
• 2008

최근, 무선 메쉬 네트워크에서 라우팅 프로토콜에 대한 연구가 활발히 진행되고 있으며 대표적인 proactive 라우팅 프로토콜인 DSDV (Destination-Sequenced Distance-Vector) 라우팅 프로토콜에서는 홉 수가 주요 라우팅 메트릭으로 사용된다. HMP (Hop-by-Hop) DSDV 및 EHMP (Enhanced HMP) DSDV 라우팅 프로토콜에서는 홉 수 및 한 홉 거리 내에 위치한 노드들의 잉여 대역폭을 고려하여 라우팅을 수행하고 있으나, 단대단 라우팅 관점에서 최적이 아닌 경로로 라우팅을 수행하는 단점이 있다. 본 논문에서는 이러한 단점을 극복하기 위해 홉 수 및 단대단 최소 잉여 대역폭을 고려한 CAMP (Cost-Aware Multi-Path) DSDV 라우팅 프로토콜을 제안한다. NS-2를 이용한 성능 분석을 통해 제안하는 라우팅 프로토콜은 홉 수 및 단대단 최소 잉여 대역폭 정보를 적절히 사용함으로써 처리율 및 패킷 전달율의 측면에서 DSDV, HMP DSDV 및 EHMP DSDV 프로토콜에 비해 더 우수한 성능을 가지며 HMP DSDV 및 EHMP DSDV 프로토콜과 같은 수의 관리 메시지를 가지게 됨을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제6권7호
• /
• pp.1735-1755
• /
• 2012

Wireless sensor networks (WSNs) are becoming increasingly attractive for a variety of applications and have become a hot research area. Routing is a key technology in WSNs and can be coarsely divided into two categories: flat routing and hierarchical routing. In a flat topology, all nodes perform the same task and have the same functionality in the network. In contrast, nodes in a hierarchical topology perform different tasks in WSNs and are typically organized into lots of clusters according to specific requirements or metrics. Owing to a variety of advantages, clustering routing protocols are becoming an active branch of routing technology in WSNs. In this paper, we present an overview on clustering routing algorithms for WSNs with focus on differentiating them according to diverse cluster shapes. We outline the main advantages of clustering and discuss the classification of clustering routing protocols in WSNs. In particular, we systematically analyze the typical clustering routing protocols in WSNs and compare the different approaches based on various metrics. Finally, we conclude the paper with some open questions.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 2005년도 춘계학술대회 논문집
• /
• pp.144-148
• /
• 2005

The sensor network consists of sensor nodes which communicate wirelessly. It requires energy-efficient routing protocols. We measure requirements in routing protocols by using simulation techniques. In this paper, we propose a random routing algorithm and evaluate it by simulation.

• Journal of applied mathematics & informatics
• /
• 제26권1_2호
• /
• pp.235-249
• /
• 2008

On-demand routing protocol in ad hoc network is that establishes a route to a destination node only when it is required by a source node. But, it is necessary to reestablish a new route when an active route breaks down. The reconstruction process establishes another route by flooding messages from the source to the destination, cause not only heavy traffic but also long delays in route discovery. A good method for analyzing performance of protocols is important for deriving better systems. In this paper, we suggest the numerical formulas of a representative on-demand routing protocol AODV, ARMP, and RRAODV to estimate the performance of these routing protocols for analyzing the performance of these protocols. The proposed analytical models are very simple and straightforward. The results of analysis show good agreement with the results of computer simulations.

• 한국인터넷방송통신학회논문지
• /
• 제20권4호
• /
• pp.51-57
• /
• 2020

WSN은 배터리와 같은 제한된 전원을 가진 센서 노드가 무선으로 구성된 네트워크이다. 센서 노드의 배터리가 모두 소모되면 해당 노드는 더는 동작하지 않으며, 일정 이상의 노드가 동작하지 않으면 네트워크는 제 역할을 하지 못하게 된다. 따라서 노드의 에너지 효율을 높여 에너지 소모를 최소화하면 네트워크의 수명을 증가시킬 수 있다. 에너지 효율을 높이기 위한 프로토콜은 다양하게 있으며, 그중 클러스터 방식과 체인 방식의 프로토콜이 있다. 본 논문은 무선 센서 네트워크의 성능 향상을 위해 별도로 연구한 라우팅 프로토콜의 성능 평가를 검토하고자 한다. 비교 기준은 대표적인 계층 라우팅 프로토콜인 LEACH 프로토콜로 선택되었으며, 비교 대상은 CHEF와 FLCFP, LEACH-DFL 라우팅 프로토콜로 퍼지 로직과 함께 고려되었다. 본 논문에서는 성능 비교를 위한 다양한 기준이 제시되었으며, 각 프로토콜의 시뮬레이션을 통해 성능을 비교하였다. CHEF, FLCFP, LEACH-DFL의 성능 비교, LEACH, Puzzy Logic과의 프로토콜 등을 통해 다른 프로토콜의 성능을 비교하기 위한 기준점을 제시하고, 프로토콜의 성능 향상을 위한 추가적인 설계 방법을 제공하는 것을 목적으로 한다.

• 정보처리학회논문지C
• /
• 제13C권6호
• /
• pp.685-690
• /
• 2006

본 논문은 소규모 애드혹 네트워크에서 데이터를 전달함에 있어 유니캐스트 라우팅 프로토콜과 브로드캐스트 라우팅 프로토콜의 성능을 비교 분석한다. 기존의 애드혹 네트워크를 위한 라우팅 프로토콜은 범용의 대규모 네트워크를 위한 프로토콜이며, 홈네트워크와 같은 소규모 네트워크를 위하여 최적화되어 설계되지 않았다. 본 논문은 소규모 애드혹 네트워크 환경에서 기존의 유니캐스트 라우팅 프로토콜과 브로드캐스트 라우팅 프로토콜의 성능을 비교 분석하여 그 결과를 기술한다. 시뮬레이션 결과에 따르면 소규모의 애드혹 네트워크에는 기존의 애드혹 네트워크를 위한 유니캐스트 라우팅 프로토콜보다 브로드캐스트 라우팅 프로토콜이 더 좋은 성능을 보인다. 특히 브로드캐스트 라우팅 프로토콜은 기존의 유니캐스트 라우팅 프로토콜보다 높은 전송률과 낮은 패킷 전송을 위한 지연시간을 보여준다.

• 대한임베디드공학회논문지
• /
• 제1권1호
• /
• pp.8-13
• /
• 2006

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.