Ad-hoc Routing Protocols Research Articles

이동 애드혹 네트워크에서의 부하 균등화 및 공평성 지원 방법

AODV(Ad Hoc On-Demand Distance Vector)나 DSR(Dynamic Source Routing)과 같은 대부분의 에드혹 라우팅 프로토콜은 네트워크 토폴로지가 변하지 않는 한 새로운 경로 설정을 하지 않는다. 따라서 노드의 이동성이 적은 경우, 트래픽은 몇몇 노드에게 집중될 수 있으며 그 결과로 해당 노드들의 혼잡으로 인한 긴 종단간 지연이 발생할 수 있다. 게다가 몇몇 특정 노드들만 오랫동안 계속해서 사용됨에 따라 그들의 배터리가 빠르게 소모될 것이다. 노드의 배터리 방전은 노드 사이의 연결 단절뿐만 아니라 동시에 새로운 경로 설정을 위하여 많은 route re-quest 패킷(RREQ)을 생성시킨다. 본 논문에서는 각 노드가 자신의 트래픽 부하 상태를 기반으로 RREQ 패킷을 무시하거나 패킷 포워딩을 포기할 수 있게 함으로써 트래픽 집중화 문제를 해결할 수 있는 SLA(Simple Load-balancing Approach)를 제안한다. 그러나 어떤 이기적인 노드들은 자신의 에너지를 절약하기 위하여 고의적으로 패킷 포워딩을 거부할 수도 있다. 이러한 노드들을 패킷 포워딩에 참여시키기 위하여 본 논문에서는 PIFA(Protocol-Independent Fairness Algorithm) 보상 방식을 제안하였다. SLA 성능의 우수함을 증명하기 위하여 SLA를 채택한 AODV 방식과 SLA를 채택하지 않은 AODV 방식을 비교 실험하였고, 이를 통하여 SLA를 채택한 방식이 트래픽 부하 분산에 효율적이며 이로 인하여 전체 에드혹 네트워크 성능 또한 향상시킴을 확인하였다. Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

Building the blocks of protocol design and analysis

With the emergence of new application-specific sensor and Ad-hoc networks, increasingly complex and custom protocols will be designed and deployed. We propose a framework to systematically design and evaluate networking protocols based on a 'building block' approach. In this approach, each protocol is broken down into a set of parameterized modules called "building blocks", each having its own specific functionality. The properties of these building blocks and their interaction define the overall behavior of the protocol. In this paper, we aim to identify the major research challenges and questions in the building block approach. By addressing some of those questions, we point out potential directions to analyze and understand the behavior of networking protocols systematically. We discuss two case studies on utilizing the building block approach for analyzing Ad-hoc routing protocols and IP mobility protocols in a systematic manner.

How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols

This paper presents a systematic analysis of insider attacks against mobile ad-hoc routing protocols, using the Ad-hoc On-Demand Distance Vector (AODV) protocol as an example. It identifies a number of attack goals, and then studies how to achieve these goals through misuses of the routing messages. To facilitate the analysis, it classifies insider attacks into two categories: atomic misuses and compound misuses. Atomic misuses are performed by manipulating a single routing message, which cannot be further divided; compound misuses are composed of combinations of atomic misuses and possibly normal uses of the routing protocol. The analysis results in this paper reveal several classes of insider attacks, including route disruption, route invasion, node isolation, and resource consumption. Finally, this paper presents simulation results that validate and demonstrate the impact of these attacks.

How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols*1

This paper presents a systematic analysis of insider attacks against mobile ad-hoc routing protocols, using the Ad-hoc On-Demand Distance Vector (AODV) protocol as an example. It identifies a number of attack goals, and then studies how to achieve these goals through misuses of the routing messages. To facilitate the analysis, it classifies insider attacks into two categories: atomic misuses and compound misuses . Atomic misuses are performed by manipulating a single routing message, which cannot be further divided; compound misuses are composed of combinations of atomic misuses and possibly normal uses of the routing protocol. The analysis results in this paper reveal several classes of insider attacks, including route disruption , route invasion , node isolation , and resource consumption . Finally, this paper presents simulation results that validate and demonstrate the impact of these attacks.

Resource Management for Ad-Hoc Wireless Networks with Cluster Organization

Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. Guaranteeing QoS in this environment is a hard problem because several applications may share the same resources in the network, and mobile ad-hoc wireless networks (MANETs) typically exhibit high variability in network topology and communication quality. In this paper we introduce DYNAMIQUE, a resource management infrastructure for MANETs. We present a resource model for multi-application admission control that optimizes the application admission utility, defined as a combination of the QoS satisfaction ratio. A method based on external adaptation (shrinking QoS for existing applications and later QoS expansion) is introduced as a way to reduce computation complexity by reducing the search space. We designed an application admission protocol that uses a greedy heuristic to improve application utility. For this, the admission control considers network topology information from the routing layer. Specifically, the admission protocol takes benefit from a cluster network organization, as defined by ad-hoc routing protocols such as CBRP and LANMAR. Information on cluster membership and cluster head elections allows the admission protocol to minimize control signaling and to improve application quality by localizing task mapping.

Unmanaged Internet Protocol

Though appropriate for core Internet infrastructure, the Internet Protocol is unsuited to routing within and between emerging ad-hoc edge networks due to its dependence on hierarchical, administratively assigned addresses. Existing ad-hoc routing protocols address the management problem but do not scale to Internet-wide networks. The promise of ubiquitous network computing cannot be fulfilled until we develop an Unmanaged Internet Protocol (UIP), a scalable routing protocol that manages itself automatically. UIP must route within and between constantly changing edge networks potentially containing millions or billions of nodes, and must still function within edge networks disconnected from the main Internet, all without imposing the administrative burden of hierarchical address assignment. Such a protocol appears challenging but feasible. We propose an architecture based on self-certifying, cryptographic node identifies and a routing algorithm adapted from distributed hash tables.

Positionsbasiertes Routing für die Kommunikation zwischen Fahrzeugen (Position-Based Routing for Inter-Vehicle Communication)

Die Möglichkeit mit Hilfe von drahtloser Kommunikation Nachrichten zwischen Fahrzeugen auszutauschen, wird in naher Zukunft das Autofahren sicherer und komfortabler gestalten. Insbesondere das Weiterleiten dieser Nachrichten von einem Sender zu einem oder mehreren Empfängern stellt hierbei eine interessante Herausforderung dar. In diesem Artikel wird ein positionsbasiertes Ad-Hoc Routing Verfahren vorgestellt, welches dieses Problem löst. Dabei arbeiten die Fahrzeuge selbst bei der Weiterleitung von Nachrichten zusammen, so dass keine flächendeckende Infrastruktur notwendig ist. Der vorgeschlagene Ansatz ist daher sowohl kostengünstig als auch robust gegenüber dem Ausfall einzelner Komponenten. Um die Funktionsfähigkeit des positionsbasierten Ad-Hoc Routing Verfahrens nachzuweisen, wurden realitätsnahe Fahrzeugbewegungen erzeugt und als Grundlage für eine Simulationsstudie mit dem Netzwerksimulator ns-2 verwendet. Die Studie belegt, dass auch für die Kommunikation über größere Distanzen und über mehrere Fahrzeuge hinweg sehr gute Zustellraten erreicht werden.