04-04-2013, 04:56 PM
ROUTING WITH SECURITY IN MOBILE ADHOC NETWORKS
ROUTING WITH SECURITY.docx (Size: 561.14 KB / Downloads: 28)
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.
INTRODUCTION
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.
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.
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.
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.
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.