Secure Mobile Ad hoc Routing Using Clusters Confrontations (SMARUC 2 ) with Genetic Algorithm (GA)

Data Routing among nodes in a wireless network is pretty complex when compared to traditional centralized network architecture. The wireless networks face quite a lot of threats due to open medium. The genuinity of the neighboring nodes must be known a priori to the transmission or routing of data packets. So, there is a need to address two issues posed by these self organizing architectures. One is to perform a genuine check before routing and the other is to find a shortest path among those trusted nodes. First issue ( genuinity) can be addressed by generating dynamic topology with secure routing using "SMARUC 2 ". Clusters are formed through"CCAM" (Classification Based Clustering Algorithm for Mobile Ad Hoc Networks). The second issue (Dynamic Traffic Assignment or routing) is addressed by using Genetic Algorithm (GA) in combination with dynamic allocation of costs among different nodes through measurement of latitudes and longitudes. Efficient utilization of resources like battery power and signal strength can also be achieved by "classification with ROSETTA". Finally, secure communication is provided among trusted nodes through enhanced Open SSL-DES96.

[1]  Sajal K. Das,et al.  An on-demand weighted clustering algorithm (WCA) for ad hoc networks , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[2]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[3]  Mary Baker,et al.  Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.

[4]  M. P. Sebastian,et al.  SCAM: Scenario-based Clustering Algorithm for Mobile ad hoc networks , 2009, 2009 First International Communication Systems and Networks and Workshops.

[5]  M. P. Sebastian,et al.  Scenario-Based Diameter-Bounded Algorithm for Cluster Creation and Management in Mobile Ad hoc Networks , 2009, 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications.

[6]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[7]  Hui Cheng,et al.  Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[8]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[9]  Dharma P. Agrawal,et al.  Introduction to Wireless and Mobile Systems , 2002 .

[10]  Jinyang Li,et al.  Cluster Based Routing Protocol(CBRP) Functional Specification , 1999 .

[11]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[12]  Ravi Prakash,et al.  Max-min d-cluster formation in wireless ad hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2005, Wirel. Networks.

[14]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[15]  Elizabeth M. Belding-Royer,et al.  A secure routing protocol for ad hoc networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..