Vellore Institute of Technology (VIT) is a private university located in&nbsp;Tamil Nadu, India. Founded in 1984, as Vellore Engineering College, the institution offers 20 undergraduate, 34 postgraduate, four integrated and four research programs. It has campuses in Vellore, Amravati, Bhopal and Chennai.

VIT is one of the top ranked private universities in India according to NIRF, THE and QS Rankings.&nbsp;Govt. of India has recognized&nbsp;VIT, Vellore as an&nbsp;Institution of Eminence. This has allowed VIT to take independent quality initiatives and move up in world ranking.

&nbsp;

&nbsp;

VIT University

Abstract: Location information plays a pivotal role in geographic routing protocols for packet routing. Network based services provide the location-based services with location information maintained in a distributed manner. In spite of their intimate association, location services and routing need to be considered separately. Hence, in the evaluation of the overheads of geographic routing, the resultant overhead of the location-based service is not reckoned. The projected purpose here is to integrate the protocols of routing and the services based on location, to minimize the routing overhead and latency in communication. Our chief contribution is the reduction of location overhead. We are proposed Geographic Routing Protocol is combined with the Grid Location Service. Instead of placing a request for exact position, the packet is sent to the earlier destination position. As the packet nears the former position, then the exact location is requested. Simulation results satisfactorily establish the complexity of the analysis and positive output regarding latency, the ratio of packet delivery and the overhead of control message.

Department of Information Technology

School of Information Technology and Engineering

Vellore Campus

Automatic Control and Computer Sciences

Refining the Renowned Route Performance on Location Information About Mobile Adhoc Network

Conventional network routing protocols rely on predefined numerical network unique node ID or group identifier for packet delivery, independent of semantic applications. This compels incorporation of resource/service discovery approaches in the design itself, at higher layers of network, causing additional overhead. This overhead, though tolerable in high speed wired networks, significantly restricts the performance in the infrastructure-less wireless ad hoc networks expending their limited battery resources, which are already consumed due to assigning unique identifiers to the naturally anonymous and high mobile nodes. This study proposes a single routing approach which facilitates descriptive and semantically-rich identification of network’s resources/services. This fusion of the discovery processes of the resources and the path based on their similarity in a single phase significantly reduces traffic load and latency of communication considering the generality too. Further, a framework capable of exploiting application-specific semantics of messages, adaptable to diverse traffic patterns is proposed. Analytical results amply illustrate the scalability and efficacy of the proposed method.

Department of Database Systems

School of Computer Science and Engineering

Defence Science Journal

A Framework for Efficient Routing in MANET using Index Routing Tables-based Algorithms

AbstractIn recent years synchronization plays a major issue for secure transmission in mobile adhoc networks. When an attacker modifies the time synchronization algorithm, the nodes will have faulty estimates of other nodes location, leading to chaos. While transmitting under these adverse conditions, packets might be lost or might be sent to wrong locations. Data replication and data diffusion are two methods which are used to solve the problem of data availability. In this paper we propose an algorithm for secure multi hop transmission used for external attacks.

Fulltext

Cybernetics and Information Technologies

Secure Routing in Manet Using Synchronization and Data Authencity

Identification of neighbours plays a major role of many protocols for wireless Adhoc networks and also the process of network paths in a network plays an important role. Wormhole attack is a major issue in networks. This type of attack causes the opponent to collects packets from one location and channels them to other location and retransmits them into the network. To avoid the problem of wormhole attack, so far we have several mechanisms like packet leashes for detecting against wormhole attack, a counter measure using directional antennas. Mobile Secure Neighbour Discovery Protocol performs a measure of security against wormhole attack by participating mobile nodes. In this paper we uses graph rigidity, Laman theorem for wormhole avoidance and forbidden graph for wormhole detection. By using these graphs we will provide a better solution to overcome the problem of wormhole attack in wireless Adhoc networks. © 2005 - 2013 JATIT &amp; LLS. All rights reserved.

World University root node

Journal of Theoretical and Applied Information Technology

Secure routing in manet using asymmetric graphs

In the past few years, we have seen a rapid increase in important application fields of Mobile ad-hoc networks (MANET). Hence, many industrial and academic researchers have been conducted. Because, these applications are closely related to human beings and their physical environment, the usage of MANET on a large scale depends on whether we can provide proper dependability. Particularly, security is the most important issue in MANET because of the limitation in resources. Management of keys is the most necessary activity for providing security for the network. MANETs have resource limitations. Thus using public-key based solutions is not feasible. Thus, we use symmetric key establishment. In this paper, a key management scheme which is self contained and public is represented. This scheme achieves near zero communication overhead while providing security services. Cryptographic keys in small numbers are inputted at all nodes prior to the deployment in network. Mathematical Combinations of pairs of keys, both public and private is used for better utilization of storage space. This means a combination of more than one key pair is utilized by nodes for the encryption and the decryption of messages. A secure communication algorithm for forwarding the packets in MANET is also proposed.