Presented By
A. SATHISH KUMAR

---

[attachment=13161]
ABSTRACT
The project work entitled as “Routing with Security in Mobile Ad Hoc Networks” and designed using Java Swing along with Java Application Programming Interfaces including Microsoft SQL Server as database. Mobile ad hoc networks remove the dependence on a fixed network infrastructure by treating every available node as an intermediate switch, thereby extending the range of nodes well beyond that of their base transceivers. Route Discovery or Creation and Route Maintenance are the two main mechanisms involved. Dynamic Source Routing algorithm concepts are involved here.
In Route Discovery every node maintains a file for identifying its neighbor node and discovers the path between the source and the destination. Once the route is discovered the data is being set along the same path between the source and the destination. In Route Maintenance the path between the source and the destination is maintained, as long as the data is being transferred. Each node attaches its address with the source while transfer between the source and the destination. At the destination, the node receives the entire path that it has taken to reach the destination. During data transfer, the security is employed by implementing the path randomizing which also finds a new path which has not been used for any previous data transfer.
CHAPTER 1
INTRODUCTION
1.1 SYNOPSIS
Mobile ad hoc networks remove this dependence on a fixed network infrastructure by treating every available mobile node as an intermediate switch, thereby extending the range of mobile nodes well beyond that of their base transceivers. Manets are also useful for disaster management. Route Discovery and Route Maintenance are the two main mechanisms involved. Four Manets algorithm concepts are involved here. In Route Discovery every node maintains a file for identifying its neighbor node and discovers the path between the source and the destination. [5] Once the route is discovered the data is being sent along the same path between the source and the destination. In Route Maintenance the path between the source and the destination is maintained, as long as the data is being transferred. Each node attaches its address with the source while transfer between the source and the destination. At the destination, the node receives the entire path that it has taken to reach between the source and the destination.
1.2 MANETS Concept
Suppose that we want to easily and efficiently connect two office floors using short-range wireless communication devices. Every employee has one of these mobile devices, and some fixed devices—computers, printers, and so on—have the same capability. We could connect these devices to the existing wired infrastructure using access points, but this option offers limited mobility, adds load on the wired network, and relies on existing protocols for wired communication. Another possibility is to build a network of dedicated and mutually connected base stations that enable cellular communication, but this is expensive with respect to time, installation, and maintenance.
The best solution is to create a mobile ad hoc network using surrounding electronic devices as intermediate switches when they are idle and if they are capable of performing this task. For example, the packet from one device can hop to the mobile phone of a person passing through the corridor in front of the office, then from the mobile phone to the shared laser printer in the next office, then to someone’s digital wrist watch on the floor below, then from the wristwatch to the coffee machine, and, finally, from the coffee machine to its ultimate destination—say, another colleague’s device or computer. Manets are also useful for disaster management. A communications infrastructure is designed to survive common short-term problems, such as overloading, but not to sustain major physical damage. In most cases, the collapse of a single system will cause many dependent devices to fail. If a fire, earthquake, or other natural catastrophe disables a subset of base stations, every mobile phone within range of those stations automatically becomes unreachable. In such situations, rescue workers can use the nodes in manets to create a network “on the fly.” Small-scale manets are also effective for emergency search and rescue, battlefield surveillance, and other communication applications in hazardous environments.[6] For example, robots or autonomous sensors deployed in an area inaccessible to humans could use simple manet routing protocols to transmit data to a control center. Even if many robots or sensors are disabled or destroyed, the remaining ones would be able to reconfigure and continue transmitting information.
1.3 PROTOCOL DESCRIPTION
1.3.1 DYNAMIC SOURCE ROUTING
DSR1 is a fairly simple algorithm based on the concept of source routing, in which a sending node must provide the sequence of all nodes through which a packet will travel. Each node maintains its own route cache, essentially a routing table, of these addresses. Source nodes determine routes dynamically and only as needed; there are no periodical broadcasts from routers. A source node that wants to send a packet first checks its route cache. If there is a valid entry for the destination, the node sends the packet using that route; if no valid route is available in the route cache, the source node initiates the route discovery process by sending a special route request (RREQ) packet to all neighboring nodes. The RREQ propagates through the network, collecting the addresses of all nodes visited, until it reaches the destination node or an intermediate node with a valid route to the destination node.
This node in turn initiates the route reply process by sending a special route reply (RREP) packet to the originating node announcing the newly discovered route. The destination node can accomplish this using inverse routing or by initiating the route discovery process backwards. The DSR algorithm also includes a route maintenance feature implemented via a hop-to-hop or end-to-end acknowledgement mechanism; the former includes error checking at each hop, while the latter checks for errors only on the sending and receiving sides. When the host encounters a broken link, it sends a route error (RERR) packet. Dynamic source routing is easy to implement, can work with asymmetric links, and involves no overhead when there are no changes in the network. The protocol can also easily be improved to support multiple routes to the same destination. DSR’s main drawback is the large bandwidth overhead inherent in source routing. Because each route cache collects the addresses of all visited nodes, RREQ packets can become huge as they propagate through the network. Routing information can also increase enough to exceed the accompanying message’s usefulness [4]. These problems limit the network’s acceptable diameter and therefore its scalability.
1.4 LITERATURE SURVEY
1.4.1 GOAL OF PROJECT
Different from the past work on the designs of cryptography algorithms and system infrastructures, we will propose a dynamic routing algorithm that could randomize delivery paths for data transmission. The algorithm is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. An analytic study on the proposed algorithm is presented, and a series of simulation experiments are conducted to verify the analytic results and to show the capability of the proposed algorithm.
1.4.2 ANALYSIS ON EXISTING NETWORKS
Existing work on security-enhanced data transmission includes the designs of cryptography algorithms and system infrastructures and security enhanced routing methods. Their common objectives are often to defeat various threats over the Internet, including eavesdropping, spoofing, session hijacking. so the data are easily affect by hackers.
1.4.3 IDEA ON PROPOSED SYSTEM
In proposed system Dynamic Routing algorithm that could randomize delivery paths for data transmission. It is easy to implement and compatible with popular routing protocols, such as the Routing Information Protocol in wired networks and Destination-Sequenced Distance Vector protocol in wireless networks, without introducing extra control messages. This is a secure routing protocol to improve the security of end-to-end data transmission based on multiple path deliveries. So the data are securely transmitted through network path.