Enhanced Security for Autonomous Mobile Mesh Networks Using Crypto Algorithm
Mobile ad hoc networks (MANETs) are ideal for situations where a fixed infrastructure is unavailable or infeasible. Today’s MANETs, however, may suffer from network partitioning. This limitation makes MANETs unsuitable for applications such as crisis management and battlefield communications, in which team members might need to work in groups scattered in the application terrain. In such applications, inter-group communication is crucial to the team collaboration. To address this weakness introduce in this paper a new class of ad hoc network called Autonomous Mobile Mesh Network (AMMNET). Unlike conventional mesh networks, the mobile mesh nodes of an AMMNET are capable of following the mesh clients in the application terrain, and organizing themselves into a suitable network topology to ensure good connectivity for both intragroup and inter-group communications. Here propose a distributed client tracking solution to deal with the dynamic nature of client mobility, and present techniques for dynamic topology adaptation in accordance with the mobility pattern of the clients. Our simulation results indicate that AMMNET is robust against network partitioning and capable of providing high relay throughput for the mobile clients.
Keywords: AMMNET, Delay tolerant network, RFID, DTN, WMN, Mobile Ad Hoc Networks, Structured Group Mobility Model (SGMM)
Cite this Article A. Renupriya, S. Parimala. Enhanced Security for Autonomous Mobile Mesh Networks Using Crypto Algorithm. Recent Trends in Programming languages. 2016; 3(1): 17–24p.
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. 2006; 24(10): 1916–1928p.
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. 2006; 13(2): 50–55p.
Gandhi R, Khuller S, Srinivasan A. Approximation Algorithms for Partial Covering Problems. Proc. 28th Int’l Colloquium Automata, Languages and Programming. 2001: 225–236p.
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–976p.
- There are currently no refbacks.