# US 2013/0254355 A9 · Identification of the location of nodes distributed in ad hoc networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2013/0254355 A9
- Document ID: US20130254355A9
- Status: Published application
- Kind: A9
- Application number: 13/162,704
- Filed: 2011-06-17
- Published: 2013-09-26
- Earliest claimed: 2006-02-17
- Assignees: Honeywell International Inc.
- Inventors: Atish Datta Chowdhury; Koushik Sinha
- Web page: https://patentgrep.com/patent/US20130254355A9

## CPC

- H04L 41/12: Discovery or management of network topologies
- Y04S 40/00: Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- Y04S: SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS

## Abstract

A location of node i in a network having a plurality of nodes is identified by intersecting regions that are guaranteed to contain the node i with respect the other nodes that are neighbors of the node i and iteratively minimizing the size of the intersection region containing the node i.

## Claims

### Claim 1

A method of identifying a location of a first node in a network having a plurality of nodes comprising:
receiving a location of a region that is guaranteed to contain the first node, wherein the receiving of a location of a region that is guaranteed to contain the first node comprises receiving a region of a second node that was extended by a measured range value rij, wherein the second node is within the transmission range of the first node, and wherein rij is based on a range between first and second nodes;
determining a region of residence of the first node based on the region that is guaranteed to contain the first node, wherein the region of residence has a size; and,
iteratively minimizing the size of the region of residence of the first node.

### Claim 2 (depends on 1)

The method of claim 1 wherein the iteratively minimizing of the size of the region of residence of the first node terminates when the minimum region of residence of the first node is not improved as a result of an iteration.

### Claim 3 (depends on 1)

The method of claim 1 wherein the determining of the region of residence of the first node comprises determining a minimum region of residence of the first node based on a viewed region of residence of the first node and a previously determined minimum region of residence of the first node.

### Claim 4 (depends on 3)

The method of claim 3 wherein the iteratively minimizing of the size of the region of residence of the first node terminates when the minimum region of residence of the first node is not improved as a result of an iteration.

### Claim 5

(canceled)

### Claim 6 (depends on 1)

The method of claim 1 wherein the iteratively minimizing of the size of the region of residence of the first node comprises: determining a region of residence of a third node in the view of the first node, wherein the third node is within a transmission range of the first node; and,
transmitting to the third node the region of residence of the third node in the view of the first node.

### Claim 7 (depends on 6)

The method of claim 6 wherein the iteratively minimizing of the size of the region of residence of the first node terminates when the minimum region of residence of the first node is not improved as a result of an iteration.

### Claim 8 (depends on 6)

The method of claim 6 wherein the determining of the region of residence of the first node comprises determining a minimum region of residence of the first node based on a viewed region of residence of the first node and a previously determined minimum region of residence of the first node.

### Claim 9 (depends on 8)

The method of claim 8 wherein the iteratively minimizing of the size of the region of residence of the first node terminates when the minimum region of residence of the first node is not improved as a result of an iteration.

### Claim at position 10

10-20. (canceled)