Mobile Ad Hoc Network ( Manet )

With the increasing dependency on wireless networks, the need for proper reliability analysis for Mobile ad hoc networks (Manets) is also increasing. Failure of Manets in areas like warfare, nuclear reactors, medical equipment and airplanes can lead to catastrophe. Unlike traditional networks, measuring the reliability of Manets is a tedious task as it involves dynamically changing topology. The existing methods for calculating reliability use two terminal analysis as the basis for calculation. It uses the same method used for traditional computer networks to calculate reliability. However, the method is not very efficient when it comes to the wireless networks as they are far different from traditional networks. It is also a time consuming task to identify all the nodes and links in a wireless network as nodes move freely in the network. In This paper, We are going to discuss about NLN(Node-Link-Node) technique which reduces the complexity of analyzing the reliability in Manets.

Application of game theoretic approach to individual nodes distributes the responsibility of security to all the nodes in the network thus reducing the loop holes in the security. The Game Theory approach explored in recent times addressing security issues in MANET focuses mostly on networks having central administration involving only 2 players i.e. attacker and defender. We propose a novel game theoretic approach with multiple players for security in MANETs.

In disconnected MANET, p2p file sharing systems is based on two methods flooding based and advertisement based. First

TBAODV – Attackers aware Secure and Trust Based Ad-hoc On Demand Distance Vector Routing Protocol for MANETs

Abstract— this paper is an involvement in the field of security study on mobile ad-hoc networks. Boundaries of the mobile ad hoc nodes have been considered in order to design a secure Ad hoc routing protocol that thwarts selfish and flooding attacks. We took the base of Ad hoc On Demand Routing Protocol (AODV); the most popular Routing protocol. The significance of the proposed protocol that should make sure security as wanted by providing a broad architecture of Trusted and PES Mechanism based smart Path Routing protocol (TBAODV) based on effective key management, secure neighbor detection, secure routing data’s, finding malicious nodes, and eliminating these nodes from routing table. Our results clearly show that our secured Ad hoc routing protocol increases the throughput and packet delivery ratio while it has a tolerable increase in the routing overhead and average delay. Also, security study proves in details that the proposed protocol is robust enough to thwart all classes of

Wireless Sensor Network Security is one of the top design criteria specifically for applications such as large scale military, robotics and so on. Since the deployment of Wireless Sensor Networks is in hostile environments it is vulnerable to many types of attacks. Node Replication

Security is a more sensitive issue in MANETs than any other networks due to lack of infrastructure and the broadcast nature of the network. While MANETs can be quickly set up as needed, so they also need secure data transfer over the network. We provide encryption and decryption algorithm using Rijndael (AES) block cipher. It helps the message to secure

Published schemes on tolerating node failure can be classified into two categories; provisioned and reactive solutions. Provisioned tolerance relies on the availability of redundant resources that can make up for the lost node(s). However, provisioned solutions for restoring connectivity are not suitable for WSAN since actors are typically more expensive and hard to deploy compared to sensors and thus assuming the presence of many actors is not practical. The second category pursues real-time restoration of severed connectivity. The main idea is to reposition the healthy actors so that a strongly connected inter-actor network topology can be established. For example, DARA [2] replaces the failed node with one of its neighbours. The approach requires every node to maintain 2-hop neighbour information so that the effect of the loss of a node can be assessed, i.e., whether the failed node is highly probable a cut-vertex or not. The candidate among the neighbours of the failed node is picked based on the node degree, distance from the failed node and the nodes ID respectively. The effect of moving a node triggers a cascaded relocation that ripples throughout the network to avoid breaking connectivity in another part in the network. The approach of [5] strives to limit the scope of cascaded relocation through the identification of dominators.

Abstract— Mobile ad hoc networks will appear in environments where the nodes of the networks are absent and have little or no physical protection against tampering. The nodes of mobile ad hoc networks are thus susceptible to compromise. The networks are particularly vulnerable to denial of service (DOS) attacks launched through compromised nodes or intruders. This work proposed a new DOS attack and its defense in ad hoc networks. The new DOS attack, called Ad Hoc Flooding Attack(AHFA), can result in denial of service when used against on-demand routing protocols for mobile ad hoc networks, such as AODV, DSR.

Technology advancement is growing very rapidly one example we can see surrounding us is wireless networks and its related very complex applications such as sensor database network, robotics military and so on. At the starting point following paper represents about the mobile ad hoc network and related basic history. After that research paper explores the problems related with the current technology and major drawbacks. Later paper shows the need of the leader election algorithm and its implementation. At the end it

In ad-hoc wireless network, mobile nodes are connected by wireless links. The network is an autonomous and self-configured. It doesn’t have fixed infrastructure or centralized management. The mobile nodes in network are free to move from one place to another. Each node has transmitter and receiver which is used to send and receives the data and communicates with other nodes which are in their communication range. If any node wants to forward packet to the node which is out of range, co-operation of other nodes required; this is known as multi-hop communication. In multi-hop communication message send and received by various intermediate nodes. The network topology frequently changes due to the mobility of nodes as they move within, move into, or move out of the network. In recent years, the ad-hoc wireless network rapidly increases being used in various applications i.e. military purpose, civilian and commercial uses without the fixed infrastructure and human interference.

Abstract— Mobile Ad hoc Network (MANET) is a special self-describing wireless ad hoc network which consists of more number of nodes that can move randomly and erratically. Because of this infrastructure it enables many kinds of attacks and establish topology-exposure problem. Many of the existing multipath protocols may ignore the topology-exposure problem. In this, we proposed a TOpology-HIding multipath routing Protocol (TOHIP) for preventing attacks in topology-exposure. In TOHIP, the link connection information is hidden in route messages, so that the malicious nodes cannot conclude the network topology. In Route Reply phase, the protocol TOHIP can also be used to establish multiple node-disjoint routes and eliminate the unreliable route before transmitting packets in Route Probe phase. With the help of a newly designed protocol, security was assured and earned better capability of finding routes in MANET. The simulation result shows that TOHIP has given better performance when compared with Ad hoc On-demand Multipath Distance Vector (AOMDV) routing protocol.

Abstract-Vehicular Ad-hoc Networks (VANETs) play main role in the design and development of the Intelligent Transportation Systems (ITS) who improves the road safety and transportation productivity. VANETs include two communication types i.e. Vehicle-to-Vehicle (V2V) and Vehicle-to-Roadside (V2R) communications. One of the most important challenges of this kind of network are the timely, safely and reliable dissemination of messages between vehicular nodes which permits the drivers to take appropriate decisions to improve the road safety. There are many routing protocols for VANETs which can support the reliability and safety for routing. These protocols undergo the several limitations including complexity, lack of scalability, end-to-end delay, routing overheads, etc. To remove these limitations, various bio-inspired methodologies have been proposed for routing among vehicular nodes in an optimized way. Here in this paper, various bio-inspired routing algorithms for the VANET are discussed.

[19] presented a black hole detection scheme. In this method, when the source node receives RREP packets, it generates a new RREQ. RREQ has the highest sequence number and it is unicast through the route which the RREP packet was received. Malicious node generates a RREP with highest sequence number on receiving RREQ. Malicious node sends the fake RREP packet to the source node. Now source identifies the malicious node. This method has very less overhead.

An Ad-hoc network is a wireless network. It uses high frequency radio waves for nodes or device communications which increase mobility but decrease the ranges rather than using communication cables between the nodes. Ad-hoc network consists of no infrastructure and no fixed base station and centralized administrator. So, each node in this network act as router or host for direct communication with each other. Then nodes are freely move from one place to another place and it forms the own topology themself. And each nodes are powered by batteries with a limited energy, wherein each node stops functioning when batteries get sanitations. For energy efficient and maximize lifetime of nodes we introduce techniques aimed to minimize power consumption of all nodes by using multicast routing protocol.