Technical Report a Robust Approach towards Secure Neighbor Discovery for Wireless Ad Hoc Networks

نویسندگان

  • SOMAYEH TAHERI
  • DIETER HOGREFE
  • Somayeh Taheri
  • Dieter Hogrefe
چکیده

Secure neighbor discovery is an important element in wireless networking. Several important network functionalities such as routing and localization basically rely on correct neighbor discovery which is the problem concerned in this work. A wormhole attacker can easily tunnel and replay packets from one area of the wireless network to another one, to make the nodes in such typically far awar areas to believe to be neighbors, even if every messages are perfectly encrypted. In this paper we propose Robust Secure Neighbor Discovery (RSND) protocol to prevent such attacks in neighbor discovery phase. RSND is a distributed protocol which is able to localize the wormhole affected links among a node’s links to its neighbors. We use MDS in combination with robust statistics to provide robustness in neighbor discovery phase at a node. Keywords-Neighbor discovery; Security; Multi-dimensional scaling; Robust statistics; Ad hoc networks;

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secure neighbor discovery and wormhole localization in mobile ad hoc networks

Neighbor discovery is an important part of many protocols for wireless adhoc networks, including localization and routing. When neighbor discovery fails, communications and protocols performance deteriorate. In networks affected by relay attacks, also known as wormholes, the failure may be more subtle. The wormhole may selectively deny or degrade communications. In this article we present Mobil...

متن کامل

A Secure Global State Routing for Mobile Ad Hoc Networks

This paper presents a secure routing protocol for wireless ad hoc networks Secure Global State Routing Protocol (SGSR). SGSR defines some rules to ensure that nodes can discover neighbor nodes safely and defines priority of neighbor nodes to defend routing against denial of service attacks. It also provides an algorithm to ensure that a packet can’t travel more than certain hops. It is capable ...

متن کامل

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Efficient Neighbor Discovery in Wireless Ad Hoc Networks

Neighbor Discovery (ND) is an important pre-requisite for a typical Wireless Ad-hoc Network for achieving self-organization and multi-hop communications which subsequently affect routing, MAC and topology control protocols. Reliability, Resource Efficiency and Responsiveness could be termed as important performance parameters for a typical Neighbor Discovery protocols. This paper attempts to re...

متن کامل

IPv6 Autoconfiguration in Large Scale Mobile Ad-Hoc Networks

Mobile ad-hoc networks are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is impractical. The Internet Protocol IPv6 defines mechanisms to autoconfigure interfaces of nodes in wired networks in a distributed manner. In this paper, the applicability of IPv6 Stateless Address Autoconfiguration and IPv6 Neighbor Discovery Protocol t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012