Network Sum Power Interference at an External Node

Abstract

The purpose of this work is to connect nodes to form a connected ad hoc network, while trying to limit the interference to a node or device that is external to the network caused by the emitted power required to make such network connections. Specifically, we consider a case where the interference at the external node cannot exceed some power threshold, and the goal is to connect as many nodes to form a tree without exceeding the threshold. In this formulation, the cost to connect a pair of nodes is the sum of the interference caused by transmitting in each direction. We call this the Largest Constrained Tree (LCT) problem. We first prove that this problem is NP-complete, and then we formulate it as a mixed integer linear program to be solved computationally. We consider two different cost metrics, for the cases where there is information about the external node(s) location and when there is not. We generate Monte Carlo simulation results for various network sizes, node densities, external node distances, and network activity levels.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 06, 2020
Accession Number
AD1114565

Entities

People

  • Caleb Z Bowers
  • Clement Kam
  • Joseph P. MacKer
  • Sastry Kompella

Organizations

  • United States Naval Research Laboratory

Tags

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Algorithms
  • Communication Systems
  • Computational Science
  • Cost Models
  • Energy Efficiency
  • Linear Programming
  • Load Monitoring
  • Mesh Networks
  • Monte Carlo Method
  • Network Topology
  • Networks
  • Optimization
  • Simulations
  • Throughput
  • Topology
  • Wireless Networks

Fields of Study

  • Computer science

Readers

  • Electronics Engineering
  • Mathematical Modeling and Probability Theory.
  • Neural Network Machine Learning.