Method and apparatus for supporting vehicle to everything service
US-2019174482-A1 · Jun 6, 2019 · US
US2018167973A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2018167973-A1 |
| Application number | US-201715822403-A |
| Country | US |
| Kind code | A1 |
| Filing date | Nov 27, 2017 |
| Priority date | Dec 8, 2016 |
| Publication date | Jun 14, 2018 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method of controlling a wireless communication network, performed by a server, includes determining neighbor base stations adjacent to a target base station based on a connection relationship between a plurality of base stations; setting at least two reference base stations based on hop distances between the neighbor base stations; grouping terminals connected to the target base station into at least two groups based on information of the at least two reference base stations, and allocating a different time resource to each of the at least two groups.
Opening claim text (preview).
What is claimed is: 1 . A method of controlling a wireless communication network, performed by a server, the method comprising: determining neighbor base stations adjacent to a target base station based on a connection relationship between a plurality of base stations; setting at least two reference base stations based on hop distances between the neighbor base stations; grouping terminals connected to the target base station into at least two groups based on information of the at least two reference base stations, and allocating a different time resource to each of the at least two groups. 2 . The method according to claim 1 , wherein, in the setting at least two reference base stations, one of the neighbor base stations is set as a first reference base station, and a base station having a largest hop distance from the first reference base station among the neighbor base stations is set as a second reference base station. 3 . The method according to claim 2 , wherein, in the setting at least two reference base stations, a base station having a largest hop distance from a n-th (n is a natural number equal to or greater than 2) reference base station among the neighbor base stations is set as a (n+1)-th reference base station, and the setting at least two reference base stations is repeated until a predetermined termination condition is satisfied. 4 . The method according to claim 3 , wherein the setting at least two reference base stations is repeated until all of the set reference base stations are adjacent to at least one other reference base station. 5 . The method according to claim 2 , wherein, when there are a plurality of base stations having the largest hop distance from the first reference base station, the plurality of base stations having the largest hop distance from the first reference base station are set as candidate base stations, and a base station having most adjacent reference base stations among the candidate base stations is set as the second reference base station. 6 . The method according to claim 3 , wherein, when there are a plurality of base stations having the largest hop distance from the n-th reference base station, the plurality of base stations having the largest hop distance from the n-th reference base station are set as candidate base stations, and a base station having most adjacent reference base stations among the candidate base stations is set as the (n+1)-th reference base station. 7 . The method according to claim 1 , wherein terminals belonging to a same group among the terminals connected to the target base station transmit data at a same time resource in a contention-based manner. 8 . The method according to claim 1 , wherein the terminals connected to the target base station are grouped into the at least two groups based on information on a list of the reference base stations to which each of the terminals connected to the target base stations is connectable. 9 . The method according to claim 1 , further comprising transmitting to the target base station time resource information on the allocated time resources and terminal information on terminals allocated to each of the allocated time resources. 10 . The method according to claim 1 , wherein the terminals connected to the target base station use a different frequency band with terminals connected to the neighbor base stations adjacent to the target base station at a same time resource. 11 . An operation method of a terminal in a communication network constituted by a server and a plurality of base stations connected to the server, the operation method comprising: receiving time resource information and terminal information from a target base station among the plurality of base stations; identifying a time resource allocated to the terminal based on the time resource information and terminal information; and transmitting a packet to the target base station based on a listen-before-talk (LBT) scheme at the time resource, wherein the time resource information and the terminal information are configured by the server through determining neighbor base stations adjacent to the target base station, setting at least two reference base stations based on hop distances between the neighbor base stations, grouping terminals connected to the target base station into at least two groups based on information of the at least two reference base stations, and allocating a different time resource to each of the at least two groups. 12 . The operation method according to claim 11 , wherein, in the setting at least two reference base stations, one of the neighbor base stations is set as a first reference base station, and a base station having a largest hop distance from the first reference base station among the neighbor base stations is set as a second reference base station. 13 . The operation method according to claim 12 , wherein, in the setting at least two reference base stations, a base station having a largest hop distance from a n-th (n is a natural number equal to or greater than 2) reference base station among the neighbor base stations is set as a (n+1)-th reference base station, and the setting at least two reference base stations is repeated until a predetermined termination condition is satisfied. 14 . A server controlling a wireless communication network comprising a processor and a memory storing at least one instruction executed by the processor, wherein the at least one instruction is configured to: determine neighbor base stations adjacent to the target base station; set at least two reference base stations based on hop distances between the neighbor base stations; group terminals connected to the target base station into at least two groups based on information of the at least two reference base stations; and allocate a different time resource to each of the at least two groups. 15 . The server according to claim 14 , wherein the at least one instruction is further configured to set one of the neighbor base stations as a first reference base station, and set a base station having a largest hop distance from the first reference base station among the neighbor base stations as a second reference base station. 16 . The server according to claim 15 , wherein the at least one instruction is further configured to set a base station having a largest hop distance from a n-th (n is a natural number equal to or greater than 2) reference base station among the neighbor base stations as a (n+1)-th reference base station, and the setting at least two reference base stations is repeated until a predetermined termination condition is satisfied. 17 . The server according to claim 16 , wherein the setting at least two reference base stations is repeated until all of the set reference base stations are adjacent to at least one other reference base station. 18 . The server according to claim 15 , wherein, when there are a plurality of base stations having the largest hop distance from the first reference base station, the at least one instruction is further configured to set the plurality of base stations having the largest hop distance from the first reference base station as candidate base stations, and set a base station having most adjacent reference base stations among the candidate base stations as the second reference base station. 19 . The server according to claim 16 , wherein, when there are a plurality of base stations having the largest hop distance from the n-th reference base station, the at least one instructio
using carrier sensing, e.g. carrier sense multiple access [CSMA] · CPC title
Access point devices · CPC title
based on the type of the allocated resource · CPC title
Resources in time domain, e.g. slots or frames · CPC title
Processing of subscriber group data · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.