CN103119863A - Channel structure for non-contention based windows and contention based random access requests - Google Patents

Channel structure for non-contention based windows and contention based random access requests Download PDF

Info

Publication number
CN103119863A
CN103119863A CN201180045920XA CN201180045920A CN103119863A CN 103119863 A CN103119863 A CN 103119863A CN 201180045920X A CN201180045920X A CN 201180045920XA CN 201180045920 A CN201180045920 A CN 201180045920A CN 103119863 A CN103119863 A CN 103119863A
Authority
CN
China
Prior art keywords
subscriber
window
request
repeater
renewal
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
Application number
CN201180045920XA
Other languages
Chinese (zh)
Other versions
CN103119863B (en
Inventor
大卫·G·维亚特罗夫斯基
迪彭德拉·M·乔杜里
托马斯·B·博恩
普涅特·K·普瑞
鲁帕克·M·英高尔
德利亚·M·马筹斯基
阿比希舍克·库马尔
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.)
Motorola Solutions Inc
Original Assignee
Motorola Solutions Inc
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 Motorola Solutions Inc filed Critical Motorola Solutions Inc
Publication of CN103119863A publication Critical patent/CN103119863A/en
Application granted granted Critical
Publication of CN103119863B publication Critical patent/CN103119863B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/02—Hybrid access
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01S—RADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S5/00—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations
    • G01S5/02—Position-fixing by co-ordinating two or more direction or position line determinations; Position-fixing by co-ordinating two or more distance determinations using radio waves
    • G01S5/14—Determining absolute distances from a plurality of spaced points of known location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B7/00—Radio transmission systems, i.e. using radiation field
    • H04B7/24—Radio transmission systems, i.e. using radiation field for communication between two or more posts
    • H04B7/26—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
    • H04B7/2603—Arrangements for wireless physical layer control
    • H04B7/2606—Arrangements for base station coverage control, e.g. by using relays in tunnels
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W36/00—Hand-off or reselection arrangements
    • H04W36/06—Reselecting a communication resource in the serving access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/21—Control channels or signalling for resource management in the uplink direction of a wireless link, i.e. towards the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/20—Control channels or signalling for resource management
    • H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W8/00—Network data management
    • H04W8/22—Processing or transfer of terminal data, e.g. status or physical capabilities
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04—Large scale networks; Deep hierarchical networks
    • H04W84/042—Public Land Mobile systems, e.g. cellular systems
    • H04W84/047—Public Land Mobile systems, e.g. cellular systems using dedicated repeater stations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W56/00—Synchronisation arrangements
    • H04W56/004—Synchronisation arrangements compensating for timing error of reception due to propagation delay
    • H04W56/0045—Synchronisation arrangements compensating for timing error of reception due to propagation delay compensating for timing error by altering transmission time
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W64/00—Locating users or terminals or network equipment for network management purposes, e.g. mobility management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/04—Scheduled access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W74/00—Wireless channel access
    • H04W74/08—Non-scheduled access, e.g. ALOHA
    • H04W74/0833—Random access procedures, e.g. with 4-step access
    • H04W74/0838—Random access procedures, e.g. with 4-step access using contention-free random access [CFRA]

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Databases & Information Systems (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Telephonic Communication Services (AREA)

Abstract

Methods of communicating location information from a subscriber to a repeater are described. The subscriber switches from a working channel to a data revert channel, transmits a request for a periodic or one-time window to transmit an update, and determines from grant information in the response announcement the allocated window and frame before switching back to the working channel. Before the allocated time, the subscriber switches to the data revert channel, confirms whether it remains scheduled to transmit the update from a repeater announcement, and if so transmits the location update in either the current or reserved window. The announcements from the repeater contain the identity of the next window and frame and the subscriber reserved to use the window in addition to grant information. The subscribers may or may not be time-aligned and the data and data revert channels may or may not be synchronized.

Description

Be used for based on non-competing window with based on the channel architecture of the random access request of competition
Technical field
The present invention relates to provide the method and system of the data communication of scheduling in communication system.
Background technology
Wireless communication system comprises can be mobile or the subscriber of portable radio unit and subscriber by its static infrastructure that communicates in cluster mode.Infrastructure comprises for example base station and controller.The subscriber distributes geographically, and usually communicates with different base stations.
Typical communication system is launched voice, video or other data (following only be called " data ") message with the working channel that is preset frequency and time slot between subscriber and base station.Working channel is Random Access Channel, and according to message direction and difference: enter (or up link) channel and be used for communication from subscriber to the base station, and (or down link) channel of going out is used for the communication from the base station to subscriber.When the subscriber wished to other subscriber's transmitting datas, at first this subscriber determined the state of uplink channel---namely, be busy or idle.In ETSI's digital mobile radio (ETSI-DMR) system, downlink channel is periodically launched the CACH(public announcements channel of the state of indicating channel) burst.
In many systems, require the subscriber to monitor that before attempting transmitting data uplink channel reaches the time period of prolongation.In case the subscriber has determined uplink idle, at first the subscriber can be by sending attempting transmitting data with the request of launching to the base station.If a large amount of subscribers use identical working channel, a plurality of subscribers can attempt launching simultaneously these requests, and cause conflict between request.Because the message of a plurality of conflicts is interfering with each other, usually this message is not responded so receive simultaneously the base station of the message of a plurality of conflicts, and make each message be retransmitted.In addition, communication system also requires to send acknowledge message to the subscriber usually on the channel of going out, to confirm the reception from subscriber's message.This bandwidth that has improved on the channel of going out is used, and has further improved from the needed time quantum of subscriber's transmitting data.
These problems because recently to use global positioning system (GPS) or other system determine the subscriber the position expectation and become problem more and more arranged.Launch frequently due to it when subscriber's positional information and when having large business load on channel, may be for the impact such as other data services of speech business in order to minimize the position data, can be in transmitting site data on Random Access Channel independently.Yet the throughput of this independent channel also is subject to above factor, that is, and and the restriction of channel access process (needing about 540ms) and collision probability.Simulation in one example (wherein, it is the channel access collision window that 6 bursts and radio device have 150ms that use utilizes ETSI DMR agreement, the emission of half rate FEC) show when sending location message on independent channel, for 93% or the better target probability of success (it is considered acceptable level usually), should attempt that every channel is per minute is no more than 20 renewals.Although this is reasonably when following the tracks of little subscriber and organize, if (for example, greater than hundreds of) subscribers' position is in a large number followed the tracks of in expectation, this becomes problem very much.This situation may for example occur when wishing to follow the tracks of the communicator of assigning in emergency service or other government vehicles in government organs (federation, state or place).And, may wish to adopt such tracking such as the other industry of transportation (for example, Freight Transport), public utilities, manufacturing, hospital, retail, airport, building, private safety or storage.Yet, in this case, be used for providing the quantity of the infrastructure equipment of tracking to become that cost is high greatly and correspondingly when providing for the acceptable level of the success of position requests.
Because the expectation that might only follow the tracks of for the position increases, and therefore the number of tracked device correspondingly increases, therefore expect that providing a kind of recovers for usage data the method and system that channel carries out the position tracking, wherein reduced the quantity of the infrastructure of using and recovered the number of channel and reduced thus cost, and wherein, minimize time quantum for channel access.
Description of drawings
Identical Reference numeral refers to identical or similar element on function in each view of accompanying drawing, accompanying drawing is involved in specification and form an illustrative part together with following detailed description, and be used for further illustrating the embodiment of concept, and explain the various principle and advantages of those embodiment.
Fig. 1 illustrates the embodiment of communication system.
Fig. 2 illustrates the internal frame diagram of the embodiment of communicator.
Fig. 3 illustrates and sets up and an embodiment of the flow chart of the method for communication position renewal.
Fig. 4 illustrates an embodiment of channel architecture.
Fig. 5 A illustrates an embodiment of the scheduling in the data superframe; Fig. 5 B illustrates another embodiment of the scheduling in superframe.
Fig. 6 illustrates the embodiment that data are recovered the logical construction of channel.
Fig. 7 illustrates an embodiment of the announcement that comprises allowance.
Fig. 8 illustrates an embodiment of the announcement that does not comprise allowance.
Fig. 9 illustrates an embodiment from subscriber's request.
But Figure 10 A illustrates an embodiment who comprises allowance do not comprise the announcement of next window distribution; Figure 10 B illustrates and neither comprises the embodiment that allowance does not comprise the announcement of next window distribution yet.
Figure 11 illustrates an embodiment of the window of expansion scheduler.
Figure 12 illustrates an embodiment for the timing of request and allowance.
An embodiment is regularly upgraded in the position that Figure 13 illustrates when cushioning.
Figure 14 illustrates an embodiment of the timing that is used for request and permits when cushioning.
An embodiment who only permits message who uses when permitting when providing with empty window is provided Figure 15.
Equipment and method part have been represented with ordinary symbol in the accompanying drawings in due course, accompanying drawing only shows those details relevant to understanding illustrated embodiment, so that do not make the disclosure and obscure mutually for benefiting from this one of ordinary skilled in the art of explanation apparent details.Therefore can there be all those other elements as is known to persons skilled in the art.
Embodiment
A kind of system and method is provided, and in this system and method, the subscriber uses auxiliary (recovery), and channel is dispatched and upgrades to repeaters transmit.This channel is constructed to support the communication window based on non-competing, between this communication window, to the repeaters transmit positional information---namely, assign specific different windows to each subscriber.For determining that the initial request with the assigned communication window is based on the random access request of competition.Communication window comprises a plurality of time slots, and at least one maintenance wherein is not assigned, and at this time durations, repeater is used for sign and assignment information and the new assignment information of next communication window to request subscriber broadcasting.Determine the number of the window of appointment during special time period (for example, frame or data superframe) by the renewal frequency of being asked by the subscriber in request.
Although usually having described periodic and disposable position at this upgrades, but periodicity or the transmission of disposable data of other types can be dispatched with similar technology, such as providing voice or video information or audience's responding system (ARS) message to repeater via the renewal of scheduling.Although upgrading can be the data of any type, for convenient, following explanation will all relate to the position and upgrade.
Fig. 1 illustrates the general networking 100 that comprises infrastructure 110.Have many distributed element in infrastructure 110, some are local each other, and other distribute geographically away from each other.Such element comprises one or more repeaters 120,122, these one or more repeaters 120,122 provide make the subscriber 130 that disposes in the overlay area by repeater 120 service by 110 pairs of infrastructure in same overlay area or the connection of other devices in different overlay areas.The information of its reception of repeater relaying.Each in repeater 120,122 can comprise a plurality of repeaters, and these a plurality of repeaters can receive and resend messages between subscriber 130.Repeater 120 can be this locality/service certain subscriber 130 in certain subscriber 130, and as for dispatching of relays device 122(referred to here as scheduler) subordinate (slave).
Infrastructure 110 can also be included in unshowned various other elements in Fig. 1.Infrastructure 110 can be connected to a plurality of other content source, such as internet or various Intranet, and can comprise the zone of a plurality of interconnection, district inclusion zone controller, base station and the data server of each interconnection.Infrastructure 110 can also be linked to PSTN (PSTN), paging network or facsimile machine.
Subscriber 130 can be mobile or the device of portable mobile wireless radio unit, cellular radio/phone or any other type that can wirelessly communicate with infrastructure.Subscriber's example comprises cell phone, personal digital assistant or the communicator that is used by the first-aid personnel, and can be coupled to other devices such as video terminal, pocket computer etc.Other elements such as controller can be used for distributing radio frequency (RF) communication resource between the subscriber.Controller can be deployed in a position, perhaps can be distributed between repeater.
One or more location servers 140 can be disposed in each position.Repeater 120,122 is after receiving the position renewal from subscriber 130, directly this information (as shown in solid line) is provided and does not repeat this information to suitable location server 140, perhaps repeat this information to controller 150, then controller 150 provides the position to upgrade (shown in dotted line) to location server 140.(or otherwise providing) and/or actuated position data are stored, shown to location server 140 as required.Due to geography and/or logic is former thereby cause the subscriber 130 of particular group to be associated with location server 140.In each embodiment, location server 140 can keep all subscribers 130 of (for example, in location server 140 this locality) or the tracking of all subscribers in one or more phone groups in one or more limited geographic areas.Phone group is that those skilled in the art are known, and therefore will not be described in detail.
Embodiment such as the communicator of subscriber or repeater has been shown in the block diagram of Fig. 2.Communicator 200 can comprise processor 202, comprise transceiver 204, antenna 222, I/O device 212, program storage 214, buffer storage 216, one or more communication interface 218 and the removable storage 220 of transmitter circuit 206 and acceptor circuit 208 except other parts.Communicator 200 is integrated unit preferably, and can be included at least all elements of describing in Fig. 2 and make communicator 200 carry out needed any other element of its electric function.This electronic component connects by bus 224.
Processor 202 comprises one or more microprocessors, microcontroller, DSP, state machine, logical circuit or comes any other device of process information based on operation or programming instruction.Such operation or programming instruction are stored in program storage 214, and can comprise by processor 202 carry out such as to the received signal estimation and correction, encrypt/decrypt and about the instruction of the decision that whether has warning and to such as the relevant information of transmitting of modulation, tranmitting frequency or signal amplitude.Program storage 214 can be: the IC memory chip comprises any type of random-access memory (ram) and/or read-only memory (ROM); Floppy disk; Compact disk (CD) ROM; Hard drive; Digital video disc (DVD); Flash memory card; Perhaps be used for any other medium of storing digital information.Those of ordinary skill in the art can recognize, when processor 202 makes state machine or logical circuit carry out its one or more function, can be embedded in the memory 214 that comprises corresponding operational order at this state machine or logical circuit.The below describes the operation of being carried out by the remainder of processor 202 and communicator 200 in detail.
Transmitter circuit 206 and acceptor circuit 208 make communicator 200 can transmit and receive respectively signal of communication.In this, transmitter circuit 206 and acceptor circuit 208 comprise for the suitable circuit of supporting wireless transmission.The implementation of transmitter circuit 206 and acceptor circuit 208 depends on communicator 200 and the implementation of the device that will communicate with it.For example, reflector and acceptor circuit 206,208 can be implemented as according to known technology the part of communicator hardware and software framework.Those of ordinary skill in the art can recognize, though can realize in the processor such as processor 202 reflector and acceptor circuit 206,208 be not or not also all most function.Yet, divide artificially processor 202, transmitter circuit 206 and acceptor circuit 208 at this, to promote better understanding.Buffer storage 216 can be any type of volatile memory such as RAM, and is used for information or emission information that interim storing received arrives.
Communicator 200 can also comprise various I/O devices, such as the keyboard with alphanumeric key; Demonstration is about repeater or be connected to the display (for example, LED, OLED) of information of the communication of repeater; Soft key and/or hardkey; Touch-screen; Roller; Microphone; And loud speaker.
As mentioned above, becoming and expecting that more and more subscriber's transmitting site upgrades.Compare with voice or other data communication, the position is upgraded relatively frequent and is occured in the scheduled time.Although have challenge because a large number of services that generates causes these to upgrade, because its periodic character, they can be scheduled, this makes and uses more efficiently channel.Utilize this periodicity, developed the channel architecture that makes it possible to realize expecting efficient.The favourable aspect of the method comprises acyclic, the non-scheduled emission of its support (for example, being used for making for the data window of scheduling and the request of auto registration service (ARS) existence registration).ARS send to be used for notifying the subscriber to be present in signaling in system from the subscriber to server.In addition, different from other system, repeater can or can not be (but the subscriber keeps aiming at repeater) of time alignment, and this realizes with special control channel usually.Unfortunately, can pass through it by the control channel of time alignment (and support software) although some systems have the subscriber, not every system can have such control channel.
Figure 3 illustrates the basic flow sheet of the method for foundation and delivering position renewal.Obviously, realize the method by the subscriber, but can realize working realizing by repeater the compensation process of the scheduling of channel together with the subscriber.Term " working channel " is defined as the acquiescence uplink/downlink channel that uses when to subscriber/from subscriber's transmitting audio frequency, video or other information as used herein.Working channel can be direct mode channel, channel of repeater or as the channel of the part of group system.Working channel can also be single website or multi-site channel.Term " data recovery channel " is to upgrade the relevant information uplink/downlink channel of (comprising such as the position data of gps data and data dispatching both) be used to providing to the position.Although only described the position renewal at this, can recover to provide on channel in data the data (for example, ARS log-on data and following sending and receiving short messages) of other types.
The subscriber switches on and initialization at step 302 place.The subscriber switches to down link data and recovers channel at step 304 place, and waits for until receive announcement from repeater at step 306 place.When receiving when announcement, the subscriber determines when transmission requests at step 308 place from announcement, make in time thus and itself aim at the emission from repeater, and in step 310 place's wait until should the time.When reaching this time, at step 312 place, the request that the subscriber upgrades for deployment position to repeaters transmit on up link.
Then, the subscriber switches to down link data and recovers channel at step 314 place, for from the announcement of repeater or permit message and wait for the predetermined time amount.This announcement will permitted the message Extraordinary simultaneously to all subscriber's advertised information (that is, be tuned to the channel launched of repeater) of listening to thereon.This announcement will be described in greater detail below, but announce the current and following schedule information.In other embodiments, at first the subscriber can wait for announcement, and is then receiving announcement request scheduling afterwards.This rear embodiment allows the subscriber to determine via announcement the availability freely that repeater does not wherein want deployment position to upgrade, and therefore should use one group of alternative data to recover channel.The below also describes in more detail and permits message.
When the subscriber receives when announcement, the subscriber determines at step 316 place whether repeater has upgraded for (or once) position periodically to have dispatched subscriber and repeater and when has upgraded for (or once) position periodically and dispatched the subscriber.If announcement does not comprise this information, the subscriber in the definite announcement (being generally 1 to 2) of whether having launched enough numbers by repeater in step 318 place, if make the request that receives, provides response in last announcement.
If the subscriber has determined also not receive the announcement of enough numbers, turn back to step 314, continue to wait for next announcement.If the subscriber has determined to receive the announcement of enough numbers, next determine whether at step 320 place to recover (for example to have spent the too much time on channel in data, sent too much request to repeater) so that be minimized in the calling of missing on working channel.If the subscriber has determined another request of assurance, then the subscriber turns back to step 312.If the request that the subscriber has determined to send predetermined maximum number (for example, 2 to 3) or be arranged in data and recover to reach on channel the maximum time amount of the confirmation of waiting for announcement, the subscriber turns back to working channel (being generally down link) in step 322.This time period can be for example that 2 to 3 windows (for example, reaching about 1 second) or subscriber can remain on data the time so long in its formation, and this time is 53 seconds in one embodiment.
In case the subscriber has determined to be provided with scheduling at step 316 place, switch back working channel at step 322 place, and enter normal running (after completing every other initialization).When in common operation, the subscriber determines whether and will launch or receive data on operational data channel at step 324 place.If the subscriber has determined will launch or receive data, at step 326 place, the subscriber launches or receives this working service data, and then turns back to step 324.Have precedence over the position such as the working channel business datum of voice communication and upgrade, if the time that is used for upgrading the position arrives but working channel business datum transmitting/receiving is carried out, subscriber's storage or abandon this positional information.Although do not illustrate in Fig. 3, the subscriber can cushion or be queued in reasonable time and be launched/receive the data of upgrading with executing location, and then recovers data flow after the completing place is upgraded.
If the subscriber has determined the data that will not launch or receive, at step 328 place, the subscriber determines whether to arrive the position update time of being dispatched by repeater or whether has stored the position that will launch and upgraded.If the position renewal that the subscriber has determined also not reach position update time or will not launch, the subscriber turns back to step 324.If the subscriber has determined also not reach position update time or has stored the position that will launch and upgraded, at step 330 place, the subscriber switches to down link data and recovers channel, and determines whether at step 332 place to upgrade for current position and dispatched in advance position update time.In other words, can be used for position update time periodic location update or the non-relaying position that is used for upgrading for the position of the above-mentioned storage that occurs in other communication period is upgraded, the latter does not dispatch during initialization usually.
If it is acyclic (that is, the position that is used for queuing up is upgraded) that the position is upgraded, the subscriber turns back to step 312, and wherein, its scheduling is used for the update time of disposable request.If in the also not deployment position renewal in advance of step 332 place, no matter whether the position renewal is periodic, at step 334 place, the subscriber waits for the next one announcement of repeater, and at step 336 place, determine whether the subscriber still is scheduled to launch its renewal for the time of appointment.As described below, if the subscriber keeps inertia (window in its distribution is not launched) to reach the time period of expansion, repeater can deallocate the update time of reservation.If the subscriber still is scheduled, the subscriber switches to uplink data and recovers channel, and before the down link working channel was returned in the switching at step 332 place, the place was transmitted into repeater with its position in step 338.If no longer dispatch the subscriber, the subscriber turns back to step 312, wherein, dispatches new update time.At least some in expenses that these steps allow to eliminate with the conventional channel access procedure is associated (with the stand-by period that monitors and the detection channel status is associated---for example, the channel status of the supervision of 180 milliseconds and 120 milliseconds).
Although the flow chart of Fig. 3 only shows a renewal, as mentioned above, if the subscriber in step 326 transmitting/receiving data, can upgrade a plurality of positions and ranks and send to repeater.In one embodiment, after arriving down link data recovery channel and next verifying its reservation window, in the burst before the position of scheduling is upgraded, subscriber's emission is for the request of an other window.After the completing place was upgraded, the subscriber received the allowance in announcement in window on the horizon.Can expect that new window of permitting approaches in time, so the subscriber remains on data and recover on channel, and the emission second place is upgraded.Can repeat this process, upgrade or continue limited scheduled time amount until launched the position of all queuings, after this, the subscriber recovers to get back to working channel and whether wants any data of transmitting/receiving to check.In one embodiment, can be in time block, for example, the subscriber believe might be idle time period (not from/go to subscriber's transmission) in, dispatch the renewal of disposable position.
Figure 4 illustrates an embodiment of channel architecture.Channel architecture comprises time slot, window, frame and data superframe.This time slot is defined in various standards, and is time division multiple access (TDMA) time slot of standard.In the embodiment shown in Fig. 4, each Time Slot Occupancy t 1=30ms(but in other embodiments, this can change).Operate each other and can not have identical window structure because the time slot on the TDMA channel is totally independent of, so aiming between the announcement frame of a time slot and the announcement frame with another time slot may inconsistent (but they be shown as aligning in Fig. 4).In other embodiments, one or more can the service with other capacity in time slot, and do not provide the position of scheduling to upgrade.In a particular example, in the ETSI-DMR structure, use 2 independently time slot (therefore, t 2=60ms).Yet, in other embodiments, can use the more time slot of big figure.
For the subscriber, which time slot each time slot (when not idle) has taken by the burst (being also referred to as burst) of voice, data or control information according to burst takies with specific frequency.Particularly, the burst in each time slot is that 27.5ms is long, wherein has 1.25ms guard time (idle or be used for CACH transmission) at every end place of burst.When time slot can operate in fact independently, for convenient, following discussion only concentrated at the set of time-slot that is used by the subscriber (understanding the independent time slot that has one or more centres between each time slot in set of time-slot).
Form window from N time slot, wherein, N is integer, and takies the time period t that depends on N 2In each embodiment, N can be 1 to 10, and therefore, in one embodiment, t 3Scope be from 60ms to 600ms.Window be defined as than make the subscriber on up link to the large one or more time slots of the minimal amount of the needed continuous slot of repeaters transmit data-message.In embodiment described here, window is to need a large time slot of minimal amount than continuous slot.The first time slot of window (illustrating by the dotted line frame in Fig. 4) uses to recover emission announcement on channel at down link data by repeater.The subscriber with the remaining time slots of window come uplink data recover transmit data messages on channel (and these are as window size N〉1 the time also on down link by relaying).For example, when recovering to launch 4 shocking flash on channel at uplink data, window size is set to 5 time slots (300 milliseconds).
Frame (or frame) is defined in the sequence of all the complete windows in predetermined the second interval.In one example, this second interval is 30s(t 4=30s).In this embodiment, the window of all in frame has identical size.The number of the complete window in frame depends on the size of the window that uses on channel.For example, in frame: 100 windows (each is 300 milliseconds) that have 5 time slots; 83 windows of 6 time slots, in this case, latter two time slot is not used (and therefore, can be used for other purposes); 71 windows of 7 time slots, in this case, last 3 time slots are not used; 62 windows of 8 time slots, in this case, last 4 time slots are not used; 55 windows of 9 time slots, in this case, last 5 time slots are not used; And 50 windows of 10 time slots.
It is 16 at this that the data superframe is defined as N() sequence of individual frame, and be 8 minutes long (t in one example 5=8 minutes).In each embodiment, 1600 windows of 5 time slots can be provided in a data superframe, 1328 windows of 6 time slots etc. can be provided in a data superframe.Value t 1– t 5May be different in different systems.
The subscriber can ask to upgrade the time of its position data as required---for example, from each frame (that is, every 30 seconds) once to each data superframe (that is, every 8 minutes) once and each point between it, 60 seconds, 120 seconds, 240 seconds.An embodiment who dispatches (and can be stored in the memory of repeater or independent control) has been shown in Fig. 5 A.In this example, each window is that 5 time slots are long, and therefore, as mentioned above, each frame comprises 100 windows.
As shown, scheduling the first subscriber SU1 comes every 30s to upgrade its position data, and has been assigned the first window of each frame.Dispatch the second subscriber SU2 and come every 120s to upgrade its position data, and be assigned the Second Window of every the 4th frame (that is, frame 1,5,9,13) from initial frame.Similarly, also dispatch the 3rd subscriber SU3 and come to upgrade its position data in every 120 seconds, and be assigned the Second Window of every the 4th frame (that is, frame 2,6,10,14) from the second frame.Dispatch the 4th subscriber SU4 and come every 60s to upgrade its position data, and be assigned that the second frame rises every a frame (that is, frame 2,4,6 ...) Second Window.Similarly, also dispatch the 5th subscriber SU5 and come to upgrade its position data in every 60 seconds, and be assigned that the first frame rises every a frame (that is, frame 1,3,5 ...) last window.Dispatch the 6th subscriber SU6 and come to upgrade its position data in every 240 seconds, and be assigned the four-light mouth (that is, two windows of each data superframe) of every the 8th frame that initial frame (that is, frame 1 and 9) rises.At last, scheduling the 7th subscriber SU7 comes to upgrade its position data in every 480 seconds, and has been assigned the four-light mouth (that is, each data superframe only a window) of every the 16 frame that the second frame rises (that is, only frame 2).
From obvious in the example shown in Fig. 5 A, when repeater uses 5 burst windows, can support 200 positions renewals that the every time slot of each repeater is per minute.For example, upgrade once 1200 subscribers in order to adapt to wherein each its position that makes per minute, only use 3 channels (frequency to), 3 repeaters and 6 control stations (being connected to location server).This is 90% minimizing from the previous system that wherein uses 30 channels, 30 repeaters and 60 control stations.In these previous systems, per minute to 20 more newly-generated business of about 10.8 seconds per minute of channel loading, caused only 18% channel utilization: as mentioned above channel capacity～82% be left and be not used, be minimised as acceptable level with the probability with the location transmission of random access collision and loss.In disclosed system, eliminated in fact random access collision here, caused the reliability that improves, and the channel utilization rate is improved as over 5 83%(6 time slot present carrying payloads from about 18%).
The scheduling that the position of the disposable and relaying in the data superframe is upgraded can be carried out randomly or with any algorithm, so that the renewal frequency of its expectation is provided to the subscriber of maximum number.In the embodiment shown in Fig. 5 B, the window in each frame is subdivided into window collection (also referred to as the zone).(for example, zone has 20 windows, another zone and has that 10 windows, the 3rd zone have 20 windows, the 4th zone has 40 windows etc. the window that this zone can be unified to have the window of similar number or can have different numbers ...).In each zone, keep certain window (the first subset) satisfying the periodic location update request, and keep other windows (the second subset) to satisfy disposable position updating request, make in frame to distribute equably periodically and disposable window.For example, in the aforementioned exemplary as the window of 5 pulses having therein (particular time-slot) 100 windows in each in each frame, window can each window be divided into the equal area of 5 20 windows.In each zone, for example, keep front 18 to 19 windows satisfying the periodic location update request, and keep last 1 to 2 window to satisfy disposable position updating request.The number of the window in upgrading for the position of particular type each zone that keeps can be configurable.Each zone can have upgrade for the position of every type the identical or different number that keeps window (for example, keep 19 windows satisfying the periodic location update request in 1 in the zone, and keep 18 windows to satisfy the periodic location update request in zone 20).As shown, this also allows the use of shared channel as follows.
In one embodiment, in order to provide disposable request and periodic request quick response both, the distribution of such request that distributes equably between the zone.In such embodiments, when the subscriber asks window, if repeater can permit window in this zone one, and which zone storage has selected in memory.When next one request arrived (from same or different subscribers), repeater was retrieved last window and is dispensed in which zone, and distributed next request in the zone of being determined by algorithm and window.This can be and the regional adjacent zone of storing, can be perhaps the some zones away from storage area.Utilize such distribution, can guarantee that the request (disposable or periodicity) of two types obtains near window, remove nonsystematic extremely busy, and distributed most of windows.
After energising, repeater check system configuration (window size and periodically reservation), and according to keeping window figure at the region method shown in Fig. 5 B.Repeater is listened to subscriber's launch window regularly to all in announcement.At this time durations, three operations occur on repeater concurrently: 1) according to the window request of region method process, 2) free window management, and 3) shared channel uses.Be described in more detail below these.
Figure 6 illustrates data and recover an embodiment of the logical construction of channel.In an illustrated embodiment, window comprises 6 bursts altogether.Above burst send out from the subscriber source, and recover to be launched into repeater on channel at uplink data, and following burst is from repeaters transmit, and recovers to be launched into the subscriber on channel at down link data.For clear, only showing a time slot---other time slots are indicated in the space between each transmission.In superincumbent burst, window comprise wherein can transmitting site more 5 bursts and the wherein request burst of subscriber's transmission requests of new data.
Request from the subscriber arrives down link data recovery channel and occurs after repeater receives announcement the subscriber.When the subscriber occurs from determining that here the next one is announced, and launches this request at reasonable time.More specifically, more disposed request burst before the first burst of new data comprising the position, the request burst with arrive simultaneously repeater from the repeaters transmit announcement.Reserved particular burst at each window that is used for request, made from subscriber's request and do not upgrade data overlap with the position from other subscribers, the most channel access time of adopting in elimination or minimizing method formerly thus.Empty because the relatively small number purpose request relevant to window in special time period when initialization (except when a plurality of subscriber at the same time) causes asking to happen suddenly in most of windows that might happen suddenly in the above.Similarly, although may conflict in the request burst for the request of the disposable or periodic window of upgrading from different subscribers' position, this possibility is relatively little.
As shown in burst below (from repeater), window comprises announcement burst and comprises the data burst that the position is upgraded, this position upgrade be advance reservation and be launched from certain subscriber.Announcement burst is deployed in and comprises from the position of repeater more before the first burst of new data.As mentioned above, for request, reserve particular burst at each window that is used for announcement.On channel, the announcement immediately following after request from the subscriber to repeaters transmit does not comprise allowance because inherent delay causes recovering at uplink data.Alternatively, recover the emission announcement corresponding with allowance after at least one window on channel at down link data.As shown in the embodiment in Fig. 6, announcement always is positioned at the starting position of the window of going out.After announcement, repeater is in position data that during current window, relaying is sent by the subscriber of scheduling on down link.If also do not dispatch the subscriber, the burst after announcement burst is idle or can be used for other purposes.
In the embodiment of Fig. 6, only provide request in the request burst of appointment.Yet, if do not keep certain window for the subscriber, can recover at uplink data that on channel, any burst place in untapped window provides request.This compares with the burst of use single request and has reduced the quantity that request collision occurs.For example, when using the window of 5 bursts as being taken in, 200 windows of existence per minute.Cause the free window * of 150(per minute (window size-2) in the situation that the data that the window (50 free windows) of reservation 75% operates are recovered channel) individual other request opportunity.This is in the improvement that enters 75% on capacity.In addition, be used for supporting the down link data of permitting to recover channel and also improved 75%.Can be with such as assigning untapped burst in window randomly or with any mode of predetermined sequence.
In one embodiment, when the repeater initialization, check system configuration (window size and periodically reservation), and keep the window mapping.Then, repeater is listened to subscriber's launch window regularly to all in announcement.At this time durations, three operations occur concurrently on repeater: window request processing, free window management and shared channel use.
In the first operation, window request were processed, repeater distributed window when receiving new disposable or periodic request.Describe this operation at this specification, for example, repeater can distribute window according to the region method described in superincumbent Fig. 5 B, makes window distribute equably in frame.
In the second operation, free window management, repeater detects the subscriber and whether does not arrive data in the time of distributing and (for example recover on channel, due to the subscriber outside scope, operate with the amount of batteries that reduces, perhaps owing to causing not launching in the window of appointment in emission on working channel or reception), and can deallocate the window that the subscriber is kept.Be apparent that, only deallocate the more kainogenesis of position for the relaying of scheduling---do not deallocate counter concerning disposable window, disposable window is deallocated after processing immediately.
In one embodiment, repeater comprises and deallocates counter, adjusts (for example, increasing or decreasing) when on window, transmitting site upgrades this deallocates counter whenever the subscriber does not keep at it.When deallocating counter and reach predetermined threshold value, deallocate all windows that keep for this subscriber.It is identical for any subscriber that threshold value can be independent of such as the variable of renewal rate, perhaps can depend on renewal rate.In a particular embodiment, when renewal rate increased, deallocating counter can increase concomitantly, made total inertia for different renewal rates/drop-out time keep identical or increase.For example, for the renewal rate of every 30 seconds, deallocate counter and can be set to 10, and therefore the inertia time before repeater deallocates the window that keeps for the subscriber is 5 minutes; For renewal rate per minute, deallocate counter and can be set to 5, and therefore, the inertia time before deallocating is 5 minutes similarly; For the renewal rate of every 2 minutes, deallocate counter and can be set to 5, and therefore the inertia time before deallocating is 10 minutes; For the renewal rate of every 4 minutes, deallocate counter and can be set to 5, and therefore the inertia time before deallocating is 20 minutes; And for the renewal rate of every 8 minutes, deallocate counter and can be set to 4, and therefore the inertia time before deallocating is 20 minutes.If the subscriber launched before deallocating, can make to deallocate counter and reset.
Repeater can also determine whether that based on the number of the window that has kept execution deallocates (that is, cancelling the decision above (override)).If keep less window, repeater can determine to adjust and deallocates the counter percentage of the window that keeps (for example, according to) or whole elimination deallocates.On the other hand, if kept most of windows, repeater can determine to carry out the window that deallocates to discharge for the position updating request of disposable or relaying.
In the 3rd operation, shared channel use, to all listen to subscriber's launch window regularly in, repeater keeps following the tracks of the distribution on the horizon in the window of ensuing predetermined number (for example, 3).If do not distribute in these windows, repeater can allow shared channel to use (that is, allowing altogether, the licensee of channel can use this channel), perhaps enters the maintenance (dormancy) of energy model until be required.In dormancy, repeater keeps window timing, distributes and if exist in the window of ensuing predetermined number, and repeater is carried out certainly and waken up, and begins again launch window regularly.This allows before to have kept certain window and subscriber's transmitting site of arriving on channel upgrades, and needn't wake repeater (thus, having prevented from leaving the time of the increase of working channel) up.Yet in this embodiment, the subscriber who arrives with request position renewal window can send the part that predetermined wake-up signal carries out in the position is upgraded to activate repeater to repeater.
An embodiment of announcement shown in Figure 7.In this embodiment, announcement comprises two parts: announcement part and allowance part that the information relevant to next window (after current window) is provided.Window advertisement (each byte is 8 bits) is formed by 12 bytes.Window advertisement first and latter two byte comprise sign and control information (for example, cyclic redundancy check (CRC)) by standard configuration, and therefore will can not be described in more detail.
Some systems (such as submit on December 9th, 2008 and title be the U.S. Patent application 12/331 of " Method For Trunking Radio Frequency Resources ", 180 system, the full content of this application is incorporated herein by reference) in, abbreviation (for example, censoring, hash or the another name) sign (2 byte) that the announcement part comprises the sign (1 byte) of rest channel id and assigns the subscriber who is used for the use next window.In legacy system, do not have rest channel id (because the subscriber always knows the working channel that will turn back to), and subscriber identification is 3 bytes.The rest channel is the channel that the subscriber turns back to after the position renewal is provided at one's leisure.The announcement part also comprises the window number (1 byte) of next window and the Frame (4 byte) that next window belongs to.Next window is not current window (that is, wherein announcing the window that occurs), but window subsequently.This subscriber's windows exchange before the time of its distribution that allows before to be allowed certain window recovers channel to the data of going out, whether it still is scheduled for more new data of emission its position to check (by being received in the subscriber identification in the announcement part), does not take adequate measures and if be not.These measures comprise the disposable window of request or new relaying window, rather than launch more new data of its position.
If received the request from the subscriber, permit the window number (1 byte) of expression (2 byte) that part comprises the subscriber who is allowed to use certain window, certain window and permit the Frame (4 bit) that window begins.Because subscriber's sign is 3 bytes usually on length, but in permitting part available 2 bytes only always, so use the person's of being allowed abbreviation sign.Can (for example abridge sign with any predetermined way, identify by censoring), this predetermined way can be identical or different with the mode that is used for abridging at announcement subscriber identification partly, as long as the subscriber knows the mode that abbreviation identifies and therefore can also determine the person of being allowed except the time (frame and window) that is allowed.
If not request before announcement, the allowance of announcement part is cleared as shown in Figure 8, but this part can be used for other purposes.For example, when the window number in permitting part is 8 bit long, can indicate 256 different windows.As mentioned above, only can assign the window of predetermined number in each frame, (for example, being 100 windows when using 5 burst windows, is 83 etc. when use 6 happens suddenly window as restrictions of the particular burst used in window size institute ...).The window of this predetermined number is less than the available window that can be instructed to.The window number that surpasses the valid window numbering can be used for transmission scheduling availability or other information thus.For example, window number can be used to indicate announcement and only comprises announcement (that is, not permitting information) (FC 16), repeater can not divide and is used in any more request (FD that periodically updates 16), repeater can not distribute any more disposable update request or next available window greater than (FE outside the default relatively long time (for example, 1 minute) 16), perhaps not can be used for the more window (FF that any (that is, disposable or periodicity) asks 16).
Figure 9 illustrates an embodiment from subscriber's request.In this embodiment, full subscriber identification (24 bit) is followed the data by standard configuration.Subscriber identification is followed in request period (4 bit).Remaining 36 bits are preserved for following use, and can be used for providing other information.When the request period is 4 bit, can indicate maximum 16 different requests.For example, 0000 2Can indicate the subscriber to expect disposable window, 0001 2Can indicate the subscriber to expect the window of every 30 seconds relayings, 0010 2Can indicate the subscriber to expect window of every 1 minute relaying etc.Untapped value in the request period can as above be preserved for later information (can or can be not relevant to positional information).
In a particular embodiment, a plurality of repeater chains can be connected together, make the position of their relay systems upgrade.Specifically, a repeater (scheduler) can be carried out the scheduling of all repeaters, and the generation announcement (or the information that will use in announcement, such as allowance information), then this announcement is relayed to other repeaters (hereinafter referred to as dummy argument or from repeater) with emission.
In one embodiment, scheduler is independently being announced part and is being permitted part to the dummy argument repeaters transmit in message.In this case, at first send allowance message by ID, and if announcement is lost, provide allowance aloft in the dummy argument announcement.Aloft do not launch independently and permit and dummy argument.First send and permit so that they can be processed earlier, and consider the IP delay and jitter.Therefore, be used for the subscriber identification (in the information of announcement part) of next window or in the schedule information in permitting part any one or both may be lost or postpone, and therefore do not reach the one or more of dummy argument repeater.In either case, no matter whether repeater has the information from scheduler, each the emission announcement in each window from repeater.Figure 10 A illustrates and has wherein received the announcement that comprises the message of permitting part and do not receive the message that comprises the announcement part, and Figure 10 B illustrates wherein both not received and comprises the announcement that the message of permitting part does not receive the message that comprises the announcement part yet.In both cases, in the situation that do not receive from scheduler the Frame that any message is known window number and next window---only subscriber information is lost.Can replace the subscriber information of expection and insert predetermined addressing information, there is no its sign even make in announcement, the subscriber's (that is, before being allowed) who is expected at its address in the subscriber identification in announcement also launches at reasonable time.
Produce other problems from the repeater of link.Can find out from one group of burst at top among Figure 11, scheduling time from the subscriber to this locality from repeater (on up link aloft receiving position upgrade from repeater) transmitting site upgrades.Local from repeater relaying positional information.Yet, lingeringly arrived fully scheduler owing to causing the position to be upgraded in the delay (Δ t) from repeater and scheduler communicate the internet that passes through, make as shown, can not be in the same window repeat packets be contained in all information in burst.In order to be adapted to this delay, can increase the window size (Win ' 2) of scheduler, as shown in one group of bottommost burst.In the example shown in Figure 11, subscriber and this locality are 6 bursts from the size of the window of repeater, and for scheduler, window size is 9 bursts.The method allows both again to broadcast the renewal of whole position from repeater and scheduler repeater.Delay can change according to repeater.Therefore, the size of window changes and can depend on the repeater that starts (service subscriber), perhaps should size changes to be set to the monodrome that limits by maximum delay.Yet changing window size adversely affects throughput of system.
In addition, inherent delay may cause the request loss on opportunity.Described in the above embodiments one, each in the subscriber can be asked the window of disposable or relaying in any free timeslot of repeater.Each subscriber determines next window (and therefore the time slot in the window) free time from repeater announcement, and therefore its request of emission during in time slot (for example, random select).If only launched a request in free window, scheduler can be launched allowance in announcement.Yet, if a plurality of requests of emission in free window are supposed these requests of scheduler handle, and send allowance back in the time slots of same free window.Yet, (for example, 60ms) and enter-go out delays, even can receive a plurality of requests in empty window, also may be able to process the requests of comparing all still less in same free window because processing delay.For example, in the end may not be processed before next one announcement by scheduler to the request of scheduler emission in a free time slot.
When the scheduler local repeater that not to be the subscriber be transmitted into request, top problem becomes more problem.Because the delay of launching information by system from local repeater to scheduler causes and may only can process one or two request same free window.This causes the window request loss on opportunity, this so that caused and caused the business that increases due to the number of the request again that increases and away from time of the increase of the working channel that is used for the subscriber.
Also expectation limits that the subscriber recovers to spend on channel in data and---sends position renewal or request window---away from working channel time quantum apart and makes the subscriber spend the more time on working channel to avoid enter situation and lose voice/data call the evening on working channel.In the example of Figure 12, the subscriber spends 1.38-1.740 second away from working channel (recover 1.08-1.44s on channel with the request window in data---according in when arriving channel and between 3 and 4 windows---and 0.3 second switching time), and spends 1.320 seconds and send the position and upgrade.
For the problem that overcomes in the keeping system throughput and postpone to be associated, repeater cushions (for example, in 120ms) timing difference to consider to be caused by the delay of the difference in each link to request and position renewal.For the result that realizes expecting, the window of subscriber before keeping window launched its position and upgraded.These data are cushioned by repeater, until arrive the time that keeps window.
As in embodiment formerly, the subscriber arrives data recovery channel early must be enough to listen to announcement.The subscriber that next (rather than current) window of this announcement indication has been preserved for makes the subscriber can confirm that next window still is preserved for this subscriber.As shown in Figure 13, in case the subscriber confirms its reservation, the subscriber waits for that predetermined time amount (for example, Δ t=90ms), its position of emission is upgraded during current window---early a window 9(namely, before adjacent window), and leave data and recover channel and go to working channel.This predetermined time amount permission subscriber processes announcement with time enough, and launches in the available burst of the next one (60ms before lower set of time-slot).Local from the renewal of repeater receiving position, and send it to scheduler by the internet.Yet the local position renewal from repeater cushioned, and do not pass through air-launched position renewal until the time of next announcement.Similarly, scheduler also comes receiving position upgrade and it is cushioned by the internet, rather than passes through air-launched position renewal until the time of next announcement.After next one announcement, scheduler and from repeater both during keeping window the position of emission buffering upgrade.The buffering capacity of using is enough to overcome above-mentioned variable internet and postpones, and reaches the size of a window.Because after announcement immediately in scheduler and transmitting site renewal the same window from repeater, so can avoid the increase of the window size of scheduler.
In addition, because announcement can indicate next window idle, as shown in Figure 14, the subscriber who attempts to keep window sends its request message in current window rather than in next window.This request is delivered to scheduler by the internet from repeater immediately.At the scheduler place, request is cushioned, and do not send its allowance until arrived the time of next announcement.Then, permit to sending from repeater by the internet in free window, and by launching this allowance to the subscriber in the air.Cushion by use, can process the request that increases number in an empty window, and provide the more time to process this request to scheduler.
In one embodiment, each in the subscriber is directly launched allowance individually.Because message is to subscriber's single message rather than announcement, thus can eliminate the information that usually exists in the announcement part (subscriber of next window numbering and Frame and scheduling---if present).In an embodiment who permits message, shown in Figure 15, can adjust and the layout of announcing relevant information---the information in permitting part is moved to the position of announcement part, and the allowance part is cleared, and (reservation comes for later use, wherein, can provide afterwards special signaling).Therefore, as shown, in may being preserved for user's the position of the scheduling in next window, announcement disposes the full subscriber identification (or subscriber identification of rest channel position and abbreviation) that receives the subscriber that permits (and permit message be intended to go to).In addition, provide window number and the frame number that subscriber's transmitting site is upgraded in for the allowance message in the position of the numbering of the next window in announcement and frame number reservation.In another embodiment, can zero clearing announce part, and provide allowance in permitting the allowance part of message.
In the above embodiments, provide independent announcement for each subscriber during one or more time slots of repeater in each time slot of organizing separately.Yet in other embodiments, repeater can provide an announcement in up to the one or more time slots in all N time slot.Therefore, same announcement can be provided for a plurality of subscribers' information.
In a word, the subscriber launches in window early, the position is upgraded or request is sent to scheduler immediately from repeater, and only at scheduler (being used for request) or at scheduler with from repeater (being used for the position upgrades), the buffering by aerial transmission occurs both.The latter allows the subscriber than earlier staying about 1 window (as shown in Figure 11,360ms) in other embodiments.
In the above embodiments, with announcement with upgrade scheduling (request and allowance) is provided on identical channel.Yet, in another embodiment, can on working channel but data recover to send on channel request and receive response.And, in other embodiments, can or recover the different data of channel with the data that are used for announcement and upgrade and recover to dispatch on channel at the working channel different from the working channel that is used for data transmission/reception.Respond by recovering in working channel, another working channel or another data to send request on channel and receive, can the extended response extension of message recover channel with other distribution and recognition data.This allows to discharge and may otherwise recover in data the window that channel is preserved for disposable request, has therefore improved the data throughout on data recovery channel.
In addition, although above relate generally to the subscriber and switch to upgrade and the data that may be used for scheduling are recovered channel from working channel, similar principle goes for repeater.For example, if the expectation repeater provides scheduling and relaying on different channels at different time, repeater can switch to data recovery channel (if recovering to provide announcement on the different channel of channel from data) before the emission announcement or before receiving renewal, and then switches to one other channel after receiving renewal.
In various embodiments, disclosed method may be implemented as the computer program that uses for together with computer system.Such implementation such as computer-readable medium (for example can be included in, dish, CD-ROM, ROM or hard disk) tangible medium on fixing or send to the series of computation machine instruction of computer system via modulator-demodulator or other interface arrangements, these other interface arrangements are such as be connected to the communication adapter of network by medium.This medium can be tangible medium (for example, optics or analog communications lines) or the medium that utilizes wireless technology (for example, microwave, infrared ray or other transmission technologys) realization.This series of computation machine instruction is prior with respect to system in this aforesaid all or part of function.Those skilled in the art should be understood that can be to write such computer instruction for the multiple programming language of use together with many computer architectures or operating system.And such instruction can be stored in any memory such as semiconductor, magnetic, optics or other storage devices, and can use any communication technology such as optics, infrared ray, microwave or other transmission technologys to transmit.Expect that such computer program can be used as and (for example has the printing followed or electronic document, compact package software) removable media and distributing, (for example be preinstalled with computer system, on the ROM of system or fixed disk), or distribute from server or BBS (Bulletin Board System) by network (for example, internet or World Wide Web (WWW)).Certainly, some embodiments of the present invention may be implemented as software (for example, computer program) and hardware combination both.Other embodiment of the present invention is implemented as whole hardware or whole software (for example, computer program).
Be appreciated that term has and its ordinary meaning consistent with expression with respect to such term of its corresponding respective queries and learning areas with expressing as used herein, except otherwise setting forth specific meanings at this.Can only be used for making an entity or action to distinguish with another entity or action such as the relational terms of the first and second grades, and needn't require or hint in such relation of such entity or any reality between behavior or sequentially.Term " comprises " and any other version is intended to contain non-exclusive comprising, make the process, method, article or the equipment that comprise series of elements not only comprise those elements, but also can not list clearly or such other intrinsic elements of process, method, article or equipment.With the element of " one " guiding in the situation that not more restrictions be not precluded within and have other identical element in process, method, article or the equipment that comprises described element.
Those skilled in the art can understand, in the situation that without departing from the spirit and scope of the present invention, can carry out a large amount of modifications, change and combination for above-described embodiment, and such modification, change and combination are counted as in the scope of thought of the present invention.Therefore, treat specification and accompanying drawing on illustrative rather than determinate implication, and all such modifications are intended to be included in the scope of this instruction.Benefit, advantage or for solution of problem scheme or can be so that any benefit, advantage or occur or key, needed or necessary feature or the element of any or whole claims sent from the application of becoming more outstanding any one or a plurality of factor and should not be interpreted as for the solution of problem scheme.Any claim that the present invention is sent from the application and all equivalents of those claims of being sent limit uniquely.
Provide summary of the present disclosure to allow the reader promptly to determine the disclosed characteristic of present technique.Can understand, it is not used in scope or the implication of explaining or limiting claim.In addition, in aforementioned detailed description, can find out, in each embodiment, each feature is grouped in together, so that the disclosure is smooth.
Claims (according to the modification of the 19th of treaty)
1. method that transmits information from the subscriber, described method comprises described subscriber:
Switch to data from working channel and recover channel;
Recover in described data the request that on channel, emission is upgraded for emission;
Determine whether to receive the response for described request, described response comprised be used to the update time of launching described renewal; And
Recover the described renewal of emission on channel in described update time in described data.
2. method according to claim 1 further comprises described subscriber:
After receiving described response and before switching back described data recovery channel, recover channel from described data and switch back described working channel, to launch described renewal.
3. method according to claim 1 further comprises: switch to described data recover channel after and before described data are recovered to launch described renewal on channel, described subscriber:
Receive announcement, described announcement has the announcement part that indication is used for the schedule information of described update time;
Confirm from described announcement part whether described subscriber is scheduled for keeping described update time; And
If described subscriber confirms that it is scheduled for keeping described update time, in the described renewal of described emission update time.
4. method according to claim 3, wherein:
Described timing information and described schedule information comprise window and the described frame of the frame in the data superframe,
Each window has a plurality of time slots,
Described announcement in the initial time slot of current window,
Described current window is after described subscriber expects to transmit the adjacent window apertures of described renewal therein, and
The indication of described announcement part:
Subscribe which subscriber for described adjacent window apertures, and
The sign of described adjacent window apertures and wherein disposed the frame of described adjacent window apertures.
5. method according to claim 4, wherein, described announcement has the allowance part, and described allowance is partly indicated and has been asked scheduling with another subscriber's of being used for its renewal allowance window and permitted frame, and the sign of indicating described another subscriber.
6. method according to claim 3, wherein:
Described announcement has the allowance part, and allowance window and the allowance frame of having asked to dispatch with another subscriber who is used for its renewal partly indicated in described allowance, and the sign of indicating described another subscriber,
If do not receive any request, with described at least some zero clearings of permitting part, and
Provide and whether can distribute further disposable renewal, whether can distribute next available update time of further periodically updating and being used for disposable renewal whether to surpass the relevant information of Preset Time apart from the current time with described part of permitting the not zero clearing of part.
7. method according to claim 3, wherein, confirm from described announcement part whether described subscriber comprises for keeping being scheduled described update time:
Determine that when following described subscriber is scheduled for keeping described update time:
Described announcement part comprises described subscriber's sign,
Described announcement part does not comprise described subscriber's sign, but alternatively comprises the preset data of the described subscriber's of indication described sign loss; And
When described announcement part comprises different subscribers' sign, determine that described subscriber is no longer for being scheduled described update time.
8. method according to claim 1, further comprise: the repeater scheduling is for the request of the window of the frame in the data superframe, described data superframe comprises a plurality of frames, each frame comprises a plurality of windows, described scheduling comprises the described a plurality of windows in each frame is subdivided into the zone, wherein, at least one window of keeping for the request that periodically updates of each district inclusion and at least one window of keeping for the request of disposable renewal.
9. method according to claim 8, described scheduling further comprises described repeater:
After the scheduling described request, which zone storage has selected for described request in memory;
When next one request arrived, which zone retrieval had selected for described request; And
Be distributed in the window in the zone that is close to the described zone of selecting for described request to described next request.
10. method according to claim 1, further comprise: launch described request in the predetermined time slot of asking to keep for the subscriber that emission is upgraded.
11. method according to claim 10, wherein, described timing information comprises the window of the frame in the data superframe, described window has a plurality of time slots, the number of described time slot being greater than being made in the described renewal of emission on uplink channel and made the number of the time slot of the described renewal of relaying on downlink channel by repeater by described subscriber, and the described request in described predetermined time slot be launched so that in the arrival of the described request at described repeater place with extremely described subscriber's announcement is consistent from described repeater.
12. method according to claim 1, further comprise: before the emission described request, described subscriber receives announcement, and described announcement comprises about the time slot in the next window adjacent from the current window that wherein receives described announcement whether be used for emission from the information of different subscribers' renewal.
13. method according to claim 12 further comprises: if the described next window of the indication of the described information in described announcement is idle, described subscriber launches described request in any one of the described time slot of described next window.
14. method according to claim 13 further comprises: described subscriber selects any one in the described time slot of next window of described free time randomly.
15. method according to claim 13, wherein, described response is transmitted into described subscriber individually, rather than as announcement.
16. method according to claim 1, wherein, described timing information comprises the window of the frame in the data superframe, and described request indication described request is that wherein said subscriber only will launch the disposable request of a renewal or the periodic request that wherein said subscriber will periodically launch renewal, and if described request is periodic request, the frequency of emission is upgraded in described periodic request indication.
17. method according to claim 16, wherein, described request is periodic request, described method further comprises: if described repeater does not receive the continuous renewal of predetermined number, described repeater deallocates the periodic window that keeps for the renewal from described subscriber, and described predetermined number depends on the speed of the renewal that is received by described repeater.
18. method according to claim 17 further comprises: the number based on the window in the data superframe that keeps determines whether to cancel the decision that deallocates described periodic window.
19. method according to claim 1, wherein, described subscriber is to this locality from the repeaters transmit described request, and described method further comprises:
Described this locality from repeater by the internet to scheduler repeaters transmit described request;
The described renewal of described scheduler repeater scheduling, and in message independently to described this locality from the described subscriber's of repeaters transmit described schedule information and current scheduling information; And
Described this locality is launched described response according to the described message that receives from described scheduler to described subscriber from repeater.
20. method according to claim 4, wherein, described subscriber communicates from repeater with local, and described method further comprises:
Described subscriber launches described renewal in described current window, and switches back described working channel immediately after the described renewal of emission;
Described this locality from repeater by the internet to the described renewal of scheduler repeaters transmit, and do not cushion to the transmission of described scheduler repeater, and before the described renewal by air-launched, described renewal cushioned;
Described scheduler repeater is the described renewal of buffering before passing through the described renewal of air-launched; And
Described this locality from repeater and described scheduler repeater therein described subscriber to launch the window of described renewal by the described renewal of air-launched.
21. method according to claim 1, wherein, described subscriber communicates from repeater with local, and described method further comprises:
Before described subscriber launched described request, described subscriber received announcement from described this locality from repeater in current window, and determined that from described announcement the next window adjacent with described current window is idle;
To described this locality from the repeaters transmit described request, described subscriber selects any one in the time slot of described current window;
Described this locality from repeater by the internet to scheduler repeaters transmit described request;
Described scheduler repeater cushions described request, generates the response for described request in next window, and the described response to described this locality from repeaters transmit; And
Described response is launched from repeater and scheduler repeater in described this locality described next window.

Claims (21)

1. method that transmits information from the subscriber, described method comprises described subscriber:
The request that emission is upgraded for emission;
Determine whether to receive the response for described request, described response comprised be used to the update time of launching described renewal; And
After receiving described response, before data are recovered to launch described renewal on channel, switched to described data from working channel and recover channel before described update time.
2. method according to claim 1 further comprises described subscriber:
Switched to described data from described working channel and recover channel before the emission described request, wherein recover to launch described request on channel in described data; And
Before described update time, after receiving described response and before switching back described data recovery channel, recover channel from described data and switch back described working channel.
3. method according to claim 1 further comprises: switch to described data recover channel after and before described data are recovered to launch described renewal on channel, described subscriber:
Receive announcement, described announcement has the announcement part that indication is used for the schedule information of described update time;
Confirm from described announcement part whether described subscriber is scheduled for keeping described update time; And
If described subscriber confirms that it is scheduled for keeping described update time, in the described renewal of described emission update time.
4. method according to claim 3, wherein:
Described timing information and described schedule information comprise window and the described frame of the frame in the data superframe,
Each window has a plurality of time slots,
Described announcement in the initial time slot of current window,
Described current window is after described subscriber expects to transmit the adjacent window apertures of described renewal therein, and
The indication of described announcement part:
Subscribe which subscriber for described adjacent window apertures, and
The sign of described adjacent window apertures and wherein disposed the frame of described adjacent window apertures.
5. method according to claim 4, wherein, described announcement has the allowance part, and described allowance is partly indicated and has been asked scheduling with another subscriber's of being used for its renewal allowance window and permitted frame, and the sign of indicating described another subscriber.
6. method according to claim 3, wherein:
Described announcement has the allowance part, and allowance window and the allowance frame of having asked to dispatch with another subscriber who is used for its renewal partly indicated in described allowance, and the sign of indicating described another subscriber,
If do not receive any request, with described at least some zero clearings of permitting part, and
Provide and whether can distribute further disposable renewal, whether can distribute next available update time of further periodically updating and being used for disposable renewal whether to surpass the relevant information of Preset Time apart from the current time with described part of permitting the not zero clearing of part.
7. method according to claim 3, wherein, confirm from described announcement part whether described subscriber comprises for keeping being scheduled described update time:
Determine that when following described subscriber is scheduled for keeping described update time:
Described announcement part comprises described subscriber's sign,
Described announcement part does not comprise described subscriber's sign, but alternatively comprises the preset data of the described subscriber's of indication described sign loss; And
When described announcement part comprises different subscribers' sign, determine that described subscriber is no longer for being scheduled described update time.
8. method according to claim 1, further comprise: the repeater scheduling is for the request of the window of the frame in the data superframe, described data superframe comprises a plurality of frames, each frame comprises a plurality of windows, described scheduling comprises the described a plurality of windows in each frame is subdivided into the zone, wherein, at least one window of keeping for the request that periodically updates of each district inclusion and at least one window of keeping for the request of disposable renewal.
9. method according to claim 8, described scheduling further comprises described repeater:
After the scheduling described request, which zone storage has selected for described request in memory;
When next one request arrived, which zone retrieval had selected for described request; And
Be distributed in the window in the zone that is close to the described zone of selecting for described request to described next request.
10. method according to claim 1, further comprise: launch described request in the predetermined time slot of asking to keep for the subscriber that emission is upgraded.
11. method according to claim 10, wherein, described timing information comprises the window of the frame in the data superframe, described window has a plurality of time slots, the number of described time slot being greater than being made in the described renewal of emission on uplink channel and made the number of the time slot of the described renewal of relaying on downlink channel by repeater by described subscriber, and the described request in described predetermined time slot be launched so that in the arrival of the described request at described repeater place with extremely described subscriber's announcement is consistent from described repeater.
12. method according to claim 1, further comprise: before the emission described request, described subscriber receives announcement, and described announcement comprises about the time slot in the next window adjacent from the current window that wherein receives described announcement whether be used for emission from the information of different subscribers' renewal.
13. method according to claim 12 further comprises: if the described next window of the indication of the described information in described announcement is idle, described subscriber launches described request in any one of the described time slot of described next window.
14. method according to claim 13 further comprises: described subscriber selects any one in the described time slot of next window of described free time randomly.
15. method according to claim 13, wherein, described response is transmitted into described subscriber individually, rather than as announcement.
16. method according to claim 1, wherein, described timing information comprises the window of the frame in the data superframe, and described request indication described request is that wherein said subscriber only will launch the disposable request of a renewal or the periodic request that wherein said subscriber will periodically launch renewal, and if described request is periodic request, the frequency of emission is upgraded in described periodic request indication.
17. method according to claim 16, wherein, described request is periodic request, described method further comprises: if described repeater does not receive the continuous renewal of predetermined number, described repeater deallocates the periodic window that keeps for the renewal from described subscriber, and described predetermined number depends on the speed of the renewal that is received by described repeater.
18. method according to claim 17 further comprises: the number based on the window in the data superframe that keeps determines whether to cancel the decision that deallocates described periodic window.
19. method according to claim 1, wherein, described subscriber is to this locality from the repeaters transmit described request, and described method further comprises:
Described this locality from repeater by the internet to scheduler repeaters transmit described request;
The described renewal of described scheduler repeater scheduling, and in message independently to described this locality from the described subscriber's of repeaters transmit described schedule information and current scheduling information; And
Described this locality is launched described response according to the described message that receives from described scheduler to described subscriber from repeater.
20. method according to claim 4, wherein, described subscriber communicates from repeater with local, and described method further comprises:
Described subscriber launches described renewal in described current window, and switches back described working channel immediately after the described renewal of emission;
Described this locality from repeater by the internet to the described renewal of scheduler repeaters transmit, and do not cushion to the transmission of described scheduler repeater, and before the described renewal by air-launched, described renewal cushioned;
Described scheduler repeater is the described renewal of buffering before passing through the described renewal of air-launched; And
Described this locality from repeater and described scheduler repeater therein described subscriber to launch the window of described renewal by the described renewal of air-launched.
21. method according to claim 1, wherein, described subscriber communicates from repeater with local, and described method further comprises:
Before described subscriber launched described request, described subscriber received announcement from described this locality from repeater in current window, and determined that from described announcement the next window adjacent with described current window is idle;
To described this locality from the repeaters transmit described request, described subscriber selects any one in the time slot of described current window;
Described this locality from repeater by the internet to scheduler repeaters transmit described request;
Described scheduler repeater cushions described request, generates the response for described request in next window, and the described response to described this locality from repeaters transmit; And
Described response is launched from repeater and scheduler repeater in described this locality described next window.
CN201180045920.XA 2010-09-22 2011-08-23 For based on non-competing window and the channel architecture of random access request based on competition Active CN103119863B (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US12/888,177 US9167599B2 (en) 2010-09-22 2010-09-22 Channel structure for non-contention based windows and contention based random access requests
US12/888,177 2010-09-22
PCT/US2011/048717 WO2012039873A1 (en) 2010-09-22 2011-08-23 Channel structure for non-contention based windows and contention based random access requests

Publications (2)

Publication Number Publication Date
CN103119863A true CN103119863A (en) 2013-05-22
CN103119863B CN103119863B (en) 2016-08-03

Family

ID=45817712

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201180045920.XA Active CN103119863B (en) 2010-09-22 2011-08-23 For based on non-competing window and the channel architecture of random access request based on competition

Country Status (6)

Country Link
US (1) US9167599B2 (en)
EP (1) EP2619927B1 (en)
CN (1) CN103119863B (en)
BR (1) BR112013006668B1 (en)
RU (1) RU2542738C2 (en)
WO (1) WO2012039873A1 (en)

Families Citing this family (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8589058B2 (en) * 2010-11-10 2013-11-19 Honda Motor Co., Ltd. Method of retrieving information for a motor vehicle
EP2587712A4 (en) * 2012-06-08 2014-07-23 Huawei Device Co Ltd Heartbeat synchronization method and device
US9271257B2 (en) 2013-12-13 2016-02-23 Motorola Solutions, Inc. Method and apparatus for informing a radio of a group-call started while the radio was away from a control channel
US9473882B2 (en) * 2014-06-16 2016-10-18 Motorola Solutions, Inc. Enhanced location data throughput on a windowed data channel in a radio communication system
US20160094945A1 (en) * 2014-09-26 2016-03-31 Sunil Kulkarni Variable interval for periodic fix requests of multiple clients
CN107404372B (en) * 2016-05-20 2019-02-22 北京小米移动软件有限公司 A kind of communication means and device
US10979857B2 (en) * 2018-05-03 2021-04-13 Curbside Inc. Content conversion tracking based on location data

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1143870A (en) * 1995-05-25 1997-02-26 三菱电机株式会社 Time dividion multiplex communication control system
US20080298280A1 (en) * 2007-05-29 2008-12-04 Motorola, Inc. Method for dynamically identifying locations of mobile nodes in a time division multiple access based ad hoc communication network
US20100158077A1 (en) * 1996-06-03 2010-06-24 Broadcom Corporation Spread spectrum transceiver module utilizing multiple mode transmission

Family Cites Families (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2679442B2 (en) * 1991-04-17 1997-11-19 日本電気株式会社 Digital mobile communication system
US5724168A (en) * 1994-10-11 1998-03-03 Spectrix Corporation Wireless diffuse infrared LAN system
US6108314A (en) * 1998-08-31 2000-08-22 Motorola, Inc. Method, subscriber device, wireless router, and communication system efficiently utilizing the receive/transmit switching time
FI112582B (en) * 1999-12-13 2003-12-15 Nokia Corp mobile communication
US6567387B1 (en) * 2000-11-07 2003-05-20 Intel Corporation System and method for data transmission from multiple wireless base transceiver stations to a subscriber unit
US20040042424A1 (en) 2002-08-30 2004-03-04 Hsu Hsien-Tsung Switch method and device thru MAC protocol for wireless network
US7826475B2 (en) * 2004-11-01 2010-11-02 Electronics And Telecommunications Research Institute Radio communication system, radio communication apparatus and radio communication method for UWB impulse communication
US8577283B2 (en) * 2005-07-15 2013-11-05 Qualcomm Incorporated TDD repeater
US8600410B2 (en) * 2005-07-28 2013-12-03 Unwired Planet, Llc Wireless network with adaptive autonomous location push
US7961749B2 (en) 2005-08-18 2011-06-14 Samsung Electronics Co., Ltd. Signaling method and system for channel switching in a wireless local area network
CN101346906B (en) * 2005-12-23 2013-10-16 Lg电子株式会社 Random access procedure processing method
US20080002734A1 (en) * 2006-06-29 2008-01-03 Haihong Zheng Contention window management for relay networks
WO2008011717A1 (en) * 2006-07-28 2008-01-31 Nortel Networks Limited Multi-hop network topology system and method
US8310996B2 (en) * 2006-08-07 2012-11-13 Qualcomm Incorporated Conditional scheduling for asynchronous wireless communication
KR101210335B1 (en) 2006-09-15 2012-12-10 삼성전자주식회사 Method for implementing clear channel assessment function in wireless mesh network and mobile terminal thereof
KR100908007B1 (en) * 2006-12-01 2009-07-16 삼성전자주식회사 Wireless network system and method for transmitting and receiving data on the wireless network
BRPI0808573A2 (en) * 2007-03-01 2014-09-09 Ntt Docomo Inc BASE STATION EQUIPMENT AND COMMUNICATION CONTROL METHOD
US20090046678A1 (en) * 2007-08-17 2009-02-19 Industry-Academic Cooperation Foundation Of Kyung Hee University Method for predicting the mobility in mobile ad hoc networks
US8300619B2 (en) 2007-11-12 2012-10-30 Motorola Solutions, Inc. System and method for providing scheduled data communications in a communication system
US8971241B2 (en) * 2008-09-30 2015-03-03 Qualcolmm Incorporated Techniques for supporting relay operation in wireless communication systems
KR101443213B1 (en) * 2008-10-10 2014-09-24 삼성전자주식회사 Cognitive radio communication method using common control channel parameter allocated dynamically
US8325765B2 (en) * 2008-12-05 2012-12-04 Stmicroelectronics, Inc. Super-frame structure for dynamic spectrum sharing in wireless networks
KR20100080288A (en) * 2008-12-31 2010-07-08 엘지전자 주식회사 Method of location update
US9094991B2 (en) * 2009-03-26 2015-07-28 Qualcomm Incorporated Method and apparatus for supporting communication in low SNR scenario
US8570995B2 (en) * 2009-09-30 2013-10-29 Nokia Corporation Apparatus and method for providing access to a local area network
US9167596B2 (en) * 2010-04-12 2015-10-20 Lg Electronics Inc. Method and apparatus for transmitting and receiving scheduling request using shared resource based filtering in radio communication system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1143870A (en) * 1995-05-25 1997-02-26 三菱电机株式会社 Time dividion multiplex communication control system
US20100158077A1 (en) * 1996-06-03 2010-06-24 Broadcom Corporation Spread spectrum transceiver module utilizing multiple mode transmission
US20080298280A1 (en) * 2007-05-29 2008-12-04 Motorola, Inc. Method for dynamically identifying locations of mobile nodes in a time division multiple access based ad hoc communication network

Also Published As

Publication number Publication date
WO2012039873A1 (en) 2012-03-29
EP2619927A4 (en) 2014-11-19
EP2619927B1 (en) 2016-03-23
BR112013006668A2 (en) 2016-06-07
BR112013006668B1 (en) 2021-09-14
RU2542738C2 (en) 2015-02-27
US9167599B2 (en) 2015-10-20
RU2013118366A (en) 2014-10-27
WO2012039873A4 (en) 2012-06-07
EP2619927A1 (en) 2013-07-31
US20120069786A1 (en) 2012-03-22
CN103119863B (en) 2016-08-03

Similar Documents

Publication Publication Date Title
CN103119863B (en) For based on non-competing window and the channel architecture of random access request based on competition
CN1685745B (en) Methods and apparatus for operating mobile nodes in multiple states
CN102792758B (en) Use registration and the method and apparatus of data transmission of quickly/zero contention resolved
CN101940008B (en) Techniques for link utilization for half-duplex and full-duplex stations in a wireless network
CN102415014B (en) Method and system for dynamic adjustment of downlink/uplink allocation ratio in lte/tdd systems
CN100527638C (en) Method and apparatus for transmitting information within a communication system
CN101365220B (en) Stochastic access method based on user side cooperative grouping in collaboration cellular network
CN101394207B (en) Cognitive radio terminal device and method of communicating using cognitive radio
EP1043675A2 (en) Communication system, communication terminal and information distribution apparatus
US8521080B2 (en) Relay station device, base station device, mobile station device, and radio communication system
CN101455106A (en) Systems, methods and apparatus for detecting time slot interference and recovering from time slot interference in an ad hoc wireless communication network
RU2001126401A (en) DISPATCHERIZATION DEVICE AND METHOD FOR IMPLEMENTING THE PACKAGE DATA TRANSFER SERVICE IN A WIRELESS COMMUNICATION SYSTEM
CN102883456A (en) Communicating uplink signalling information
WO2010034655A1 (en) Multi-hop wireless communication system and relay method and relay station therein
CN101346950A (en) Communications methods and apparatus for using a single logical link with multiple physical layer connections
CN101272231B (en) Method of managing coexisting packet streams
US8547904B2 (en) Supporting communication devices with different technologies within the same communication channel
CN101909328A (en) Method for realizing wireless access of DMR (Digital Mobile Radio) digital-trunked grouped data
US20140079040A1 (en) Time Slot Synchronized, Flexible Bandwidth Communication System
KR20090019859A (en) User device, base station, and method in mobile communication system
CN101646243B (en) Method and device for periodic allocation of continuous scheduling resource
US8284749B2 (en) Time slot synchronized, flexible bandwidth communication system
CN101364943B (en) Wireless communication device and wireless communication method
CN102318406A (en) Method and apparatus for updating additional broadcast information transferred through broadcast message in broadband wireless communication system
WO2016174914A1 (en) Wireless communication system and wireless communication method

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