IMPROVING DATA ACCESSIBILITY IN MANET WITH NODE MOBILITY ALGORITHM

International Journal of Computer Science (IJCS Journal) Published by SK Research Group of Companies (SKRGC) Scholarly Peer Reviewed Research Journals

Format: Volume 2, Issue 2, No 3, 2014.

Copyright: All Rights Reserved ©2014

Year of Publication: 2014

Author: S.Kavitha, S.Umamaheswari

Reference:IJCS-064

View PDF Format

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.

References

[1] A.Moon,H,Cho, ―Energy efficient replication extended database state machine in ad hoc network,‖ International Conference on Applied Computing, pp. 224–228, 2004. [2] Hara.T ―Effective replica allocation in ad hoc networks for improving data accessibility ,‖ IEEE INFOCOM, 2001, pp. 1568–1576. [3]Hauspie.M.,Simplot.D.,Carle.J. ―Replication decision algorithm based on link evaluation services in MANET,‖ CNRS UPRESA 8022 —LIFL University Lille, 2002. [4] Jae-Ho Choi, Kyu-Sun Shim, SangKeun Lee,Kun-Lung Wu ,―Handling Selfishness in Replica Allocation over a Mobile AdHoc Network, ‖ IEEE Transactions on mobile computing, vol. 11, no. 2,February 2012. [5] Jim Solomon Raja, Immanuel John Raja, ―A Survey on Selfishness Handling In Mobile Ad Hoc Network,‖ International Journal of Emerging Technology and Advanced Engineering Web (ISSN 2250-2459, vol. 2, Issue 11, November 2012) [6] Jing Zheng, Jinshu Su, and Xicheng Lu. ―A clustering based data replication algorithm in mobile ad hoc networks for improving data availability,‖ In Proc. 2nd International Symposium on Parallel and Distributed Processing and Applications (ISPA 2004), pp.399–409, 2004.[7] P.Mukilan, A.Wahi, ―CDRA: Consistency based Data Replication Algorithm for MANET,‖ International Journal of Computer Applications (0975 –8887) vol. 51–No.14, August 2012. [8] P.Mukilan et.al, ―EENMDRA: Efficient Energy and Node Mobility based Data Replication Algorithm for MANET‖, IJCSI International Journal of Computer Science Issues, vol. 9, Issue 3, No 1, May 2012,pp.357-364. [9] Rajeev Kumar et.al, ―Replica Allocation techniques based on Clusters for MANETs‖, International Conference on Emerging Trends in Computer and Electronics Engineering (ICETCEE’2012) March 24-25, 2012 Dubai, pp.56-59. [10] V.Thanedar, C. Almeroth and Elizabeth M.BeldingRoyer,―A lightweight content replication scheme for mobile ad hoc environment, ‖ Networking, pp. 125- 136, 2004. [11] Yang Zhang et.al, ―Balancing the Trade-Offs between Query Delay and Data Availability in MANETs ‖,IEEE Transactions on Parallel and Distributed Systems, vol. 23, No. 4, April 2012, pp.643-650.


Keywords

Data replication, Link failure, Contact probability, Energy level.

This work is licensed under a Creative Commons Attribution 3.0 Unported License.   

TOP
Facebook IconYouTube IconTwitter IconVisit Our Blog