Accession Number:

ADA591976

Title:

The Thinnest Path Problem

Descriptive Note:

Corporate Author:

CALIFORNIA UNIV DAVIS DEPT OF ELECTRICAL AND COMPUTER ENGINEERING

Report Date:

2013-10-01

Pagination or Media Count:

15.0

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.

Subject Categories:

  • Non-Radio Communications

Distribution Statement:

APPROVED FOR PUBLIC RELEASE