DISTRIBUTED FIBER OPTIC SENSOR PLACEMENT

    公开(公告)号:US20220321219A1

    公开(公告)日:2022-10-06

    申请号:US17713171

    申请日:2022-04-04

    Abstract: A procedure to solve the DFOS placement problem that uses a genetic algorithm to achieve a global optimization of sensor placement. First, our procedure according to aspects of the present disclosure defines a fitness function that counts the number of DFOS sensors used. Second, the procedure uses a valid DFOS placement assignment to model an individual in the genetic algorithm. Each individual consists of N genes, where N is the number of nodes in the given network infrastructure, e.g., N=|V|. Each gene has two genomes: (1) a list of 0s and/or 1s, in which is represent the network nodes that are equipped with DFOS sensors, and 0s represent the nodes that are not equipped with DFOS sensors; (2) a list of sensing fiber routes. An individual that has smallest number of is in their genes will be considered as the strongest individual. Thirdly, the procedure randomly generates a population of individuals. After a certain number of generations of population, the strongest individual in the last generation will be the global optima for the DFOS placement assignment.

    CONCURRENT SENSING DISTRIBUTED FIBER OPTIC SENSOR PLACEMENT

    公开(公告)号:US20220263579A1

    公开(公告)日:2022-08-18

    申请号:US17580572

    申请日:2022-01-20

    Abstract: Aspects of the present disclosure describe a method of placement of sensors for DFOS systems, methods, and structures that advantageously employ concurrent sensing. In sharp contrast to the prior art, our inventive method—a heuristic method based on the Explore-and-Pick (EnP) algorithm, which we call a modified EnP (mEnP) method—includes two procedures. The first procedure of our mEnP method explores all possible sensing fiber routes (both linear and star-like routes) for each node in the given network. The second procedure applies a modified greedy algorithm for minimum set cover to select the minimum set of DFOS assignment to fully cover all the links in the given network.

Patent Agency Ranking