Topology Discovery in Wireless Networks Via Spatial Graph Entropy

Abstract

All primary objectives were met. The primary contributions generated within this project are summarized in new entropy bounds for directed and asymptotically connected graphs. Crucially, the bounds on the structural entropy in one dimensional networks point to a very simple compression scheme with encoding that is linear in the number of nodes. For (quasi-) one-dimensional networks, such as convoys, one may use this encoding scheme to propagate information about the topological structure of the network quickly and efficiently to all devices in a time period that grows linearly with the size of the network.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 26, 2021
Accession Number
AD1187766

Entities

People

  • Justin Coon

Organizations

  • University of Oxford

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Coding
  • Communication Channels
  • Communication Systems
  • Covid-19
  • Data Compression
  • Electronic Mail
  • Global Communications
  • Hidden Markov Models
  • Information Theory
  • Markov Models
  • Mesh Networks
  • Mobile Ad Hoc Networks
  • Network Topology
  • Networks
  • Probability
  • Probability Distributions
  • Random Variables
  • Spatial Distribution
  • Topology
  • Two Dimensional
  • Wireless Communications
  • Wireless Networks

Readers

  • Distributed Systems and Data Platform Development
  • Finite Element Method (FEM) for solving Partial Differential Equations (PDEs)
  • Theoretical Analysis.