WO2003013078A9 - Attribution dynamique de ressources materielles dans une station de base pour l'envoi de messages de recherche de personnes - Google Patents

Attribution dynamique de ressources materielles dans une station de base pour l'envoi de messages de recherche de personnes

Info

Publication number
WO2003013078A9
WO2003013078A9 PCT/US2002/024380 US0224380W WO03013078A9 WO 2003013078 A9 WO2003013078 A9 WO 2003013078A9 US 0224380 W US0224380 W US 0224380W WO 03013078 A9 WO03013078 A9 WO 03013078A9
Authority
WO
WIPO (PCT)
Prior art keywords
resource
page
resources
user terminal
radio frequency
Prior art date
Application number
PCT/US2002/024380
Other languages
English (en)
Other versions
WO2003013078A1 (fr
Inventor
Craig H Barratt
Mitchell D Trott
Christopher R Uhlik
Original Assignee
Arraycomm 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 Arraycomm Inc filed Critical Arraycomm Inc
Publication of WO2003013078A1 publication Critical patent/WO2003013078A1/fr
Publication of WO2003013078A9 publication Critical patent/WO2003013078A9/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B1/00—Details of transmission systems, not covered by a single one of groups H04B3/00 - H04B13/00; Details of transmission systems not characterised by the medium used for transmission
    • H04B1/69—Spread spectrum techniques
    • H04B1/713—Spread spectrum techniques using frequency hopping
    • H04B1/7143—Arrangements for generation of hop patterns
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W68/00—User notification, e.g. alerting and paging, for incoming communication, change of service or the like
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices

Definitions

  • the invention relates to the field of wireless communication networks.
  • the invention relates to a process for dynamically allocating resources for transmitting control and/or data messages, as well as for assigning such resources to distributed processing resources in a Base Station (BS) for processing each transmission.
  • BS Base Station
  • RF radio frequency
  • Dynamically allocating an RF resource, for example, to transmit control information or user data, in a wireless communications network on an as needed basis provides better flexibility and offers better utilization of the RF resources in the network.
  • a User Terminal UT
  • BS Base Station
  • the UT first needs to know over what RF resource to transmit a Random Access (RA) request, or over what RF resource to listen for a page from the BS.
  • RA Random Access
  • the UT needs to know over what RF resource to transmit a Page Response in response to the page, in order to set up yet another RF resource over which to exchange data or in-band messages with the BS in the communications network. Since the assignment and allocation of at least one RF resource is required to transmit data, it is advantageous for this dynamic RF resource allocation process to be as efficient as possible.
  • User Terminal refers to a user device or user equipment. Additionally, a user is a device or application attached to the UT, and a subscriber is a person or entity owning or using the user/UT.
  • a stream is defined herein as a series of RF data bursts, or data packets. It would be desirable for the distributed DSPs to operate independently with respect to each other, otherwise a central processor with signal paths to each DSP is necessary to coordinate operation of the DSPs, with the concomitant processing overhead associated therewith. However, with independent operation of the DSPs, there arises the problem of assigning a particular RF resource to a particular DSP for transmitting a series of RF data bursts. Without the DSPs first exchanging information among each other about their state, e.g., active, idle, etc., the question arises which DSP should be assigned to, and process, the RF resource.
  • Figure 1 illustrates multiple frequencies and time slots in a radio frequency spectrum.
  • Figure 2(A) is a timing diagram of a user terminal initiated data exchange with a base station.
  • Figure 2(B) is a timing diagram of a base station initiated data exchange between a user terminal and a base station.
  • FIG. 3 illustrates an example embodiment of the invention.
  • the invention relates to a process for dynamically allocating resources, and utilization thereof for transmitting messages, as well as assigning such resources to distributed hardware processing resources, or simply, hardware resources, in a Base Station (BS) for each transmission.
  • BS Base Station
  • the invention is utilized in a wireless communications network operated in accordance with proprietary, well known, or commercially available protocols.
  • a commercially available protocol is the i-Burst TM Broadband Access system available from ArrayComm Corporation in San Jose, California, the assignee of the invention.
  • the i-Burst system provides a user with high-speed, wireless Internet connection for a device of the user's choice (e.g., a laptop, palmtop, Internet appliance, etc.).
  • the -Burst system utilizes a Time Division Multiple Access/Time Division Duplex (TDMA/TDD) based air interface that is optimized to provide mobile broadband Internet Protocol (IP) access.
  • TDMA/TDD Time Division Multiple Access/Time Division Duplex
  • An i-Burst user terminal registers with a BS to form a relationship referred to as a registration.
  • the registration enables the UT and the BS thereafter to exchange both control messages and data messages.
  • multiple UTs can each establish a network session to log into an Internet Service Provider (ISP) via a gateway provided by, or accessible to, the BS.
  • ISP Internet Service Provider
  • Multiple registrations may occur during a single network session, in particular when a UT is mobile and moving among multiple base stations during the single network session.
  • many streams likely occur.
  • idle periods that is, when no data packets are being transmitted between a BS and the UT
  • the UT may periodically listen for pages in the downlink direction from the BS. After a long idle period, the registration between the UT and BS times out and ends.
  • multiple streams can simultaneously be open and transferring packets in parallel, for example, on several time slots.
  • multiple streams can be transferring packets in parallel via several radio frequency channels, also increasing throughput.
  • the base station 405 comprises a baseband module 400, having multiple, distributed computing resources, such as digital signal processors 410-425.
  • the DSPs are Motorola MC56311 DSPs.
  • Each of the DSPs is coupled to an RF module 430, providing a conversion of digital to analog signals for downlink transmissions, and analog to digital conversion of received uplink signals to digital signals, for processing by at least one of the DSPs.
  • the RF module optionally provides for amplification of analog signals.
  • An antenna array 450 provides for transmitting and receiving control and data messages via an air interface 480 to communicate with user terminals, e.g., UTs 470-475, in the same sector of a wireless communications network as the BS.
  • a network card or network switch 435 provides transmission and/or routing capabilities in association with a wired network, such as an Ethernet network 440 or the Internet. Thus, for example, data may be received via the network card or switch from the Internet and transmitted over the air interface to one or more user terminals.
  • the DSPs operate substantially independently of one another and are each assigned to a particular RF resource in the wireless communications network, whether such RF resource is, for example, an RF carrier, a time slot, a frame, a code in a CDMA system, or some combination thereof.
  • each DSP is assigned to a particular hopping sequence that follows a sequence of RF resources to be utilized for transmitting data over the wireless communications network.
  • an RF resource is a resource in the radio-frequency domain.
  • An RF resource can be a radio frequency (RF) carrier or channel, that is, a portion of radio frequency spectrum, for example, a 625 kHz wide radio frequency channel in one embodiment of the invention.
  • An RF resource can also be a time slot or frame, not necessarily confined or limited to a particular frequency band, although commonly so for regulatory reasons.
  • an RF resource can be a code in a code division multiple access (CDMA) system.
  • CDMA code division multiple access
  • an RF resource can be a combination of RF carrier, time slot or CDMA code, for example, a combination of RF carrier and time slot or frame, a combination of RF carrier and a CDMA code, or a combination of RF carrier, time slot or frame, and a code in a CDMA system.
  • a set of RF resources generally can be thought of as an available portion of RF spectrum and time divided into individual pieces that can be isolated at an RF receiver.
  • Figure 1 illustrates an RF resource as a frame of some duration, e.g., 5 milliseconds, further subdivided into multiple time slots.
  • Figure 1 depicts 6 time slots per frame, wherein the first 3 time slots are uplink time slots, and the second 3 time slots are downlink time slots.
  • the first downlink time slot is separated from the last uplink time slot by a transition guard time 120.
  • each time slot may comprise an RF resource.
  • sixteen 625 kHz RF carriers fit in a nominal 10 MHz wide operating bandwith 6 time slots per frame (A-F), yielding 3 time slot pairs, wherein each pair comprises an uplink time slot and a downlink time slot.
  • A-F time slots per frame
  • the operating band, frame duration, time slot duration, time slots per frame, number of uplink versus downlink time slots, etc. may be configured to take in consideration different operating environments, network protocols, and architectures without departing from the invention.
  • a base station hardware resource such as a DSP in one embodiment, being configured to follow a hopping sequence among a set of RF resources.
  • the term resource when used herein by itself, refers to this sequence of RF resources that follow a hopping sequence.
  • a hopping sequence can be a radio frequency hopping sequence.
  • a hopping sequence can be a time hopping sequence, or a code hopping sequence.
  • each base station hardware resource is assigned to a resource, that is, a sequence of RF resources that follow a particular hopping sequence, for example, to participate in transmitting a stream of data with a user terminal via the resource.
  • a DSP in the base station processes a particular hopping sequence.
  • Streams start up and remain on a fixed hardware resource, and employ a sequence of RF resources per the hopping sequence associated with the hardware resource.
  • a new stream is started and the old stream stopped.
  • multiple resources can exist together on a single hardware resource.
  • a User Terminal begins a sequence of radio bursts with a random access (RA) request burst 201 in an uplink timeslot to a BS, specifying, in one embodiment, the paging identifier (PID) of the UT.
  • the BS may see this RA request and may respond with an access assignment (AA) burst 202 in the corresponding downlink time slot later in the frame, thereby opening a stream.
  • the AA informs the UT what resource the UT is to use for the remainder of the stream, if different from the resource already used to send the RA request.
  • the UT may communicate user data with the BS via the same resource used to exchange the RA and AA, or the AA may indicate the UT and BS exchange user data via a different resource, for example, a traffic channel (TCH) that follows its own hopping sequence, for example, a radio frequency hopping sequence.
  • TCH traffic channel
  • user data and/or in- band signals messages can be transmitted between the UT and BS, e.g., at 203 and 204, until the stream is terminated.
  • streams may begin when the BS notifies the UT via a page message 205 on a downlink time slot.
  • the UT knows the page is sent to it based on, for example, the paging identifier (PID) or other unique information in the page identifying the UT as the appropriate recipient of the page.
  • PID paging identifier
  • the UT listens for the page by following the hopping sequence utilized by the BS.
  • the UT and BS maintain predefined hopping sequence information in locally accessible data structures so that the UT knows where (that is, on what RF resource) to listen for a page from the BS.
  • the UT After receiving the page from the BS, the UT recognizes that it should contact the BS, for example, to receive queued information, and must locate a resource over which to receive the queued information. In one embodiment of the invention, the UT sends a page response 206 on the same resource as utilized by the BS in sending the page. If the UT receives a corresponding AA, the UT has been granted a stream. Alternatively, the UT may utilize a different resource to send the page response 206, and such resource may follow a different hopping sequence than the resource over which the page from the BS was transmitted.
  • the UT responds with the page response 206 on the same or different resource, depending on the embodiment of the invention.
  • the BS and UT agree beforehand on the resource and respective hopping sequence followed by the resource over which to send the page response. This may be accomplished through the exchange of information that coordinates the page and page response communications between the BS and UT, for example, during registration and configuration of these devices.
  • the page response is thus to the same base station hardware resource on the corresponding uplink time slot in the very next frame (since BS DSPs are assigned a particular time slot, in one embodiment of the invention). Moreover, the base station hardware resource that sent the page is known to be free because it had the transmit resources to construct and transmit the page. In this manner, hardware resource assignment is provided, in one embodiment of the invention, through paging.
  • paging is accomplished without a dedicated control channel. All unused hardware resources are available for paging. Whenever a base station hardware resource is idle, it builds pages for any users that are expected to be listening on the resource over which the page is transmitted and for whom data is queued and waiting. Thus, paging operates to provide a resource allocation strategy.
  • each UT has a unique radio frequency and time slot hopping sequence that it monitors while in the idle state.
  • the UT hops to different RF resources listening for a page from different BS hardware resources.
  • the sequence of RF resources followed by the UT is referred to as the UT's paging resource.
  • the page includes the UT's paging identifier (PID) or some other such unique information.
  • the hardware resources at the BS each maintain a list of UTs (PIDs) that it can page at each hop.
  • the base station hardware resource that is matched to the paging resource at that frame sends a page.
  • paging is repeated, one page per frame, until the UT responds or times out.
  • the UT may listen for a page one time slot per frame, or one time slot per multiple frames. It is appreciated that to decrease the number of RF or hardware resources and to conserve UT battery, the frequency of paging can be decreased.
  • the BS knows what page listening pattern the UT is following by computing a function at the BS that tracks the UT page listening pattern. .
  • the BS can identify the page listening pattern of the UT by referring to a look up table or the like maintained in the BS for the UT.
  • the UT computes a function at the UT to determine the resource over which to send a page response. For example, the UT searches a look up table maintained at the UT when it receives a page to determine over what resource to send a page response. In this manner, the BS and the UT are able follow each other along. This aspect of the invention allows for resource assignment.
  • a BS does not want a particular UT to send a page response on a particular resource
  • the BS simply avoids sending a page to the UT on the corresponding resource.
  • the paging process described above makes implicit resource allocation or assignment possible by providing information about available resources to the user terminals. Pages are only sent from, and thus seen on. available resources, so a UT responds to pages on a resource where the UT has just received a page, or on a different resource as directed by, for example, the look up table maintained at or accessible by the UT.
  • the fact that the resource is available is either implicit in the timing of the page, or the mapping of the frame in which the page is transmitted to the hopping sequence information calculated at the BS and UT.
  • This aspect of the invention greatly increases the likelihood that the first attempt by the UT to respond to a page on a particular resource will likely be on an available resource.
  • the UT If the first attempt to send the page response fails, for example, if some other UT or BS grabs the resource just before the UT attempts to send a page response, the UT recognizes that it must still contact the BS. In one embodiment, the UT attempts to retry sending a page response some number of times before scanning for other resources over which to send a page response to the BS. Additionally, the number of retries can be parameterized and provide for different levels of service based thereon.
  • the BS assigns resources by sending or withholding pages. Moreover, it can also assign hardware resources to provide a DSP associated with a time slot (or radio frequency) that has free processing cycles available to process a page. Importantly, the DSP does not need to know the state of the BS or other DSPs. The DSP only needs to be concerned with whether it has the computing resources to provide a page and/or receive a page response, and indicate to a general processor in the BS to stop the paging process once it has done so. In this manner, direct DSP to DSP communication in the BS is eliminated, yet transmission of paging and data messages is shared.
  • UTl listens for a page on radio frequency A during even numbered frames, and on radio frequency B during odd numbered frames.
  • UT2 conversely, listens for a page on radio frequency B during even numbered frames, and on radio frequency A during odd numbered frames (even though it is appreciated that both UTs could listen to the same radio frequency since there is an address, a PID, or the like, in the page that distinguishes between multiple UTs).
  • UT2 is exchanging data with the BS on radio frequency B, and the radio frequency is busy and thus unavailable, as is the associated BS hardware resource assigned to this radio frequency, while UT2 is exchanging data.
  • a message is queued at the BS for UTl .
  • the BS provides or is accessible by a gateway to the Internet and the user associated with UTl requested some time ago information to be downloaded from a web site on the World Wide Web, and the first of multiple packets to be transmitted to UTl as a result thereof is queued for transmission to UTl .
  • the BS in particular, for example, a general processor in the BS, notifies all DSPs in the BS (in this case, just DSPs A and B) to page UTl. If the DSPs are idle, or based on other criteria such as the load on the RF resource over which a DSP is communicating, the DSPs send a page as follows. Given that DSP B is considered busy in this example communicating with UT2 on radio frequency B, it does not page UTl. However, since DSP A is idle, on an even numbered frame, DSP A sends a page message to UTl on radio frequency A.
  • Tt may be necessary to send multiple pages before UTl receives and responds to the page.
  • DSP A sits idle, since the BS and UTl agreed that UTl listens for a page from DSP B on radio frequency B during odd numbered frames, and DSP B is considered busy in this example.
  • UTl does not receive a page during the odd numbered frame.
  • UTl listens for a page on radio frequency A and receives a page, recognizes its own unique identifying information in the page, and verifies integrity of the page. In response thereto, UTl sends a response page on radio, frequency A, specifying, for example, its identifier and transmission power level, etc. While this embodiment utilizes the same radio frequency for the pag e and page response, it is appreciated that the page response may be transmitted on another radio frequency, or resource, through the use of coordinated look up tables on, or dynamic calculations performed by, the BS and UT.
  • DSP A receives the page response and sends an access assignment (AA) on radio frequency A to UTl directing UTl to continue utilizing radio frequency A for transmitting data messages.
  • AA may, in another embodiment, indicate a resource, or frequency other than radio frequency A, over which UTl and DSP A begin transmitting data messages.
  • the invention comprises various steps.
  • the steps of the invention may be performed by hardware components, such as those illustrated herein, or may be embodied in machine- executable instructions, which may be used to cause one or more general-purpose or special- purpose processor or logic circuits programmed with the instructions to perform the steps.
  • the steps may be performed by a combination of hardware and software.
  • the invention may be provided as a computer program product that may include a machine-readable medium having stored thereon instructions which may be used to program a computer (or other electronic devices) to perform a process according to the invention.
  • the machine-readable medium may include, but is not limited to, floppy diskettes, optical disks, CD-ROMs, and magneto-optical disks, ROMs, RAMs, EPROMs, EEPROMs, magnet or optical cards, flash memory, or other type of media / machine-readable medium suitable for storing electronic instructions.
  • the invention may also be downloaded as a computer program product, wherein the program may be transferred from a remote computer to a requesting computer by way of data signals embodied in a carrier, or radio frequency, wave or other propagation medium via a communication link (e.g., a modem or network connection).
  • a communication link e.g., a modem or network connection
  • the invention can be applied to a wide variety of different wireless systems in which data are exchanged. Such systems include voice, video, music, broadcast and other types of data systems without external connections.
  • the invention can be applied to fixed remote terminals as well as to low and high mobility terminals. Many of the methods are described in their most basic form but steps can be added to or deleted from any of the methods and information can be added or subtracted from any of the described messages without departing from the basic scope of the invention. It will be apparent to those skilled in the art that many further modifications and adaptations can be made. The particular embodiments are not provided to limit the invention but to illustrate it. The scope of the invention is not to be determined by the specific examples provided above but only by the claims below.

Landscapes

  • Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

Dans la présente invention, une ressource est attribuée à chacune des multiples ressources matérielles indépendantes, réparties dans une station de base, la ressource comprenant une séquence de ressources radiofréquence qui suivent une séquence de sauts. Les ressources matérielles qui sont capables de transmettre un message via leur première ressource attribuée respective sont identifiées. Une des ressources matérielles disponible identifiée capable de transmettre le message est sélectionnée pour envoyer le message via la ressource à laquelle la ressource matérielle sélectionnée est affectée. Le message est reçu au niveau d'un terminal d'utilisateur via la ressource; et une réponse au message est envoyée via une autre ressource à la ressource matérielle sélectionnée en réponse au message.
PCT/US2002/024380 2001-07-31 2002-07-31 Attribution dynamique de ressources materielles dans une station de base pour l'envoi de messages de recherche de personnes WO2003013078A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US91972601A 2001-07-31 2001-07-31
US09/919,726 2001-07-31

Publications (2)

Publication Number Publication Date
WO2003013078A1 WO2003013078A1 (fr) 2003-02-13
WO2003013078A9 true WO2003013078A9 (fr) 2003-12-11

Family

ID=25442545

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2002/024380 WO2003013078A1 (fr) 2001-07-31 2002-07-31 Attribution dynamique de ressources materielles dans une station de base pour l'envoi de messages de recherche de personnes

Country Status (1)

Country Link
WO (1) WO2003013078A1 (fr)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7424002B2 (en) 2001-03-20 2008-09-09 Arraycomm, Llc Resource allocation in a wireless network
US7227855B1 (en) 2001-03-20 2007-06-05 Arraycomm Llc Resource allocation in a wireless network
EP1413097B1 (fr) * 2001-07-31 2017-07-26 Intel Corporation Attribution de ressources dans un réseau sans fil
US20040063465A1 (en) 2002-09-30 2004-04-01 Uhlik Christopher R. Hopping hardware resources during paging in a wireless communications system
JP4362472B2 (ja) * 2005-12-27 2009-11-11 京セラ株式会社 移動体通信システム及び基地局装置
EP3010155B1 (fr) * 2014-10-13 2024-05-08 MyLaps B.V. Communication à fréquence radio rapide pour des applications de synchronisation de sport

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6647000B1 (en) * 1999-05-28 2003-11-11 Telefonaktiebolaget Lm Ericsson (Publ) Methods and apparatus for performing slot hopping of logical control channels in wireless communications systems
KR100317216B1 (ko) * 1994-06-01 2002-02-28 에어네트 커뮤니케이션즈 코포레이션 모듈레이터/디모듈레이터자원과의스위치가능한접속을실시하기위해시분할다원접속버스를이용하는광대역무선기지국
US6590928B1 (en) * 1997-09-17 2003-07-08 Telefonaktiebolaget Lm Ericsson (Publ) Frequency hopping piconets in an uncoordinated wireless multi-user system
KR100255320B1 (ko) * 1997-12-29 2000-05-01 윤종용 주파수 도약/부호 분할 다중 접속시스템의 기지국시스템
US6570857B1 (en) * 1998-01-13 2003-05-27 Telefonaktiebolaget L M Ericsson Central multiple access control for frequency hopping radio networks
AU1563701A (en) * 1999-11-19 2001-05-30 Telefonaktiebolaget Lm Ericsson (Publ) Frequency hopping in gprs/gsm compact communications system

Also Published As

Publication number Publication date
WO2003013078A1 (fr) 2003-02-13

Similar Documents

Publication Publication Date Title
US7424002B2 (en) Resource allocation in a wireless network
US7734809B2 (en) System and method to maximize channel utilization in a multi-channel wireless communication network
KR100420606B1 (ko) 대역폭할당
JP4523171B2 (ja) 移動体通信における複数の多元アクセスタイプの利用
US7003303B2 (en) Dedicated high priority access channel
US7227855B1 (en) Resource allocation in a wireless network
US7907956B2 (en) Hopping hardware resources during paging in a wireless communications system
US7158495B2 (en) Packet data transmitting/receiving method in mobile communication system
CA2689852C (fr) Procede pour effectuer une commutation sans fil
KR20020038922A (ko) 가변 고속 페이지 모드
US20050113023A1 (en) Method of managing communications in a network and the corresponding signal, transmitting device and destination terminal
KR20010031579A (ko) Ｃｄｍａ 디스패치 시스템
EP0898845A2 (fr) Procede de transmission de donnees et appareil correspondant
EP1149484A2 (fr) Systeme et procede destines a la communication de donnees depuis un point unique vers des points fixes multiples
US6603750B1 (en) Rehash timer for packet data communications
WO2003013078A9 (fr) Attribution dynamique de ressources materielles dans une station de base pour l'envoi de messages de recherche de personnes
EP1413097B1 (fr) Attribution de ressources dans un réseau sans fil
JP2004504784A (ja) ダウンリンクの論理チャネルに対する無線リソースの高速割り当て方法
WO2003094559A2 (fr) Systeme et dispositif de communication sans fil, et procede de surveillance associe
RU2350024C1 (ru) Способ распределения временных интервалов в сетевых каналах радиосвязи
AU2002317602A1 (en) Resource allocation in a wireless network
JP4846895B2 (ja) 分散制御によるオーバーヘッドメッセージの更新
JP4295117B2 (ja) インターネットプロトコルベースの無線通信システムにおける情報伝送
Vitebskiy et al. A distributed trunking mechanism for ad hoc VHF tactical networking

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BY BZ CA CH CN CO CR CU CZ DE DM DZ EC EE ES FI GB GD GE GH HR HU ID IL IN IS JP KE KG KP KR LC LK LR LS LT LU LV MA MD MG MN MW MX MZ NO NZ OM PH PL PT RU SD SE SG SI SK SL TJ TM TN TR TZ UA UG UZ VN YU ZA ZM

Kind code of ref document: A1

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SI SK SL TJ TM TN TR TT TZ UA UG UZ VN YU ZA ZM ZW

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ UG ZM ZW AM AZ BY KG KZ RU TJ TM AT BE BG CH CY CZ DK EE ES FI FR GB GR IE IT LU MC PT SE SK TR BF BJ CF CG CI GA GN GQ GW ML MR NE SN TD TG

Kind code of ref document: A1

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR IE IT LU MC NL PT SE SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
COP Corrected version of pamphlet

Free format text: PAGES 1/4-4/4, DRAWINGS, REPLACED BY NEW PAGES 1/4-4/4; DUE TO LATE TRANSMITTAL BY THE RECEIVING OFFICE

REG Reference to national code

Ref country code: DE

Ref legal event code: 8642

122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase in:

Ref country code: JP

WWW Wipo information: withdrawn in national office

Country of ref document: JP