Algebraic Connectivity-Based Stable Data Gathering Trees for Mobile Sensor Networks

We propose the use of a graph-theoretic metric called Algebraic Connectivity (ALGC) computed on the egocentric network of an edge to quantify the extent of shared neighborhood between the end vertices of the edge/link in mobile sensor networks (MSNs). The chances for the egocentric network of an edge to stay connected increases with increase in the number of triangles involving the end vertices of the edge and their shared neighbors. We claim that edges whose egocentric network have a larger ALGC score are more likely to be short distance links and show that such links could be considered for inclusion to be part of stable data gathering trees for MSNs.