IP Library Granted Patent US 12,332,367
Granted Patent B2
US 12,332,367 · App. 17/940,898 · Granted Jun 17, 2025

System and method using passive spatial awareness for GEO network routing

Inventors: Tj T. Kwon (Marion, IA); William B. Sorsby (Cedar Rapids, IA); Eric J. Loren (North Liberty, IA)
Assignee: Rockwell Collins, Inc.
G01S5/0027G01S13/583G01S13/62
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,332,367
App. No.
17/940,898
Granted
Jun 17, 2025
Kind
B2
Abstract

A system may include a mobile ad-hoc network (MANET) including a plurality of nodes. Each of the plurality of nodes is configured to transmit communication data packets and transmit beacons. Each of the plurality of nodes has passive spatial awareness. A first node has information of own node velocity, own node orientation, and a destination. The first node may be configured to: calculate a direct line or an arc from the first node to the destination; utilize passive spatial awareness; assess possible relay routes beyond the communication range and within the beacon range of the first node; determine a next relay node that is on one of the possible relay routes wherein the one of the possible relay routes may be closest to the direct line or the arc without being determined to be part of a dead-end route; and transmit a communication data packet to the next relay node.

Claims (47)

1. A system, comprising:

a mobile ad-hoc network (MANET) including a plurality of nodes, wherein each of the plurality of nodes comprises a communication interface and a controller, wherein each of the plurality of nodes is configured to transmit communication data packets and transmit beacons, wherein a beacon range of each beacon is greater than a communication range of each communication data packet, wherein each of the plurality of nodes has passive spatial awareness,

wherein a first node of the plurality of nodes has information of own node velocity, own node orientation, and a destination, the destination being a destination area or a destination node, wherein the destination is outside of the communication range of the first node and optionally outside the beacon range of the first node,

wherein the first node is configured to:

calculate a direct line or a curved arc from the first node to the destination;

utilize passive spatial awareness to compile spatial awareness of nodes within the beacon range of the first node;

assess possible relay routes beyond the communication range and within the beacon range of the first node;

determine a next relay node of the plurality of nodes that is on one of the possible relay routes, the one of the possible relay routes being closest to the direct line or the curved arc without being determined to be part of a dead-end route; and

transmit a communication data packet to the next relay node.

2. The system of claim 1 , wherein the first node is not required to have compiled global positioning system-based (GPS-based) position-location information (PLI) from nodes beyond the communication range of the first node to determine the next relay node that is on the one of the possible relay routes.

3. The system of claim 1 , wherein each node of the plurality of nodes is time synchronized to apply Doppler corrections associated with said node's own motions relative to a common reference frame, said node being a beacon-receiving node, wherein the common reference frame is known to a beacon-transmitting node of the plurality of nodes and said node prior to the beacon-transmitting node transmitting a beacon to said node and prior to said node receiving the beacon from the beacon-transmitting node.

4. The system of claim 1 , wherein the next relay node is a second node, wherein the second node has information of own node velocity, own node orientation, and the destination, wherein the destination is outside of the communication range of the second node and optionally outside the beacon range of the second node,

wherein the second node is configured to:

receive the communication data packet;

calculate a second direct line or a second curved arc from the second node to the destination;

utilize passive spatial awareness to compile spatial awareness of nodes within the beacon range of the second node,

assess second possible relay routes beyond the communication range and within the beacon range of the second node,

determine a second next relay node of the plurality of nodes that is on one of the second possible relay routes, the one of the second possible relay routes being closest to the second direct line or the second curved arc without being determined to be part of a dead-end route; and

transmit the communication data packet to the second next relay node.

5. The system of claim 4 , wherein the second node is further configured to utilize multi-hop spatial awareness (MHSA) to assess the second possible relay routes beyond the beacon range of the second node.

6. The system of claim 4 , wherein the destination is the destination area, wherein the second direct line or the second curved arc is calculated using a center of mass of the destination area, wherein the second direct line or the second curved arc extends from the second node to the center of mass of the destination area.

7. The system of claim 4 , wherein the second node is further configured to: receive, from any particular relay node, a negative acknowledgement (NAK) indicating an occurrence of a dead-end route; and determine an alternative second next relay node of the plurality of nodes that is on a second possible route of the second possible relay routes, the second possible route of the second possible relay routes being second closest to the second direct line or the second curved arc without being determined to be part of a dead-end route.

8. The system of claim 4 , wherein the second node is not required to have compiled global positioning system-based (GPS-based) position-location information (PLI) from nodes beyond the communication range of the second node to determine the second next relay node that is on the one of the second possible relay routes.

9. The system of claim 1 , wherein the next relay node is a second node, wherein the second node has information of own node velocity, own node orientation, and the destination, wherein the destination is outside of the communication range of the second node and optionally outside the beacon range of the second node,

wherein the second node is configured to:

receive the communication data packet;

utilize passive spatial awareness to compile spatial awareness of nodes within the beacon range of the second node,

assess second possible relay routes beyond the communication range and within the beacon range of the second node,

determine a second next relay node of the plurality of nodes that is on one of the second possible relay routes, the one of the second possible relay routes being closest to the direct line or the curved arc without being determined to be part of a dead-end route; and

transmit the communication data packet to the second next relay node.

10. The system of claim 9 , wherein the second node is further configured to utilize multi-hop spatial awareness (MHSA) to assess the second possible relay routes beyond the beacon range of the second node.

11. The system of claim 9 , wherein the destination is the destination area, wherein the direct line or the curved arc is calculated using a center of mass of the destination area, wherein the direct line or the curved arc extends from the second node to the center of mass of the destination area.

12. The system of claim 9 , wherein the second node is further configured to: receive, from any particular relay node, a negative acknowledgement (NAK) indicating an occurrence of a dead-end route; and determine an alternative second next relay node of the plurality of nodes that is on a second possible route of the second possible relay routes, the second possible route of the second possible relay routes being second closest to the direct line or the curved arc without being determined to be part of a dead-end route.

13. The system of claim 12 , wherein the first node, the second node, or the any particular relay node is configured to broadcast the communication data packet to the destination via flooding to routing (F2R) upon identifying that communication data packet routing has resulted in a predetermined number of dead-end routes.

14. The system of claim 1 , wherein a final relay node of the plurality of nodes is configured to receive the communication data packet and to transmit the communication data packet to the destination.

15. The system of claim 14 , wherein the final relay node is further configured to unicast the communication data packet to the destination.

16. The system of claim 14 , wherein the final relay node is further configured to broadcast the communication data packet to the destination.

17. The system of claim 1 , wherein the first node is further configured to utilize multi-hop spatial awareness (MHSA) to assess the possible relay routes beyond the beacon range of the first node.

18. The system of claim 1 , wherein the destination is the destination area, wherein the direct line or the curved arc is calculated using a center of mass of the destination area, wherein the direct line or the curved arc extends from the first node to the center of mass of the destination area.

19. The system of claim 1 , wherein the first node is further configured to: receive, from the second node, a negative acknowledgement (NAK) indicating an occurrence of a dead-end route; and determine an alternative second next relay node of the plurality of nodes that is on a second possible route of the possible relay routes, the second possible route of the possible relay routes being second closest to the direct line or the curved arc without being determined to be part of a dead-end route.

20. A method, comprising:

providing a mobile ad-hoc network (MANET) including a plurality of nodes, wherein each of the plurality of nodes comprises a communication interface and a controller, wherein each of the plurality of nodes is configured to transmit communication data packets and transmit beacons, wherein a beacon range of each beacon is greater than a communication range of each communication data packet, wherein each of the plurality of nodes has passive spatial awareness, wherein a first node of the plurality of nodes has information of own node velocity, own node orientation, and a destination, the destination being a destination area or a destination node, wherein the destination is outside of the communication range of the first node and optionally outside the beacon range of the first node,

calculating, by the first node, a direct line or a curved arc from the first node to the destination;

utilizing, by the first node, passive spatial awareness to compile spatial awareness of nodes within the beacon range of the first node;

assessing, by the first node, possible relay routes beyond the communication range and within the beacon range of the first node;

determining, by the first node, a next relay node of the plurality of nodes that is on one of the possible relay routes, the one of the possible relay routes being closest to the direct line or the curved arc without being determined to be part of a dead-end route; and

transmitting, by the first node, a communication data packet to the next relay node.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 8, 2022
From: KWON, TJ T.; SORSBY, WILLIAM B.; LOREN, ERIC J.
To: ROCKWELL COLLINS, INC.
Reel/Frame 061031/0195 →
Continuity (14)
Continuation In Part 17857920 · Jul 5, 2022
Continuation In Part PCTUS2022024653 · Apr 13, 2022
Continuation In Part 17541703 · Dec 3, 2021
Continuation In Part 17534061 · Nov 23, 2021
Continuation In Part 17408156 · Aug 20, 2021
Continuation 17233107 · Apr 16, 2021
Continuation In Part 17233107 · Apr 16, 2021
Continuation In Part 17079175 · Oct 23, 2020
Continuation In Part 17020231 · Sep 14, 2020
Continuation In Part 16987671 · Aug 7, 2020
Continuation In Part 16698230 · Nov 27, 2019
Provisional Application 63400138 · Aug 23, 2022
Provisional Application 63344445 · May 20, 2022
Related Publication 20230081728A1 · Mar 16, 2023
References Cited (266)
US 4134113A · Powell · 1979 [cited by applicant]
US 4399531A · Grande et al. · 1983 [cited by applicant]
US 4806934A · Magoon · 1989 [cited by applicant]
US 5835482A · Allen · 1998 [cited by applicant]
US 5898902A · Tuzov · 1999 [cited by applicant]
US 6072425A · Vopat · 2000 [cited by applicant]
US 6115394A · Balachandran et al. · 2000 [cited by applicant]
US 6195403B1 · Anderson et al. · 2001 [cited by applicant]
US 6496940B1 · Horst et al. · 2002 [cited by applicant]
US 6611773B2 · Przydatek et al. · 2003 [cited by applicant]
US 6662229B2 · Passman et al. · 2003 [cited by applicant]
US 6721290B1 · Kondylis et al. · 2004 [cited by applicant]
US 6744740B2 · Chen · 2004 [cited by applicant]
US 6845091B2 · Ogier et al. · 2005 [cited by applicant]
US 7023818B1 · Elliott · 2006 [cited by applicant]
US 7171476B2 · Maeda et al. · 2007 [cited by applicant]
US 7242671B2 · Li et al. · 2007 [cited by applicant]
US 7299013B2 · Rotta et al. · 2007 [cited by applicant]
US 7417948B2 · Sjöblom · 2008 [cited by applicant]
US 7558575B2 · Losh et al. · 2009 [cited by applicant]
US 7573835B2 · Sahinoglu et al. · 2009 [cited by applicant]
US 7633921B2 · Thubert et al. · 2009 [cited by applicant]
US 7679551B2 · Petovello et al. · 2010 [cited by applicant]
US 7698463B2 · Ogier et al. · 2010 [cited by applicant]
US 7719989B2 · Yau · 2010 [cited by applicant]
US 7729240B1 · Crane et al. · 2010 [cited by applicant]
US 7787450B1 · Chan et al. · 2010 [cited by applicant]
US 7881229B2 · Weinstein et al. · 2011 [cited by applicant]
US 7903662B2 · Cohn · 2011 [cited by applicant]
US 7983239B1 · Weinstein et al. · 2011 [cited by applicant]
US 8036224B2 · Axelsson et al. · 2011 [cited by applicant]
US 8121741B2 · Taft et al. · 2012 [cited by applicant]
US 8138626B2 · Jonsson et al. · 2012 [cited by applicant]
US 8159954B2 · Larsson et al. · 2012 [cited by applicant]
US 8218550B2 · Axelsson et al. · 2012 [cited by applicant]
US 8223660B2 · Allan et al. · 2012 [cited by applicant]
US 8223868B2 · Lee · 2012 [cited by applicant]
US 8341289B2 · Hellhake et al. · 2012 [cited by applicant]
US 8396686B2 · Song et al. · 2013 [cited by applicant]
US 8490175B2 · Barton et al. · 2013 [cited by applicant]
US 8553560B2 · Axelsson et al. · 2013 [cited by applicant]
US 8630291B2 · Shaffer et al. · 2014 [cited by applicant]
US 8638008B2 · Baldwin et al. · 2014 [cited by applicant]
US 8717230B1 · Fischi et al. · 2014 [cited by applicant]
US 8717935B2 · Lindem, III et al. · 2014 [cited by applicant]
US 8732338B2 · Hutchison et al. · 2014 [cited by applicant]
US 8798034B2 · Aggarwal et al. · 2014 [cited by applicant]
US 8824444B1 · Berenberg et al. · 2014 [cited by applicant]
US 8849596B2 · Ting et al. · 2014 [cited by applicant]
US 8867427B2 · Taori et al. · 2014 [cited by applicant]
US 8913543B2 · Zainaldin · 2014 [cited by applicant]
US 8942197B2 · Rudnick et al. · 2015 [cited by applicant]
US 8964739B1 · Wisehart · 2015 [cited by applicant]
US 8989326B2 · An et al. · 2015 [cited by applicant]
US 9179475B2 · Koleszar et al. · 2015 [cited by applicant]
US 9213387B2 · King et al. · 2015 [cited by applicant]
US 9246795B2 · Madaiah et al. · 2016 [cited by applicant]
US 9294159B2 · Duerksen · 2016 [cited by applicant]
US 9304198B1 · Doerry et al. · 2016 [cited by applicant]
US 9325513B2 · Liu et al. · 2016 [cited by applicant]
US 9345029B2 · Monte et al. · 2016 [cited by applicant]
US 9435884B2 · Inoue · 2016 [cited by applicant]
US 9516513B2 · Saegrov et al. · 2016 [cited by applicant]
US 9544162B2 · Vasseur et al. · 2017 [cited by applicant]
US 9628285B2 · Császár · 2017 [cited by applicant]
US 9713061B2 · Ruiz et al. · 2017 [cited by applicant]
US 9719803B2 · Ratcliff et al. · 2017 [cited by applicant]
US 9858822B1 · Gentry · 2018 [cited by applicant]
US 9979635B2 · Hellhake et al. · 2018 [cited by applicant]
US 10067199B2 · Eldridge et al. · 2018 [cited by applicant]
US 10097469B2 · Hui et al. · 2018 [cited by applicant]
US 10098051B2 · Mosko et al. · 2018 [cited by applicant]
US 10205654B2 · Choi et al. · 2019 [cited by applicant]
US 10236648B2 · Irons et al. · 2019 [cited by applicant]
US 10257655B2 · Cody · 2019 [cited by applicant]
US 10382897B1 · Lanes et al. · 2019 [cited by applicant]
US 10455521B2 · Hudson et al. · 2019 [cited by applicant]
US 10459074B1 · Omer et al. · 2019 [cited by applicant]
US 10484837B2 · Navalekar et al. · 2019 [cited by applicant]
US 10531500B2 · Ulinskas · 2020 [cited by applicant]
US 10601684B2 · Hashmi et al. · 2020 [cited by applicant]
US 10601713B1 · Turgeman et al. · 2020 [cited by applicant]
US 10609622B2 · Bader et al. · 2020 [cited by applicant]
US 10785672B2 · Kwan et al. · 2020 [cited by applicant]
US 10798053B2 · Nolan et al. · 2020 [cited by applicant]
US 10873429B1 · Kwon et al. · 2020 [cited by applicant]
US 10931570B1 · Kwon et al. · 2021 [cited by applicant]
US 10965584B1 · Kwon et al. · 2021 [cited by applicant]
US 10979348B1 · Kwon et al. · 2021 [cited by applicant]
US 10993201B2 · Luecke · 2021 [cited by applicant]
US 10999778B1 · Kwon et al. · 2021 [cited by applicant]
US 11071039B2 · Fallon et al. · 2021 [cited by applicant]
US 11082324B2 · Ramanathan et al. · 2021 [cited by applicant]
US 11129078B2 · Yates et al. · 2021 [cited by applicant]
US 11258520B2 · Goergen et al. · 2022 [cited by applicant]
US 11284295B1 · Kwon et al. · 2022 [cited by applicant]
US 11290942B2 · Kwon et al. · 2022 [cited by applicant]
US 11500111B2 · Frederiksen et al. · 2022 [cited by applicant]
US 11528675B2 · Nagaraja et al. · 2022 [cited by applicant]
US 11977173B2 · Loren et al. · 2024 [cited by applicant]
US 12050279B2 · Stevens et al. · 2024 [cited by applicant]
US 12111406B2 · Sorsby et al. · 2024 [cited by applicant]
US 20020018448A1 · Amis et al. · 2002 [cited by applicant]
US 20030035589A1 · Kim · 2003 [cited by applicant]
US 20030151513A1 · Herrmann et al. · 2003 [cited by applicant]
US 20040012859A1 · Minefuji · 2004 [cited by applicant]
US 20040028016A1 · Billhartz · 2004 [cited by applicant]
US 20040123228A1 · Kikuchi et al. · 2004 [cited by applicant]
US 20040213239A1 · Lin et al. · 2004 [cited by applicant]
US 20040246902A1 · Weinstein et al. · 2004 [cited by applicant]
US 20050025076A1 · Chaudhuri et al. · 2005 [cited by applicant]
US 20050272379A1 · Rotta et al. · 2005 [cited by applicant]
US 20060010170A1 · Lashley et al. · 2006 [cited by applicant]
US 20060056421A1 · Zaki · 2006 [cited by applicant]
US 20060176847A1 · Chen · 2006 [cited by examiner]
US 20070086541A1 · Moon et al. · 2007 [cited by applicant]
US 20070097880A1 · Rajsic · 2007 [cited by applicant]
US 20070109979A1 · Fu et al. · 2007 [cited by applicant]
US 20070223497A1 · Elson et al. · 2007 [cited by applicant]
US 20070299950A1 · Kulkarni · 2007 [cited by applicant]
US 20080107034A1 · Jetcheva et al. · 2008 [cited by applicant]
US 20080117904A1 · Radha et al. · 2008 [cited by applicant]
US 20080219204A1 · Lee et al. · 2008 [cited by applicant]
US 20080273582A1 · Gaal et al. · 2008 [cited by applicant]
US 20080291945A1 · Luo · 2008 [cited by applicant]
US 20080310325A1 · Yang · 2008 [cited by applicant]
US 20090086713A1 · Luo · 2009 [cited by applicant]
US 20090290572A1 · Gonia et al. · 2009 [cited by applicant]
US 20100074101A1 · Skalecki et al. · 2010 [cited by applicant]
US 20100074141A1 · Nguyen · 2010 [cited by applicant]
US 20100111065A1 · Noh et al. · 2010 [cited by applicant]
US 20110006913A1 · Chen et al. · 2011 [cited by applicant]
US 20110013487A1 · Zhou et al. · 2011 [cited by applicant]
US 20110188378A1 · Collins et al. · 2011 [cited by applicant]
US 20110312279A1 · Tsai et al. · 2011 [cited by applicant]
US 20120092208A1 · LeMire et al. · 2012 [cited by applicant]
US 20120098699A1 · Calmettes et al. · 2012 [cited by applicant]
US 20130006834A1 · Waelbroeck et al. · 2013 [cited by applicant]
US 20130069834A1 · Duerksen · 2013 [cited by applicant]
US 20130094366A1 · Lee et al. · 2013 [cited by applicant]
US 20130100942A1 · Rudnick et al. · 2013 [cited by applicant]
US 20130195017A1 · Jamadagni et al. · 2013 [cited by applicant]
US 20130197835A1 · Jonsson et al. · 2013 [cited by applicant]
US 20130250808A1 · Hui et al. · 2013 [cited by applicant]
US 20140017196A1 · Han et al. · 2014 [cited by applicant]
US 20140018097A1 · Goldstein · 2014 [cited by applicant]
US 20140188990A1 · Fulks · 2014 [cited by applicant]
US 20140229519A1 · Dietrich et al. · 2014 [cited by applicant]
US 20140236483A1 · Beaurepaire et al. · 2014 [cited by applicant]
US 20140258201A1 · Finlow-Bates · 2014 [cited by applicant]
US 20150010153A1 · Robertson · 2015 [cited by applicant]
US 20150025818A1 · Das et al. · 2015 [cited by applicant]
US 20150222479A1 · Kim et al. · 2015 [cited by applicant]
US 20150296335A1 · Joshi et al. · 2015 [cited by applicant]
US 20150326689A1 · Leppänen et al. · 2015 [cited by applicant]
US 20160139241A1 · Holz et al. · 2016 [cited by applicant]
US 20160150465A1 · Jung et al. · 2016 [cited by applicant]
US 20160187458A1 · Shah et al. · 2016 [cited by applicant]
US 20160189381A1 · Rhoads · 2016 [cited by applicant]
US 20160373997A1 · Petersen et al. · 2016 [cited by applicant]
US 20170111266A1 · Ko · 2017 [cited by applicant]
US 20170134227A1 · Song et al. · 2017 [cited by applicant]
US 20170149658A1 · Rimhagen et al. · 2017 [cited by applicant]
US 20170168163A1 · Small · 2017 [cited by applicant]
US 20180013665A1 · Ko et al. · 2018 [cited by applicant]
US 20180026475A1 · Gelonese et al. · 2018 [cited by applicant]
US 20180098263A1 · Luo et al. · 2018 [cited by applicant]
US 20180146489A1 · Jin et al. · 2018 [cited by applicant]
US 20180234336A1 · Schumm et al. · 2018 [cited by applicant]
US 20180302807A1 · Chen et al. · 2018 [cited by applicant]
US 20180317226A1 · Sakoda · 2018 [cited by applicant]
US 20190098625A1 · Johnson et al. · 2019 [cited by applicant]
US 20190222302A1 · Lin et al. · 2019 [cited by applicant]
US 20190251848A1 · Sivanesan et al. · 2019 [cited by applicant]
US 20190317207A1 · Schroder et al. · 2019 [cited by applicant]
US 20190349172A1 · Zhang · 2019 [cited by applicant]
US 20200011968A1 · Hammes et al. · 2020 [cited by applicant]
US 20200052997A1 · Ramanathan et al. · 2020 [cited by applicant]
US 20200092949A1 · Donepudi et al. · 2020 [cited by applicant]
US 20200196309A1 · Amouris · 2020 [cited by applicant]
US 20200236607A1 · Zhu et al. · 2020 [cited by applicant]
US 20200292706A1 · Hexsel et al. · 2020 [cited by applicant]
US 20200350983A1 · Alasti et al. · 2020 [cited by applicant]
US 20200371247A1 · Marmet · 2020 [cited by applicant]
US 20200396708A1 · Bharadwaj et al. · 2020 [cited by applicant]
US 20210083917A1 · Konishi et al. · 2021 [cited by applicant]
US 20210153097A1 · Du et al. · 2021 [cited by applicant]
US 20210201044A1 · Herdade et al. · 2021 [cited by applicant]
US 20210302956A1 · Sudhakaran et al. · 2021 [cited by applicant]
US 20210359752A1 · Wang et al. · 2021 [cited by applicant]
US 20210385879A1 · Mahalingam et al. · 2021 [cited by applicant]
US 20220030511A1 · Wang et al. · 2022 [cited by applicant]
US 20220038139A1 · Löwenmark et al. · 2022 [cited by applicant]
US 20220060959A1 · Atungsiri et al. · 2022 [cited by applicant]
US 20220069901A1 · Tian et al. · 2022 [cited by applicant]
US 20220085892A1 · Sorge · 2022 [cited by applicant]
US 20220086818A1 · Nam et al. · 2022 [cited by applicant]
US 20220094634A1 · Kwon et al. · 2022 [cited by applicant]
US 20220143428A1 · Goetz et al. · 2022 [cited by applicant]
US 20220159741A1 · Hoang et al. · 2022 [cited by applicant]
US 20220173799A1 · Wigard et al. · 2022 [cited by applicant]
US 20220198351A1 · Beaurepaire et al. · 2022 [cited by applicant]
US 20220360320A1 · Miao et al. · 2022 [cited by applicant]
US 20220368410A1 · Ma et al. · 2022 [cited by applicant]
US 20230057666A1 · Kwon et al. · 2023 [cited by applicant]
US 20230111316A1 · Ma et al. · 2023 [cited by applicant]
US 20230118153A1 · Amorim et al. · 2023 [cited by applicant]
US 20230133633A1 · Park et al. · 2023 [cited by applicant]
US 20230135149A1 · Krishnamurthy et al. · 2023 [cited by applicant]
US 20230280435A1 · Schatz et al. · 2023 [cited by applicant]
US 20230280436A1 · Loren et al. · 2023 [cited by applicant]
US 20230280437A1 · Kwon et al. · 2023 [cited by applicant]
US 20230288518A1 · Graf et al. · 2023 [cited by applicant]
US 20230288519A1 · Schatz et al. · 2023 [cited by applicant]
US 20230288521A1 · Kwon et al. · 2023 [cited by applicant]
US 20230296716A1 · Dean et al. · 2023 [cited by applicant]
US 20230379007A1 · Kwon et al. · 2023 [cited by applicant]
US 20230379008A1 · Sorsby et al. · 2023 [cited by applicant]
US 20230393229A1 · Loren et al. · 2023 [cited by applicant]
US 20240151800A1 · Stevens et al. · 2024 [cited by applicant]
CN 115085799A · 2022 [cited by applicant]
EP 2208084A4 · 2011 [cited by applicant]
EP 2743726A1 · 2014 [cited by applicant]
GB 2542491A · 2017 [cited by applicant]
KR 101231707B1 · 2013 [cited by applicant]
WO 2019045767A1 · 2019 [cited by applicant]
WO 2020117427A1 · 2020 [cited by applicant]
WO 2020220233A1 · 2020 [cited by applicant]
WO 2021251902A1 · 2021 [cited by applicant]
WO 2022003386A1 · 2022 [cited by applicant]
WO PCTUS2224653 · 2022 [cited by applicant]
WO 2022202858A1 · 2022 [cited by applicant]
WO 2022221429A1 · 2022 [cited by applicant]
WO 2022232336A1 · 2022 [cited by applicant]
WO 2022233042A1 · 2022 [cited by applicant]
WO 2022233314A1 · 2022 [cited by applicant]
WO 2023001520A1 · 2023 [cited by applicant]
WO 2023030622A1 · 2023 [cited by applicant]
WO 2023047336A1 · 2023 [cited by applicant]
WO 2023057655A1 · 2023 [cited by applicant]
WO 2023067552A1 · 2023 [cited by applicant]
WO 2023068990A1 · 2023 [cited by applicant]
WO 2023081918A1 · 2023 [cited by applicant]
Seddigh M et al: “Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks”, vol. 13, No. 1, Jan. 1, 2002, pp. 14-25. [cited by applicant]
Turgut D. et al: “Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing”, vol. 3, Mar. 16, 20023, pp. 1492-1497. [cited by applicant]
Extended European Search Report dated Apr. 4, 2024; European Application No. 21190368.7. [cited by applicant]
Peng Wang, et al., “Convergence of Satellite and Terrestrial Networks: A Comprehensive Survey networks” IEEEAcess; vol. 4, Dec. 31, 2019. [cited by applicant]
Pulak K. Chowdhury, et al. “Handover Schemes in Satellite Networks: State-of-the-Art and Future Research Directions” 4th Quarter 2006, vol. 8, No. 4, Oct. 1, 2006. [cited by applicant]
U.S. Appl. No. 17/233,107, filed Apr. 16, 2021, Eric J. Loren. [cited by applicant]
U.S. Appl. No. 16/987,671, filed Aug. 7, 2021, Kwon et al. [cited by applicant]
U.S. Appl. No. 17/408,156, filed Aug. 20, 2021, Tj T. Kwon. [cited by applicant]
U.S. Appl. No. 17/534,061, filed Nov. 23, 2021, William B. Sorsby. [cited by applicant]
U.S. Appl. No. 17/857,920, filed Jul. 5, 2022, Eric J. Loren. [cited by applicant]
U.S. Appl. No. 63/344,445, filed May 20, 2022, Eric J. Loren. [cited by applicant]
U.S. Appl. No. 16/369,398, filed Mar. 29, 2019, Kwon. [cited by applicant]
U.S. Appl. No. 17/233,107, filed Apr. 16, 2022, Loren et al. [cited by applicant]
U.S. Appl. No. 17/541,703, filed Dec. 3, 2021, Kwon et al. [cited by applicant]
U.S. Appl. No. 17/857,920, filed Jul. 5, 2022, Loren et al. [cited by applicant]
Martorella, M. et al., Ground Moving Target Imaging via SDAP-ISAR Processing: Review and New Trends. Sensors 2021, 21, 2391. https://doi.org/10.3390/s21072391. [cited by applicant]
U.S. Appl. No. 17/020,231, filed Sep. 14, 2020. [cited by applicant]
U.S. Appl. No. 17/079,175, filed Oct. 23, 2020. [cited by applicant]
U.S. Appl. No. 17/233,107, filed Apr. 16, 2021. [cited by applicant]
U.S. Appl. No. 17/408,156, filed Aug. 20, 2021. [cited by applicant]
U.S. Appl. No. 17/534,061, filed Nov. 23, 2021. [cited by applicant]
U.S. Appl. No. 17/541,703, filed Dec. 3, 2021. [cited by applicant]
U.S. Appl. No. 17/857,920, filed Jul. 5, 2022. [cited by applicant]