Open Access Open Access  Restricted Access Subscription or Fee Access

Enhanced Security for Autonomous Mobile Mesh Networks Using Crypto Algorithm

A. Renupriya, S. Vimal Anand

Abstract


Abstract
Mobile unintended networks (MANETs) area unit, ideal for things wherever a set infrastructure is unobtainable or unworkable. Today’s MANETs, however, could suffer from network partitioning. This limitation makes MANETs unsuitable for applications like crisis management and field communications, during which team members may ought to add teams scattered within the application parcel. In such applications, intergroup communication is crucial to the team collaboration. To deal with this weakness we introduce during this paper a brand new category of ad-hoc network referred to as autonomous mobile mesh network (AMMNET). Not like typical mesh networks, the mobile mesh nodes of associate in nursing AMMNET area unit capable of following the mesh shoppers within the application parcel, and organizing themselves into an appropriate topology to confirm sensible property for each intra- and intergroup communications. Here we propose a distributed consumer trailing answer to subsume the dynamic nature of consumer quality, and gift techniques for dynamic topology adaptation in accordance with the quality pattern of the shoppers. Our simulation results indicate that AMMNET is powerful against network partitioning and capable of providing high relay outturn for the mobile shoppers.

Keywords: Mobile mesh network, communication, security, Crypto Algorithm

Full Text:

PDF

References


Fall K. A Delay-Tolerant Network Architecture for Challenged Internets. Proc. ACM Special Interest Group on Data Comm. 2003.

Zhang Y, Fang Y. ARSA: An Attack-Resilient Security Architecture for Multihop Wireless Mesh Networks. IEEE J. Selected Areas in Comm. Oct 2006; 24(10): 1916–28p.

Sun J, Zhang C, Fang Y. A Security Architecture Achieving Anonymity and Traceability in Wireless Mesh Networks. Proc. IEEE INFOCOM. 2008.

Salem B, Hubaux J. Securing Wireless Mesh Networks. IEEE Wireless Comm. Apr 2006; 13(2): 50–5p.

Gandhi R, Khuller S, Srinivasan A. Approximation Algorithms for Partial Covering Problems. Proc. 28th Int’l Colloquium Automata, Languages and Programming. 2001; 225–36p.

Guttman A. R-Trees: A Dynamic Index Structure for Spatial Searching. Proc. ACM SIGMOD Int’l Conf. Management of Data (SIGMOD). 1984.

MacQuene J. Some Methods for Classification and Analysis of Multivariate Observations. Proc. Fifth Berkeley Symp. Math. Statistics and Probability. 1964.

Frey B., Bueck D. Clustering by Passing Messages between Data Points. Science. 2007; 315(5814): 972–6p.




DOI: https://doi.org/10.37628/ijowns.v1i1.44

Refbacks

  • There are currently no refbacks.