[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN100382631C - Method of implementing neighbour region searching in time division group network system - Google Patents

Method of implementing neighbour region searching in time division group network system Download PDF

Info

Publication number
CN100382631C
CN100382631C CNB2004100095900A CN200410009590A CN100382631C CN 100382631 C CN100382631 C CN 100382631C CN B2004100095900 A CNB2004100095900 A CN B2004100095900A CN 200410009590 A CN200410009590 A CN 200410009590A CN 100382631 C CN100382631 C CN 100382631C
Authority
CN
China
Prior art keywords
frame
sector
time
search
different
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.)
Expired - Fee Related
Application number
CNB2004100095900A
Other languages
Chinese (zh)
Other versions
CN1753543A (en
Inventor
高翔
刘和兴
吴岩巍
刘颖
王宁
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Priority to CNB2004100095900A priority Critical patent/CN100382631C/en
Publication of CN1753543A publication Critical patent/CN1753543A/en
Application granted granted Critical
Publication of CN100382631C publication Critical patent/CN100382631C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Mobile Radio Communication Systems (AREA)

Abstract

The present invention relates to a method for a neighboring area search in a time division networking system. In the time division networking system, at least one terminal exists; the terminal is accessed to one sector of one base station of the system and can normally communicate with the sector. The present invention is characterized in that the present invention comprises the following steps: terminal the demodulation of downstream signals, the terminal acquires the frame length information of the system and the frame start timing information of other different sectors; the terminal searches for the signals of neighboring subarea, and by using the starting time of different sector frames as a reference, the neighbouring area search is executed only in different intervals to capture the data frames of different sectors; if the signals are successfully found, the terminal records the actual starting time information of the signal frames to make preparations for the later switching between the sectors. The method can be applied to cellular networking and has high searching efficiency.

Description

A kind of method of in time-division group network system, carrying out the adjacent area search
Technical field
The present invention relates to a kind of time-division group network technology of wireless communication field, particularly relate to a kind of method of in time-division group network system, carrying out the adjacent area search.
Background technology
Radio communication is the fastest industry of development in recent years, up to BWA (broadband wireless access), demonstrates fully the tremendous influence power of communication standard from GSM (global system for mobile communications), CDMA (code division multiple access access) standard, 3G standard.Growing along with data service, manifesting gradually of multimedia service demand to wireless access technology, puts forward higher requirement.The system work of new wireless access wide band technology standard is carried out just in full preparation.
IEEE 802.16 series standards have defined wireless MAN (metropolitan area network) air interface specification, and it is made up of MAC (medium access control) layer and a plurality of physical layer.This WiMAX inserts standard " last mile " broadband connection service is provided in wireless MAN.
IEEE 802.16 series standards are for providing the means of the multi-service wireless access with service quality towards connection or connectionless service.10~66GHz frequency range in IEEE 802.16 series standards is mainly used in the service access of high traffic, because it needs line-of-sight transmission and high equipment cost, the progress of standard is very slow.For in the following frequency range developing target market of widely used 11GHz already, IEEE has released the extended version standard that runs on 2 ~ 11GHz, revised the standard of MAC (medium access control), and physical layer has also increased corresponding standard.Current Standard is applicable to that special permission frequency range and 2.4G, 5.8GHz etc. exempt to specially permit frequency range.
The setting that WiMAX inserts is similar to cellular system, use be that service radius is thousands of meters base station.Rely on 802.16 series standards, enterprise and resident have had a kind of new method that can enjoy broadband service more quickly, and by using the 802.16 series standard equipment that can support that the large tracts of land metropolitan area network inserts, the deployment of wireless service can be finished fast.
In order to support large-scale networking, agreement needs to carry out big carrier-class disposes, and realizes beehive net.In the 802.16d serial protocols, be that the system of physical layer still can not the supporting cellular networking with the OFDM technology, this has limited the further application of this standard technique.
For this problem, at Chinese patent " being used for reusable time-sharing method of frequency and equipment in the cellular communication system " (application number 96197163.0), proposed a kind of time-division group network method, and provided the application in paging system.But this method can not directly apply in the beehive net, also needs to solve the function of search of terminal to the sub-district.Because the zero-time of different sector frame is different, according to conventional search methods, the search window of terminal can be very big, and the efficient of search is very low.
Summary of the invention
Technical problem to be solved by this invention is to provide a kind of method of carrying out the adjacent area search in time-division group network system, and it can be applicable in the beehive net and the search efficiency height.
To achieve these goals, the invention provides a kind of method of in time-division group network system, carrying out the adjacent area search, in this time-division group network system, there is a terminal at least, this terminal has inserted a sector of this base station of system, and can be normally and this sector communicate, wherein, comprise the steps:
Step 1, this terminal are obtained the frame length information of this system and the frame zero-time t of other different sectors by the demodulation downstream signal 1, t 2..., t N
Step 2, the signal of this terminal searching neighbor cell, and be benchmark with the zero-time of different sector frame, only at different interval [t 11, t 1+ τ 2], [t 21, t 2+τ 2] ..., [t N1, t N+ τ 2] in carry out adjacent area search, to catch different sectors of data frames, wherein [τ 1, τ 2] be search box size to each frame zero-time of different sectors, above-mentioned different intervals are not overlapping, between have at interval;
Step 3, if successfully search signal, this terminal is with the actual start time information of tracer signal frame.
The method of above-mentioned adjacent area search, wherein, in any base station of this system, the frame length that data communication is carried out in different sectors, this base station is identical, the zero-time difference of different sector frame.
The method of above-mentioned adjacent area search is characterized in that, when there were 3 sectors each base station, 3 sector mean allocation were at the data transmission period of each sector frame, and can only have a sector to carry out transfer of data at the same time.
The method of above-mentioned adjacent area search wherein, has the sector synchronized transmission and the reception of identical sector area code between different base station in this system, and have identical frame starting point and transmission data length.
The method of above-mentioned adjacent area search, wherein, the frame structure in this system between the different sectors, same base station is nested frame structure.
The method of above-mentioned adjacent area search, wherein, this system is TDD system or FDD system.
The method of above-mentioned adjacent area search, wherein, in the TDD system, Frame is sub-frame of uplink and/or descending sub frame.
The method of above-mentioned adjacent area search, wherein, in the FDD system, Frame is uplink frame or descending chain circuit frame.
Describe the present invention below in conjunction with the drawings and specific embodiments, but not as a limitation of the invention.
Description of drawings
Fig. 1 is the terminal communication schematic diagram based on the time-division group network technology;
Fig. 2 is the schematic diagram of different sector frame structures and timing method among Fig. 1;
Fig. 3 is the terminal mobile communication schematic diagram between different base station based on the time-division group network technology;
Fig. 4 is based on the distribution method schematic diagram between the different sectors of time-division group network;
Fig. 5 is disclosed a kind of flow chart that carries out the adjacent area searching method in time-division group network system.
Embodiment
With reference to figure 1-Fig. 4, the present invention can be applied to the system group network based on the IEEE802.16 serial protocols, also can be used for other communication system.
Be illustrated in figure 1 as Radio Network System based on aforementioned time-division group network method.B0...B6 is respectively base station in the wireless network, forms cellular network jointly.In order to simplify narration, in Fig. 1, having 3 sectors with each base station is example, is labeled as S in order successively 1, S 2, S 3Between the different base station, if the sector has identical numbering, then the sector should have identical direction as far as possible, to avoid interference.The frame length that data communication is carried out in the base station is L.According to the time-division group network needs, on time domain, frame is divided into 3 parts successively according to certain rule, the zero-time of each sector frame is designated as t successively 1, t 2, t 3, length is respectively L 1, L 2, L 3I sector S iCorresponding length L i, i sector can only be at time corresponding L iIn carry out transfer of data.In order to simplify, with 3 sector mean allocation frame lengths, promptly L 1 = L 2 = L 3 = L 3 . And distribute the transmission time not change in time.
Be illustrated in figure 2 as different sector frame structures and timing schematic diagram, in frame was divided, the zero-time of different sector frame was different, and the original position of i sector (i=1,2,3) is from distributing to the time period L of this sector iInitial position t iBeginning, and the length of each sector frame is L.But the L that the i sector can only distributed iCarry out transfer of data in time, other times must not occupied bandwidth.Can avoid the interference between the different sectors like this.
For the network that a plurality of base stations are formed, different base station will communicate respectively according to the method described above.The sector that has the same fan area code between different base station sends strict synchronism and receive, and has identical frame starting point and transmission data length.
Known to Fig. 2, adopted the nested method of frame to carry out transfer of data between the different sectors, the zero-time of frame is different between the different sectors, promptly same base station, and sometime, can only have a sector to carry out transfer of data at most.K frame as the 1st sector is from t K, 1To t K+1,1Time, this time comprised between the different sectors protection at interval.But the actual data available transmission time is from t in the k frame of the 1st sector K, 1To t K, 2Time L 1, this time has comprised the blanking time of the boundary belt between the different sectors, and at t K, 2To t K+1,1Transfer of data is not carried out in the 1st sector in time, to avoid that other sub-districts (sector) caused interference.For the k+1 frame of the 1st sector, then be from t K+1,1To t K+2,1Time, this time comprised between the different sectors protection at interval.But the actual data available transmission time is from t in the k+1 frame of the 1st sector K+1,1To t K+1,2Time L 1, this time has comprised the blanking time of boundary belt between the different sectors.And at t K+1,2To t K+2,1Transfer of data is not carried out in the 1st sector in time, to avoid the interference to other sub-districts (sector).
In like manner, the k frame of the 2nd sector is from t k, 2 to t K+1,2Time, this time comprised between the different sectors protection at interval.But the actual data available transmission time is from t in the k frame of the 2nd sector K, 2To t K, 3Time L 2, this time has comprised the blanking time of boundary belt between the different sectors, and at t K, 3To t K+1,2Transfer of data is not carried out in the 2nd sector in time, to avoid that other sub-districts (sector) caused interference.For the k+1 frame of the 2nd sector, then be from t K+1,2To t K+2,2Time, this time comprised between the different sectors protection at interval.But the actual data available transmission time is from t in the k+1 frame of the 2nd sector K+1,2To t K+1,3Time L 2, this time has comprised the blanking time of boundary belt between the different sectors.And at t K+1,3Do not carry out transfer of data to interior the 2nd sector of the time of this frame end, to avoid interference to other sub-districts (sector).
Same method can realize the 3rd sectors of data transmission.
As seen by above-mentioned, Frame is accurate timing between the different sectors, same base station, and the zero-time of different sector data frames differs regular time at interval.Can only have a sector to carry out data in a certain set time sends.Frame structure between the different sectors, above-mentioned same base station is nested frame structure.
In order to realize the beehive net of a plurality of base stations, also to realize accurate timing between the different base station.Be different base station but have between the sector of same fan area code and want synchronized transmission and reception.The generation that can farthest avoid interference like this.
In Fig. 5, disclosed a kind of flow process of in time-division group network system, carrying out the adjacent area searching method.This method comprises the steps:
Step 100, this terminal are obtained the frame length information of this system and the frame zero-time of other different sectors by the demodulation downstream signal;
Step 200, the signal of this terminal searching neighbor cell, and be benchmark with the zero-time of different sector frame, only in different intervals, carry out the adjacent area search, to catch different sectors of data frames;
Step 300, if successfully search signal, this terminal will write down the actual start time information of this signal frame.
This method is applicable to the beehive net of TDD or FDD.To the TDD system, the Frame in the said method comprises that sub-frame of uplink and descending sub frame or said method are sub-frame of uplink or descending sub frame; For the FDD system, the Frame in the said method is meant uplink frame or descending chain circuit frame.
Fig. 3 is terminal communication scheme between different base station in the time-division group network cellular network, and this network is made up of a plurality of base stations, and there are three sectors each base station, and adopts aforesaid communication frame structure.A terminal has inserted cellular network, and communicates by the 1st sector of BTS1.Shown in arrow among the figure, this terminal moves in the drawings from right to left.In cellular network when guaranteeing that terminal moves to other sub-districts (sector) the uninterrupted communication process.Require terminal in moving process, can search for the signal of other sub-districts (sector).If condition satisfies, then need to realize the handoff procedure between sub-district (sector).
According to above-mentioned time-division group network mode, the method for other cell signals of search of terminal is as follows.
If this terminal communicates with first sector (sub-district) of BTS1, this terminal obtains the zero-time t of frame length information L and different sector data frames by the downstream signal of demodulation BTS1 1, t 2, t 3
In order to guarantee the proper communication in moving process, terminal need be searched for the signal of other sectors (sub-district), determines the original position of other sector frame.The signal timing relation of different from the above sectors (sub-district) is by this timing sequence t 1, t 2, t 3Decision.If the search box size of terminal is [τ 1, τ 2], in order to catch the original position of different sector frame, at t 1, t 2, t 3Search window constantly is respectively [t 11, t 1+ τ 2], [t 21, t 2+ τ 2], [t N1, t N+ τ 2].The searching method of this great-jump-forward has reduced the zone of searching for, and has improved the efficient of signal search.
Certainly; the present invention also can have other various embodiments; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art work as can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection range of the appended claim of the present invention.

Claims (8)

1. one kind is carried out the method that the adjacent area is searched in time-division group network system, at least have a terminal in this time-division group network system, this terminal has inserted a sector of this base station of system, and can be normally and this sector communicate, it is characterized in that this method comprises the steps:
Step 1, this terminal be by the demodulation downstream signal, obtains the zero-time t of the frame of the frame length information of this system and other different sectors 1, t 2..., t N
Step 2, the signal of this terminal searching neighbor cell, and be benchmark with the zero-time of different sector frame, only at different interval [t 11, t 1+ τ 2], [t 21, t 2+ τ 2] ..., [t N1, t N+ τ 2] in carry out adjacent area search, to catch different sectors of data frames, wherein [τ 1, τ 2] be search box size to each frame zero-time of different sectors, described different intervals are not overlapping, between have at interval;
Step 3, if successfully search signal, this terminal is with the actual start time information of tracer signal frame.
2. the method for adjacent area according to claim 1 search is characterized in that, in any base station of this system, the frame length that data communication is carried out in different sectors, this base station is identical, the zero-time difference of different sector frame.
3. the method for adjacent area according to claim 2 search is characterized in that, when there were 3 sectors each base station, 3 sector mean allocation were at the data transmission period of each sector frame, and can only have a sector to carry out transfer of data at the same time.
4. the method for adjacent area according to claim 1 search is characterized in that having the sector synchronized transmission and the reception of identical sector area code between different base station in this system, and has identical frame starting point and transmission data length.
5. according to the method for claim 1 or 4 described adjacent area search, it is characterized in that the frame structure in this system between the different sectors, same base station is nested frame structure.
6. the method for adjacent area according to claim 5 search is characterized in that this system is TDD system or FDD system.
7. the method for adjacent area according to claim 6 search is characterized in that in the TDD system, Frame is sub-frame of uplink and/or descending sub frame.
8. the method for adjacent area according to claim 6 search is characterized in that in the FDD system, Frame is uplink frame or descending chain circuit frame.
CNB2004100095900A 2004-09-21 2004-09-21 Method of implementing neighbour region searching in time division group network system Expired - Fee Related CN100382631C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2004100095900A CN100382631C (en) 2004-09-21 2004-09-21 Method of implementing neighbour region searching in time division group network system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2004100095900A CN100382631C (en) 2004-09-21 2004-09-21 Method of implementing neighbour region searching in time division group network system

Publications (2)

Publication Number Publication Date
CN1753543A CN1753543A (en) 2006-03-29
CN100382631C true CN100382631C (en) 2008-04-16

Family

ID=36680184

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2004100095900A Expired - Fee Related CN100382631C (en) 2004-09-21 2004-09-21 Method of implementing neighbour region searching in time division group network system

Country Status (1)

Country Link
CN (1) CN100382631C (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101370276B (en) * 2007-08-17 2012-07-04 中兴通讯股份有限公司 Neighbor section list updating method
US8363767B2 (en) * 2009-01-13 2013-01-29 Intel Mobile Communications GmbH Method and device for transferring data
CN103200648B (en) * 2013-03-08 2015-09-16 北京久华信信息技术有限公司 A kind of method realizing frame length search and descending Timing Synchronization

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030039228A1 (en) * 2001-08-22 2003-02-27 Shiu Da-Shan Method & apparatus for W-CDMA handoff searching
US20030095516A1 (en) * 2001-10-26 2003-05-22 Samsung Electronics Co., Ltd. Cell search apparatus and method in a mobile communication system
CN1453948A (en) * 2002-04-24 2003-11-05 三星电子株式会社 Cell searching apparatus and method for supporting multi search function in mobile communication system
CN1512794A (en) * 2002-12-30 2004-07-14 �ʼҷ����ֵ��ӹɷ����޹�˾ Small cell searching method and device for mobile terminal in TDD-CDMA system

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030039228A1 (en) * 2001-08-22 2003-02-27 Shiu Da-Shan Method & apparatus for W-CDMA handoff searching
US20030095516A1 (en) * 2001-10-26 2003-05-22 Samsung Electronics Co., Ltd. Cell search apparatus and method in a mobile communication system
CN1453948A (en) * 2002-04-24 2003-11-05 三星电子株式会社 Cell searching apparatus and method for supporting multi search function in mobile communication system
CN1512794A (en) * 2002-12-30 2004-07-14 �ʼҷ����ֵ��ӹɷ����޹�˾ Small cell searching method and device for mobile terminal in TDD-CDMA system

Also Published As

Publication number Publication date
CN1753543A (en) 2006-03-29

Similar Documents

Publication Publication Date Title
CN102811494B (en) A kind of data transmission method and device
US10681658B2 (en) Communication system
EP2567556B1 (en) Apparatus and method to control the collection of measurement data in a communication system
CN101422007B (en) Methods and apparatus related to composite beacon and wideband synchronization signaling
TW343419B (en) Adaptive neighbor cell list
KR101513038B1 (en) Method For Managing ID Information for Heterogeneous cells
RU2005127326A (en) SYSTEM AND METHOD INTENDED TO EXTEND THE NEARBY CELL SEARCH WINDOW
RU2698252C1 (en) Method of transmitting system information, a base station and a terminal
CN105745981A (en) Method of synchronization within an LTE/LTE-A system in unlicensed spectrum
CN100534027C (en) Transmission method of time division duplexing system
CN103582077A (en) Inter-cell D2D communication method, UE and base station
CN104255056A (en) Switching method and device
CN100407598C (en) A multi-carrier based public physical channel assignment method
CN106375965A (en) Method, device and system for broadcasting system information
Kapoor et al. A base station selection scheme for handover in a mobility-aware ultra-dense small cell urban vehicular environment
CN104995944A (en) Method and apparatus for supporting user equipment to execute task
CN103199975A (en) Multi-indoor-eNB (MIB) system of distributed type carrier aggregation
CN101087469B (en) A method for realizing random access of user device
CN100382631C (en) Method of implementing neighbour region searching in time division group network system
CN102625439B (en) Method and equipment for carrying out synchronization
CN102104931B (en) Method and device for fragmenting, sending and receiving network topology information
CN101981828B (en) Apparatus and method for supporting different system in broadband wireless communication system using multi-hop relay scheme
WO2019137293A1 (en) Method and device for synchronization between base stations
CN104160749A (en) Wireless communication method and device
CN1568055A (en) A networking method for time division duplexing mode cellular network

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20080416

Termination date: 20170921