Community Overlapping Detection in Complex Networks

Background/Objectives: The community overlapping is the process by which number of nodes within the mesh network share common resources. The shared resources could lead to the conflict such as inconsistent analysis problem. Study of these problems is the objective of the paper. Methods/Statistical Analysis: In order to analyze the problem Modified K-Clique with sink node elimination technique is suggested. K-Clique method used detects the nodes in the mesh network having more than one connection. The modification to K-Clique enhance speed since sink node is eliminated prior to calculation of cliques. The adjacency matrix is used in order to detect the sink nodes. The Simulation is conducted in MATLAB. The MATLAB provides tools of network programming in terms of plots and graphs. The existing K-Clique is compared against the modified K-Clique and result obtained is better for Modified k-Clique. Findings: The speed is enhanced almost by 5% and number of cliques of distinct sizes discovered is also increased by 5%. The speed can further be enhanced by following hop count mechanism to reach destination quickly in addition to sink node elimination. Application/Improvement: Enhancement of performance using community overlapping detection in wireless mesh network through which it is possible to transfer the data towards multiple destinations with the help of community overlapping detection. Multiple destination towards which is to be transferred can be detected. Time will be less consumed in this case. The distance vector routing can be merged in the supposed system to further enhance the scope of the system.