The Thinnest Path Problem

Abstract

We consider the thinnest path problem for secure communication in wireless ad hoc networks. For a given source and a destination, the thinnest path problem asks for a path from the source to the destination that results in the minimum number of nodes hearing the message. Such a path is achieved by carefully choosing a sequence of relaying nodes and their corresponding transmission powers.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Oct 01, 2013
Accession Number
ADA591976

Entities

People

  • Ananthram Swami
  • Jianhang Gao
  • Qing Zhao

Organizations

  • University of California

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Ad Hoc Networks
  • Algorithms
  • Computational Complexity
  • Construction
  • Geometry
  • Inequalities
  • Information Operations
  • Mesh Networks
  • Military Research
  • Networks
  • Polynomials
  • Secure Communications
  • Sequences
  • Three Dimensional
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computer Networking