Concentration on Research of MANETS

P2P considers interest of the user and the frequency of nearest neighbours this makes efficient file sharing between user’s. Interest extraction identifies nodes’ interests; Community construction builds community according to the interest of communities. Files are also retrieved on the social network within limited time span. Thus the files can be transferred efficiently between

On Lieskovsky et al\cite{Lieskovsky}, the authors present a solution for data distribution and replication in VANET(Vehicle Ad-hoc Networks) that allows the perception the whole VANET system as a simple distributed database system. However, the

\noindent Several existing studies employ simulations to explore the impact of node selfishness on data delivery performance. The authors in \cite{EffNonCoo-15} explore the impact of the nodes' non-forwarding and partially-forwarding actions on the performance of Epidemic, SnW, and Prophet protocols in terms of the data delivery ratio and delay. The experimental results demonstrate that DTNs tolerate a high percentage of non-cooperative nodes (20-40\% or even 60\%) without too much harm, even though they still utilize the other nodes' resources to deliver their own messages. Meanwhile, synthetic random mobility models are most vulnerable to less cooperation that implies that DTNs are robust against the nodes' non-cooperative behavior.

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.

VANET is an application of MANET but it has its own distinct characteristics which can be summarized as:

Mustapha, et al. [3] investigated the impact of sensing range on the throughput of MANET by taking into consideration two essential issues in MAC they are concurrent transmission, which is referred to spatial reuse, and collision in terms of transmission range persistent probability and back-off time.

Mobile Ad hoc Network”, discussed about a reputation system that relies on neighbors to monitor and identify misbehaving nodes.

Authors in [53], proposed a Location Aware Service Discovery Protocol for MANETs , that employs a data aggregation scheme in intermediate nodes in order to reduce messages replies in these networks. Moreover, it is introduced a service invocation

Mobile is a most commonly used distributed communication device. Our project describes the problem encountered with mobile distributed systems and how it can be solved and implemented for secure P2P communications (Peer-to-Peer communications). The system we have is distributed and based on object oriented architecture, where each node functions as both client and server. Once a network is established between these nodes, it is difficult to refuse an access to anyone who is within stipulated range and can see the network with their adapter. It is a set of distributed systems that communicate via short range wireless technologies. This

Ad hoc networks consist of a set of self-organized of mobile nodes which cooperate using a routing protocol to facilitate the communication. They have become very popular in recent years due to their characteristics: easy deployment, lack of infrastructure, dynamic topology, mobility and minimum commissioning costs.

Ehsan Mostajerani [2] proposed I-AODV. On-Demand Distance Vector (AODV) is one of the ad hoc routing protocols utilized in MANET and VANET. Ad hoc routing protocols are categorized into Table-driven and On-demand. On-Demand routing protocols find their destinations based on the process of flooding a request to neighbors searching for their destinations. Neighbors of nodes are detected based on the neighbor discovery method, which periodically broadcasts HELLO messages to detect available neighbors at time. Generating routing packets and neighbor discovery messages produce high overhead in the On-Demand routing protocol, such as AODV. In order to overcome overhead issues, a novel scheme in Ad hoc networks based on

In MANETs congestion occurs due to the packet loss and it can be successfully reduced by involving congestion control scheme which includes routing algorithm and a flow control at the network layer [1].

Mobile Ad Hoc Network (MANET), is a cluster of independent mobile hosts communicating wirelessly. These nodes do not require any prior remaining infrastructure or any kind of centralized unit to control them. MANET has an active topology which refers to that any node can join or leave the network at any instant of a time without affecting the overall working of the network. Due to these characteristics such as being an open medium, having a dynamic topology, dispersed operations and controlled capabilities it is often vulnerable to attacks.

Abstract—This Paper discusses about the capability of the current MANET routing protocols for VANET. Though VANET is derived from MANET, it

Abstract— An Ad-hoc mobile network is an assembly of wireless transportable nodes devotedly creating a short-lived network lacking the use of any core-existing centralized administration or network infrastructure. MANET have restrictions owed to mobility, infrastructure and capabilities of mobile nodes or due to network system as an entire. Limitations due to system or infrastructure,