Geographic routing

Patent metadata

Field	Value
Publication number	US-2022014462-A1
Application number	US-202117484102-A
Country	US
Kind code	A1
Filing date	Sep 24, 2021
Priority date	Sep 24, 2021
Publication date	Jan 13, 2022
Grant date	—

Abstract

System and techniques for geographic routing are described herein. A node receives a data packet that includes map data, a sequence of geographic areas to a requestor, and a target geographic area. The node may then determine that it is within the target geographic area and start a transmit timer based on a next-hop geographic area. Here, the next-hop geographic area is determined from the sequence of geographic areas in the data packet. The node may then counts how many other nodes from the geographic area sent data packets while the transmit timer is running. When the transmit timer expires, the node may transmit a modified data packet when the number of data packets is less than a predefined threshold. Here, the modified data packet is the data packet updated to include local map data and the next-hop geographic area.

First claim

1 . A node comprising:
a memory including instructions; and processing circuitry that, when in operation, is configured by the instructions to:
receive a data packet, the data packet including map data, a sequence of geographic areas to a requestor, and a target geographic area;
determine that the node is within the target geographic area;
start a transmit timer based on a next-hop geographic area, the next-hop geographic area determined from the sequence of geographic areas in the data packet;
count, during the transmit timer, a number of data packets received from the target geographic area that match to the data packet to determine that the number of data packets is less than a predefined threshold; and
transmit a modified data packet in response to expiration of the transmit timer and the number of data packets is less than the predefined threshold, the modified data packet being the data packet modified such that the map data is updated with map data from the node for the target geographic area and the target geographic area is by the next-hop geographic area to specify a new target geographic area.

2 . The node of claim 1 , wherein the instructions configure the processing circuitry to update the map data from the node with the map data of the data packet.

3 . The node of claim 1 , wherein the data packet is in response to an interest packet originating from the requestor, the interest packet specifying a request by the requestor.

4 . The node of claim 3 , wherein the data packet is one of two types, a first type including a response to the request, and a second type does not include a response to the request.

5 . The node of claim 4 , wherein the data packet is of the second type, and wherein the modified data packet includes an aggregation of map data from data packets of the second type received over a predefined period of time.

6 . The node of claim 3 , wherein the instructions configure the processing circuitry to:
receive the interest packet, the interest packet including the sequence of geographic areas to the requestor; start a random timer; count, during the random timer, a number of interest packets received from the target geographic area that match the interest packet to determine that a number of interest packets is less than a second predefined threshold; and transmit a modified interest packet in response to expiration of the random timer and the number of interest packets is less that the second predefined threshold, the modified interest being the interest packet modified such that the target geographic area is added to the sequence of geographic areas back to the requestor.

7 . The node of claim 1 , wherein, to start the transmit timer based on a next-hop geographic area, the processing circuitry calculates a geographic component of time based on a proximity of the node to the next-hop geographic area, wherein the geographic component of time is smaller when the node is closer to the next-hop geographic area.

8 . The node of claim 7 , wherein, to calculate the geographic component of time, the processing circuitry:
determines a first vector from a center of the target geographic area to a center of the next-hop geographic area; determines a second vector from the center of the next-hop geographic area towards a center of a next-two-hop geographic area; adds the first vector and the second vector to produce a third vector; determines a fourth vector from the center of the target geographic area to the node; projects the fourth vector onto the third vector to produce a fifth vector; and sets the geographic component of time based on a magnitude of the fifth vector.

9 . At least one non-transitory machine readable medium including instructions that, when executed by processing circuitry, cause the processing circuitry to perform operations comprising:
receiving, at a node, a data packet, the data packet including map data, a sequence of geographic areas to a requestor, and a target geographic area; determining that the node is within the target geographic area; starting a transmit timer based on a next-hop geographic area, the next-hop geographic area determined from the sequence of geographic areas in the data packet; counting, during the transmit timer, a number of data packets received from the target geographic area that match to the data packet to determine that the number of data packets is less than a predefined threshold; and transmitting a modified data packet in response to expiration of the transmit timer and the number of data packets is less than the predefined threshold, the modified data packet being the data packet modified such that the map data is updated with map data from the node for the target geographic area and the target geographic area is by the next-hop geographic area to specify a new target geographic area.

10 . The at least one machine readable medium of claim 9 , wherein the operations comprise updating the map data from the node with the map data of the data packet.

11 . The at least one machine readable medium of claim 9 , wherein the data packet is in response to an interest packet originating from the requestor, the interest packet specifying a request by the requestor.

12 . The at least one machine readable medium of claim 11 , wherein the data packet is one of two types, a first type including a response to the request, and a second type does not include a response to the request.

13 . The at least one machine readable medium of claim 12 , wherein the data packet is of the second type, and wherein the modified data packet includes an aggregation of map data from data packets of the second type received over a predefined period of time.

14 . The at least one machine readable medium of claim 11 , wherein the operations comprise:
receiving the interest packet, the interest packet including the sequence of geographic areas to the requestor; starting a random timer; counting, during the random timer, a number of interest packets received from the target geographic area that match the interest packet to determine that a number of interest packets is less than a second predefined threshold; and transmitting a modified interest packet in response to expiration of the random timer and the number of interest packets is less that the second predefined threshold, the modified interest being the interest packet modified such that the target geographic area is added to the sequence of geographic areas back to the requestor.

15 . The at least one machine readable medium of claim 14 , wherein the operations comprise updating map data of the node with the map data in the interest packet.

16 . The at least one machine readable medium of claim 9 , wherein geographic areas have a predefined addressing.

17 . The at least one machine readable medium of claim 9 , wherein an address is arranged in a grid in a two-dimensional plane, the address include a first identifier for a row and a second identifier for a column in the grid.

18 . The at least one machine readable medium of claim 17 , wherein cells of the grid are sized based on a radio frequency environment for the cell.

19 . The at least one machine readable medium of claim 18 , wherein the cells are sized such that a transmission from a first cell will reach an entirety of a neighbor cell under normal conditions.

20 . The at least one machine readable medium of claim 17 , wherein the address includes a third indicator for a layer, the layer being another two dimensional at a

Assignees

• Feng Hao
• Srikanteswara Srikathyayani
• Zhang Yi
• Jha Satish Chandra
• Alam S M Iftekharul
• Spoczynski Marcin
• Bachmutsky Alexander
• Himayat Nageen
• Smith Ned M
• Doshi Kshitij Arun
• Guim Bernat Francesc

Inventors

• Feng Hao
• Srikanteswara Srikathyayani
• Zhang Yi
• Jha Satish Chandra
• Alam S M Iftekharul
• Spoczynski Marcin
• Bachmutsky Alexander
• Himayat Nageen
• Smith Ned M
• Doshi Kshitij Arun
• Guim Bernat Francesc

Classifications

• H04W4/021

  Services related to particular areas, e.g. point of interest [POI] services, venue services or geofences · CPC title

• H04W4/46

  for vehicle-to-vehicle communication [V2V] · CPC title

• H04W40/026

  Route selection considering the moving speed of individual devices · CPC title

• H04W40/20

  based on geographic position or location · CPC title

• H04W40/22

  using selective relaying for reaching a BTS [Base Transceiver Station] or an access point · CPC title