Enhanced Ad Hoc On-Demand Distance Vector Routing Protocol For Mobile Ad Hoc Network Internet Connectivity

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration and consists of mobile nodes that use a wireless interface to communicate with each other. These mobile nodes serve as both hosts and routers so they can forward packets on behalf of each other. Hence, the mobile nodes are able to communicate beyond their transmission range by supporting multi hop communication. However, the fact that there is no central infrastructure and that the devices which can move randomly gives rise to various kinds of problems, such as routing and security and quality of service (QoS). In this thesis the problem of routing is considered. An Ad-Hoc network has certain characteristics, which impose new demand on the routing protocol the most important characteristic is the dynamic topology, which is a consequence of node mobility. Nodes can changes position quite frequently, which means that we need a routing protocol that quickly adapts to topology changes. The nodes in ad hoc network can consist of laptops and PDA (Personal Digital Assistants) and are often very limited in resources such as CPU capacity, storage capacity, battery power and bandwidth. This means that routing protocol should try to minimize control traffic, such as period update message. Instead the routing protocol should be reactive, thus only calculate routes upon receiving a specific request. The Internet Engineering Task Force (IEFT) currently has a working group called mobile Ad hoc network (MANET) that is working on routing specification for Ad hoc networks. This thesis evaluates some of the routing protocols such as AODV (Ad hoc on demand Distance vector) and DSR (Dynamic Sources Routing) and DSDV (Destination Sequenced Distance vector) for performance testing and an enhanced implementation of AODV, which is able to detect Internet gateway in the proactive, reactive, and hybrid situation. This evaluation is done by means of simulation using NS-2 developed by University California Berkeley. There are several ad hoc routing protocols, such as AODV, DSR, and DSDV that propose solutions for routing within a mobile ad hoc network. However, since there is an interest in communication between not only mobile devices in an ad hoc network, but also between a mobile device in an ad hoc network and a fixed device in a fixed network (e.g. the Internet), the ad hoc routing protocols need to be modified. In this thesis the ad hoc routing protocol AODV is used and modified to examine the interconnection between a mobile ad hoc network and the Internet. For this purpose Network Simulator 2, NS 2, has been used. Moreover, three proposed approaches for gateway discovery are implemented; propose a forwarding algorithm, and route determination algorithm for default route and host route in MANET are investigated

A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks

This paper presents a thorough survey of recent work addressing energy efficient multicast routing protocols and secure multicast routing protocols in Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which witness the need of energy management and security in ad hoc wireless networks. The objective of a multicast routing protocol for MANETs is to support the propagation of data from a sender to all the receivers of a multicast group while trying to use the available bandwidth efficiently in the presence of frequent topology changes. Multicasting can improve the efficiency of the wireless link when sending multiple copies of messages by exploiting the inherent broadcast property of wireless transmission. Secure multicast routing plays a significant role in MANETs. However, offering energy efficient and secure multicast routing is a difficult and challenging task. In recent years, various multicast routing protocols have been proposed for MANETs. These protocols have distinguishing features and use different mechanismsComment: 15 page

QoS routing in ad-hoc networks using GA and multi-objective optimization

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version

Resilient networking in wireless sensor networks

This report deals with security in wireless sensor networks (WSNs), especially in network layer. Multiple secure routing protocols have been proposed in the literature. However, they often use the cryptography to secure routing functionalities. The cryptography alone is not enough to defend against multiple attacks due to the node compromise. Therefore, we need more algorithmic solutions. In this report, we focus on the behavior of routing protocols to determine which properties make them more resilient to attacks. Our aim is to find some answers to the following questions. Are there any existing protocols, not designed initially for security, but which already contain some inherently resilient properties against attacks under which some portion of the network nodes is compromised? If yes, which specific behaviors are making these protocols more resilient? We propose in this report an overview of security strategies for WSNs in general, including existing attacks and defensive measures. In this report we focus at the network layer in particular, and an analysis of the behavior of four particular routing protocols is provided to determine their inherent resiliency to insider attacks. The protocols considered are: Dynamic Source Routing (DSR), Gradient-Based Routing (GBR), Greedy Forwarding (GF) and Random Walk Routing (RWR)