The Thinnest Path Problem
CALIFORNIA UNIV DAVIS DEPT OF ELECTRICAL AND COMPUTER ENGINEERING
Pagination or Media Count:
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.
- Non-Radio Communications