In one aspect, network node operates in a wireless communications network that includes two or more beam-based transmission points (30), where each of the two or more beam-based transmission points transmits synchronization signals corresponding to beams transmitted by the respective transmission point. The network node configures the two or more beam-based transmission points to use non-conflicting radio resources for their respective transmissions of synchronization signals.

A method of defining a Site to constitute one more interference coordination group (ICG). Additionally defined a Site to be constituted of Sub-Sites and defining ICSG (interference coordination sub-group), allowing a given access point from a ICG to belong to one or more ICSG. A method of aggregating the channel quality information determined by information provided from the SAS (Spectrum Access System) and Probe UE (User Equipment) to define ICG and ICSG. Providing a preferred ordered list of channels for ICG and each ICSG, further adapting the SON (Self Organizing Network) algorithm to use the channel allocations received for ICG and ICSG to perform optimized allocations. Continuously perform the Channel quality assessment and ICG/ICSG determination and rebalance the channel allocation based current, predicted, time-series, and know events for optimized operation.

A method of defining a Site to constitute one more interference coordination group (ICG). Additionally defined a Site to be constituted of Sub-Sites and defining ICSG (interference coordination sub-group), allowing a given access point from a ICG to belong to one or more ICSG. A method of aggregating the channel quality information determined by information provided from the SAS (Spectrum Access System) and Probe UE (User Equipment) to define ICG and ICSG. Providing a preferred ordered list of channels for ICG and each ICSG, further adapting the SON (Self Organizing Network) algorithm to use the channel allocations received for ICG and ICSG to perform optimized allocations. Continuously perform the Channel quality assessment and ICG/ICSG determination and rebalance the channel allocation based current, predicted, time-series, and know events for optimized operation.

Systems and methods for determining an assignment of radio resources to antennas are provided. In some embodiments, a method includes obtaining an antenna deployment including antennas and corresponding locations for the antennas; determining a cell assignment for the antennas such that each antenna is assigned to one cell out of one or more cells; and, based on the cell assignment, determining a resource assignment for the antennas such that each antenna is assigned to one radio resource out of one or more radio resources. In this way, some embodiments disclosed herein provide a lightweight and efficient method to design a distributed antenna deployment. In some embodiments, the resulting network is optimized in terms of the total area where a high rank is achieved.

Systems and methods for determining an assignment of radio resources to antennas are provided. In some embodiments, a method includes obtaining an antenna deployment including antennas and corresponding locations for the antennas; determining a cell assignment for the antennas such that each antenna is assigned to one cell out of one or more cells; and, based on the cell assignment, determining a resource assignment for the antennas such that each antenna is assigned to one radio resource out of one or more radio resources. In this way, some embodiments disclosed herein provide a lightweight and efficient method to design a distributed antenna deployment. In some embodiments, the resulting network is optimized in terms of the total area where a high rank is achieved.

A search-based heuristic for assigning frequencies to transmitters in a fixed spectrum frequency assignment (FS-FA) telecommunications network in order to satisfy a set of frequency constraints is described. Each connection in a network must have a frequency assigned from the spectrum which satisfies the set of constraints, which specify the frequency separation which is necessary between frequencies assigned to different transmitters. Violation of these constraints creates interference, which must be minimized. The exemplary heuristic has two main components: a local search heuristic and a compound move. The local search heuristic employs one-change moves and a lookup table that classifies all possible one-change moves as positive or negative, which are chosen until a locally minimal solution is found. The compound move operation shifts the local search to a new location in the search space. The local search and compound move are iterated until a total interference cost function is minimized.

A search-based heuristic for assigning frequencies to transmitters in a fixed spectrum frequency assignment (FS-FA) telecommunications network in order to satisfy a set of frequency constraints is described. Each connection in a network must have a frequency assigned from the spectrum which satisfies the set of constraints, which specify the frequency separation which is necessary between frequencies assigned to different transmitters. Violation of these constraints creates interference, which must be minimized. The exemplary heuristic has two main components: a local search heuristic and a compound move. The local search heuristic employs one-change moves and a lookup table that classifies all possible one-change moves as positive or negative, which are chosen until a locally minimal solution is found. The compound move operation shifts the local search to a new location in the search space. The local search and compound move are iterated until a total interference cost function is minimized.

Example information transmission methods are described. One example method includes that a first base station receives resource status information from a second base station. The resource status information includes a service classification identifier and a resource status corresponding to the service classification identifier. The service classification identifier is a service type identifier or slice identification information.

Example information transmission methods are described. One example method includes that a first base station receives resource status information from a second base station. The resource status information includes a service classification identifier and a resource status corresponding to the service classification identifier. The service classification identifier is a service type identifier or slice identification information.

A method for mapping underground sensors onto a network map may include obtaining a plurality of magnetic measurements from a plurality of sensors. The method may include using the plurality of magnetic measurements for determining a plurality of sensor locations in an initial network map. The method may include generating updated network maps from the perspective of each localized sensor. The method may include merging the updated network maps into a final network map, the final network map comprising a most accurate location for each sensor. The method may include determining inner localized sensors out of the plurality of sensors in the final network map. The method may include identifying the inner localized sensors as new base station anchors. The method may include mapping the inner localized sensors onto the final network map as new base station anchors.