Determining the inline relationship of network nodes in a subterranean survey data acquistion network
AssigneeWesternGeco L.L.C.
InventorsEspen Gulbransen, Vidar Anders Husom
Life of this patent
Estimating the term…
Abstract
A system includes a subterranean survey data acquisition network and a processor. The network has first nodes that are distributed along a length of the network between a first end of the network and a second end of the network. Each of the first nodes is capable of being either in a state in which the first node is transparent to the network or in a state in which the first node is visible to the network. The processor is adapted to communicate with the closest visible first node relative to the first end, and the processor is adapted to, based on the communication, determine whether the closest visible first node is the closest first node of all of the first nodes relative to the first end.
Claims26
A method usable with a subterranean survey data acquisition network having first nodes distributed along a length of the network between a first end of the network and a second end of the network, and each of the first nodes capable of being either in a state in which the first node is transparent to the network or in a state in which the first node is visible to the network, the method comprising:
- communicating with the closest visible first node relative to the first end, the communication comprising information indicative of a relationship of the closest visible first node relative to at least one of the other first nodes;
- and
- based on the communication, determining whether the closest visible first node is the closest first node of all of the first nodes relative to the first end.
A system comprising:
- a subterranean survey data acquisition network having first nodes distributed along a length of the network between a first end of the network and a second end of the network, each of the first nodes capable of being either in a state in which the first node is transparent to the network or in a state in which the first node is visible to the network;
- and
- a processor adapted to:
- communicate with the closest visible first node relative to the first end, the communication comprising information indicative of a relationship of the closest visible first node relative to at least one of the other first nodes;
- and
- based on the communication, determine whether the closest visible first node is the closest first node of all of the first nodes relative to the first end.
Dependencies are inferred from the claim text.