MANETs

Transmission control protocol is a connection oriented and reliable transport layer protocol. Initially TCP was mainly used for in wired networks but due to its efficiency was adopted initially for wireless and subsequently for Ad-Hoc Networks as well. Since TCP was originally designed to be meant for Wired Networks, it faced severe performance degradation when deployed in the wireless world. The reason for those performance failures included causes and effects such as route failures, channel losses and channel contention issues. This review is all about TCP working process with challenges of deploying TCP over wireless ad-hoc networks such as route failure and network partition, hidden and visible node problem, cross layer technique and improved inter layer communication. Finally, based on deriving best practices from the past works, authors have recommended for their own improvisation that is expected to address these limitations.

 Abstract: Reuse of existing deteriorated bituminous pavement material in construction and maintenance of flexible pavement is called recycling of bituminous pavement. Removed and reprocessed deteriorated pavement material which is recycled is termed as Reclaimed asphalt pavement (RAP). In India during construction of flexible pavement different types of bituminous layers are in practice depending upon CBR of sub-grade and traffic count i.e. CVPD of the road stretch. Depending upon types of bituminous layer i.e. PC Seal Coat, Bituminous Macadam(BM), Dense grade bituminous Macadam (DBM), Semi Dense Bituminous Concrete (SDBC) or Bituminous Concrete(BC) Reclaimed Asphalt Pavement can classified in different groups These classified RAP groups materials will have different characteristics i.e. Rap aggregates and Recovered bitumen of different group of RAP will have different characteristics. In this study characterization of RAP limited to Aggregate Impact Value (AIV) and Aggregate Abra...

Lately, the concept of VANETs (Vehicular Ad hoc Networks) has gotten a huge attention as more wireless communication technologies becoming available. Such networkis expected to be one of the most valuable technology for improving efficiency and safety of the future transportation. Vehicular networks are characterized by high mobility nodes which pose many communication challenging problems. In vehicular networks, routing Collision Avoidance Messages (CAMs) among vehicles is a key communication problem.Failure in routing CAMs to their intended destination within the time constraint can render these messages useless. Many
routing protocols have been adapted for VANETs, such as DSDV (Destination Sequenced Distance Vector), AODV (Ad-hoc On demand Distance Vector), and DSR (Dynamic Source Routing). This work compares the performance of those routing protocols at different driving environments and scenarios created by using the mobility generator (VanetMobiSim) and network simulator(NS2). The obtained results at different vehicular densities, speeds, road obstacles, lanes, traffic lights, and transmission ranges showed that on average AODV protocol outperforms DSR and DSDV protocols in packet delivery ratio and end-toend delay. However,
at certain circumstances (e.g., at shorter transmission ranges) DSR tends to have better performance than AODV and DSDV protocols.

Information-Centric Networking (ICN) is a promising architecture for the future Internet that focuses on content rather
than IP addresses. By leveraging named-data instead of named-hosts, ICN does not need the set up and maintenance
of stable paths between end-nodes. This makes ICN particularly convenient in networks characterized by intermittent
connectivity and hostile propagation conditions, such as wireless multihop networks like ad hoc and mesh networks.
In this paper, we present an information-centric architecture for IEEE 802.11 wireless ad hoc networks, named
E-CHANET, which performs routing, forwarding and reliable transport functions, specifically tailored to cope with
the limitations and requirements of wireless distributed environments. E-CHANET performance is evaluated through
simulations and a comparison with the legacy TCP/IP architecture and the basic CCN model is provided. Achieved
results demonstrate the effectiveness of the proposed solution in mobile wireless environments.

NS2 IEEE Project Titles 2017 | 2018 Network Simulator IEEE Projects
2017 - 2018 NETWORK SIMULATOR - NS2 IEEE FINAL YEAR Projects
MANET (Mobile Ad-hoc Networks)
A Delay-Sensitive Multicast Protocol for Network Capacity Enhancement in Multirate MANETs
A Novel Approach for Efficient Usage of Intrusion Detection System in Mobile Ad Hoc Networks
Contradiction Based Gray-Hole Attack Minimization for Ad-Hoc Networks
Delay Analytical Models for Opportunistic Routing in Wireless Ad Hoc Networks
Energy Efficient Multipath Routing Protocol for Mobile ad-hoc Network Using the Fitness Function
Fine-Grained Analysis of Packet Loss in MANETs
SUPERMAN: Security Using Pre-Existing Routing for Mobile Ad hoc Networks
WSN – Wireless Sensor Networks (Routing)
A Distributed Delay-Efficient Data Aggregation Scheduling for Duty-cycled WSNs
A Joint Routing and MAC Protocol for Transmission Delay Reduction in Many-to-One Communication Paradigm for Wireless Sensor Networks
A Self-Adaptive Sleep/Wake-Up Scheduling Approach for Wireless Sensor Networks
E2HRC: An Energy-Efficient Heterogeneous Ring Clustering Routing Protocol for Wireless Sensor Networks
Energy Efficient Clustering Algorithm for Multi-Hop Wireless Sensor Network Using Type-2 Fuzzy Logic
Load Balanced Coverage with Graded Node Deployment in Wireless Sensor Networks
Load-Balanced Opportunistic Routing for Duty-Cycled Wireless Sensor Networks
Low-Cost Collaborative Mobile Charging for Large-Scale Wireless Sensor Networks
Near Optimal Data Gathering in Rechargeable Sensor Networks with a Mobile Sink
Optimal Privacy-Preserving Probabilistic Routing for Wireless Networks
Optimization of Watchdog Selection in Wireless Sensor Networks
QoS-Aware and Heterogeneously Clustered Routing Protocol for Wireless Sensor Networks
Routing Protocol for Wireless sensor networks Using Swarm intelligence-ACO with ECPSOA
SEND: A Situation-Aware Emergency Navigation Algorithm with Sensor Networks
Speed Up-Greedy Perimeter Stateless Routing Protocol for Wireless Sensor Networks (SU-GPSR)
WSN – Wireless Sensor Networks (Security)
A Key Distribution Scheme for Mobile Wireless Sensor Networks: q-s-composite
A Novel Authentication and Key Agreement Scheme for Implantable Medical Devices Deployment
A Secure and Efficient ID-Based Aggregate Signature Scheme for Wireless Sensor Networks
Intrusion Detection Based on State Context and Hierarchical Trust in Wireless Sensor Networks
Lightweight Three-factor Authentication and Key Agreement Protocol for Internet-integrated Wireless Sensor Networks
Location-Based Key Management Strong Against Insider Threats in Wireless Sensor Networks
Research on Trust Sensing based Secure Routing Mechanism for Wireless Sensor Network
Resilience of DoS Attacks in Designing Anonymous User Authentication Protocol for Wireless Sensor Networks
ROSE: Robustness Strategy for Scale-Free Wireless Sensor Networks
Traffic Decorrelation Techniques for Countering a Global Eavesdropper in WSNs
TruFiX: A Configurable Trust-based Cross-Layer Protocol for Wireless Sensor Networks
VANET – Vehicular Ad-hoc Networks (Routing)
Adaptive Quality of Service based Routing for Vehicular Ad hoc Networks with Ant Colony Optimization
CBS: Community-based Bus System as Routing Backbone for Vehicular Ad Hoc Networks
DIVERT: A Distributed Vehicular Traffic Re-routing System for Congestion Avoidance
EcoTrec—A Novel VANET-Based Approach to Reducing Vehicle Emissions
Enhancing Quality of Service Conditions Using a Cross-Layer Paradigm for Ad-hoc Vehicular Communication
MoZo: A Moving Zone Based Routing Protocol Using Pure V2V Communication in VANETs
Trustworthiness Evaluation-based Routing Protocol for Incompletely Predictable Vehicular Ad hoc Networks
VANET – Vehicular Ad-hoc Networks (Security)
Distributed Aggregate Privacy-Preserving Authentication in VANETs
EAAP: Efficient Anonymous Authentication With Conditional Privacy-Preserving Scheme for Vehicular Ad Hoc Networks
Efficient Privacy-Preserving Dual Authentication and Key Agreement Scheme for Secure V2V Communications in an IoV Paradigm
Enhancing Security and Privacy for Identity-based Batch Verification Scheme in VANET
GDVAN: A New Greedy Behavior Attack Detection Algorithm For VANETs
REPLACE: A Reliable Trust-based Platoon Service Recommendation Scheme in VANET
WIRELESS COMMUNICATIONS & OTHERS
Congestion Control Scheme Performance Analysis Based on Nonlinear RED
Distributed Learning for Energy-Efficient Resource Management in Self-Organizing Heterogeneous Networks
End-to-end Throughput Maximization for Underlay Multi-hop Cognitive Radio Networks with RF Energy Harvesting
Robotic Message Ferrying for Wireless Networks using Coarse-Grained Backpressure Control
Spectrum-Availability based Routing for Cognitive Sensor Networks
Towards Effective Trust-based Packet Filtering in Collaborative Network Environments
Virtual Multipath Attack and Defense for Location Distinction in Wireless Networks

In mobile ad hoc networks (MANETs), links are created and destroyed in an unpredictable way, which makes quite challenging the determination of routes between each pair of nodes. In this paper, we propose a formulation of the routing problem in multi-services MANETs, as well as the implementation of an adaptation of the dynamic source routing (DSR) protocol.

Unlike conventional infrastructure based wireless networks such as, wireless cellular networks, Mobile Ad Hoc Networks (MANET) contains rapidly deployable, self organizing and self maintaining capability features. Moreover, they can be formed on the fly as needed. More concerns for MANET’s security arise due to its high popularity to its users. Now-a days, more interests are given in Public Key Cryptography (PKC) rather than Secret Key Cryptography because of its strong security. However, in the context of wireless communication, although PKC offers robust solutions for many security problems, the excessive amount of required computational resources remarkably limit the usage of PKC.

Using Elliptic Curve Cryptography (ECC) offers higher strength per key bit in comparison with other PKCs. The computational power needed to break 1024 bit RSA is equal to the computational power needed to break 163 bit ECC. Unlike the ordinary Discrete Logarithm Problem (DLP) and the Integer Factorization Problem (IFP) for PKCs, no sub exponential-time algorithm is known for the Elliptic Curve Discrete Logarithm Problem (ECDLP). For this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves rather than existing RSA or El-Gamal PKC.

This thesis paper gives an introduction to ECC, how it is used in the implementation of Digital Signature Algorithms (ECDSA) and provides a novel security framework based on ECC and ECDSA for MANET. In the proposed framework, namely Optimized Pretty Good Privacy (OPGP), a composition of ECC and ECDSA is introduced for enhancing security. In OPGP, the authentication, non repudiation, integrity of information is provided by ECDSA and confidentiality is provided by using ECC. The optimized ECC and ECDSA succeed to provide same security level of existing RSA, by performing relatively lower computations.

AIRCC's International Journal of Computer Network & Communications( IJCNC) is dedicated to strengthen the field of Computer Networks and Communications and publishes only good quality papers. IJCNC is highly selective and maintains less than 5% acceptance rate. All accepted papers will be tested for plagiarism manually as well as by Docoloc. Papers published in IJCNC has received enormous citations and has been regarded as one of the best Journal in the networking research field.

Mobile Ad hoc Networks(MANETs) consists of mobile nodes that are interconnected by wireless network interfaces to create a temporary network, each node among the MANET works as a host as well as a router while receiving data nodes help other nodes to forward packets. The wireless nature of the communication makes these networks susceptible to various kinds of security threats. Since these networks lack any central authority, so any intruder can steal the information from the network. Black hole is one such attack which intends to claim shortest path to the destination and then drops the data packets received by it. This paper presents the technique to detect the black hole attack but also in an energy efficient way. The proposed scheme has been compared on the basis of the remaining energy, throughput as well as packet delivery ratio. These parameters have showed an improvement over the existing scheme.

MANET is infrastructure-less, lacks centralized monitoring and has dynamic changing network topology. The high usage of MANET demands more security and confidentiality and integrity of the data communicated through network. Security has turned out to be a major concern so as to provide non-endangered communication between mobile nodes in an unfriendly environment of MANET, which poses a number of trivial challenges to security design. The wormhole attack is one of the most threatening and hazardous attacks. In this paper we have classified the well-known countermeasures against wormhole attack in the network according to detection and prevention techniques based on hop counts and delay, protocol modification, trust and reputation. The projected technique to be used for detection of wormhole attack using trust based mechanism, neighbor monitoring concept and credits based mechanism will help to detect and isolate the malicious nodes hence enabling the formation of trusted network.

ABSTRACT: Ad-hoc network can be defined as a collection of mobile nodes which makes a temporary
network secure routing in the field of MANET is one of the most emerging areas of research. Blackhole
attack is one of the well-known security threats in wireless MANETS. Blackhole attack[1] in MANETS is
an attack mainly occurs due to the malicious node, which attacks the data packets from the source node by
falsely advertising that it is nearest path to the destination node. This paper gives the analysis of black hole
attacks in MANET’s.
IndexTerms: MANETS, Attacks in MANETs, Blackhole attacks, Blackhole attack in MANETS.

—Mobile Ad-hoc Network (MANET) represents a system of mobile nodes that can self-organize freely and connect themselves by wireless links deprived of a common infrastructure. MANET routing protocols can be categorized into reactive, proactive and hybrid routing protocols. Recently, numerous researchers have conducted studies that compare performance of routing protocols that fall in these categories under varying conditions and constraints. However, most of the studies have concentrated on the comparison between reactive and proactive routing protocols. This study is subjected to performance comparison between reactive routing protocols (represented by Ad-hoc On-demand Distance Vector-AODV) and hybrid routing protocols (represented by AntHocNet) under four different mobility models. The metrics used are Packet Delivery Ratio (PDR) and End-to-End Delay (EED) under ns-2 simulation environment. The study found that AntHocNet provides better PDR and is more fault tolerant than the traditional single path AODV. The study suggests that, apart from the pheromone values, other quality of service matrices viz. energy, queuing delay, and mobility can be tested in future studies.

Mobile Ad Hoc Networks (MANETs) are more vulnerable to different attacks. Prevention methods as
cryptographic techniques alone are not sufficient to make them secure; therefore, efficient intrusion
detection must be deployed and elaborated to facilitate the identification of attacks. An Intrusion Detection
System (IDS) aims to detect malicious and selfish nodes in a network. The intrusion detection methods used
normally for wired networks can no longer adequate when adapted directly to a wireless ad-hoc network,
so existing techniques of intrusion detection have to be changed and new techniques have to be determined
to work efficiency and effectively in this new network architecture of MANETs. In this paper we give a
survey of different architectures and methods of intrusion detection systems (IDSs) for MANETs
accordingly to the recent literature.

The current communication requirements are moving quickly to mobile ad-hoc networks, mainly because of the decreasing cost of wireless networking technology and the increasing capacity to integrate into embedded devices technologies such as WiFi, ZigBee, Bluetooth, and WAVE. It is important to understand the limitation or the strength of each protocol and standard in order to make a better selection decision at the moment of implementing a specific scenario. This paper evaluates how routing protocols perform in mobile scenarios when the speed of nodes is relatively high. Our research shows that reactive routing protocols have a better packet delivery ratio (PDR) than proactive routing protocols. However, proactive routing protocols have a smaller end-to-end delay and hops count.

 Abstract: Reuse of existing deteriorated bituminous pavement material in construction and maintenance of flexible pavement is called recycling of bituminous pavement. Removed and reprocessed deteriorated pavement material which is recycled is termed as Reclaimed asphalt pavement (RAP). In India during construction of flexible pavement different types of bituminous layers are in practice depending upon CBR of sub-grade and traffic count i.e. CVPD of the road stretch. Depending upon types of bituminous layer i.e. PC Seal Coat, Bituminous Macadam(BM), Dense grade bituminous Macadam (DBM), Semi Dense Bituminous Concrete (SDBC) or Bituminous Concrete(BC) Reclaimed Asphalt Pavement can classified in different groups These classified RAP groups materials will have different characteristics i.e. Rap aggregates and Recovered bitumen of different group of RAP will have different characteristics. In this study characterization of RAP limited to Aggregate Impact Value (AIV) and Aggregate Abra...

Mobile Ad-hoc Network (MANET) is a collection of wireless mobile nodes dynamically forming a temporary network without the aid of any established infrastructure or centralized administration. The mobility of nodes in MANETs results in frequent changes of network topology making routing in MANETs a challenging task. Routing protocols in MANET helps node to send and receive packets. Some studies have been
reported in the literature to evaluate the performance of the proposed routing algorithms. This paper evaluates the performance of reactive (DSR) routing protocols in MANETs based on Average end-to-end delay, Throughput using OPNET 14.5. The performance DSR routing protocols is evaluated with respect to throughput and end-to-end delay under different traffic load using OPNET simulator.

Actual network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable and efficient. Each routing protocol should support small as well as large
scale networks very efficiently. As the number of node increase, it increases the management functionality
of the network. Graph theoretic approach traditionally was applied to networks where nodes are static or
fixed. In this paper, we have applied the graph theoretic routing to MANET where nodes are mobile. Here,
we designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Each cluster supports a few nodes with a cluster head. The intracluster
connectivity amongst the nodes within the cluster is supported by multi-hop connectivity to ensure
handling mobility in such a way that no service disruption can occur. The inter-cluster connectivity is also
achieved by multi-hop connectivity. However, for inter-cluster communications, only cluster heads are
connected. This paper demonstrates graph theoretic approach produces an optimum multi-hop connectivity
path based on cumulative minimum degree that minimizes the contention and scheduling delay end-toend.
It is applied to both intra-cluster communications as well as inter-cluster communications. The
performance shows that having a multi-hop connectivity for intra-cluster communications is more power
efficient compared to broadcast of information with maximum power coverage. We also showed the total
number of required intermediate nodes in the transmission from source to destination. However, dynamic
behavior of the nodes requires greater understanding of the node degree and mobility at each instance of
time in order to maintain end-to-end QoS for multi-service provisioning. Our simulation results show that
the proposed graph theoretic routing approach will reduce the overall delay and improves the physical
layer data frame transmission.

Routing in ad-hoc networks is a big issue and challenge. AODV is most popular on demand routing protocol which is applicable in mostly all wireless ad-hoc networks. We here AODV routing protocol is analysed in wireless ad-hoc networks. Grid based topology has been used. Based on transmission rate and pause times, AODV is evaluated. Several routing parameters like throughput, dropped packets and average delay have been used for evaluation purposes. We have analysed AODV in several aspects at different network scenarios.

n this paper, we have analyzed the effect of node
mobility on theperformance of AOMDV multipath routi
ng
protocol. This routing protocol in ad hoc network
has been analyzed with random way point mobility mo
d-
el only. This is not sufficient to evaluate the beh
avior of a routing protocol. Therefore, in this pap
er, we
have considered Random waypoint, Random Direction a
nd Probabilistic Random Walk mobility Model for
performance analysis of AOMDV protocol. The result
reveals that packet delivery ratio decreases with t
he
increasing node mobility forall mobility models. Al
so, average end-to-end delay is also vary with vary
ing
node speed, initially upto 20 nodes in all mobility
models delay is minimum.

Opportunistic Networks an emerging research area that encompasses Mobile Adhoc Networks (MANETs) and a subset of Delay Tolerant Network (DTNs). In such networks one of the most dynamic and challenging tasks is to detect congestion timely and effectively. Congestion both at link and node level can occur due to Irregular Connectivity, Long and Variable Length Delays, and Heterogeneous Networks Infrastructure. Intermediate nodes between source and destination are seems to be critical for detecting a congestion issue as they have to store data in their respective buffer until a next best forwarding opportunistic node is found. The prime objective of our research is to evaluate different congestion handling techniques that addressed issues of storage/node level congestion in opportunistic networks. Consequently it may help to detect congestion issue at node level in a Pre-active manner rather than pro-active manner.

Mobile Ad hoc Network (MANET) is a distributed, infrastructure-less and decentralized network. A routing protocol in MANET is used to find routes between mobile nodes to facilitate communication within the network. Numerous routing protocols have been proposed for MANET. Those routing protocols are designed to adaptively accommodate for dynamic unpredictable changes in network's topology. The mobile nodes in MANET are often powered by limited batteries and network lifetime relies heavily on the energy consumption of nodes. In consequence, the lack of a mobile node can lead to network partitioning. In this paper we analyse, evaluate and measure the energy efficiency of three prominent MANET routing protocols namely DSR, AODV and OLSR in addition to modified protocols. These routing protocols follow the reactive and the proactive routing schemes. A discussion and comparison highlighting their particular merits and drawbacks are also presented. Evaluation study and simulations are performed using NS-2 and its accompanying tools for analysis and investigation of results.

s: Mobile Adhoc Networks (MANETs) are used most commonly all around the world, because it has the ability to communicate each other without any fixed network. It has the tendency to take decisions on its own that is autonomous state. MANET is generally known for infrastructure less. The bridges in the network are generally known as a base station. In, this paper we simulate GRP routing Protocol, to know the network performance in the MANET.

Nowadays, the importance of Mobile Ad hoc Networks
(MANETs) is growing rapidly especially in military and business applications. It is crucial to have a more efficient initial link setup mechanism. In this work, we propose an efficient initial access authentication protocol, which realizes the authentications and key distribution through least roundtrip messages. We propose efficient initial access authentication mechanism over MANET that is more efficient than any message authentication method in the literature. The key idea behind the proposed method is to
provide efficient initial authentication as well as to provide secure message passing between Mobile user and authentication server. Furthermore, a simple and practical method is presented to make compatible with MANET.

Simulation of mobile networks requires reliable movement generation. Evaluation of the performance of the existing random movement generator used in ns2 shows a bias for placing the mobile nodes in the center of the experimental area. Applying the quadrat count and the VMR tests confirms the tendency for clustering of nodes. To remedy this problem we propose, and implement a different method for random movement generation for use with the ns2 simulator, and show that our movement generator improves the randomness of the node distribution during the simulation.

All networks must provide an acceptable and desirable level of Quality of Service (QoS) to ensure that applications are well supported. This becomes a challenge when it comes to Mobile ad-hoc networks (MANETs). This paper presents a security framework that is QoS-aware in MANETs using a network protocol called Optimized Link State Routing Protocol (OLSR). Security & QoS targets may not necessarily be similar but this framework seeks to bridge the gap for the provision of an optimal functioning MANET. This paper presents the various security challenges, attacks, and goals in MANETs and the existing architectures or mechanisms used to combat security attacks. Additionally, this framework includes a security keying system to ascertain QoS. The keying system is linked to the basic configuration of the protocol OLSR through its Multi-point Relays (MPRs) functionality. The proposed framework is one that optimizes the use of network resources and time.

The MANETs (Mobile Ad Hoc Network) refers to a multi-hop packet based upon wireless
network that does not require any fixed infrastructure. Each node in the network act as the base station
and the packets are forwarded to the required destination. Many kinds of attack can be done on this type of
networks. In this paper we have described a method to detect the wormhole attack and to secure the path of
the packets from these types of attacks using delay per hop method. Wormhole attack is a dangerous attack
occurring in the routing protocols in the network layer. Using hop count method we isolate the node that is
the cause of the wormhole attack in the network. This method neither used the synchronized clocks nor the
special kind of hardware for detecting the wormhole. In this paper will help to pinpoint the malicious node
and to isolate that node from the network. The performance of the network is improved.

In the last years mobile networking via smart phones and mobile telephones is widely realized as an infrastructure based networking. The provider grants an affordable and stable access to the Internet, which can be used by applications in the same way as it is used on stationary computers. However, many mobile devices support a variety of communication interfaces that are suitable for ad-hoc communication. Routing in ad hoc network is a great problematic, since a good routing protocol must ensure fast and efficient packet forwarding, which isn't evident in ad hoc networks. In literature there exists lot of routing protocols however they don't include all the aspects of ad hoc networks as mobility, device and medium constraints which make these protocols not efficient for some configuration and categories of ad hoc networks. Thus in this paper I propose an improvement of Dynamic Source Routing Protocol DSR in order to include some of the aspects of ad hoc networks as mobility and energy by proposing a new metric to evaluate route based on intermediate nodes weight computed by combining the stability and the battery power of nodes to choose the most stable and powered nodes for packet forwarding.

Mobile ad hoc network (MANET) is a self-configuring network that is formed automatically via wireless links by a collection of mobile nodes without the help of a fixed infrastructure or centralized management. The mobile nodes allow communication among the nodes outside the wireless transmission range by hop to hop and the forward packets to each other. Due to dynamic infrastructure-less nature and lack of centralized monitoring points, the ad hoc networks are vulnerable to attacks. The network performance and reliability is break by attacks on ad hoc network routing protocols. AODV is a important on-demand reactive routing protocol for mobile ad hoc networks. There is no any security provision against a " Black Hole " and " Wormhole " attacks in existing AODV protocol. Black hole nodes are those malicious nodes that conform to forward packet to destination. But they do not forward packet intentionally to the destination node. The black hole nodes degrade the performance of network eventually by participating in the network actively. The propose watchdog mechanism detect the black hole nodes in a MANET. This method first detects a black hole attack in the network and then provide a new route to this node. In this, the performance of original AODV and modified AODV in the presence of multiple black hole nodes is find out on the basis of throughput and packet delivery ratio. In a wormhole attack, intruders tunnel the data from one end of the network to the other, leading distant network nodes to trust they are neighbors' and making them communicate through the wormhole link.

Ad-Hoc networks between vehicles are special types of mobile ad-hoc networks. VANET nodes despite MANET networks move too fast. Keeping and staying in a stable and constant route for urgent and alarming messages broadcasting from one danger area, is a very challenging task. Therefore, routing play significant role in VANETs. Network overhead decrease, preventing overcrowd incidence in the network, the traffic jam and increasing package delivery rate are the most important issues related to routing in VANET. Therefore, broadcasting and transmitting threatening alarm messages as accident prevention message and damage incidence, jam controlling messages, messages related to the road conditions and all other threatening alarm messages, on time for the endangered vehicles is of great importance. The main goal of this paper is to study routing protocol based on geographical location, so it needs Global Positioning System (GPS) to obtain vehicle's location and improve decision making for data delivery. On VANET networks, for better routing, we will need network topology information to make decisions to deliver data to the next vehicle, so we can make the best decision. In this Paper, the purpose is to present one greedy routing method and executing it in a scenario as urban area. For this reason, the proposed method creation was by using the vector concept and b y using greedily transmission. which in time of selecting the next step, not only it gives importance to the distance criteria and data routing precision, but also is connected with intersections in urban areas and adds a certain mode for predicting vehicle's behaviour at intersections, which promote the routing protocol efficiency. By using the NS2 simulator, Simulation results of the proposed method, (GRUA), indicate that this method has an efficient performance and improves throughput , Packet drop , Packet delivery ratio and end-to-end delay decrease.

 Abstract: Transmission control protocol faces a problem of packet loss differentiation in the wireless and mobile adhoc network. Congestion control is not properly done here. It cannot manage the congestion window as per type of loss and it reduces Congestion window unnecessarily and that degrades the performance. TCP Westwood cannot identify congestion or link failure loss, and it cannot manage the congestion window as per available bandwidth. This paper discusses that TCP Westwood performs bandwidth estimation, setting up a congestion window and a slow start threshold. In mobile adhoc network, link failure may happen frequently, and it should be handled properly. Link failure can be detected with the help of retransmission timeout. Once timeout occurs Westwood performs congestion avoidance. Proposed Westwood manages three states of congestion 1) Avoidance 2) congestion and 3) No congestion, it updates congestion window and slow start threshold as per the status of network. It maintains congestion window dynamically. Network status is identified by estimated bandwidth and proportionality ratio. Proposed method is tested on NS2.35 and compared with the existing TCP variants. The proposed Westwood performs optimized link utilization and congestion control mechanism. Hence it gives significant performance for loss recovery.