IP Library Granted Patent US 12,028,110
Granted Patent B2
US 12,028,110 · App. 17/713,171 · Granted Jul 2, 2024

Distributed fiber optic sensor placement

Inventors: Philip Ji (Cranbury, NJ); Ting Wang (West Windsor, NJ); Zilong Ye (LaVerne, CA)
Assignee: NEC Corporation
H04B10/27H04Q11/0062H04Q2011/009
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,028,110
App. No.
17/713,171
Granted
Jul 2, 2024
Kind
B2
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.

Claims (14)

1. A computer implemented method for determining distributed fiber optic sensing (DFOS) sensor placement in an optical network including a plurality of nodes interconnected via a plurality of optical links, the method comprising:

by the computer:

initialize an assignment list as empty and an uncovered list as containing all the optical links in graph G(V,E) where G is the graph, Vis a set of vertices, and E is a set of paired vertices;

if uncovered is not empty

1) Randomly select a node s from V to place a DFOS sensor fiber;

2) randomly select a neighbor node d of s that is within a sensing range limit R to place a DFOS sensor fiber terminator;

3) remove all optical links that are traveled through by a shortest path between s and d from uncovered;

2) Add s and the shortest path from s to d to assignment;

repeat 1-4 if uncovered is not empty, else return assignment; and

output an indicia of the assignment as a location in the optical network at which a DFOS sensor fiber is to be placed;

wherein the assignment list includes an identification of assignment of DFOS sensor fiber placement, sensing route, and sensing range of a sensor fiber; and

wherein the assignment list includes increased birefringence of the optical fiber is increased with respect to its average magnitude.

2. The computer implemented method of claim 1 FURTHER CHARACTERIZED BY a genetic algorithm for determining strongest individuals, wherein such strongest individuals each represent a location in the graph at which to place a DFOS sensor.

3. The computer implemented method of claim 2 FURTHER CHARACTERIZED BY determining strongest individuals over three generations, wherein the strongest individuals of the 3 rd generation represent locations in the graph at which to place a DFOS sensor.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 28, 2024
From: NEC LABORATORIES AMERICA, INC.
To: NEC CORPORATION
Reel/Frame 067535/0623 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 4, 2022
From: JI, PHILIP; WANG, TING; YE, ZILONG
To: NEC LABORATORIES AMERICA, INC.
Reel/Frame 059494/0908 →
Continuity (2)
Provisional Application 63170646 · Apr 5, 2021
Related Publication 20220321219A1 · Oct 6, 2022