In this paper, we measure and analyze the correlation of betweenness centrality (BWC) to five centrality measures, including eigenvector centrality (EVC), degree centrality DEG),
clustering coefficient centrality (CCC), farness centrality (FRC), and closeness centrality(CLC). We simulate the evolution of random networks and small-world networks to test the correlation between BWC and the five measures. Additionally, nine real-world networks are also involved in our present study to further examine the correlation. We find that DEG is
highly correlated to BWC on most cases and can serve as alternative to computationallyexpensive BWC. Moreover, EVC, CLC and FRC are also good candidates to replace BWC on
random networks. Although it is not a perfect correlation for all the real-world networks, there still exists a relatively good correlation between BWC and other three measures (CLC, FRC and EVC) on some networks. Our findings in this paper can help us understand how BWC correlates to other centrality measures and when to decide a good alternative to BWC
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITYijfcstjournal
In this paper, we seek to find a computationally light centrality metric that could serve as an alternate for the computationally heavy betweenness centrality (BWC) metric. In this pursuit, in the first half of the paper, we evaluate the correlation coefficient between BWC and the other commonly used centrality metrics such as Degree Centrality (DEG), Closeness Centrality (CLC), Farness Centrality (FRC),Clustering Coefficient Centrality (CCC) and Eigenvector Centrality (EVC). We observe BWC to be highly correlated with DEG for synthetic networks generated based on the Erdos-Renyi model (for randomnetworks) and Watts-Strogatz model (for small-world networks). In the second half of the paper, weconduct a regression analysis for BWC with that of a recently proposed centrality metric called thelocalized clustering coefficient complement-based degree centrality (LCC'DC) for a suite of 47 real-world networks. The R-Squared metric and Correlation coefficient for the LCC'DC-BWC regression has been observed to be appreciably greater than those observed for the DEG-BWC regression. We also bserve the LCC'DC-BWC regression to incur relatively a lower value for the standard error of residuals for a majority of the real-world networks.
MAINTAINING UNIFORM DENSITY AND MINIMIZING THE CHANCE OF ERROR IN A LARGE SCA...IJNSA Journal
In a real application area, the WSN is not a homogeneous network where the nodes are maintained in respective coordinate position relatively same to each other. But rather homogeneous it should be heterogeneous, where the relative positional difference for different nodes are different. In this paper a better scheme is being proposed which will take care of the life time and density of a WSN. Sun et. al. proposed uniform density in WSN by assuming the network as a homogeneous network ,but in this paper without taking a homogeneous network the same problem is being solved by using the Gaussian probability density function. And also the chance of error in receiving the message from the WSN to the base station is minimized by using priori probability algorithm.
DISTRIBUTED COVERAGE AND CONNECTIVITY PRESERVING ALGORITHM WITH SUPPORT OF DI...IJCSEIT Journal
Given a 3D space where should be supervised and a group of mobile sensor actor nodes with limited
sensing and communicating capabilities, this paper aims at proposing a distributed self-deployment
algorithm for agents to cover the space as much as possible by considering non-uniform sensing coverage
degree constraint of environment while preserving connectivity. The problem is formulated as coverage
maximization subject to connectivity and sensing coverage degree constraint. Considering a desired
distance between neighbouring nodes, an error function which depends on pairwise distance between
nodes is described. The maximization is encoded to an error minimization problem that is solved using
gradient descent algorithm and will yield in moving sensors into appropriate positions. Simulation results
are presented in two different conditions that importance of sensing coverage degree support of
environment is very high and is low.
LOSSLESS RECONSTRUCTION OF SECRET IMAGE USING THRESHOLD SECRET SHARING AND TR...IJNSA Journal
This paper is proposed to provide confidentiality of the secret image which can be used by multiple users or to store on multiple servers. A secret sharing is a technique to protect the secret information which will be used by multiple users. The threshold secret sharing is more efficient as it is possible to
reconstruct the secret with the threshold number of shares. Along with Shamir’s secret sharing method we propose to use the radon transformation before dividing the image in to shares. This transformation is used so that the shares will not have the original pixel intensity. The run length code is used to compress
the image after the transformation. Then apply secret sharing technique. The reconstruction of the image results in original image by applying the operations in the reverse order.
CORRELATION AND REGRESSION ANALYSIS FOR NODE BETWEENNESS CENTRALITYijfcstjournal
In this paper, we seek to find a computationally light centrality metric that could serve as an alternate for the computationally heavy betweenness centrality (BWC) metric. In this pursuit, in the first half of the paper, we evaluate the correlation coefficient between BWC and the other commonly used centrality metrics such as Degree Centrality (DEG), Closeness Centrality (CLC), Farness Centrality (FRC),Clustering Coefficient Centrality (CCC) and Eigenvector Centrality (EVC). We observe BWC to be highly correlated with DEG for synthetic networks generated based on the Erdos-Renyi model (for randomnetworks) and Watts-Strogatz model (for small-world networks). In the second half of the paper, weconduct a regression analysis for BWC with that of a recently proposed centrality metric called thelocalized clustering coefficient complement-based degree centrality (LCC'DC) for a suite of 47 real-world networks. The R-Squared metric and Correlation coefficient for the LCC'DC-BWC regression has been observed to be appreciably greater than those observed for the DEG-BWC regression. We also bserve the LCC'DC-BWC regression to incur relatively a lower value for the standard error of residuals for a majority of the real-world networks.
MAINTAINING UNIFORM DENSITY AND MINIMIZING THE CHANCE OF ERROR IN A LARGE SCA...IJNSA Journal
In a real application area, the WSN is not a homogeneous network where the nodes are maintained in respective coordinate position relatively same to each other. But rather homogeneous it should be heterogeneous, where the relative positional difference for different nodes are different. In this paper a better scheme is being proposed which will take care of the life time and density of a WSN. Sun et. al. proposed uniform density in WSN by assuming the network as a homogeneous network ,but in this paper without taking a homogeneous network the same problem is being solved by using the Gaussian probability density function. And also the chance of error in receiving the message from the WSN to the base station is minimized by using priori probability algorithm.
DISTRIBUTED COVERAGE AND CONNECTIVITY PRESERVING ALGORITHM WITH SUPPORT OF DI...IJCSEIT Journal
Given a 3D space where should be supervised and a group of mobile sensor actor nodes with limited
sensing and communicating capabilities, this paper aims at proposing a distributed self-deployment
algorithm for agents to cover the space as much as possible by considering non-uniform sensing coverage
degree constraint of environment while preserving connectivity. The problem is formulated as coverage
maximization subject to connectivity and sensing coverage degree constraint. Considering a desired
distance between neighbouring nodes, an error function which depends on pairwise distance between
nodes is described. The maximization is encoded to an error minimization problem that is solved using
gradient descent algorithm and will yield in moving sensors into appropriate positions. Simulation results
are presented in two different conditions that importance of sensing coverage degree support of
environment is very high and is low.
LOSSLESS RECONSTRUCTION OF SECRET IMAGE USING THRESHOLD SECRET SHARING AND TR...IJNSA Journal
This paper is proposed to provide confidentiality of the secret image which can be used by multiple users or to store on multiple servers. A secret sharing is a technique to protect the secret information which will be used by multiple users. The threshold secret sharing is more efficient as it is possible to
reconstruct the secret with the threshold number of shares. Along with Shamir’s secret sharing method we propose to use the radon transformation before dividing the image in to shares. This transformation is used so that the shares will not have the original pixel intensity. The run length code is used to compress
the image after the transformation. Then apply secret sharing technique. The reconstruction of the image results in original image by applying the operations in the reverse order.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Proposed Algorithm to Detect the Largest Community Based On Depth LevelEswar Publications
The incredible rising of online networks show that these networks are complex and involving massive data.Giving a very strong interest to set of techniques developed for mining these networks. The clique problem is a well known NP-Hard problem in graph mining. One of the fundamental applications for it is the community detection. It helps to understand and model the network structure which has been a fundamental problem in several fields. In literature, the exponentially increasing computation time of this problem make the quality of these solutions is limited and infeasible for massive graphs. Furthermore, most of the proposed approaches are able to detect only disjoint communities. In this paper, we present a new clique based approach for fast and efficient overlapping
community detection. The work overcomes the short falls of clique percolation method (CPM), one of most popular and commonly used methods in this area. The shortfalls occur due to brute force algorithm for enumerating maximal cliques and also the missing out many vertices thatleads to poor node coverage. The proposed work overcome these shortfalls producing NMC method for enumerating maximal cliques then detects overlapping communities using three different community scales based on three different depth levels to assure high nodes coverage and detects the largest communities. The clustering coefficient and cluster density are used to measure the quality. The work also provide experimental results on benchmark real world network to
demonstrate the efficiency and compare the new proposed algorithm with CPM method, The proposed algorithm is able to quickly discover the maximal cliques and detects overlapping community with interesting remarks and findings.
Network clustering is an important technique used in many large-scale distributed systems. Given good design and implementation, network clustering can significantly enhance the system\'s scalability and efficiency. However, it is very challenging to design a good clustering protocol for networks that scale fast and change continuously. In this paper, we propose a distributed network clustering protocol SDC targeting large-scale decentralized systems. In SDC, clusters are dynamically formed and adjusted based on SCM, a practical clustering accuracy measure. Based on SCM, each node can join or leave a cluster such that the clustering accuracy of the whole network can be improved. A big advantage of SDC is it can recover accurate clusters from node dynamics with very small message overhead. Through extensive simulations, we conclude that SDC is able to discover good quality clusters very efficiently.
A NOVEL SCHEME FOR DEVIATION DETECTION IN ASYNCHRONOUS DISTRIBUTED PRICINGIJNSA Journal
Modelling resource allocation problems in the form of non-cooperative pricing games takes into account the difference between how much a given performance metric is valued and how much is paid for it. For the convergence of the sum of all users’ payoff to a global maximum, the determination of the utility function is essential. Although supermodularity conditions have been previously defined and determined to obtain suitable utility functions, different utilities have significantly varying performance characteristics under similar network parameters. In an ad-hoc framework, absence of a central authority leads to uncontrollability of unfairness. Users could misbehave by broadcasting high price coefficients to force other users to transmit at a lower power. This paper proposes an adaptation of the Asynchronous Distributed Pricing Algorithm with a Deviation Detection Block that re-aligns the deviated system back into the algorithm.
Hidden geometric correlations in real multiplex networksKolja Kleineberg
Read the paper at http://www.nature.com/nphys/journal/vaop/ncurrent/full/nphys3812.html
Real networks often form interacting parts of larger and more complex systems. Examples can be found in different domains, ranging from the Internet to structural and functional brain networks. Here, we show that these multiplex systems are not random combinations of single network layers. Instead, they are organized in specific ways dictated by hidden geometric correlations between the layers. We find that these correlations are significant in different real multiplexes, and form a key framework for answering many important questions. Specifically, we show that these geometric correlations facilitate the definition and detection of multidimensional communities, which are sets of nodes that are simultaneously similar in multiple layers. They also enable accurate trans-layer link prediction, meaning that connections in one layer can be predicted by observing the hidden geometric space of another layer. And they allow efficient targeted navigation in the multilayer system using only local knowledge, outperforming navigation in the single layers only if the geometric correlations are sufficiently strong.
THE NASH’S BALANCE IN THE THEORY OF GAMES FOR A SECURE MODEL MECHANISM IN ROU...ijcisjournal
The present work is dedicated to study attacks and countermeasure in MANET. After a short introduction to what the Mobile Ad hoc Networks (MANETs) are and network security we present a survey of various attacks in MANETs pertaining to fail routing protocols. We present the different tools used by these attacks and the mechanisms used by the secured routing protocols to counter them. We also study a mechanism of security, named the reputation, proposed for the MANETs and the protocol which implements it. We also propose a secure mechanism which is based on the reputation. Our work ends with a proposal analytical model to the modules of our mechanism and the equilibrium states of our model.
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
Additive gaussian noise based data perturbation in multi level trust privacy ...IJDKP
Data perturbation is one of the most popular models used in pr
ivacy preserving data mining. It is specially
convenient for applications where the data owners need to export/publi
sh the privacy-sensitive data. This
work proposes that an Additive Perturbation based Privacy Pre
serving Data Mining (PPDM) to deal with
the problem of increasing accurate models about all data without
knowing exact details of individual
values. To Preserve Privacy, the approach establishes R
andom Perturbation to individual values before
data are published. In Proposed system the PPDM approach introd
uces Multilevel Trust (MLT) on data
miners. Here different perturbed copies of the similar data a
re available to the data miner at different trust
levels and may mingle these copies to jointly gather extra infor
mation about original data and release the
data is called diversity attack. To prevent this attack ML
T-PPDM approach is used along with the addition
of random Gaussian noise and the noise is properly correlated to
the original data, so the data miners
cannot get diversity gain in their combined reconstruction.
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
Wireless sensor networks have been used in various fields like battle feilds, surveillance, schools, colleges, etc. It has been used in our day-to-day life. Its growth increases day by day. Sensor node normally senses the physical event from the environment such as temperature, sound, vibration, pressure etc. Sensor nodes are connected with each other through wireless medium such as infrared or radio waves it depends on applications. Each node has its internal memory to store the information regarding the event packets. In this paper we will come to know the various algorithms in clustering techniques for wireless sensor networks and discuss them. Clustering is a key technique used to extend the lifetime of a sensor network by reducing energy consumption .It can also increase network scalability. Sensor nodes are considered to be homogeneous since the researches in the feild of WSNs have been evolved but in reality homogeneous sensor networks hardly exist. Here we will discuss some of the impact of heterogeneous sensor networks on WSN and various clustering algorithms used in HWSN.
Java Abs Peer To Peer Design & Implementation Of A Tuple Spacencct
Final Year Projects, IEEE Projects, Final Year Projects in Chennai, Final Year IEEE Projects, final year projects, college projects, student projects, java projects, asp.net projects, software projects, software ieee projects, ieee 2009 projects, 2009 ieee projects, embedded projects, final year software projects, final year embedded projects, ieee embedded projects, matlab projects, microcontroller projects, vlsi projects, dsp projects, free projects, project review, project report, project presentation, free source code, free project report, Final Year Projects, IEEE Projects, Final Year Projects in Chennai, Final Year IEEE Projects, final year projects, college projects, student projects, java projects, asp.net projects, software projects, software ieee projects, ieee 2009 projects, 2009 ieee projects, embedded projects, final year software projects, final year embedded projects, ieee embedded projects, matlab projects, final year java projects, final year asp.net projects, final year vb.net projects, vb.net projects, c# projects, final year c# projects, electrical projects, power electronics projects, motors and drives projects, robotics projects, ieee electrical projects, ieee power electronics projects, ieee robotics projects, power system projects, power system ieee projects, engineering projects, ieee engineering projects, engineering students projects, be projects, mca projects, mtech projects, btech projects, me projects, mtech projects, college projects, polytechnic projects, real time projects, ieee projects, non ieee projects, project presentation, project ppt, project pdf, project source code, project review, final year project, final year projects
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
RECOGNITION OF RECAPTURED IMAGES USING PHYSICAL BASED FEATUREScsandit
With the development of multimedia technology and digital devices, it is very simple and easier to recapture a high quality images from LCD screens. In authentication, the use of such
recaptured images can be very dangerous. So, it is very important to recognize the recaptured images in order to increase authenticity. Image recapture detection (IRD) is to distinguish realscene images from the recaptured ones. An image recapture detection method based on set of physical based features is proposed in this paper, which uses combination of low-level features including texture, HSV colour and blurriness. Twenty six dimensions of features are xtracted to train a suppo rt vector machine classifier with linear kernel. The experimental results show that the proposed method is efficient with good recognition rate of distinguishing real scene images from the recaptured ones. The proposed method also possesses low dimensional features compared to the state-of-the-art recaptured methods.
THE IMPACT OF EXISTING SOUTH AFRICAN ICT POLICIES AND REGULATORY LAWS ON CLOU...csandit
Cloud computing promises good opportunities for economies around the world, as it can help reduce capital expenditure and administration costs, and improve resource utilization. However there are challenges regarding the adoption of cloud computing, key amongst those are security and privacy, reliability and liability, access and usage restriction. Some of these challenges lead to a need for cloud computing policy so that they can be addressed. The purpose of this paper is
twofold. First is to discuss challenges that prompt a need for cloud computing policy. Secondly, is to look at South African ICT policies and regulatory laws in relation to the emergence of cloud computing. Since this is literature review paper, the data was collected mainly through literature reviews. The findings reveals that indeed cloud computing raises policy challenges that needs to be addressed by policy makers. A lack of policy that addresses cloud computing challenges can
negatively have an impact on areas such as security and privacy, competition, intellectual property and liability, consumer protection, cross border and juridical challenges.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Proposed Algorithm to Detect the Largest Community Based On Depth LevelEswar Publications
The incredible rising of online networks show that these networks are complex and involving massive data.Giving a very strong interest to set of techniques developed for mining these networks. The clique problem is a well known NP-Hard problem in graph mining. One of the fundamental applications for it is the community detection. It helps to understand and model the network structure which has been a fundamental problem in several fields. In literature, the exponentially increasing computation time of this problem make the quality of these solutions is limited and infeasible for massive graphs. Furthermore, most of the proposed approaches are able to detect only disjoint communities. In this paper, we present a new clique based approach for fast and efficient overlapping
community detection. The work overcomes the short falls of clique percolation method (CPM), one of most popular and commonly used methods in this area. The shortfalls occur due to brute force algorithm for enumerating maximal cliques and also the missing out many vertices thatleads to poor node coverage. The proposed work overcome these shortfalls producing NMC method for enumerating maximal cliques then detects overlapping communities using three different community scales based on three different depth levels to assure high nodes coverage and detects the largest communities. The clustering coefficient and cluster density are used to measure the quality. The work also provide experimental results on benchmark real world network to
demonstrate the efficiency and compare the new proposed algorithm with CPM method, The proposed algorithm is able to quickly discover the maximal cliques and detects overlapping community with interesting remarks and findings.
Network clustering is an important technique used in many large-scale distributed systems. Given good design and implementation, network clustering can significantly enhance the system\'s scalability and efficiency. However, it is very challenging to design a good clustering protocol for networks that scale fast and change continuously. In this paper, we propose a distributed network clustering protocol SDC targeting large-scale decentralized systems. In SDC, clusters are dynamically formed and adjusted based on SCM, a practical clustering accuracy measure. Based on SCM, each node can join or leave a cluster such that the clustering accuracy of the whole network can be improved. A big advantage of SDC is it can recover accurate clusters from node dynamics with very small message overhead. Through extensive simulations, we conclude that SDC is able to discover good quality clusters very efficiently.
A NOVEL SCHEME FOR DEVIATION DETECTION IN ASYNCHRONOUS DISTRIBUTED PRICINGIJNSA Journal
Modelling resource allocation problems in the form of non-cooperative pricing games takes into account the difference between how much a given performance metric is valued and how much is paid for it. For the convergence of the sum of all users’ payoff to a global maximum, the determination of the utility function is essential. Although supermodularity conditions have been previously defined and determined to obtain suitable utility functions, different utilities have significantly varying performance characteristics under similar network parameters. In an ad-hoc framework, absence of a central authority leads to uncontrollability of unfairness. Users could misbehave by broadcasting high price coefficients to force other users to transmit at a lower power. This paper proposes an adaptation of the Asynchronous Distributed Pricing Algorithm with a Deviation Detection Block that re-aligns the deviated system back into the algorithm.
Hidden geometric correlations in real multiplex networksKolja Kleineberg
Read the paper at http://www.nature.com/nphys/journal/vaop/ncurrent/full/nphys3812.html
Real networks often form interacting parts of larger and more complex systems. Examples can be found in different domains, ranging from the Internet to structural and functional brain networks. Here, we show that these multiplex systems are not random combinations of single network layers. Instead, they are organized in specific ways dictated by hidden geometric correlations between the layers. We find that these correlations are significant in different real multiplexes, and form a key framework for answering many important questions. Specifically, we show that these geometric correlations facilitate the definition and detection of multidimensional communities, which are sets of nodes that are simultaneously similar in multiple layers. They also enable accurate trans-layer link prediction, meaning that connections in one layer can be predicted by observing the hidden geometric space of another layer. And they allow efficient targeted navigation in the multilayer system using only local knowledge, outperforming navigation in the single layers only if the geometric correlations are sufficiently strong.
THE NASH’S BALANCE IN THE THEORY OF GAMES FOR A SECURE MODEL MECHANISM IN ROU...ijcisjournal
The present work is dedicated to study attacks and countermeasure in MANET. After a short introduction to what the Mobile Ad hoc Networks (MANETs) are and network security we present a survey of various attacks in MANETs pertaining to fail routing protocols. We present the different tools used by these attacks and the mechanisms used by the secured routing protocols to counter them. We also study a mechanism of security, named the reputation, proposed for the MANETs and the protocol which implements it. We also propose a secure mechanism which is based on the reputation. Our work ends with a proposal analytical model to the modules of our mechanism and the equilibrium states of our model.
EVOLUTIONARY CENTRALITY AND MAXIMAL CLIQUES IN MOBILE SOCIAL NETWORKSijcsit
This paper introduces an evolutionary approach to enhance the process of finding central nodes in mobile networks. This can provide essential information and important applications in mobile and social networks. This evolutionary approach considers the dynamics of the network and takes into consideration the central nodes from previous time slots. We also study the applicability of maximal cliques algorithms in mobile social networks and how it can be used to find the central nodes based on the discovered maximal cliques. The experimental results are promising and show a significant enhancement in finding the central nodes.
Additive gaussian noise based data perturbation in multi level trust privacy ...IJDKP
Data perturbation is one of the most popular models used in pr
ivacy preserving data mining. It is specially
convenient for applications where the data owners need to export/publi
sh the privacy-sensitive data. This
work proposes that an Additive Perturbation based Privacy Pre
serving Data Mining (PPDM) to deal with
the problem of increasing accurate models about all data without
knowing exact details of individual
values. To Preserve Privacy, the approach establishes R
andom Perturbation to individual values before
data are published. In Proposed system the PPDM approach introd
uces Multilevel Trust (MLT) on data
miners. Here different perturbed copies of the similar data a
re available to the data miner at different trust
levels and may mingle these copies to jointly gather extra infor
mation about original data and release the
data is called diversity attack. To prevent this attack ML
T-PPDM approach is used along with the addition
of random Gaussian noise and the noise is properly correlated to
the original data, so the data miners
cannot get diversity gain in their combined reconstruction.
A Survey on Clustering Techniques for Wireless Sensor Network IJORCS
Wireless sensor networks have been used in various fields like battle feilds, surveillance, schools, colleges, etc. It has been used in our day-to-day life. Its growth increases day by day. Sensor node normally senses the physical event from the environment such as temperature, sound, vibration, pressure etc. Sensor nodes are connected with each other through wireless medium such as infrared or radio waves it depends on applications. Each node has its internal memory to store the information regarding the event packets. In this paper we will come to know the various algorithms in clustering techniques for wireless sensor networks and discuss them. Clustering is a key technique used to extend the lifetime of a sensor network by reducing energy consumption .It can also increase network scalability. Sensor nodes are considered to be homogeneous since the researches in the feild of WSNs have been evolved but in reality homogeneous sensor networks hardly exist. Here we will discuss some of the impact of heterogeneous sensor networks on WSN and various clustering algorithms used in HWSN.
Java Abs Peer To Peer Design & Implementation Of A Tuple Spacencct
Final Year Projects, IEEE Projects, Final Year Projects in Chennai, Final Year IEEE Projects, final year projects, college projects, student projects, java projects, asp.net projects, software projects, software ieee projects, ieee 2009 projects, 2009 ieee projects, embedded projects, final year software projects, final year embedded projects, ieee embedded projects, matlab projects, microcontroller projects, vlsi projects, dsp projects, free projects, project review, project report, project presentation, free source code, free project report, Final Year Projects, IEEE Projects, Final Year Projects in Chennai, Final Year IEEE Projects, final year projects, college projects, student projects, java projects, asp.net projects, software projects, software ieee projects, ieee 2009 projects, 2009 ieee projects, embedded projects, final year software projects, final year embedded projects, ieee embedded projects, matlab projects, final year java projects, final year asp.net projects, final year vb.net projects, vb.net projects, c# projects, final year c# projects, electrical projects, power electronics projects, motors and drives projects, robotics projects, ieee electrical projects, ieee power electronics projects, ieee robotics projects, power system projects, power system ieee projects, engineering projects, ieee engineering projects, engineering students projects, be projects, mca projects, mtech projects, btech projects, me projects, mtech projects, college projects, polytechnic projects, real time projects, ieee projects, non ieee projects, project presentation, project ppt, project pdf, project source code, project review, final year project, final year projects
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
RECOGNITION OF RECAPTURED IMAGES USING PHYSICAL BASED FEATUREScsandit
With the development of multimedia technology and digital devices, it is very simple and easier to recapture a high quality images from LCD screens. In authentication, the use of such
recaptured images can be very dangerous. So, it is very important to recognize the recaptured images in order to increase authenticity. Image recapture detection (IRD) is to distinguish realscene images from the recaptured ones. An image recapture detection method based on set of physical based features is proposed in this paper, which uses combination of low-level features including texture, HSV colour and blurriness. Twenty six dimensions of features are xtracted to train a suppo rt vector machine classifier with linear kernel. The experimental results show that the proposed method is efficient with good recognition rate of distinguishing real scene images from the recaptured ones. The proposed method also possesses low dimensional features compared to the state-of-the-art recaptured methods.
THE IMPACT OF EXISTING SOUTH AFRICAN ICT POLICIES AND REGULATORY LAWS ON CLOU...csandit
Cloud computing promises good opportunities for economies around the world, as it can help reduce capital expenditure and administration costs, and improve resource utilization. However there are challenges regarding the adoption of cloud computing, key amongst those are security and privacy, reliability and liability, access and usage restriction. Some of these challenges lead to a need for cloud computing policy so that they can be addressed. The purpose of this paper is
twofold. First is to discuss challenges that prompt a need for cloud computing policy. Secondly, is to look at South African ICT policies and regulatory laws in relation to the emergence of cloud computing. Since this is literature review paper, the data was collected mainly through literature reviews. The findings reveals that indeed cloud computing raises policy challenges that needs to be addressed by policy makers. A lack of policy that addresses cloud computing challenges can
negatively have an impact on areas such as security and privacy, competition, intellectual property and liability, consumer protection, cross border and juridical challenges.
COMPUTATIONAL METHODS FOR FUNCTIONAL ANALYSIS OF GENE EXPRESSIONcsandit
Sequencing projects arising from high throughput technologies including those of sequencing DNA microarrays allowed to simultaneously measure the expression levels of millions of genes of a biological sample as well as annotate and identify the role (function) of those genes. Consequently, to better manage and organize this significant amount of information,
bioinformatics approaches have been developed. These approaches provide a representation and a more 'relevant' integration of data in order to test and validate the hypothesis of researchers throughout the experimental cycle. In this context, this article describes and discusses some of techniques used for the functional analysis of gene expression data.
WI-FI FINGERPRINT-BASED APPROACH TO SECURING THE CONNECTED VEHICLE AGAINST WI...csandit
In this paper, we present wifi fingerprint-based approach to securing the connected vehicle against wireless attack. In current connected vehicles such as Tesla EV, Mitsubishi outlander PHEV etc., there is a wi-fi access point on the vehicle to connect to the mobile device which has telematics apps installed. And generally the wi-fi access point is managed by the head unit system in the vehicle. Currently, the headunit in the vehicle utilizes white-list that contain MAC addresses of the pre-registered (i.e authorized) device. However, the white-list based mechanism cannot detect the device that forges its MAC address with authorized one. This paper presents security mechanism to detect rogue telematics device that has a spoofed (i.e, forged) MAC by analysing wi-fi fingerprint. We generate wi-fi fingerprint by analysing radio frequency features such as error vector magnitude (EVM), frequency offset, I/Q offset, sync correlation and so on. And we also utilizing distance information for improving detection ratio. The prototype of the proposed mechanism is implemented in this work, and we provide experimental results
How to Make Awesome SlideShares: Tips & TricksSlideShare
Turbocharge your online presence with SlideShare. We provide the best tips and tricks for succeeding on SlideShare. Get ideas for what to upload, tips for designing your deck and more.
"Kurtosis" has long been considered an appropriate measure to quantify the extent of fat-tailedness of the degree distribution of a complex real-world network. However, the Kurtosis values for more than one realworld network have not been studied in conjunction with other statistical measures that also capture the
extent of variation in node degree. Also, the Kurtosis values of the distributions of other commonly centrality metrics for real-world networks have not been analyzed. In this paper, we determine the Kurtosis values for a suite of 48 real-world networks along with measures such as SPR(K), Max(K)-Min(K),
Max(K)-Avg(K), SD(K)/Avg(K), wherein SPR(K), Max(K), Min(K), Avg(K) and SD(K) represent the spectral radius ratio for node degree, maximum node degree, minimum node degree, average and standard deviation of node degree respectively. Contrary to the conceived notion in the literature, we observe that real-world networks whose degree distribution is Poisson in nature (characterized by lower values of SPR(K), Max(K)-Min(K), Max(K)-Avg(K), SD(K)/Avg(K)) could have Kurtosis values that are larger than that of real-world networks whose degree distribution is scale-free in nature (characterized by larger values of SPR(K), Max(K)-Min(K), Max(K)-Avg(K), SD(K)/Avg(K)). We also observe the Kurtosis values of the betweenness centrality distributions of the real-world networks to be more likely the largest among the Kurtosis values with respect to the commonly studied centrality metrics.
Bridging Centrality: Identifying Bridging Nodes in Transportation NetworkEswar Publications
To identify the importance of node of a network, several centralities are used. Majority of these centrality measures are dominated by components' degree due to their nature of looking at networks’ topology. We propose a centrality to identification model, bridging centrality, based on information flow and topological aspects. We apply bridging centrality on real world networks including the transportation network and show that the nodes distinguished by bridging centrality are well located on the connecting positions between highly connected regions. Bridging centrality can discriminate bridging nodes, the nodes with more information flowed through them and locations between highly connected regions, while other centrality measures cannot.
An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distribut...ijitcs
The aim of this paper is develop a software module to test the connectivity of various odd-sized HRs and attempted to answer an open question whether the node connectivity of an odd-sized HR is equal to its degree. We attempted to answer this question by explicitly testing the node connectivity's of various oddsized HRs. In this paper, we also study the properties, constructions, and connectivity of hyper-rings. We usually use a graph to represent the architecture of an interconnection network, where nodes represent processors and edges represent communication links between pairs of processors. Although the number of edges in a hyper-ring is roughly twice that of a hypercube with the same number of nodes, the diameter and the connectivity of the hyper-ring are shorter and larger, respectively, than those of the corresponding hypercube. These properties are advantageous to hyper-ring as desirable interconnection networks. This paper discusses the reliability in hyper-ring. One of the major goals in network design is to find the best way to increase the system’s reliability. The reliability of a distributed system depends on the reliabilities of its communication links and computer elements
WEIGHTED DYNAMIC DISTRIBUTED CLUSTERING PROTOCOL FOR HETEROGENEOUS WIRELESS S...ijwmn
In wireless sensor networks (WSN), conserving energy and increasing lifetime of the network are a critical issue that has been addressed by substantial research works. The clustering technique has been proven particularly energy-efficient in WSN. The nodes form groups (clusters) that include one cluster head and member clusters. Cluster heads (CHs) are able to process, filter, gather the data sent by sensors
belonging to their cluster and send it to the base station. Many routing protocols which have been proposed are based on heterogeneity and use the clustering scheme such as SEP and DEEC. In this paper we introduce a new approach called WDDC in which cluster heads are chosen on the basis
of probability of ratio of residual energy and average energy of the network. It also takes into consideration distances between nodes and the base station to favor near nodes with more energy to be cluster heads. Furthermore, WDDC is dynamic; it divides network lifetime in two zones in which it changes its behavior. Simulation results show that our approach performs better than the other distributed clustering protocols such as SEP and DEEC in terms of energy efficiency and lifetime of the network.
Online Social Networks have become a prominent mode of communication and collaboration. Link Prediction is a major issue in Social Networks. Though ample methods are proposed to solve it, most of them take a static view of the network. Social Networks are dynamic in nature, this aspect has to be accounted. In this paper we propose a novel predictor LCF for Link Prediction in dynamic networks. In this method we view Social Networks as sequence of snapshots, each snapshot is the state of the network of a particular time period. Each edge of the network is assigned a weight based on its time stamp. We compute the LCF score for all node pairs in the network to predict the associations that may occur at a future time in the Social Network. We have also shown that our predictor outperforms the standard baseline methods for Link Prediction
Improved Performance of LEACH using Better CH Selection by Weighted Parametersijsrd.com
In recent era, the research for improving the performance of the WSN is done in the 'speed of light'. LEACH is the protocol which has changed the scenario of using WSN for any application like monitoring physical parameters, measuring parameters surveillance etc. Also LEACH-C can be used for the same with some modifications in LEACH like deciding CH centrally in fixed amount. But there is a con of LEACH; it decides the CH based on random generation value. Therefore, in proposed scheme, threshold is calculated using weighted parameter of residual energy and distance from the base station.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route planning of WSN exists a big localization error in wireless communication. WSN communication system is researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route planning of WSN is proposed. The performance of the node density and localization error is simulated and analyzed. The simulation results show that the performance of proposed WSN localization algorithm and route planning method are better than the traditional algorithms.
NONLINEAR MODELING AND ANALYSIS OF WSN NODE LOCALIZATION METHODijwmn
In this paper, node localization algorithms in wireless sensor networks are researched, the traditional
algorithms are studied, and some meaningful results are obtained. For the localization algorithm and route
planning of WSN exists a big localization error in wireless communication. WSN communication system is
researched. According to the anchor nodes and unknown nodes, a new localization algorithm and route
planning method of WSN are proposed in this paper. At the same time, a new genetic algorithm of route
planning of WSN is proposed. The performance of the node density and localization error is simulated and
analyzed. The simulation results show that the performance of proposed WSN localization algorithm and
route planning method are better than the traditional algorithms.
Vertex covering has important applications for wireless sensor networks such as monitoring link failures,
facility location, clustering, and data aggregation. In this study, we designed three algorithms for
constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the
Parnas & Ron’s algorithm, is a greedy approach that finds a vertex cover by using the degrees of the
nodes. The second algorithm finds a vertex cover from graph matching where Hoepman’s weighted
matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and then
constructs a vertex cover by selecting nodes with predefined levels from breadth-first tree. We show the
operation of the designed algorithms, analyze them, and provide the simulation results in the TOSSIM
environment. Finally we have implemented, compared and assessed all these approaches. The transmitted
message count of the first algorithm is smallest among other algorithms where the third algorithm has
turned out to be presenting the best results in vertex cover approximation ratio.
Transmission Time and Throughput analysis of EEE LEACH, LEACH and Direct Tran...acijjournal
This paper gives a brief description about some routing protocols like EEE LEACH, LEACH and Direct
Transmission protocol (DTx) in Wireless Sensor Network (WSN) and a comparison study of these
protocols based on some performance matrices. Addition to this an attempt is done to calculate their
transmission time and throughput. To calculate these, MATLAB environment is used. Finally, on the basis
of the obtained results from the simulation, the above mentioned three protocols are compared. The
comparison results show that, the EEE LEACH routing protocol has a greater transmission time than
LEACH and DTx protocol and with smaller throughput.
Solution for intra/inter-cluster event-reporting problem in cluster-based pro...IJECEIAES
In recent years, wireless sensor networks (WSNs) have been considered one of the important topics for researchers due to their wide applications in our life. Several researches have been conducted to improve WSNs performance and solve their issues. One of these issues is the energy limitation in WSNs since the source of energy in most WSNs is the battery. Accordingly, various protocols and techniques have been proposed with the intention of reducing power consumption of WSNs and lengthen their lifetime. Cluster-oriented routing protocols are one of the most effective categories of these protocols. In this article, we consider a major issue affecting the performance of this category of protocols, which we call the intra/inter-cluster event-reporting problem (IICERP). We demonstrate that IICERP severely reduces the performance of a cluster-oriented routing protocol, so we suggest an effective Solution for IICERP (SIICERP). To assess SIICERP’s performance, comprehensive simulations were performed to demonstrate the performance of several cluster-oriented protocols without and with SIICERP. Simulation results revealed that SIICERP substantially increases the performance of cluster-oriented routing protocols.
Lifetime centric load balancing mechanism in wireless sensor network based Io...IJECEIAES
Wireless sensor network (WSN) is a vital form of the underlying technology of the internet of things (IoT); WSN comprises several energy-constrained sensor nodes to monitor various physical parameters. Moreover, due to the energy constraint, load balancing plays a vital role considering the wireless sensor network as battery power. Although several clustering algorithms have been proposed for providing energy efficiency, there are chances of uneven load balancing and this causes the reduction in network lifetime as there exists inequality within the network. These scenarios occur due to the short lifetime of the cluster head. These cluster head (CH) are prime responsible for all the activity as it is also responsible for intra-cluster and inter-cluster communications. In this research work, a mechanism named lifetime centric load balancing mechanism (LCLBM) is developed that focuses on CH-selection, network design, and optimal CH distribution. Furthermore, under LCLBM, assistant cluster head (ACH) for balancing the load is developed. LCLBM is evaluated by considering the important metrics, such as energy consumption, communication overhead, number of failed nodes, and one-way delay. Further, evaluation is carried out by comparing with ES-Leach method, through the comparative analysis it is observed that the proposed model outperforms the existing model.
k fault tolerance Mobile Adhoc Network under Cost Constraintsugandhasinghhooda
A network topology is a K-FT topology if it can endure K number of link failures, however to find a reliable hardware topology for a set of nodes keeping the total cost of the links within a predefined budget, is a challenging task, especially when the topology is subjective to constraints that the topological network can tolerate K link failures keeping total cost of network within budget. This problem has been addressed in this paper where in a novel algorithm is proposed that uses N X N matrix to represent the cost between the participating nodes, and uses K-FT topology to tackle the fault tolerant problem of Mobile Adhoc Networks. Intention is to achieve optimal resource utilization and fairness among competing end to end flows. A network topology is said to be K-FT if and only if every pair of node is reachable from all other nodes for K link failures. The algorithm has been tested for wide range of node sets and the result obtained there of suggest that the proposed algorithm finds better solutions in comparison to Genetic Algorithm.
GRAPH ALGORITHM TO FIND CORE PERIPHERY STRUCTURES USING MUTUAL K-NEAREST NEIG...ijaia
Core periphery structures exist naturally in many complex networks in the real-world like social,
economic, biological and metabolic networks. Most of the existing research efforts focus on the
identification of a meso scale structure called community structure. Core periphery structures are another
equally important meso scale property in a graph that can help to gain deeper insights about the
relationships between different nodes. In this paper, we provide a definition of core periphery structures
suitable for weighted graphs. We further score and categorize these relationships into different types based
upon the density difference between the core and periphery nodes. Next, we propose an algorithm called
CP-MKNN (Core Periphery-Mutual K Nearest Neighbors) to extract core periphery structures from
weighted graphs using a heuristic node affinity measure called Mutual K-nearest neighbors (MKNN).
Using synthetic and real-world social and biological networks, we illustrate the effectiveness of developed
core periphery structures.
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...gerogepatton
Core periphery structures exist naturally in many complex networks in the real-world like social,
economic, biological and metabolic networks. Most of the existing research efforts focus on the
identification of a meso scale structure called community structure. Core periphery structures are another
equally important meso scale property in a graph that can help to gain deeper insights about the
relationships between different nodes. In this paper, we provide a definition of core periphery structures
suitable for weighted graphs. We further score and categorize these relationships into different types based
upon the density difference between the core and periphery nodes. Next, we propose an algorithm called
CP-MKNN (Core Periphery-Mutual K Nearest Neighbors) to extract core periphery structures from
weighted graphs using a heuristic node affinity measure called Mutual K-nearest neighbors (MKNN).
Using synthetic and real-world social and biological networks, we illustrate the effectiveness of developed
core periphery structures.
Graph Algorithm to Find Core Periphery Structures using Mutual K-nearest Neig...gerogepatton
Core periphery structures exist naturally in many complex networks in the real-world like social, economic, biological and metabolic networks. Most of the existing research efforts focus on the identification of a meso scale structure called community structure. Core periphery structures are another equally important meso scale property in a graph that can help to gain deeper insights about the relationships between different nodes. In this paper, we provide a definition of core periphery structures suitable for weighted graphs. We further score and categorize these relationships into different types based upon the density difference between the core and periphery nodes. Next, we propose an algorithm called CP-MKNN (Core Periphery-Mutual K Nearest Neighbors) to extract core periphery structures from weighted graphs using a heuristic node affinity measure called Mutual K-nearest neighbors (MKNN). Using synthetic and real-world social and biological networks, we illustrate the effectiveness of developed core periphery structures.
MULTI-HOP DISTRIBUTED ENERGY EFFICIENT HIERARCHICAL CLUSTERING SCHEME FOR HET...ijfcstjournal
Wireless sensor network (WSNs) are network of Sensor Nodes (SNs) with inherent sensing, processing and
communicating abilities. One of current concerns in wireless sensor networks is developing a stable
clustered heterogeneous protocol prolonging the network lifetime with minimum consumption of battery
power. In the recent times, many routing protocols have been proposed increasing the network lifetime,
stability in short proposing a reliable and robust routing protocol. In this paper we study the impact of
hierarchical clustered network with sensor nodes of two-level heterogeneity. The main approach in this
research is to develop an enhanced multi-hop DEEC routing protocol unlike DEEC. Simulation results
show the proposed protocol is better than DEEC in terms of FDN (First Dead Node), energy consumption
and Packet transmission.
Similar to ALTERNATIVES TO BETWEENNESS CENTRALITY: A MEASURE OF CORRELATION COEFFICIENT (20)
Welcome to TechSoup New Member Orientation and Q&A (May 2024).pdfTechSoup
In this webinar you will learn how your organization can access TechSoup's wide variety of product discount and donation programs. From hardware to software, we'll give you a tour of the tools available to help your nonprofit with productivity, collaboration, financial management, donor tracking, security, and more.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Unit 8 - Information and Communication Technology (Paper I).pdfThiyagu K
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
This is a presentation by Dada Robert in a Your Skill Boost masterclass organised by the Excellence Foundation for South Sudan (EFSS) on Saturday, the 25th and Sunday, the 26th of May 2024.
He discussed the concept of quality improvement, emphasizing its applicability to various aspects of life, including personal, project, and program improvements. He defined quality as doing the right thing at the right time in the right way to achieve the best possible results and discussed the concept of the "gap" between what we know and what we do, and how this gap represents the areas we need to improve. He explained the scientific approach to quality improvement, which involves systematic performance analysis, testing and learning, and implementing change ideas. He also highlighted the importance of client focus and a team approach to quality improvement.
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptxEduSkills OECD
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
2. 2 Computer Science & Information Technology (CS & IT)
BWC has been widely applied to a large number of complex network analyses. For instance, it
has been proposed as an indicator of the “interdisciplinary” nature of scientific journals [3]. In
general, BWC of the nodes in a network increases with connectivity as a power law with an
exponent η [4]. Thus, it is known to be computationally time consuming to obtain exact BWC:
O(nm) time for unweighted graphs and O(nm + n2
logn) time for weighted graphs, where n is the
number of vertices and m is the number of edges in the network [5][6][14]. In this paper, we
focus on analyzing the correlation between BWC and five well-known centrality measures,
including eigenvector centrality (EVC), degree centrality (DEG), clustering coefficient centrality
(CCC), farness centrality (FRC), and closeness centrality (CLC). Random network, small-world
network, and several real-world networks are involved in this paper.
2. COMPUTATION OF BETWEENNESS CENTRALITY
The computation of BWC in this paper follows the algorithm by Brandes (2001) [5]. If the
number of shortest paths between two nodes i and j that pass through node k as the intermediate
node is denoted as gij
k
and the total number of geodesic between the two nodes i and j is denoted
as gij, then the BWC for node k is defined as
Figure 1: Representative Example to Compute the Betweenness Centrality of the Vertices in a Network
The representative BWC calculation is illustrated in Figure 1. On the basis of the algorithm
proposed by Brandes (2001) [5], breadth-first search is involved in the computation. It is clear
3. Computer Science & Information Technology (CS & IT) 3
that BWC is different to degree-based ranking as shown in Figure 1. Nodes 3 and 4 have highest
degree in this present network; however, node 3 has highest BWC. Nodes 0, 1, 5, and 6 each has
a degree of 2, but with a BWC of 0.
3. CORRELATION ANALYSIS
3.1. Analysis on Random Networks
Firstly, random networks were simulated to investigate all the six centrality measures including
BWC, EVC, DEG, CCC, FRC, and CLC. In this section, networks with 100 nodes were
simulated. Particularly, the probability of linkage between nodes is varied from 0.05 to 0.9 to
evaluate above mentioned centrality measures. The probability of linkage is increased from 0.05
to 0.1 by 0.01; from 0.1 to 0.9 by 0.1. Representative random networks are shown in Figure 2
with a ranking factor of BWC. Correlation between BWC and other five measures, including
DEG, EVC, CCC, FRC, and CLC, was then determined. Average correlation coefficient value
was calculated based on 100 trials.
Figure 2: Simulation of Random Networks with Various Probability of Linkage Values
[Ranking Factor is Betweenness Centrality]
4. 4 Computer Science & Information Technology (CS & IT)
Figure 3: Correlation Coefficient between BWC and the other Five Centrality Measures: DEG, EVC, CCC,
FRC and CLC on Random Networks with Various Probability of Linkage Values
As shown in Figure 3, BWC is highly correlated to all measures except CCC. Our data suggests a
strong correlation between BWC and DEG, ranging from 0.9316 to 0.9513. The highest
correlation of BWC to FRC, CLC, and EVC reaches -0.9576, -0.9495, and 0.94, respectively. The
negative correlation indicates that an increase in one variable reliably predicts a decrease in the
other one. A high value in negative correlation still suggests high correlation. It is pretty sure that
we can select DEG, FRC, CLC, EVC as alternatives to BWC in random networks.
3.2. Analysis on Small-World Networks
We investigated on small-world networks evolved from regular network. Similar to random
network simulation, 100 nodes with a k-regular value (initial number of links per node) of 10 are
set for small-world network simulation. In this section, the probability of rewiring was varied
from 0.01 to 0.09 with increment of 0.01; and from 0.1 to 0.9 with increment of 0.1.
Representative small-world networks are shown in Figure 4 with a ranking factor of BWC.
Correlation between BWC and the other five measures, including DEG, EVC, CCC, FRC, and
CLC, was then calculated. Average correlation coefficient value was calculated based on 100
trials.
5. Computer Science & Information Technology (CS & IT) 5
Figure 4: Simulation of Small-World Networks with Various Probability of Rewiring Values
[Ranking Factor is Betweenness Centrality]
For small-world networks, there is a strong correlation between BWC and the other centrality
metrics, except EVC, at a probability of rewiring lower than 0.2. The correlation coefficient was
larger than 0.51 when the probability of rewiring reaches 0.2 for DEG, FRC, CLC, and CCC. The
highest correlation coefficient of BWC to DEG, FRC, and CLC reaches to 0.5325, -0.7499, and -
0.7348 at probability of rewiring of 0.08. The correlation between BWC and CCC decreases from
0.8131 to 0.0683 along with the increase of probability of rewiring.
In a previous work, a transformation between small-world network and random network was
revealed [15]. It was found that simulated network from a regular network would be small-world
network when the probability of rewiring is from 0.01 to 0.1; however, it changes to random
network when the probability of rewiring is between 0.1 and 1.0. In this study, we also observed a
clear turning point at probability of rewiring of 0.1 as shown in Figure 5. Overall, we could
6. 6 Computer Science & Information Technology (CS & IT)
preferably use CCC as alternative to BWC at probability of rewiring lower than 0.07. At a critical
probability of rewiring lower than 0.2, we still could use DEG, FRC, CLC, and CCC as
alternatives.
Figure 5: Correlation Coefficient between BWC and the other Five Centrality Measures, including DEG,
EVC, CCC, FRC and CLC, on Small-World Networks with Various Probability of Rewiring Values
3.3. Analysis on Real-World Networks
In order to evaluate the feasibility of applying the above mentioned candidate centrality metrics to
replace BWC practically, multiple real-world networks were also studied. Analysis on real-world
networks is crucial to understanding how BWC relates to other measures in real world. In this
study, nine real-world networks (see Figure 6) were analyzed. These are: Dolphins social network
(Dolphins), Word adjacency network of common adjectives and nouns in the novel David
Copperfield by Charles Dickens (WordAdj), Celegensmetabolic network representing the
metabolic network of C. elegans (Celegm), Celegensneural network representing the neural
network of C. elegans (Celegn), American football games network between Division IA colleges
during regular season Fall 2000 (Football), Karate Social network of friendships between 34
members of a karate club at a US university in the 1970 (Karate), LesMis Coappearance network
of characters in the novel Les Miserables (LesMis), the 1997 US Airports network (AirNet), and
Political books network (BookNet). Average correlation between BWC and other five measures,
including DEG, EVC, CCC, FRC, and CLC, was determined on 100 trials.
7. Computer Science & Information Technology (CS & IT) 7
Figure 6: Distribution of the Nodes in Real-World Networks
[Ranking Factor: Betweenness Centrality]
Figure 7: Correlation Coefficient between BWC and the other Five Centrality Measures, including DEG,
EVC, CCC, FRC and CLC on Real-World Networks
8. 8 Computer Science & Information Technology (CS & IT)
Unlike the random and small-world networks, the correlation of BWC to CLC and FRC is
relatively low with a correlation coefficient value less than 0.6 for five tested networks out of
nine (WordAdj, Celegm, Celegn, LesMis, and AirNet). Similarly, correlation coefficient between
BWC and EVC is also relatively low with a value less than 0.6 for five tested networks including
Dolphins, Football, LesMis, AirNet, and BookNet. Particularly, the correlation coefficient
between BWC and EVC on Football network only shows a value of 0.14. It is also similar to
BWC and DEG with a correlation coefficient of 0.28 on Football network. Notably, the
correlation coefficient between BWC and CCC is lower than 0.6 on all tested networks. It is
noteworthy that BWC correlates well with DEG on all but Football network. On Football
network, BWC has a high correlation with FRC and CLC
4. RELATED WORK
Recently, Meghanathan (2016) proposed a hybrid centrality metric (takes both the degree and the
shortest paths into account) called the local clustering coefficient-based degree centrality
(LCCDC) [10]. The local clustering coefficient (LCC) of a vertex is a measure of the probability
that any two neighbors of the vertex are connected. If a vertex has a larger LCC value, then the
neighbors of the vertex can directly communicate with each other rather than going through the
particular vertex. If the neighbors of a vertex do not need go through the vertex for shortest path
communication, then it is more likely that the rest of the vertices in the network would not need
to go through the vertex for shortest path communication. If a vertex has a smaller LCC, then the
neighbors of the vertex are more likely to go through the vertex for shortest path communication
between themselves (as there is more likely not a direct edge between the two neighbors, because
of the low LCC for the vertex). More specifically, if a vertex has a low LCC and a high degree,
then several of the neighbors of the vertex (and as a result, several of the two-hop, three-hop
neighbors and so on) are more likely to go through the vertex for shortest path communication.
Such vertices are expected to have a higher BWC. The LCCDC metric captures such high BWC
vertices (with a strongly positive correlation) and could be used to rank the vertices in a graph in
lieu of the BWC. Since the strongly positive correlation between BWC and LCCDC has been
already studied in [10], in this paper, we explore any of the other well-known centrality metrics
exhibit a strong correlation with BWC.
There are some other algorithms proposed to further develop the application of BWC. For
instance, the random-walk betweenness measure calculated for all vertices in a network in worst-
case time O((m+n)n2
) using matrix methods [8]. Others such as bounded-distance betweenness
[9], distance-scaled betweenness [9], edge betweenness [11] and group betweenness [12] are also
introduced. Alternatively, an approximation computation of BWC of a given vertex with an
adaptive sampling technique is discussed in the paper by Bader et al (2007) [7]. Nevertheless, the
computation cost of these betweenness measures is still high. It is more feasible if we could find
another centrality measure with low computation cost that is highly correlated to BWC. It was
shown that the BWC is related to the degree in social networks [13] and scale-free network [14].
However, there still lacks substantial support on the alternatives to BWC.
BWC measures the interrelationships among vertices. The results of our simulation studies
suggest that BWC is highly correlated to DEG on most tested networks. Leydesdorff (2007) [3]
also observed high correlation between BWC and DEG with a correlation coefficient value of
0.724 on Journal Citing Social Networks. Recently, Pozzi et al (2013) [16] observed a strong
correlation of the centrality indices between unweighted BWC and DEG calculated on Planar
9. Computer Science & Information Technology (CS & IT) 9
Maximally Filtered Graphs (PMFG) with a value of 0.97. There is also a moderate correlation
between BWC and CLC papered with a value of 0.54 [3]. CLC refers to the relatedness among a
set of vertices, providing a global measure of relationships among all vertices. A good correlation
between BWC and CLC is valuable when it comes to a connection between global and local
view.
5. CONCLUSIONS
In this paper, we analyzed the six commonly studied centrality measures on random networks,
small-world networks, and multiple real-world networks. A clear correlation of BWC to DEG is
shown on most tested networks. It is safe to conclude that there is a strong correlation between
BWC and DEG. In addition, FRC, CLC and EVC can also serve as alternatives to BWC in
random network. For small-world networks, DEG, FRC, CLC and CCC could be preferably used
as alternative to BWC at probability of rewiring lower than 0.2. Unlike the random and small-
world networks, BWC is relatively less correlated to CLC and FRC on five tested real-world
networks out of nine. DEG still is one of the best alternatives to BWC on real-world networks. In
conclusion, we have found the computationally-cheap DEG as a good candidate to replace
computationally-expensive BWC on most occasions.
REFERENCES
[1] L. C. Freeman, "A Set of Measures of Centrality based on Betweenness," Sociometry, vol. 40, no. 1,
pp. 35-41, March 1977.
[2] J. M. Anthonisse, "The Rush in a Directed Graph," Stichting Mathematisch Centrum. Mathemaatische
Besliskunde (BN 9/71), pp. 1-10, 1971.
[3] L. Leydesdorff, "Betweenness Centrality as an Indicator of the Interdisciplinarity of Scientific
Journals," Journal of the American Society for Information Science and Technology, vol. 58, no. 9,
pp. 1303-1319, 2007.
[4] M. Barthelemy, "Betweenness Centrality in Large Complex Networks," European Physical Journal B,
vol. 38, pp. 163-168, 2004.
[5] U. Brandes, "A Faster Algorithm for Betweenness Centrality," The Journal of Mathematical
Sociology, vol. 25, no. 2, pp. 163-177, 2001.
[6] M. E. J. Newman, "Scientific Collaboration Networks. II. Shortest Paths, Weighted Networks, and
Centrality," Physical Review E, vol. 64, 016132, June 2001.
[7] D. Bader, S. Kintali, K. Madduri and M. Mihail, "Approximating Betweenness Centrality,"
Algorithms and Models for the Web-Graph, Lecture Notes in Computer Science, vol. 4863, pp. 124-
137, 2007.
[8] M. E. J. Newman, "A Measure of Betweenness Centrality based on Random Walks," Social
Networks, vol. 27, pp. 39-54, 2005.
[9] S. P. Borgatti and M. G. Everett, "A Graph-Theoretic Perspective on Centrality," Social Networks,
vol. 28, no. 4, pp. 466-484, October 2006.
10. 10 Computer Science & Information Technology (CS & IT)
[10] N. Meghanathan, "A computationally lightweight and localized centrality metric in lieu of
betweenness centrality for complex network analysis," Vietnam Journal of Computer Science, pp. 1-
16, June 2016.
[11] M. E. J. Newman and M. Girvan, "Finding and Evaluating Community Structure in Networks,"
Physical Review E, vol. 69, 026113, February 2004.
[12] M. G. Everett and S. P. Borgatti, "The Centrality of Groups and Classes," The Journal of
Mathematical Sociology, vol. 23, no. 9, pp. 181-201, 1999.
[13] K-I. Goh, E. Oh, B. Kahng and D. Kim, "Betweenness Centrality Correlation in Social Networks,"
Physical Review E, vol. 67, 017101, January 2003.
[14] K-I. Goh, B. Kahng and D. Kim, "Universal Behavior of Load Distribution in Scale-Free Networks,"
Physical Review Letters, vol. 87, 278701, December 2001.
[15] N. Meghanathan, "Distribution of Maximal Clique Size under the Watts-Strogatz Model of Evolution
of Complex Networks," International Journal in Foundations of Computer Science and Technology,
vol. 5, no. 3, pp. 1-12, May 2015.
[16] F. Pozzi, T. D. Matteo and T. Aste, "Spread of Risk across Financial Markets: Better to Invest in te
Peripheries," Scientific Reports, vol. 3, no. 1665, 2013.