CN109618405A - Small base station distribution formula network synchronization method based on gossip algorithm - Google Patents
Small base station distribution formula network synchronization method based on gossip algorithm Download PDFInfo
- Publication number
- CN109618405A CN109618405A CN201910084863.4A CN201910084863A CN109618405A CN 109618405 A CN109618405 A CN 109618405A CN 201910084863 A CN201910084863 A CN 201910084863A CN 109618405 A CN109618405 A CN 109618405A
- Authority
- CN
- China
- Prior art keywords
- node
- base station
- nodes
- neighbor
- timing information
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W56/00—Synchronisation arrangements
- H04W56/001—Synchronization between nodes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/16—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality based on interference
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Present invention discloses a kind of small base station distribution formula network synchronization method based on gossip algorithm, include the following steps: S1, neighbor node selection step, it is non-directed graph by the network abstraction that synchronous base station is constituted, wherein each base-station node is peer-entities, and each node selects its neighbor node set；S2, synchronizing information exchange amendment step, definition node synchronizes start time, receives the timing information of neighbor node, randomly chooses node, synchronization signal by listening to all nodes in neighbor node set obtains the timing information of all neighbor nodes, modifies timing information；S3, Area Node synchronizing step re-start node selection until the timing information of all nodes is modified and judge whether the timing of all nodes is consistent, synchronize success if consistent, otherwise jump to S1 step.The present invention can complete the distributed synchronization of small base station in the case where no macro base station, the convergence rate for meeting synchronization accuracy requirement, improving base station.
Description
Technical field
The present invention relates to a kind of network synchronization methods, in particular to a kind of small base station based on gossip algorithm point
Cloth network synchronization method belongs to super-intensive network technique field.
Background technique
Super-intensive network (Ultra-Dense Networks, UDN) is the key that in the 5th generation (5G) mobile communication system
One of technology, in order to cope with ever-increasing data capacity demand, super-intensive network can be by the extensive portion in hot spot region
The mode for affixing one's name to small base station (such as Picocell, Femtocell) is wanted to meet the access of high flow capacity, highdensity wireless terminal
It asks.
In the prior art, super-intensive network mainly includes two scenes, i.e., macro-micro- covering deployment scenario and micro--micro- covers
Lid deployment scenario.The macro station service that wherein macro-micro- covering scene describes responsible basis covering coexists with micro- (small) base station service
Heterogeneous network framework.Its medium and small main main application scenarios in base station can not be touched in dense population areas, the big base station of covering
Tip communication.Small base station enhances the coverage area and service of macro base station, and the plug and play characteristic of small base station can be promoted on demand
Network capacity, and can reduce the load of macro base station.And micro--micro- scene is then no macro base station covering either covering signal matter
Measure very poor scene.By disposing various small base stations, zero-lag, high speed connection and high data rate are provided for user.
However, the mode of such small base station dense deployment can equally bring problems, wherein be the most significantly exactly,
If when not obtaining synchronous between the base station Nei Ge little of hot spot region, it will aggravate the influence of interference, too strong interference can also be serious
Influence speech quality and network rate.
Traditional cellular network simultaneous techniques mainly includes three kinds, i.e. GPS is synchronous, when passing through IEEE1588v2 protocol realization
Between synchronize and eat dishes without rice or wine to listen to synchronization.In view of the cost problem of small base station, small base station, which not will be installed generally, receives GPS signal
Equipment, thus can not accomplish that GPS is synchronous.Also, IEEE 1588v2 technology is realized on condition that link is symmetrical, and ultra dense
Collect in network scenarios, due to the plug and play characteristic of small base station, network link is asymmetric, so IEEE 1588v2 technology is same
It can not be suitable for 5G super-intensive networking scene.In addition, decentralization has become network in current technology development process
The inexorable trend of technology development can not be synchronized, secondly because high in some no macro base station regions using eating dishes without rice or wine to listen to synchronize
The small base station deployment of density can bring strong interference, when being synchronized by the way of eating dishes without rice or wine to listen to, inter base station interference signal
Useful signal can be lost, will appear mistake when listening to signal and the case where can not listening to even occur.
In conclusion the prior art not can be well solved the problem of small synchronization among base stations under super-intensive network scenarios.
Therefore, a kind of completely new network synchronization method how is proposed on the basis of existing technology, is completed in no macro base station
The convergence rate that small base station distribution formula is synchronous, meets base station synchronization required precision in region, improves base station, also just becomes at present
Researcher's urgent problem to be solved in the industry.
Summary of the invention
In view of the prior art, there are drawbacks described above, and the purpose of the present invention is to propose to a kind of small base stations based on gossip algorithm
Synchronization of distributed networks method, includes the following steps:
S1, neighbor node select step, and the very poor scene of signal quality is covered or covered for no macro base station, by synchronous base
The network abstraction constituted of standing is a non-directed graph, wherein each base-station node is peer-entities, between each node
Signal Interference and Noise Ratio be standard select its neighbor node set；
S2, synchronizing information exchange amendment step, and at the time of 0 moment of definition is that node synchronizes beginning, base station is in period τ
The timing information of neighbor node is listened to and receives, the definition n moment indicates n-th of period τ, randomly chooses a node, pass through
The synchronization signal that all nodes in the nodes neighbors node set are listened at the n moment, obtains the timing information of all neighbor nodes,
The node then modifies the timing at n+1 moment, other node states are not according to the timing information of the synchronous signal obtaining listened to
Become；
S3, Area Node synchronizing step re-start node selection, jump to S2 step, until all nodes in region
Timing information modified once subsequently determine whether the timing of all nodes consistent, indicate that node is same if consistent
It walks successfully, otherwise jump to S1 step and sequentially executes subsequent step.
Preferably, the Signal Interference and Noise Ratio between each node described in S1 is that standard selects its neighbor node
Set, specifically includes: when the Signal Interference and Noise Ratio that each node receives the synchronization signal of another node is greater than the node
When threshold value, just it is chosen as itself neighbor node.
Preferably, the Signal Interference and Noise Ratio for all node synchronization signals that the threshold definitions can listen to for node
Weighted value, weighting coefficient defines according to euclidean distance between node pair, and each node has its own corresponding threshold value.
Preferably, the S1 neighbor node selects step, specifically includes:
S11, node v is randomly selected in whole regioni, the synchronization signal for all nodes that can be listened to is received, is obtained
Its timing information, and the power of all node synchronization signals is obtained, calculate Signal Interference and Noise Ratio；
S12, according to the Signal Interference and Noise Ratio and euclidean distance between node pair of the node synchronization signal received come threshold value, will
Node viThe Signal Interference and Noise Ratio listened to is greater than the node of the threshold value as viNeighbor node, determine node viNeighbours
Node set；
S13, when neighbor node set determine after the completion of, judge whether that all nodes all have neighbor node set, if
Then enter S2 step, otherwise go to step S11.
Preferably, the S2 synchronizing information exchanges amendment step, specifically includes:
S21, a node v is randomly selectedi, receive neighbor node set IiTiming information；
S22, neighbor node set IiInterior all nodes are respectively transmitted it in the timing information at n momentTo node
vi；
S23, node viAfter the timing information at neighbor node n moment in neighbor node set, when modification is from n+1
The timing information at quarter
S24, judge whether the time of all nodes is consistent, the synchronous convergence process of Area Node is completed if consistent, otherwise
Go to step S21.
Preferably, in S23, the timing information that node subsequent time is modified is in the neighbor node set of the node
The weighted average of all timing informations, weight coefficient are determined by the Signal Interference and Noise Ratio of timing information.
Compared with prior art, advantages of the present invention is mainly reflected in the following aspects:
The present invention does not have the scene of standard synchronisation time source for base station in region, proposes a kind of distributed synchronization information
It is synchronous to realize base station time for exchange method.The problems such as big, interference is strong for base station density in super-intensive network, the present invention
Method selecting neighbor node and when obtaining its timing information, use between base station Signal Interference and Noise Ratio as neighbor node
Selection criteria；When synchronization signal is listened in base station, neighbor node synchronization signal separately send, to efficiently avoid base station
Between due to signal send caused by interference.
Meanwhile the present invention is being protected using Signal Interference and Noise Ratio and base distance between sites as neighbor node timing information weight
Under the premise of demonstrate,proving Signal Interference and Noise Ratio, the specific gravity of the closer timing information of base station distance as much as possible in promotion neighbor node,
To reduce the influence that base station is interfered in region on to greatest extent.
In addition, the present invention also provides reference for other relevant issues in same domain, can be opened up on this basis
Extension is stretched, and applies in other technical solutions synchronous about super-intensive network scenarios lower network, has very wide application
Prospect.
Just attached drawing in conjunction with the embodiments below, the embodiment of the present invention is described in further detail, so that of the invention
Technical solution is more readily understood, grasps.
Detailed description of the invention
Fig. 1 is the application scenario diagram of the method for the present invention；
Fig. 2 is the flow diagram of the method for the present invention；
Fig. 3 is the flow diagram that neighbor node selects step in the method for the present invention；
Fig. 4 is that synchronizing information of the invention exchanges schematic diagram；
Fig. 5 is the flow diagram that synchronizing information exchanges amendment step in the method for the present invention；
Fig. 6 is the constringency performance analogous diagram of the method for the present invention.
Specific embodiment
The present invention considers that in super-intensive networking scene, base station is without there are strong jammings between standard time source, base station in region
The problems such as, a kind of small base station synchronization information switching method based on gossip algorithm is devised, to solve small base station without standard
Time synchronization problem in the case of time source.
Fig. 1 is the application scenario diagram of the small base station distribution formula network synchronization method of the invention based on gossip algorithm, figure
Shown in node be small base station, wherein all small base stations be peer-entities.By the region base station Nei little be abstracted into one it is oriented
G=(V, E, W) is schemed to describe super-intensive network in figure, the N number of small base station of random distribution.Base station and communication path difference in network
It is indicated with the node of digraph and side, V indicates node set, V={ v1,v2...,vN}.E indicates the set on side, if node vi
Node v can be receivedjSignal then indicate node viAnd vjThere are side eij.W indicates the weight matrix on side, wijIndicate side eijPower
Value, weight definition are the Signal Interference and Noise Ratio (SINR) between two nodes.It is shown below:
Wherein,It is expressed as node viReceived node vjSignal reception power.Noise is fixed in region
Noise power.
The neighbor node of one node i ∈ V is defined as S (i)={ vj∈V,eij∈E,wij> Ti}。
Wherein, TiFor threshold value, node viAll neighbor nodes composition collection be collectively referred to as node viNeighbor node set,
It is denoted as Si={ vi| S (i) }, the number of neighbor node set is | Si|, interior joint viSelect the threshold value T of neighbor nodeiDefinition
Are as follows:
Wherein, dimFor node viAnd vmThe distance between, l is node viSide number.
Specifically, flow chart of the method for the present invention is as shown in Fig. 2, the small base station of the invention based on gossip algorithm point
Cloth network synchronization method, includes the following steps:
S1, neighbor node select step, and the very poor scene of signal quality is covered or covered for no macro base station, by synchronous base
The network abstraction constituted of standing is a non-directed graph, wherein each base-station node is peer-entities, between each node
Signal Interference and Noise Ratio be standard select its neighbor node set.
S2, synchronizing information exchange amendment step, and at the time of 0 moment of definition is that node synchronizes beginning, base station is in period τ
The timing information of neighbor node is listened to and receives, the definition n moment indicates n-th of period τ, randomly chooses a node, pass through
The synchronization signal that all nodes in the nodes neighbors node set are listened at the n moment, obtains the timing information of all neighbor nodes,
The node then modifies the timing at n+1 moment, other node states are not according to the timing information of the synchronous signal obtaining listened to
Become.
S3, Area Node synchronizing step re-start node selection, jump to S2 step, until all nodes in region
Timing information modified once subsequently determine whether the timing of all nodes consistent, indicate that node is same if consistent
It walks successfully, otherwise jump to S1 step and sequentially executes subsequent step.
Signal Interference and Noise Ratio between each node described in S1 is that standard selects its neighbor node set, is had
Body include: when each node receive the synchronization signal of another node Signal Interference and Noise Ratio be greater than the node threshold value when,
Just it is chosen as the neighbor node of itself.The signal for all node synchronization signals that the threshold definitions can listen to for node
The weighted value of interference-to-noise ratio, weighting coefficient are defined according to euclidean distance between node pair, can be listened to by node each in region
Node is different, and each node has its own corresponding threshold value, how many node then how many threshold value in region.
As shown in figure 3, heretofore described S1 neighbor node selects step, detailed process includes:
S11, node v is randomly selected in whole regioni, the synchronization signal for all nodes that can be listened to is received, is obtained
Its timing information, and the power of all node synchronization signals is obtained, calculate Signal Interference and Noise Ratio.Basis signal reception power,
Use weight w in above-described embodimentijCalculation formula calculate node viThe weight on all sides.
S12, according to the Signal Interference and Noise Ratio of node synchronization signal and euclidean distance between node pair received, using above-mentioned implementation
Threshold value T in exampleiCalculation formula carry out threshold value, by node viThe Signal Interference and Noise Ratio listened to is greater than the node of the threshold value
As viNeighbor node, determine node viNeighbor node set.
S13, when neighbor node set determine after the completion of, judge whether that all nodes all have neighbor node set, if
Then neighbor node set, which is chosen, completes, at this point, all nodes all have a neighbor node set in region.Otherwise step is jumped to
Rapid S11.
Fig. 4 is timing information interchange graph of the invention.As shown, node viNeighbor node v is received respectively at the n momentpWith
vqTiming information, the temporal information of neighbor node adjusts oneself temporal information, node viOneself is not sent at the n moment
Temporal information.At the n+1 moment, node viAnd vqAs node vpNeighbor node, node vpThe timing information of oneself is adjusted,
He remains unchanged node, and so on, node vqPass through node viAnd vpTiming information adjust oneself temporal information, pass through
The iteration of limited times realizes that regional nodes timing is consistent.
As shown in figure 5, the S2 synchronizing information exchanges amendment step, specifically include:
S21, a node v is randomly selectedi, receive neighbor node set IiTiming information.
S22, neighbor node set IiInterior all nodes are respectively transmitted it in the timing information at n momentTo node
vi。
S23, node viAfter the timing information at neighbor node n moment in neighbor node set, when modification is from n+1
The timing information at quarterCalculation formula is
The timing information that node subsequent time is modified is all timing informations in the neighbor node set of the node
Weighted average, weight coefficient are determined by the Signal Interference and Noise Ratio of timing information.
S24, judge whether entire node time is consistent in region, show that base station time has synchronized in the region if consistent
At, otherwise jump to S21, again in region select a node, to the node newly selected be timed information modification process.
Fig. 6 is the constringency performance analogous diagram of the method for the present invention, and the maximum timing difference of setting area interior nodes is 1s, with calculation
The timing difference of the increase of method number of run, node becomes smaller therewith, and when algorithm number of run reaches about 650 times, maximum is fixed
The time difference becomes 0, i.e. completion timing synchronizing process, this is because with the increase of algorithm number of run, each node in region
Will do it timing information exchange modification, modify the timing information of oneself according to neighbor node, each node can reduce oneself and
The timing difference of other nodes, maximum timing difference can be smaller and smaller in region, finally when algorithm runs to certain number, institute
There is the timing of node that can converge to a value, i.e. distributed synchronization is completed.
The present invention does not have the scene of standard synchronisation time source for base station in region, proposes a kind of small base station distribution formula net
It is synchronous to realize base station time for network synchronous method.The problems such as big, interference is strong for base station density in super-intensive network, this hair
Bright method uses Signal Interference and Noise Ratio between base station to save as neighbours when selecting neighbor node and obtaining its timing information
The selection criteria of point；When synchronization signal is listened in base station, neighbor node synchronization signal separately send, to efficiently avoid base
Interference caused by being sent between standing due to signal.
Meanwhile the present invention is being protected using Signal Interference and Noise Ratio and base distance between sites as neighbor node timing information weight
Under the premise of demonstrate,proving Signal Interference and Noise Ratio, the specific gravity of the closer timing information of base station distance as much as possible in promotion neighbor node,
To reduce the influence that base station is interfered in region on to greatest extent.
In addition, the present invention also provides reference for other relevant issues in same domain, can be opened up on this basis
Extension is stretched, and applies in other technical solutions synchronous about super-intensive network scenarios lower network, has very wide application
Prospect.
In general, the small base station distribution formula network synchronization method of the invention based on gossip algorithm, can be without macro
The distributed synchronization that small base station is completed in the case where base station meets the synchronization accuracy requirement of base station in region, improves the receipts of base station
Hold back speed.
It is obvious to a person skilled in the art that invention is not limited to the details of the above exemplary embodiments, Er Qie
In the case where without departing substantially from spirit and essential characteristics of the invention, the present invention can be realized in other specific forms.Therefore, no matter
From the point of view of which point, the present embodiments are to be considered as illustrative and not restrictive, and the scope of the present invention is by appended power
Benefit requires rather than above description limits, it is intended that all by what is fallen within the meaning and scope of the equivalent elements of the claims
Variation is included within the present invention, and any reference signs in the claims should not be construed as limiting the involved claims.
In addition, it should be understood that although this specification is described in terms of embodiments, but not each embodiment is only wrapped
Containing an independent technical solution, this description of the specification is merely for the sake of clarity, and those skilled in the art should
It considers the specification as a whole, the technical solutions in the various embodiments may also be suitably combined, forms those skilled in the art
The other embodiments being understood that.
Claims (6)
1. a kind of small base station distribution formula network synchronization method based on gossip algorithm, which comprises the steps of:
S1, neighbor node select step, and the very poor scene of signal quality is covered or covered for no macro base station, by synchronous base station structure
At network abstraction be a non-directed graph, wherein each base-station node is peer-entities, the letter between each node
Number interference-to-noise ratio is that standard selects its neighbor node set；
S2, synchronizing information exchange amendment step, and at the time of 0 moment of definition is that node synchronizes beginning, base station is listened in period τ
And the timing information of neighbor node is received, the definition n moment indicates n-th of period τ, a node is randomly choosed, by n
The synchronization signal for listening to all nodes in the nodes neighbors node set is carved, obtains the timing information of all neighbor nodes, the section
Point then modifies the timing at n+1 moment according to the timing information of the synchronous signal obtaining listened to, other node states are constant；
S3, Area Node synchronizing step re-start node selection, jump to S2 step, until all nodes are determined in region
When information modified once subsequently determine whether the timing of all nodes consistent, indicated if consistent node it is synchronous at
Otherwise function jumps to S1 step and sequentially executes subsequent step.
2. the small base station distribution formula network synchronization method according to claim 1 based on gossip algorithm, which is characterized in that
Signal Interference and Noise Ratio between each node described in S1 is that standard selects its neighbor node set, is specifically included:
When the Signal Interference and Noise Ratio that each node receives the synchronization signal of another node is greater than the threshold value of the node, just selected
For the neighbor node of itself.
3. the small base station distribution formula network synchronization method according to claim 2 based on gossip algorithm, it is characterised in that:
The weighted value of the Signal Interference and Noise Ratio for all node synchronization signals that the threshold definitions can listen to for node, weighting system
Number is defined according to euclidean distance between node pair, and each node has its own corresponding threshold value.
4. the small base station distribution formula network synchronization method according to claim 1 based on gossip algorithm, which is characterized in that
The S1 neighbor node selects step, specifically includes:
S11, node v is randomly selected in whole regioni, the synchronization signal for all nodes that can be listened to is received, its timing is obtained
Information, and the power of all node synchronization signals is obtained, calculate Signal Interference and Noise Ratio；
S12, according to the Signal Interference and Noise Ratio and euclidean distance between node pair of the node synchronization signal received come threshold value, by node
viThe Signal Interference and Noise Ratio listened to is greater than the node of the threshold value as viNeighbor node, determine node viNeighbor node
Set；
S13, when neighbor node set determine after the completion of, judge whether that all nodes all have neighbor node set, if then into
Enter S2 step, otherwise go to step S11.
5. the small base station distribution formula network synchronization method according to claim 1 based on gossip algorithm, which is characterized in that
The S2 synchronizing information exchanges amendment step, specifically includes:
S21, a node v is randomly selectedi, receive neighbor node set IiTiming information；
S22, neighbor node set IiInterior all nodes are respectively transmitted it in the timing information at n momentGive node vi；
S23, node viAfter the timing information at neighbor node n moment in neighbor node set, modification is from the n+1 moment
Timing information
S24, judge whether the time of all nodes is consistent, the synchronous convergence process of Area Node is completed if consistent, is otherwise jumped
To step S21.
6. the small base station distribution formula network synchronization method according to claim 4 based on gossip algorithm, it is characterised in that:
In S23, the timing information that node subsequent time is modified is all timing informations in the neighbor node set of the node
Weighted average, weight coefficient are determined by the Signal Interference and Noise Ratio of timing information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910084863.4A CN109618405B (en) | 2019-01-29 | 2019-01-29 | Small base station distributed network synchronization method based on gossip algorithm |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910084863.4A CN109618405B (en) | 2019-01-29 | 2019-01-29 | Small base station distributed network synchronization method based on gossip algorithm |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109618405A true CN109618405A (en) | 2019-04-12 |
| CN109618405B CN109618405B (en) | 2021-07-20 |
Family
ID=66018620
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910084863.4A Active CN109618405B (en) | 2019-01-29 | 2019-01-29 | Small base station distributed network synchronization method based on gossip algorithm |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109618405B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110233876A (en) * | 2019-05-13 | 2019-09-13 | 上海但为科技有限公司 | Data distributing method, diostribution device and electronic equipment based on mobile P 2 P |
| CN113810988A (en) * | 2020-06-16 | 2021-12-17 | 上海华为技术有限公司 | Data processing method and related equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103152817A (en) * | 2013-03-27 | 2013-06-12 | 哈尔滨工业大学 | Distributed clock synchronizing method based on broadcast Gossip algorithm |
| CN103813436A (en) * | 2012-11-05 | 2014-05-21 | 京信通信系统（中国）有限公司 | Method for synchronizing household base station air interface, apparatus, and household base station |
| US20140369340A1 (en) * | 2013-06-13 | 2014-12-18 | Michael Horvat | Method and devices for radio link monitoring |
| CN105120008A (en) * | 2015-09-14 | 2015-12-02 | 南京邮电大学 | Layering-based distributed cloud computing centre load balancing method |
-
2019
- 2019-01-29 CN CN201910084863.4A patent/CN109618405B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103813436A (en) * | 2012-11-05 | 2014-05-21 | 京信通信系统（中国）有限公司 | Method for synchronizing household base station air interface, apparatus, and household base station |
| CN103152817A (en) * | 2013-03-27 | 2013-06-12 | 哈尔滨工业大学 | Distributed clock synchronizing method based on broadcast Gossip algorithm |
| US20140369340A1 (en) * | 2013-06-13 | 2014-12-18 | Michael Horvat | Method and devices for radio link monitoring |
| CN105120008A (en) * | 2015-09-14 | 2015-12-02 | 南京邮电大学 | Layering-based distributed cloud computing centre load balancing method |
Non-Patent Citations (2)
| Title |
|---|
| JING XU: "Cooperative Distributed Optimization for the Hyper-Dense Small Cell Deployment", 《IEEE》 * |
| 张扬: "基于UE测量辅助的TD-LTE家庭基站时间同步算法", 《中国硕士论文全文数据库》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110233876A (en) * | 2019-05-13 | 2019-09-13 | 上海但为科技有限公司 | Data distributing method, diostribution device and electronic equipment based on mobile P 2 P |
| CN113810988A (en) * | 2020-06-16 | 2021-12-17 | 上海华为技术有限公司 | Data processing method and related equipment |
| WO2021253916A1 (en) * | 2020-06-16 | 2021-12-23 | 华为技术有限公司 | Data processing method and related device |
| CN113810988B (en) * | 2020-06-16 | 2023-03-10 | 上海华为技术有限公司 | Data processing method and related equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109618405B (en) | 2021-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Zhang et al. | Fog radio access networks: Mobility management, interference mitigation, and resource optimization | |
| López-Pérez et al. | OFDMA femtocells: A roadmap on interference avoidance | |
| Mesodiakaki et al. | Energy-efficient user association in cognitive heterogeneous networks | |
| CN105493558B (en) | For carrying out shared method and apparatus to access point status information | |
| Xu et al. | Cooperative distributed optimization for the hyper-dense small cell deployment | |
| JP6388944B2 (en) | Method of synchronization in LTE / LTE-A system in unlicensed band | |
| CN105009647B (en) | System and method for the synchronization in neighborhood aware network | |
| CN105493583A (en) | High efficiency wireless (HEW) access point (AP) coordination protocol | |
| CN104838685B (en) | For operating the method and apparatus of network controlling entity | |
| WO2018228287A1 (en) | Information transmission method and apparatus | |
| CN103200577B (en) | The group management method of TDD cross jamming and base station | |
| CN109660958A (en) | A kind of network-building method and meter register method of power meter reading system | |
| CN110140392A (en) | Synchronization signal block detection method, synchronization signal block transmission method, apparatus and system | |
| CN108243423A (en) | For the method and system of dynamic cell configuration | |
| CN105684530B (en) | For constructing the distributed method of the hierarchical structure synchronous for device-to-device with safeguarding | |
| CN104254081B (en) | A kind of method and terminal device of centralization networking | |
| CN103476105B (en) | Space connector synchronization method | |
| CN105745990B (en) | Wireless device with relay capabilities | |
| CN104184549B (en) | A kind of method and apparatus to communicate in TDD system D2D UE | |
| CN103873218B (en) | Public search space CSS disturbance coordination method and device | |
| CN101667874A (en) | Method and system for partial cooperative spectrum sensing | |
| CN106162810B (en) | A kind of new node networking synchronous method of wireless multi-hop collaborative network | |
| CN104469928B (en) | A kind of air interface synchronization method and device based on network intercepting | |
| CN104854895A (en) | Method and apparatus for seamless handover operation in wireless communication system | |
| CN104094647B (en) | Synchronous method and base station |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |