Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
 
Articles by G. Mahadevan
Total Records ( 2 ) for G. Mahadevan
  Kuldeep Sharma and G. Mahadevan
  Mobile ad hoc networks used for processing, storage and wireless communication capabilities of mobile devices to create unstructured and low-cost self-configuring networks. Black Hole Attacks are serious problems to establish a communication in MANETs. In this research, we present CCLAM, a new proposed approach using new classic clustering formatted graphs to identify the nodes who are trying to create a black hole. We use well-established architecture to gain information about the network topology, keep eyes on all ordinary nodes and master nodes and maintain database to update all kind of information which use to perform original checks of the routing information generated by the nodes in the network. We assume there is a node in the network generating fake and wrong routing information as malicious node. Therefore, we blow an flag and alarm if the verification check fails. Furthermore, we present promising first simulation results with the new architecture, it is possible to detect the attempt of creating a black hole before the actual attack occurs and prevent the network from malicious attack.
  G. Mahadevan and V. Vijayalakshmi
  The medium domination number of a Jahangir graph Jm,n was introduced by M. Ramachandran and N. Parvathi. Recently Mahadevan et al., introduced the concept of extended medium domination number of a graph. edom (u, v) is the sum of number of u-v paths of length less than or equal to 3. ETDV (G) = Σedom (u, v) for u, vεV(G) is the total number of vertices that dominate every pair of vertices. The extended medium domination number of G is EMD(G) = ETDV(G)/(p2) where, p is the number of vertices in G. Here, we generalize the extended medium domination number of Jahangir graph, sunflower graph and windmill graph.
 
 
 
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility