Arshad Ahmad Khan Mohammad ¹, Ali Mirza ², Srikanth Vemuru ¹

Affiliations
1 KL University, Guntur - 522502, Andhra Pradesh, IN
2 DMS, SVH College of Engineering, Machlipatnam - 521002, Andhra Pradesh, IN

Abstract

Objectives: Finding optimistic path between source to destination in Mobile ad hoc networks is most challenging task due to its constrained resources. Constrained battery power is one of eminent considerable issues in routing. Lot of routing protocols designed to address the issue of constrained battery power by designing routing path based on reliable routes, energy-efficient routes and routes with higher energy nodes. However, these protocols lead to the problem of a bottleneck intermediate node, which need to forward the packets from multiple sources. The major problem arises with bottleneck intermediate node is loss of packets. Methods/Statistical Analysis: In this work we develop a mathematical model to analyze the performance of an intermediate bottleneck node with the use of poison random process. Findings: Proposed model estimates the average queue length at input buffer, average waiting time in buffer and network life time. Application/Improvements: This model is used to control the input traffic of an intermediate node and to decide the node to take part of route or not.

Keywords

Bottleneck node, MANETs, Poison Random Process and Energy.

Full Text

   

Arshad Ahmad Khan Mohammad ¹, Ali Mirza ², Srikanth Vemuru ¹

Affiliations
1 KL University, Guntur - 522502, Andhra Pradesh, IN
2 DMSSVH College, Machlipatnam - 521002, Andhra Pradesh, IN

Abstract

Implementing security in mobile ad hoc networks is very challenging due to its dynamic, heterogeneous and distributed nature. In order to deploy security most important pre requisite is ‘authentication’. However, providing security based on public key infrastructure with central third party authentication is difficult to deploy in MANETs Environment. Energy efficiency is another powerful factor due to its constrained battery power of nodes in MANETs. Methods/Analysis: In order to achieve security along with energy efficiency, we design & evaluate mechanism based on chaotic maps and knapsack algorithm, which addresses two vital characteristics: authentication & lifetime of network. We divide the MANETs into number of clusters with cluster heads and assign the key management task to cluster heads. Findings: Proposed work achieves the network life time based on new metric called ‘Optimized data packets processing capacity’ and authentication with the help of Chebyshev polynomials. Application/Improvements: Our proposed scheme abstains from computing overhead such as modular exponentiation and scalar multiplications of an elliptical curve. Moreover it is robust to different network attacks and assures that the secrete session key is established only between two intended entities.

Keywords

Authentication, Cluster, Chebyshev Polynomials, Key Agreement, MANETs, Optimization.

Full Text