Optimization of MANET Routing Protocol

Mobile Ad hoc Network (MANET) basically, is a collection of mobile hosts incorporating wireless interfaces that forms a transitory autonomous network. They do not base on fixed infrastructure or central administration, rather work on the principle of self-organized interconnections among mobile nodes. Fundamentally, in MANET when nodes come inside the transmission range of neighboring nodes', they can be detected by each other and can communicate directly. However for communication outside this range they have to depend on some other nodes to relay the messages .This is where routing protocols have to play a very important role. Literature for improving the performance of routing protocol is available in abundance. Among these comes, the hierarchical/cluster-based routing protocols that claim to reduce control overheads. Clustering in Mobile Ad hoc Networks (MANETs) has proved to be advantageous compared to the traditional networks. However the highly dynamic and unstable nature of MANETs makes it intricate for the cluster based routing protocols to split a mobile network into clusters and determination of cluster heads for each cluster. Although much previous research has concentrated on cluster-head selection in MANETs, not much effort has been done on the security side of cluster-head selection. This paper emphasize that secure cluster head selection in MANETs has an intense effect on network performance. Specifically, we stress that in ad hoc network where all the participants are self controlled, security is an essential aspect and the effective cluster-head selection can improve network throughput. We propose a secure and effective cluster-head Selection scheme using a cross-layer approach that integrates cluster-head discovery and selection functionality with network ad hoc routing mechanisms and the lower layer drivers built-in the system. Besides, proposed scheme handle the disconnections in ad hoc network due to the effects of topology changes and battery depletion. This scheme allows clients to switch to better cluster-head nodes as network topology changes. Hence, provides better performance to network.

The (MANET) ad-hoc mobile network is an automated, network in which android systems link to wireless devices. Ad hoc word means "for this purpose". In MANET any device can easily move in various directions. MANETs (Mobile Ad Hoc Networks) are the basics of broadband networks. In MANET network user can link and get connected anywhere, anytime through communication. MANET introduces a new co system for communication. MANET does not require a fixed structure relies on unconnected ports for service transportation delivery. The temporary hoc network is not dependent on mobile devices (android phones, laptop, PCs, sensors, etc.) that connect exclusively to wireless connectors. Ad-hoc work on a distributed system to provide the required network performance when there is no fixed structure. In this network, it acts as a standalone network or with many attachment points on mobile networks. This paper provides view on the features, applications of ad hoc networks, characteristics and various attacks and challenges faced by programmers and Users . We analyze MANET security objectives and will outline the features, structure, types and challenges of research and the latest trend analysis presented on Mobile Ad Hoc Network to explore open-ended issues in developing navigation strategies for MANET.

Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the Mobile Ad Hoc Network (MANET). MANET is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. There are two types of MANET, homogeneous and heterogeneous MANET. An architecture has been designed in previous work to model these two types of MANET. Three scenarios have been defined from this architecture: scenario I (communication entirely within MANET, homogeneous MANET), scenario II (communication between MANET and wireless LAN, heterogeneous MANET) and scenario III (communication between MANET with wireless LAN and wired LAN, heterogeneous MANET). MANET has its own routing protocols which can compromised with frequent route exchange, dynamic topology, bandwidth constraint and multi-hop routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET. The aim of this research is to assess the effects of different packet size with the implementation of AODV routing protocols in homogeneous and heterogeneous MANET through the simulation method. The three scenarios above have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned, throughput and packet delivery ratio (PDR). The tests show that the increase of throughput and PDR performance was parallel with the increase of packet size. From the test also, we can conclude that the performance due to the packet size effect in homogeneous MANET is better than in heterogeneous MANET.

It is our great pleasure to welcome you to the 3rd ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN'05), held in conjunction with the 12th ACM Conference on Computer and Communications Security (CCS'05), November 7, 2005, in Alexandria, Virginia.This year we received a total of 39 submissions on various aspects of ad-hoc and sensor network security. The program committee selected 6 as regular papers that cover a variety of topics, including trust establishment in Mobile Ad-Hoc Networks (MANETs), security of vehicular ad-hoc networks, secure group communication, key pre-distribution for sensor networks, jamming attacks against sensor network MAC protocols, and defense against Denial-of-Service (DoS) attacks. This year we continue the tradition of SASN'03 and SASN'04 to encourage the presentation and discussion of work-in-progress on ad-hoc and sensor network security. Among the 39 submissions, the program committee selected 7 papers to present in work-in-progress sessions, covering topics on anonymous routing for MANETs, key distribution for inter-group multicast in ad-hoc networks, improved topology assumptions for threshold cryptography in MANETs, RFID security, tracing in mobile wireless sensor networks, time synchronization attacks in sensor networks, and coordinated deployment for improving secure communications and sensing coverage in wireless sensor networks. In addition, the program includes a panel on Advances in Sensor and Ad-hoc Network Security and an invited keynote talk by Radha Poovandran (University of Washington) on Information Assurance in MANETs and Wireless Sensor Networks. We hope that these proceedings will serve as a valuable reference for security researchers and developers.

Mobile Ad hoc Networks (MANETs) have witnessed an increasing amount of interest during the last decade. Hosts (or nodes) within the network are mobile, and each node is equipped with a short range transmitter and receiver, antenna, and local power supply. Nodes then operate as a router to relay messages from the sender to the receiver, and they can be organised into different topologies; for example: they can be flat or hierarchical, they can move in any direction and speed, and they can communicate with each other through wireless routing protocols. More recently, systems based on Ultra-WideBand (UWB) technology have become a promising candidate in application to MANETs. This is mainly due to their powerful capabilities, such as their high data rates and low power consumption, and although many routing protocols have been designed for ad-hoc networks, few have considered their application to UWB based MANETs. This paper presents a review of different types of wireless routing protocols for MANETs with a concluding emphasis on their application to UWB based systems.

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

Ad Hoc Routing with Distributed Ordered Sequences

The year 2005 witnesses the third occasion that the Wireless Personal Area and Ad-hoc Networks minitrack is part of the annual HICSS conference. This year there was a substantial increase in submissions (thus a substantial decrease in the acceptance rate), indicating the growing importance of research in this area. The minitrack is also focused on fundamental challenges and issues arising in wireless sensor networks and their applications. Wireless sensor networks differ from other wireless networks in the need for unattended and very low-energy operation, in the possibility of collaboration and distributed sensor calibration, and in the mission oriented nature of most sensor networks. Thus our mini track looks at two very important streams of research. After a strict review process nine papers were selected to be included in the program of the minitrack. The first paper is titled “BT-Crowds: Crowds-style Anonymity with Bluetooth and Java,” presenting an interesting idea on how anonymity can be achieved when sending messages in WPAN environments. Our second paper revisits scatternet formation issues of Bluetooth based ad hoc networks thus the title: “A Dynamic and Distributed Scatternet Formation Protocol for Real-life Bluetooth Scatternets.” The third paper is titled “Secure Dynamic Source Routing” and presents a new variant of the DSR routing protocol with special emphasis on security. In the fourth paper, the discussion concerns “Routing Based Feedback towards Applications in Mobile Ad Hoc Networks,” where routing notifications are relayed via event channels. “A Location Service Mechanism for Position-Based Multicasting in Wireless Mobile Ad hoc Networks” is the title of the fifth paper in the minitrack. It presents some innovative ideas on how location information can be managed for multicast communications in ad-hoc networks. In the sixth paper, “Sliding Window Protocol for Secure Group Communication in Ad Hoc Networks,” the authors propose a sliding window protocol for determining multiple routes in a multi-communications environment. In the seventh paper titled “Ad Hoc Routing Protocol Avoiding Route Breaks Based on AODV,” the authors propose improvements to the well-known AODV ad hoc routing protocol The eight paper, “Joint Scheduling and Routing Algorithm for Ad Hoc Wireless,” presents an innovative and interesting idea wrapped around an iterative algorithm on power control. In the final paper of the minitrack, “Performance Issues of Ad Hoc Routing Protocols in a Network Scenario used for VideoPhone Applications,” the authors present a simulation based performance analysis of different ad hoc routing protocols using the application pointed to in the title. These papers highlight some of the issues and work towards solutions in Personal Area and ad hoc networks which are among the most active research fields in wireless networking. We believe that the papers will provide opportunities for researchers to come together and discuss and debate the results of the interesting experiments that are described in the papers. We are confident that the minitrack will achieve its goal of bringing together leading researchers, to present new results and discuss synergies between the two areas. We also take this opportunity to thank all the reviewers for their valuable and professional work as well as all the authors who submitted papers and thus helped us to create such a strong minitrack. We would also like to express our sincere gratitude to the conference organizers for their hard work and help.

Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show the appropriate routing protocol for two kinds of communication services (data and voice).

Power control algorithms for mobile ad hoc networks

Mobile Ad Hoc Network (MANET) is a dynamic network without fixed infrastructure due to their wireless nature and can be deployed as multi-hop packet networks. It is a wireless network and has dynamic topology due to its node mobility. Networks are being used in various areas and the demand of users nowadays has motivated the emergence of the heterogeneous MANET. Compared to homogeneous MANET, heterogeneous MANET is more open to other types of network for example wireless LAN, cellular network and fixed network. In MANET, the concern is more to configuration and one of the important elements in configuration is routing. Ad hoc On Demand Distance Vector (AODV) is one of the routing protocols in MANET which can compromise with MANET characteristics. The aim of this research is to assess the performance of AODV in different mobility speed for homogeneous MANET and heterogeneous MANET through the simulation method. The simulation scenarios derived from the HetMAN architecture (as been discussed in previous work) have been developed in the OMNeT++ network simulator. The results achieved from the test have been evaluated using the metrics assigned; throughput and packet delivery ratio (PDR). The tests show that, as the speed increase, the throughput and PDR decrease for both homogeneous and heterogeneous MANET. From the test also, we can conclude that the performance in homogeneous MANET is better than in heterogeneous MANET.

Now a days, mobile users like to use their own consumer electronic devices anywhere and at anytime to access multimedia data. Consumer electronic devices have evolved depending on user needs. Users want to use compact and portable devices such as cellular phones, laptop computers, Personal Digital Assistants (PDAs), etc. anywhere and at anytime to download multimedia data or to access realtime traffic. The mobile Ad Hoc networks have several salient characteristics, such as Dynamic topologies, Bandwidth-constrained, Variable capacity links, Energy-constrained operation and Limited physical security. Due to these features, mobile Ad Hoc networks are particularly vulnerable to denial of service attacks launched through compromised node. The communication in mobile AdHoc networks comprises of two phases, the route discovery and the data transmission. In a hostile environment, adversarial nodes can try to disrupt communication in both the two phases. However, consumer electronic devices generally operate on limited battery power and therefore are vulnerable to security threats like data flooding attacks. Flooding attack is a novel and powerful attack against on-demand Ad Hoc routing protocols. At present, FAP (Flooding Attack Prevention) is the single scheme proposed to resist such attack. But it may not give quality of service. In this paper, we present a Period Based Defense mechanism against data flooding attack in wireless AdHoc network. This is the new technique to defend the flooding attack. This scheme is based on the periods and uses a blacklist to efficiently prevent the data flooding attack. The main aim of this paper is to enhance the throughput of burst traffic. As a result of which, many data packets are forwarded at a high rate for the whole duration. The simulation results show that the proposed scheme enhances the throughput of burst traffic.

A stable and reliable routing mechanism for vehicular ad hoc networks (VANETs) is an important step toward the provision of long data transmission applications, such as file sharing and music download. Traditional mobile ad hoc network (MANET) routing protocols are not suitable for VANET because the mobility model and environment of VANET are different from those of traditional MANET. To solve this problem, we proposed a new stable routing algorithm, called stable directional forward routing. The novelty of the proposed routing protocol is its combining direction broadcast and path duration prediction into ad hoc on-demand distance vector routing protocols, which including: (1) Nodes in VANET are grouped based on the position, only nodes in a given direction range participating in the route discovery process to reduce the frequency of flood requests, (2) Route selection is based on the link duration while not the hops or other metrics to increase the path duration, (3) Route discovery is executed before the path expiration in order to decrease the end to end delay. The performance of the new scheme is evaluated through extensive simulations with Qualnet. Simulation results indicate the benefits of the proposed routing strategy in terms of decreasing routing control packet, reducing the number of link-breakage events, improving the packet delivery ratio and decreasing the end-to-end delay.

Wireless ad-hoc networks have many different characteristics from previous centralized networks. While the infrastructure based networks usually employ the simple routing protocol because every node can reach the coordinator in a single hop, some specific situations, i.e., unplanned dynamic links and multi hop environment, were required in ad-hoc networks. In mobile ad-hoc network, all nodes engaging in communication under the ad-hoc networks should be operated as a router. For this, two routing approaches are previously designed for ad-hoc networks; proactive and reactive routing, and they differently have pros and cons from each other. Moreover, to integrate their advantages in case by case, hybrid approach is consistently researched, and Zone Routing Protocol (ZRP) was motivating many recent hybrid protocols. In ZRP, a node uses proactive routing if it is located within the zone defined by the specific number of hops, but it uses reactive routing in otherwise case. However, ZRP always forms the proactive zone considering only the number of hops, regardless of whether real data communication occurred frequently or not. In this paper, we propose a new routing scheme called Traffic Aware Dynamic Zone Routing (TA-DZR) protocol which employs the zone method but forms customized zone using traffic load, by a new decision method named Dynamic Zone Decision (DZD). The DZD selects nodes that are good to use proactive routing based on the traffic load and forms the proactive zone with them. By considering traffic awareness, TA-DZR can decrease the number of transmissions and can reduce the total energy consumption. After the description of TA-DZR, the performance is demonstrated with simulation results which show that the number of transmissions decreases in overall network, and that the energy consumption is also reduced. Additionally, we validate that the end-to-end delivery delay is reduced and that the packet delivery ratio is improved. These enhancements are caused by reducing overall network congestion.

With the current increase in ad-hoc mobile networks in public domains (e.g. airports, cities, etc.), and the widespread use of IEEE 802.11 wireless LAN, there is a growing need to handle and manage fast mobility. Extending the coverage area of ad-hoc networks and taking into account fast mobility in routing protocols could offer a complementary solution to the UMTS for fourth generation (4G) mobile networks. In this paper we present an extension of the optimized link state routing protocol (OLSR), denoted Fast-OLSR, which is designed to meet the need for fast mobility in mobile ad-hoc networks (MANETs). Performance evaluation of Fast-OLSR is done by simulation, and the results show that the loss rate can be minimized while maintaining a reasonable overhead traffic.