# US 2025/0097870 A1 · Methods and apparatuses of wireless communication in non-terrestrial network

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

- Number: US 2025/0097870 A1
- Document ID: US20250097870A1
- Status: Published application
- Kind: A1
- Application number: 18/729,317
- Filed: 2022-01-21
- Published: 2025-03-20
- Earliest claimed: 2022-01-21
- Assignees: Lenovo (Beijing) Limited
- Applicants: Lenovo (Beijing) Limited
- Inventors: Min Xu; Hongmei Liu; Jing Han; Lianhai Wu; Ran Yue; Jie Hu
- Web page: https://patentgrep.com/patent/US20250097870A1

## CPC

- H04W 56/0045: {compensating for timing error by altering transmission time}
- H04B 7/1851: {Systems using a satellite or space-based relay (H04B7/18508, H04B7/18521 take precedence; providing specific services H04B7/18523 - H04B7/18576)}
- H04B 7/18539: {Arrangements for managing radio, resources, i.e. for establishing or releasing a connection}
- H04B 7/18563: {Arrangements for interconnecting multiple systems (data switching networks H04L12/00)}
- H04W 28/06: Optimizing {the usage of the radio link}, e.g. header compression, information sizing {, discarding information (system modifying transmission characteristic according to link quality by modifying frame length H04L1/0007; dynamic adaptation of the packet size for flow control or congestion control H04L47/365)}
- H04W 56/0025: {synchronizing potentially movable access points}
- H04W 84/06: Airborne or Satellite Networks (space-based or airborne stations H04B7/185)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)
- H04B: TRANSMISSION

## Abstract

The present application relates to methods and apparatuses for wireless communication in non-terrestrial network. One embodiment of the present disclosure provides a radio access network (RAN) node, may include: a transceiver; and a processor, wherein the processor is configured to: determine first time information associated with a neighbor RAN node of the RAN node; and transmit the first time information to a user equipment (UE), wherein the first time information includes at least one of: a first epoch time associated with the neighbor RAN node; or a first validity time associated with the neighbor RAN node.

## Claims

### Claim 1

A radio access network (RAN) node for wireless communication, comprising:
at least one memory; and
at least one processor coupled with the at least one memory and configured to cause the RAN node to:
determine first time information associated with a neighbor RAN node of the RAN node; and
transmit the first time information to a user equipment (UE), wherein the first time information includes at least one of:
a first epoch time associated with the neighbor RAN node; or
a first validity time associated with the neighbor RAN node.

### Claim 2 (depends on 1)

The RAN node of claim 1, wherein the first time information is determined based on second time information of the neighbor RAN node, wherein the second time information at least comprises one of:
a second epoch time associated with the neighbor RAN node; or
a second validity time associated with the neighbor RAN node.

### Claim 3 (depends on 2)

The RAN node of claim 2, wherein the second time information is one or more of pre-stored in the RAN node, or received from the neighbor RAN node in response to a request from the RAN node to the neighbor RAN node.

### Claim 4 (depends on 3)

The RAN node of claim 3, wherein the request comprises at least one of:
an indication to request a part of the second time information or all of the second time information;
an identity of the neighbor RAN node; or
a preferred format of the second time information.

### Claim 5 (depends on 2)

The RAN node of claim 2, wherein the first time information is represented in a first format, the second time information is represented in a second format, and the processor is further configured to cause the RAN node to:
convert the second time information in the second format to the first time information in the first format.

### Claim 6 (depends on 1)

The RAN node of claim 1, wherein at least one of the first epoch time or the first validity time is associated with at least one of:
an ephemeris of the neighbor RAN node;
a common timing advance (TA) of the neighbor RAN node; or
a feeder link propagation delay of the neighbor RAN node.

### Claim 7 (depends on 1)

The RAN node of claim 1, wherein the first time information further comprises a first reference time point for at least one of the first epoch time or the first validity time.

### Claim 8 (depends on 1)

The RAN node of claim 1, wherein the first time information is transmitted to the UE by a system information (SI) broadcast, an on-demand SI, or a dedicated signaling.

### Claim 9 (depends on 1)

The RAN node of claim 1, wherein the first time information indicates at least one of:
the first epoch time has a same value as a third epoch time associated with the RAN node, wherein the third epoch time is associated with at least one of an ephemeris of the RAN node or a common TA of the RAN node; or
the first validity time has a same value as a third validity time associated with the RAN node, wherein the third validity time is associated with at least one of an ephemeris of the RAN node or a common TA of the RAN node.

### Claim 10

A user equipment (UE) for wireless communication, comprising:
at least one memory; and
at least one processor coupled with the at least one memory and configured to cause the UE to:
receive, from a radio access network (RAN) node, first time information associated with a neighbor RAN node of the RAN node; and
determine time-related status of the neighbor RAN node based on the first time information, wherein the first time information includes at least one of:
a first epoch time associated with the neighbor RAN node; or
a first validity time associated with the neighbor RAN node.

### Claim 11 (depends on 10)

The UE of claim 10, wherein at least one of the first epoch time or the first validity time is associated with at least one of:
an ephemeris of the neighbor RAN node;
a common timing advance (TA) of the neighbor RAN node; or
a feeder link propagation delay of the neighbor RAN node.

### Claim 12 (depends on 10)

The UE of claim 10, wherein the first time information further comprises a first reference time point for at least one the first epoch time or the first validity time.

### Claim 13 (depends on 10)

The UE of claim 10, wherein the first time information is received by a system information (SI) broadcast, an on-demand SI, or a dedicated signaling.

### Claim 14 (depends on 11)

The UE of claim 11, wherein the time-related status of the neighbor RAN node comprises at least one of:
at least one of the ephemeris, the common TA, or the feeder link propagation delay at the first epoch time;
at least one of the ephemeris, the common TA, or the feeder link propagation delay that is valid;
at least one of the ephemeris, the common TA, or the feeder link propagation delay at a given time;
coordinates of the neighbor RAN node at a given time;
an orbital position of the neighbor RAN node at a given time;
a validity timer for the neighbor RAN node parameter values that is started the first time information is received;
a length of the validity timer from reception time to the first validity time;
the first epoch time has a same value as a third epoch time associated with the RAN node, wherein the third epoch time is associated with at least one of an ephemeris of the RAN node or a common TA of the RAN node; or
the first validity time has a same value as a third validity time associated with the RAN node, wherein the third validity time is associated with at least one of an ephemeris of the RAN node or a common TA of the RAN node.

### Claim 15 (depends on 10)

The UE of claim 10, wherein in a case that the first time information comprises the first validity time, the at least one processor is further configured to cause the UE to at least one of:
discard received first time information associated with the neighbor RAN node when the first validity time expires;
discard determined time-related status based on the first time information when the first validity time expires;
consider UE uplink synchronization to the neighbor RAN node lost; or
request for updating the first time information associated with the neighbor RAN node when the first validity time expires.

### Claim 16

A processor for wireless communication, comprising:
at least one controller coupled with at least one memory and configured to cause the processor to:
receive, from a radio access network (RAN) node, first time information associated with a neighbor RAN node of the RAN node; and
determine time-related status of the neighbor RAN node based on the first time information, wherein the first time information includes at least one of:
a first epoch time associated with the neighbor RAN node; or
a first validity time associated with the neighbor RAN node.

### Claim 17 (depends on 16)

The processor of claim 16, wherein at least one of the first epoch time or the first validity time is associated with at least one of:
an ephemeris of the neighbor RAN node;
a common timing advance (TA) of the neighbor RAN node; or
a feeder link propagation delay of the neighbor RAN node.

### Claim 18 (depends on 17)

The processor of claim 17, wherein the time-related status of the neighbor RAN node comprises at least one of:
at least one of the ephemeris, the common TA, or the feeder link propagation delay at the first epoch time;
at least one of the ephemeris, the common TA, or the feeder link propagation delay that is valid;
at least one of the ephemeris, the common TA, or the feeder link propagation delay at a given time;
coordinates of the neighbor RAN node at a given time;
an orbital position of the neighbor RAN node at a given time;
a validity timer for neighbor RAN node parameter values that is started the first time information is received;
a length of the validity timer from reception time to the first validity time;
the first epoch time has a same value as a third epoch time associated with the RAN node, wherein the third epoch time is associated with at least one of an ephemeris of the RAN node or a common TA of the RAN node; or
the first validity time has a same value as a third validity time associated with the RAN node, wherein the third validity time is associated with at least one of an ephemeris of the RAN node or a common TA of the RAN node.

### Claim 19 (depends on 16)

The processor of claim 16, wherein the first time information is received by a system information (SI) broadcast, an on-demand SI, or a dedicated signaling.

### Claim 20

A method performed by a user equipment (UE), the method comprising:
receiving, from a radio access network (RAN) node, first time information associated with a neighbor RAN node of the RAN node; and
determining time-related status of the neighbor RAN node based on the first time information, wherein the first time information includes at least one of:
a first epoch time associated with the neighbor RAN node; or
a first validity time associated with the neighbor RAN node.
