Optimal best-case and worst-case coverage for straight paths in ad hoc networks
Yung-Tsung Hou · Journal of Information and Optimization Sciences · 2019
Given a set of network nodes and their locations, the best support path problem is to find a path that has the min-max distance to network nodes and the maximal breach path problem is to find a path that has the max-min distance to network nodes. This paper considers straight paths and proposes optimal algorithms identifying both the best support and the maximal breach straight paths. Our study provides a coverage measurement method for straight paths in an ad hoc network. Based on computational geometry and graph theory, we propose plane-sweep algorithms to find the optimal straight paths for both the best-case and worst-case coverage problems in polynomial time. Mathematical analysis and simulations are used to prove the optimality of proposed algorithms.