The Thinnest Path Problem

  title={The Thinnest Path Problem},
  author={Jianhang Gao and Qing Zhao and Ananthram Swami},
  journal={IEEE/ACM Transactions on Networking},
We formulate and study the thinnest path problem for secure communication in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of nodes overhearing the message by a judicious choice of relaying nodes and their corresponding transmission powers. We adopt a directed hypergraph model of the problem and establish the NP-completeness of the problem in 2-D networks. We then develop two polynomial-time approximation algorithms… 
Efficient Approximations for Thinnest Path Problem in Grid Graph
This paper defines a new concept of "shortest thinnest path (STP)", and proposes a novel design named Pseudo-Dijkstra algorithm based on STP, which yields an optimal solution while scarifies time-complexity.
A Thinner Thinnest Path Using Directional Transmissions in a Network
  • Raymond Moberly
  • Computer Science
    MILCOM 2013 - 2013 IEEE Military Communications Conference
  • 2013
The thinnest path is defined herein as the route that minimizes the number of nodes within receiving range of a set of transmitting nodes, where the transmitting nodes act so as to relay a message
Optimal Decomposition for Large-Scale Infrastructure-Based Wireless Networks
  • L. Dai, B. Bai
  • Computer Science
    IEEE Transactions on Wireless Communications
  • 2017
This paper starts from a novel bipartite graph representation of an infrastructure-based wireless network and shows that in general the optimal network decomposition can be formulated as a graph partitioning problem, and proposes a binary search based spectral relaxation (BSSR) algorithm to solve it in two loops.
Scheduling for Time-Constrained Big-File Transfer Over Multiple Paths in Cloud Computing
This paper proposes a heuristic algorithm MFTS-H with dynamic reconfiguration scheme for addressing the transfer scheduling problem for multiple concurrent files and demonstrates that the proposed algorithm can efficiently support multiple file transfer over multiple paths in terms of delay and bandwidth utilization.


Secluded Connectivity Problems
It is shown that on unweighted undirected n-node graphs, the problem of finding the minimum exposure path connecting a given pair of vertices is strongly inapproximable, but is approximable with ratio \(\sqrt{\Delta }+3\), where Δ is the maximum degree in the graph.
A robust interference model for wireless ad-hoc networks
This paper presents a receiver-centric interference model featuring two main advantages over previous work: first, it reflects the fact that interference occurs at the intended receiver of a message, and second, the presented interference measure is robust with respect to addition or removal of single network nodes.
Minimizing Interference of a Wireless Ad-Hoc Network in a Plane
A method based on quad-tree decomposition and bucketing is given that has another provable interference bound in terms of the ratio of the minimum distance to the radius of a uniform-radius ad-hoc network.
Dynamic Shortest Path Algorithms for Hypergraphs
These two algorithms are the first to address the fully dynamic shortest path problem in a general hypergraph and complement each other by partitioning the application space based on the nature of the change dynamics and the type of the hypergraph.
Optimal Traversal of Directed Hypergraphs
This paper considers the problem of nding minimal hyperpaths according to several measures and describes eecient algorithms and data structures which can be used with any value-based measure function, since it appears in parametric form.
Graphs and Hypergraphs
Independence densities of hypergraphs We consider the number of independent sets in hypergraphs, which allows us to define the independence density of countable hypergraphs. Hypergraph independence
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
A new low-degree-test is introduced, one that uses the restriction of low- degree polynomials to planes rather than the restriction to lines, and enables us to prove a low-error characterization of NP in terms of PCP.
Beyond graphs: Capturing groups in networks
It is shown that a number of problems within social and communications networks such as network-wide broadcast and collaborative teams can be elegantly captured using simplicial complexes in a way that is not possible with graphs.
Dynamic Maintenance of Directed Hypergraphs