The Concept of Ad-hoc Networking

A group of wireless sensor nodes (devices) dynamically constructs a temporary network without the exercise of any pre-existing network infrastructure or centralized administration. The main goal of ad-hoc networking is multihop broadcasting in which packets are transferred from source node to destination node through the intermediate nodes (hops). The main function of multi hop WSN is to enable communication between two terminal devices through a bit of middle nodes, which are transferring information from one level to another level. On the foundation of network connectivity, it dynamically gets to determine that which nodes should get included in routing, each node involved in routing transmit the data to further

Unfortunately, it is a big overhead to maintain routing tables in the mobile ad hoc network

The Mobile ad hoc networks is one of the emerging technologies today. The instability of the nodes in a mobile ad hoc network makes it difficult to calculate the reliability of the network. When a node moves freely move in a

The Wireless Routing Protocol (WRP) is a table-based distance-vector routing protocol. Each node in the network maintains a Distance table (DT), a Link-Cost table, a Routing table and a Message Retransmission list. The DT contains the network observation of the neighbours of a node. It contains a matrix where each element contains the distance and the one

Reactive routing protocols were designed to reduce the overheads by maintaining information for active routes at each node [8]. This means that each node determined and maintained routes only, when it requires sending data to a particular destination. It using two main mechanisms for route establishment: Route discovery and Route maintenance [17, 25]. Route discovery mechanism uses two messages: Route Request (RREQ) and Route Reply (RREP).

the shortest path to a destination. Believing these false route replies, source transmits data packets to the malicious node. The malicious node captures the data packets and drops them instead of transmitting them to destination.

The main objective of this paper is to propose an on demand QoS routing algorithm. Since the requirements for various applications may vary time to time, the approach for QoS routing may not be proactive. The proposed approach has two phases namely route discovery phase and route maintenance phase. When a source node has to pass data to a destination node with QoS requirements it starts with the route discovery phase. Once the route is found, the data transfer will take place. While data transmission is going on, it is also required to maintain the path to the destination. This is very much desirable and required in mobile ad hoc networks and hence is done in the route maintenance phase.

The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile networks. AODV is capable of both unicast and multicast routing. It is an on demand algorithm, meaning that it builds routes between nodes only as desired by source nodes. It maintains these routes as long as they are needed by the sources. Additionally, AODV forms trees which connect multicast group members. The trees are composed of the group members and the nodes needed to connect the members. AODV uses sequence numbers to ensure the freshness of routes. It is loop-free, self-starting, and scales to large numbers of mobile nodes.

An important issue for mobile ad hoc network is the routing protocol design. Due to frequent changes in the topology of the network this becomes a major technical challenge. Node failures and link breakages in the network may cause loss of the network resources. In signal strength based AODV, protocol measures signal strength between nodes and compare with RSSI threshold values. If it is greater than threshold value then it is accepted for further processing otherwise it is discarded. If it will not find any route between source and destination then it will switch to normal AODV which selects route on the basis of minimum hop count. The benefit of this scheme is by selecting a strong route to the destination we can increase the lifetime of the network.

In the current years, there has been developing enthusiasm for Mobile Ad Hoc Network (MANET) as a methods for giving moment systems administration to a gathering of portable nodes which may not be inside the transmission scope of each other. In MANET, portable nodes speak with each other in a multi-bounce mold. That is the reason the accessibility of every portable node is similarly imperative for the correct operation of the entire system. The disappointment of a Single portable node can significantly influence the general execution of the system. Since every portable node has an extremely constrained battery life, one of the significant reasons of node disappointment is the battery fatigue. It has been demonstrated that even under the

Mobile ad hoc network (MANTE) is a group of wireless mobile computers (nodes) in where they help each other to forward packets when out of range of direct wireless transmission. When out of range could mean constantly moving, no base station infrastructure or infrastructure destroyed. Ad hoc networks can effortlessly and inexpensively be established. Ad hoc network can be easily set up due to the fact it doesn’t require a centralized administrator and doesn’t require a fixed network infrastructure (base station/ access point). With the creation of Ad hoc networks came the problem of secure routing protocols for this type of network.

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.

Performance metrics are measured which shows that packet loss is less than AODV. Packet Loss increases as mobility increases. In route discovery process, an intermediate node will try to create a route and this route should not contain a node whose legitimacy ratio lesser the lower threshold level.

Mobile ad hoc network (MANET) falls in the category of wireless ad hoc network, and is a self-configuring network. Each device is free to move independently in any direction, and hence will change its link with other devices

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 Geographic 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 Secured PPEM Mechanism based Multi-Hop Strong Path Geographic Routing protocol (SMHSP) 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 Geographic 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