Network Topology Mapping from Partial Virtual Coordinates and Graph Geodesics

12/28/2017
by   Anura P. Jayasumana, et al.
0

For many important network types (e.g., sensor networks in complex harsh environments and social networks) physical coordinate systems (e.g., Cartesian), and physical distances (e.g., Euclidean), are either difficult to discern or inappropriate. Accordingly, Topology Preserving Maps (TPMs) derived from a Virtual-Coordinate (VC) system representing the distance to a small set of anchors is an attractive alternative to physical coordinates for many network algorithms. Herein, we present an approach, based on the theory of low-rank matrix completion, to recover geometric properties of a network with only partial information about the VCs of nodes. In particular, our approach is a combination of geodesic recovery concepts and low-rank matrix completion, generalized to the case of hop-distances in graphs. Distortion evaluated using the change of distance among node pairs shows that even with up to 40 of random coordinates missing, accurate TPMs can be obtained. TPM generation can now also be based on different context appropriate VC systems or measurements as long as they characterize each node with distances to a small set of random nodes (instead of a global set of anchors). The proposed method is a significant generalization that allows the topology to be extracted from a random set of graph geodesics, making it applicable in contexts such as social networks where VC generation may not be possible.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2020

Inverse Kinematics as Low-Rank Euclidean Distance Matrix Completion

The majority of inverse kinematics (IK) algorithms search for solutions ...
research
06/06/2021

A Pre-training Oracle for Predicting Distances in Social Networks

In this paper, we propose a novel method to make distance predictions in...
research
04/30/2018

Maximum Likelihood Coordinate Systems for Wireless Sensor Networks: from physical coordinates to topology coordinates

Many WSN protocols require the location coordinates of the sensor nodes,...
research
11/30/2018

Localization from Incomplete Euclidean Distance Matrix: Performance Analysis for the SVD-MDS Approach

Localizing a cloud of points from noisy measurements of a subset of pair...
research
10/29/2021

Efficient Map Prediction via Low-Rank Matrix Completion

In many autonomous mapping tasks, the maps cannot be accurately construc...
research
01/28/2016

Log-Normal Matrix Completion for Large Scale Link Prediction

The ubiquitous proliferation of online social networks has led to the wi...
research
06/24/2019

On Uniquely Registrable Networks

Consider a network with N nodes in d-dimensional Euclidean space, and M ...

Please sign up or login with your details

Forgot password? Click here to reset