IP Library Granted Patent US 12,477,583
Granted Patent B2
US 12,477,583 · App. 17/846,625 · Granted Nov 18, 2025

Aliasing for cell-based manet

Inventors: Brian L. Aanderud (Eden Prairie, MN); Stephen M. Clark (Evansdale, IA); Tj T. Kwon (Marion, IA)
Assignee: Rockwell Collins, Inc.
H04W74/0833H04W48/20H04W74/006
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,477,583
App. No.
17/846,625
Granted
Nov 18, 2025
Kind
B2
Abstract

A communication system and method for joining a first cell in a network is disclosed. The system includes a plurality of nodes with one node configured as a base station and one or more nodes of the plurality of nodes configured as user equipment. Aliased resource allocation messages are used to send scheduling information to the user equipment, for which proper aliases must be determined. To ensure that proper aliasing is utilized, the base station and user equipment determine that the alias is unique. The base station may also recommend an alias with a smaller bit size. The communication system may also include a second cell that shares user equipment with the first cell, with each shared user equipment having a cell-specific alias.

Claims (82)

1 . A method for joining a communication network comprising a first cell, comprising:

monitoring a channel for a first pilot signal;

determining the first pilot signal;

determining a first base station associated with the first pilot signal;

identifying a random-access channel procedure to communicate with the first base station;

selecting a first proposed alias;

transmitting a cell join request to the first base station via the random-access channel procedure for admittance into the first cell, wherein the join request comprises the first proposed alias;

determining if the first proposed alias is acceptable via the first base station;

receiving an admittance reply from the first base station, wherein the admittance reply is based on an acceptance of the first proposed alias or a recommended alias; and

receiving a resource allocation message that includes the first proposed alias or the recommended alias.

2 . The method of claim 1 , wherein selecting the first proposed alias comprises:

examining in-use aliases within the first cell;

selecting an alias that is not in-use.

3 . The method of claim 1 , further comprising receiving a recommended alias reply from the first base station, wherein the recommended alias reply includes the recommended alias that is dissimilar to the proposed alias.

4 . The method of claim 1 , wherein determining if the first proposed alias is acceptable comprises;

determining a number of bits required to transmit the first proposed alias; and

selecting the recommended alias requiring fewer bits to transmit than the proposed alias if aliases with a lower bit count are available.

5 . The method of claim 4 , wherein determining if the first proposed alias is acceptable further comprises:

comparing the first proposed alias to a set of aliases in-use within the first cell;

determining that the first proposed alias is unique to the set of aliases in-use within the first cell.

6 . The method of claim 1 further comprising transmitting a resource management message, wherein the resource management message comprises an aliased identification element configured to identify the first proposed alias or the recommended alias.

7 . The method of claim 1 , further comprising joining a second cell within the communication network, comprising:

monitoring a channel for a second pilot signal for the second cell;

receiving the second pilot signal;

identifying a second base station associated with the second pilot signal;

identifying the random-access channel procedure to communicate with the second base station;

selecting a second proposed alias;

transmitting a second cell join request to the second base station via the random-access channel procedure for admittance into the second cell, wherein the second cell join request comprises the second proposed alias;

determining if the second proposed alias is acceptable via the second base station;

receiving an admittance reply from the second base station; and

receiving a resource allocation message that includes the second proposed alias.

8 . The method of claim 7 further comprising transmitting a second resource management message, wherein the second resource management message comprises an aliased identification element configured to identify the first proposed alias, and the second proposed alias.

9 . A method of claim 1 , whereupon at least one of a determination of an absence of the first pilot signal or a determination of an absence of the first base station, the method further includes designating a node as the first base station.

10 . The method of claim 9 , further comprising:

transmitting an initial resource allocation message;

receiving the cell join request; and

transmitting the admittance reply.

11 . A communication system comprising:

a plurality of communication nodes, wherein a first set of the plurality of communication nodes are arranged in a first cell containing one communication node configured as a base station and at least one communication node configured as a user equipment, the user equipment comprising:

a first transmitter;

a first receiver;

one or more first processors; and

a first memory communicatively coupled to the one or more first processors and having instructions stored upon, which when executed by the one or more first processors, causing the one or more first processors to:

monitor a channel for a first pilot signal;

determine the first pilot signal;

determine a first base station associated with the first pilot signal;

identify a random-access channel procedure to communicate with the first base station;

select a first proposed alias;

transmit a cell join request to the first base station via the random-access channel procedure for admittance into the first cell, wherein the join request comprises the first proposed alias;

receive an admittance reply from the first base station, wherein the admittance reply is based on an acceptance of the first proposed alias or a recommended alias; and

transmit a signal via a resource of a cell joining procedure.

12 . The system of claim 11 , wherein the base station comprises:

a second transmitter;

a second receiver;

one or more second processors; and

a second memory communicatively coupled to the one or more second processors and having second instructions stored upon, which when executed by the one or more second processors, causing the one or more second processors to:

determine at least one of an absence of the first pilot signal or an absence of the first base station;

designate a node as the first base station;

receive the cell join request;

determine if the first proposed alias is acceptable;

transmit the admittance reply.

13 . The system of claim 11 , wherein selecting the first proposed alias comprises:

examining in-use aliases within the first cell; and

selecting an alias that is not in-use.

14 . The system of claim 12 , wherein the determination that the first proposed alias is acceptable comprises:

comparing the first proposed alias to other aliases in-use within the first cell; and

determining that the first proposed alias is unique to the other aliases in-use within the first cell.

15 . The system of claim 12 , wherein the instructions stored upon the second memory further instruct the second one or more processors to maintain an alias table.

16 . The system of claim 11 wherein a determination of the first proposed alias as acceptable comprises:

determining a number of bits required to transmit the proposed alias; and

selecting the recommended alias requiring fewer bits to transmit than the proposed alias if aliases with a lower bit count are available.

17 . The system of claim 11 , wherein the plurality of communication nodes comprises a second set of communication nodes arranged in a second cell containing a second base station, wherein the second cell includes at least one shared user equipment from the first cell, the shared user equipment configured with a second alias specific for the second cell.

18 . The system of claim 17 , wherein the at least one shared user equipment is configured to transmit a resource management message comprising an alias element, configured to identify the first proposed alias or the second alias, and a cell identification element configured to identify the first cell or the second cell.

19 . The system of claim 12 , wherein the instructions stored upon the second memory further instruct the second one or more processors to, upon two or more user equipment selecting a same alias, to:

refuse to admit the two or more-user equipment; and

report a random-access channel collision in a subsequent resource allocation message.

20 . A method for joining an ad hoc communication network comprising a first cell, comprising:

selecting a first proposed alias;

transmitting a cell join request to a first base station via a random-access channel procedure for admittance into the first cell, wherein the join request comprises the first proposed alias;

determining if the first proposed alias is acceptable via the first base station;

receiving an admittance reply from the first base station, wherein the admittance reply is based on an acceptance of the first proposed alias or a recommended alias; and

receiving a resource allocation message that includes the alias.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 22, 2022
From: AANDERUD, BRIAN L.; CLARK, STEPHEN M.; KWON, TJ T
To: ROCKWELL COLLINS, INC.
Reel/Frame 060277/0132 →
Continuity (1)
Related Publication 20230422307A1 · Dec 28, 2023
References Cited (328)
US 4134113A · Powell · 1979 [cited by applicant]
US 4399531A · Grande et al. · 1983 [cited by applicant]
US 4438439A · Shreve · 1984 [cited by applicant]
US 4806934A · Magoon · 1989 [cited by applicant]
US 5706010A · Franke · 1998 [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 6111541A · Karmel · 2000 [cited by applicant]
US 6115394A · Balachandran et al. · 2000 [cited by applicant]
US 6148219A · Engelbrecht et al. · 2000 [cited by applicant]
US 6195403B1 · Anderson et al. · 2001 [cited by applicant]
US 6415154B1 · Wang et al. · 2002 [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 7313401B2 · Karmel · 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 7636061B1 · Thomas 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 8217836B1 · Anderson 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 8587770B1 · Johnston 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 11138044B2 · Boehm et al. · 2021 [cited by applicant]
US 11258520B2 · Goergen et al. · 2022 [cited by applicant]
US 11280911B2 · Kennedy 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 12078732B1 · Sirianni 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 20020082024A1 · Bajikar · 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 20040032363A1 · Schantz et al. · 2004 [cited by applicant]
US 20040123228A1 · Kikuchi et al. · 2004 [cited by applicant]
US 20040192334A1 · McBurney 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 20050033789A1 · Sirois · 2005 [cited by applicant]
US 20050047347A1 · Lee et al. · 2005 [cited by applicant]
US 20050141545A1 · Fein et al. · 2005 [cited by applicant]
US 20050219950A1 · Rowe · 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 et al. · 2006 [cited by applicant]
US 20070021122A1 · Lane et al. · 2007 [cited by applicant]
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 20070222665A1 · Koeneman · 2007 [cited by applicant]
US 20070223497A1 · Elson et al. · 2007 [cited by applicant]
US 20070299950A1 · Kulkarni · 2007 [cited by applicant]
US 20080068250A1 · Brandao et al. · 2008 [cited by applicant]
US 20080107034A1 · Jetcheva et al. · 2008 [cited by applicant]
US 20080117904A1 · Radha et al. · 2008 [cited by applicant]
US 20080158040A1 · Stayton 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 20090203337A1 · Sisley et al. · 2009 [cited by applicant]
US 20090207694A1 · Guigne et al. · 2009 [cited by applicant]
US 20090233544A1 · Oyman et al. · 2009 [cited by applicant]
US 20090290572A1 · Gonia et al. · 2009 [cited by applicant]
US 20090303115A1 · Alizadeh-Shabdiz · 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 20100226450A1 · Tanaka · 2010 [cited by applicant]
US 20100246660A1 · Matsuo 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 20110053494A1 · Kobayakawa · 2011 [cited by applicant]
US 20110169684A1 · Margolin · 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 20130130682A1 · Awad 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 20140340192A1 · Yamada et al. · 2014 [cited by applicant]
US 20150010153A1 · Robertson · 2015 [cited by applicant]
US 20150025818A1 · Das et al. · 2015 [cited by applicant]
US 20150071332A1 · Xu 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 20150366470A1 · Kim 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 20160265968A1 · Boutaud · 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 20170366223A1 · Stofer et al. · 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 20190332067A1 · Zhao 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 20220295492A1 · Shattil · 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 101330448A · 2008 [cited by applicant]
CN 101465793A · 2009 [cited by applicant]
CN 101330448B · 2010 [cited by applicant]
CN 101465793B · 2011 [cited by applicant]
CN 101686179B · 2013 [cited by applicant]
CN 103067286B · 2016 [cited by applicant]
CN 107645417A · 2018 [cited by applicant]
CN 110234147A · 2019 [cited by applicant]
CN 115085799A · 2022 [cited by applicant]
DE 102010010935A1 · 2011 [cited by applicant]
EP 0908022A2 · 1999 [cited by applicant]
EP 1912392A2 · 2008 [cited by applicant]
EP 2208084A4 · 2011 [cited by applicant]
EP 2743726A1 · 2014 [cited by applicant]
EP 2466964B1 · 2017 [cited by applicant]
EP 3026961B1 · 2020 [cited by applicant]
GB 2542491A · 2017 [cited by applicant]
GB 2568122B · 2019 [cited by applicant]
JP 4290684B2 · 2009 [cited by applicant]
JP 5164157B2 · 2013 [cited by applicant]
KR 1020040107702A · 2004 [cited by applicant]
KR 100568976B1 · 2006 [cited by applicant]
KR 1020060078814A · 2006 [cited by applicant]
KR 101231707B1 · 2013 [cited by applicant]
KR 1020160071964A · 2016 [cited by applicant]
WO 2008157609A3 · 2009 [cited by applicant]
WO 2012062091A1 · 2012 [cited by applicant]
WO 2012165938A1 · 2012 [cited by applicant]
WO 2015114077A1 · 2015 [cited by applicant]
WO 2015143604A1 · 2015 [cited by applicant]
WO 2017101575A1 · 2017 [cited by applicant]
WO 2018077864A1 · 2018 [cited by applicant]
WO 2019045767A1 · 2019 [cited by applicant]
WO 2020117427A1 · 2020 [cited by applicant]
WO 2020165627A1 · 2020 [cited by applicant]
WO 2020220233A1 · 2020 [cited by applicant]
WO 2021251902A1 · 2021 [cited by applicant]
WO 2022003386A1 · 2022 [cited by applicant]
WO 2022202858A1 · 2022 [cited by applicant]
WO 2022221429 · 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]
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]
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, Kown et al. [cited by applicant]
U.S. Appl. No. 17/857,920, filed Jul. 5, 2022, Loren et al. [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]
Extended Search Report for European Application No. 21188737.7 dated Dec. 10, 2021, 8 pages. [cited by applicant]
Extended Search Report in European Application No. 21190368.7 dated Jan. 5, 2022, 10 pages. [cited by applicant]
Kwon et al., “Efficient Flooding with Passive Clustering (PC) in Ad Hoc Networks”, Computer Communication Review. 32. 44-56. 10.1145/510726.510730, Aug. 11, 2003, 13 pages. [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]
Seddigh et al., “Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks”, IEE Transactions in Parallel and Distributed Systems, IEEE, USA, vol. 13, No. 1, Jan. 1, 2002 (Jan. 1, 2002)… [cited by applicant]
Yi et al., “Passive Clustering in Ad Hoc Networks (PC)”, URL: https://tools.ietf,org/html/drafts-yi-manet-pc-00, Nov. 14, 2001, 31 pages. [cited by applicant]