Improving Data Accessibility in MANET with Node Mobility Algorithm

Abstract

A Mobile Ad-hoc Network (MANET) is a collection of independent wireless nodes that can move randomly which forms a short-term network which has no fixed Infrastructure [8]. A MANET is a collection of mobile nodes connected by wireless links which can configure by itself. In Mobile Ad Hoc Networks, network partitioning or performance degradation occurs due to mobility of nodes. To minimize the performance degradation we go for replication techniques. These techniques consider that all mobile nodes co-operate fully, where as some nodes may co-operate partially or may not co-operate with other nodes and they are termed as selfish nodes. These types of nodes reduce the overall data accessibility. In order to preserve their battery selfish nodes won’t transmit data to others. Most of the existing research focuses on the network issues in a MANET. The main purpose of using a MANET is to provide well-organized data services to users replica allocation is also an important area to be focused. In previous methods some time link failure nodes are identified as selfish node. To overcome these issues a novel method is proposed where each node selects its neighbor nodes by considering low link failure rate, high contact probability and high remaining energy level. Then reliable neighbor scheme is applied to select nodes from its neighbors to replicate data. Here nodes are considered reliable which contribute more memory to neighbor nodes for replication of data items.