TWI328949B - Method, apparatus and machine-readable medium for scheduling data packets for transmission - Google Patents

Description

1328949 IX. Description of the Invention: TECHNICAL FIELD OF THE INVENTION The present invention relates generally to wireless communications, and in particular to reducing interference in a wireless communication environment. [Prior Art] • Wireless communication systems have become a popular tool for most people around the world to connect. Wireless communication devices have become smaller and more powerful to meet consumer demand and improve portability and convenience. The increased processing power of mobile devices such as mobile phones has led to an increase in demand for wireless network transmission systems. Typically, such systems are not as easily renewable as mobile devices that communicate through such systems. Due to the expanded capabilities of mobile devices, it may be difficult to maintain older wireless network systems in a manner that promotes the full use of new and improved wireless device capabilities. Specifically, the frequency division based technology typically divides the spectrum into distinct channels by dividing the spectrum into a number of equal bandwidth blocks. For example, 5, the frequency band configured for wireless communication is divided. It can be divided into % channels, each of which can carry a voice conversation or carry digital data in conjunction with a digital service. Each channel can be assigned to only one user at a time. One known variant is the orthogonal frequency division technique, which efficiently divides the overall system bandwidth into multiple orthogonal subchannels. Their sub-bands are also known as carrier tone, carrier, bin and/or frequency channels. Each sub-band is associated with a subcarrier that can be modulated by the available data. The time-based technique is used to divide the _band into a number of consecutive time slices (1) coffee slices or time slots (tlme sl〇t). - Each user of the channel is provided with a time of 115542.doc 1328949 slices for transmission and reception in a cyclic manner. For example, at any given time t, a user is provided access to the channel during a short burst. The access right is then switched to another user who is provided with a short burst time for transmitting and receiving information. , the rotation " loop continues, and finally each user is provided with multiple transmissions and receiving bursts.

Several frequencies to transmit data. In general, the data is digitized and spread over the available bandwidth, where multiple users can be overlaid on the channel and each user can be assigned a unique serial number. The user can transmit in a wide frequency band block of the same spectrum, wherein each user's signal is spread over the entire bandwidth according to its respective unique spreading code (spreading). This technology provides sharing, where – or multiple users can simultaneously transmit and receive. This sharing can be achieved by spread-frequency digital modulation, where a user's turbulence is encoded in a pseudo-random manner and spread over a very wide frequency.

The code-based technology is typically available at any time within a range. The receiver is designed to recognize the associated unique sequence code and to restore randomization to collect a particular user's bit in a sequel to the scam. A typical wireless communication network (eg, employing frequency division techniques, time sharing techniques, and code division techniques) includes one or more base stations (which provide coverage areas) and one or more mobile (eg, wireless) terminals. Can be transmitted and connected in the coverage area::枓). A typical base station can simultaneously transmit multiple data streams for use in the == interesting multi-point broadcast service and/or unicast service. The data stream that the mobile terminal can receive independently. The mobile terminal in the base station W area (IV) may be interested in receiving one, more than one or all data streams carried by the composite stream 115654.doc 1328949. Similarly, mobile terminals can transmit data to base stations or other mobile terminals. Such communication between the base station and the mobile, terminal or interworking terminal may be degraded due to channel variations and/or interference power variations. Accordingly, there is a need in the art for systems and/or methods that facilitate reducing interference and improving throughput in a wireless communication environment. [Summary of the Invention]

A simplified summary of one or more aspects is provided below to provide a basic understanding of their aspects. The summary is not an extensive overview of the aspects of the invention, and is not intended to identify the essential or critical elements of all aspects, and is not intended to describe the scope of any or all aspects. Rather, it is intended to present a concept of one or more aspects in a simplified form as a preface to the [implementation] set forth below.

According to various aspects of the present invention, the number of schedules can be evaluated for a node (for example, an access point, an access terminal,) belonging to the sender of the data packet transmission, and can be performed according to the $etc. The Master Scheduler chooses between the scheduler and the receiver-based schedule agreement. The scheduling factor may include a node topology (eg, associated with the sender node and the receiver node weight), traffic between the nodes, interference experienced at the respective node, upload activity at the node, and download activity. Ratio and so on. According to some kind of 'sending material point and picking up the material-saving communication and agreement (4) to send the main scheduling mechanism and the terminal-based scheduling mechanism. According to the dispatching protocol based on the sender, the fact that the node data packet of the node that wants to transmit the packet is ready for transmission, and (iv) from (4) 115542.doc 1328949 node is ready to receive the packet. .嚯 一 W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W W The node grants a subset of available resources, and the sending end node can transmit the data packet through the available resource subgroup. The choice between the sender-side agreement and the receiver-based schedule agreement may be a function of comparing the amount of downloads at the data transfer-or-nodes. μ According to the - item aspect, the method of arranging (4) the transmitted data packet in the wireless network may include determining a download amount at a first node relative to an upload amount; and by utilizing The dispatching technology based on the transmitting end and the scheduling data for transmitting at least one of the scheduling technologies mainly based on the receiving end, wherein the scheduling technology used is based on the download amount relative to the This determination of the amount of upload is selected. The method may further include: if the download amount is greater than the upload amount, using the scheduling technology based on the sender, and if the download amount is less than or equal to the upload amount, using the receiver-based row Process technology. According to another aspect, an apparatus for facilitating dynamic schedule data packet transmission can include: a decision module that determines a download amount relative to an upload amount at a first node; and a scheduler that borrows The data packet for transmission is scheduled by using at least one of a scheduling technology based on the transmitting end and a scheduling technology based on the receiving end, wherein the scheduling technology is used according to the downloading The determination is made with respect to the determination of the amount of upload. If the download amount is greater than the upload amount, the determining module may select the scheduling technology that is 115542.doc •9- 1328949, and if the download amount is less than the upload amount, the determining module may Select this scheduling technology based on the receiving end. According to another aspect, an apparatus for facilitating scheduling of data packets for transmission in a wireless communication environment may include: determining, by a component 1 a download amount at a first node relative to an upload amount; a component component for scheduling data packets by using a scheduling technology based on the transmitting end and at least one of the scheduling technologies mainly based on the receiving end, wherein the data packet is used for transmitting The scheduling technique selects the determination based on the download amount relative to the upload amount. Another aspect relates to a computer readable medium comprising instructions for scheduling data packet transmissions in a wireless communication environment, when executed, causing a machine to perform the following actions: determining at a first node - downloading relative to an upload amount; and scheduling a data packet for transmission by utilizing at least one of a scheduling technique based on the transmitting end and a scheduling technique based on the receiving end, Wherein the scheduling technique utilized is selected according to the determination of the download 1 relative to the upload amount. Another aspect relates to a processor for scheduling data packets for transmission. For determining: a download amount at a first node relative to an upload amount; and using at least one of a scheduling technology based on the transmitting end and a scheduling technology based on the receiving end The data packet for transmission is scheduled, wherein the scheduling technique utilized is selected according to the determination of the download amount relative to the upload amount. In order to achieve the foregoing and related ends, the one or more aspects include features that are fully described in the [embodiment] and are specifically indicated in the scope of the claims. -10-115542.doc 1328949 [Embodiment] and the accompanying drawings illustrate in detail a schematic aspect of one or more aspects. These aspects are symbolic, however, there are a number of ways in which various aspects can be used, and the described aspects are intended to include all such aspects and equivalents thereof. [Embodiment] Reference will now be made to the accompanying drawings. Various aspects are described, in which like reference numerals are used to refer to the like. For the purpose of commentary,

Numerous specific details are set forth in the Detailed Description which follows to provide a sufficient understanding or a plurality of aspects. However, it is obvious that I can still implement this (equal) aspect without using these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate a description or a plurality of aspects. The system "and similar terms are used in this application, the term "component means a computer-related entity' which is hardware, software, software in execution, firmware, intermediates, microcode and/or Any combination of them. For example, a component

It may be, but is not limited to, a processor, processor, object, executable, thread, program, and/or computer that is executing on the processor... or multiple components may reside within the processor and/or thread. And - components can be localized on one computer and / or dispersed in two or more computers ^ then "can be carried from a computer-readable medium that has stored various data structures: He: components. The components can be processed by the local and/or remote end: 仃: 仏 'such as according to a signal with one or more data packets (such as the way (such as self / by signal and this m distributed system and / or cross A component of a network (such as the Internet) that interacts with another component in other systems. 115542.doc -11- 1328949 Further, the system components described herein may be rearranged and/or supplemented by additional components to Promote the achievement of the various aspects, objectives, advantages, etc. described by it, and is not limited by the precise configuration proposed in the established drawings, as understood by those skilled in the art. The platform can also be used to describe various aspects. The subscriber station can also be called the system, the subscriber unit 'mobile station, the mobile device 'remote station' access point, the remote terminal, the access terminal, the user terminal, the user. Agent, access terminal or user equipment. The subscriber station may be a mobile phone, a non-wired telephone, a session initiation protocol (Sessi〇n Initiati〇n Protocol; SIP) handset, a wireless local loop (WLL) platform Number of individuals Assistant (PDA), hand-held device with wireless connectivity or other processing device connected to the wireless data system. In addition, standard stylization and / or engineering techniques can be used to describe the aspects or features described in this article. It can be implemented as a method, device, or article of manufacture. The term "article of manufacture" as used herein is intended to encompass a computer program that can be accessed from any computer-readable device, carrier, or media. For example, a computer can media These may include, but are not limited to, magnetic storage media (eg, hard drives, floppy disks, magnetic strips), optical discs (eg, compact discs (CDs), digital versatile discs (DVD)...), smart cards And a flash memory device (eg, a card, a stick, a key dHve, etc.). Further, various storage media described herein may represent one of the stored information or A plurality of devices and/or other machine-readable media. The term "machine-readable medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and/or carrying instructions and/or materials. . Obviously, the use of this article

115542.doc •12· 1328949 The word "demonstration" is expressed as an example, example or explanation. Any aspect or design described as "demonstration" in this article is considered to be a better aspect or design. Or better than other aspects or designs. Figure 1 will not be based on a variety of special or random wireless communication environment 1 〇〇. System 1 〇〇 can be included in one or more sectors One or more • access points 1〇2 (which may be fixed, mobile, radio, Wi-Fi • etc.), receiving, transmitting, relaying, etc. wireless communication _ to each of the other access points and/or one or more access terminals 104, 106, 108. Each access point 〇2 may include a transmitter chain and a receiver key 'per-transmitted The device key and the receiver chain may include a plurality of components (eg, processor, modulator, multiplexer, demodulation rabbit, demultiplexer, antenna, etc.) associated with signal transmission and reception, such as familiarity As known to the skilled person, the access terminal 104 can be, for example, a mobile phone, a smart phone, a laptop, a table. A laptop, a handheld communication device, a handheld computing device, a satellite radio, a global positioning system, a PDA, and/or any other suitable device for communicating over a wireless network 1. It can be combined with the various items described herein. The aspect uses a system 100 to facilitate the provision of flexible resource reuse in a wireless communication environment, as described in relation to subsequent figures. Access terminals 104, 1, 6, 108 are typically dispersed throughout the system and each A terminal may be fixed or mobile. The terminal may also be called a mobile station, user equipment, access terminal or other terminology. The terminal may be a wireless device, a mobile phone, a personal digital assistant (pDA), or wireless. Data cards, etc. Each terminal 1〇4,1〇6,1〇8 can communicate with zero, one or more access points on the downlink and uplink at any given time. Downstream 115542.doc - 13- 1328949 The keyway (or forward link) means the communication key from the access point to the terminal, and the uplink (or reverse link) means the communication link from the terminal to the base station. *For decentralized architecture The access point 102 may optionally be connected to the other access point. The data transmission on the forward link occurs at a maximum data rate supported by the forward link and/or the communication system or near the maximum data rate. Pointing to an access terminal. Additional channels (eg, channels) of the forward link can be transmitted from one access point to one access terminal. Reverse link data communication can occur from one access terminal Terminal to one or more accesses According to other aspects, the special network may be a multi-hop network in which the access terminal 108 utilizes another access terminal 1〇6 as the access point 1〇 2 repeater. For example, 'access terminal 1〇8 can determine that its signal strength is insufficient to transmit to access point 1G2' but access terminal (10) does have sufficient signal strength in this case, access The terminal (10) can just forward the reverse link communication to one or more access points 1〇2 through the access terminal. Thus, the access terminal 106 can act as an access point to the access terminal 1-8. 2 illustrates a path selection tree structure 200 that facilitates the execution of a schedule that is predominantly or predominantly on the transmit end, or both, in accordance with the plurality of aspects described herein. Indeed, several types of communication systems can take advantage of the above. For example, in a wired access point scheme, there may be 10 to 30 access terminals being talked to, and there is no confrontation between access points; s #, m 耵 equation communication). Therefore, a wired access point can be considered as a very small cell. p Al hits the ground. In addition, in such deployments, there may be 115542.doc 1328949 high load downloads, and as a result, it may be desirable to assume more scheduling responsibility at the sender.

Moreover, when employing the systems and methods described herein, cluster heads and/or nodes having many outbound connections in the path selection tree structure 200 with few inbound connections can be found to have improved throughput. Consider the node B in the path selection tree structure 200 shown in FIG. Node 8 may decide to apply the schedule based on the sender when communicating with node a. In the two cases, the nodes that are relatively familiar with the interference environment or traffic mix may be candidates for the #send-based schedule. In addition, the node may utilize traffic mixing (e.g., ratio of upload and download), perceptual interference, or a combination thereof when deciding whether to use a schedule based on the sender or a schedule based on the receiver. For example, D, using traffic mixing to determine whether to use a sender-based schedule or a receiver-based schedule node can determine that the neighboring node is performing the game system (4), and it may wish to use interference as an option. Scheduling mechanism parameters 'to ensure that neighboring nodes are not mixed by using traffic

Cooperatives experience excessive signal delays for the transmission of possible schedules. In this manner, the access terminal can utilize either or both of traffic mixing and potential interference to maximize the throughput of the access terminal and the throughput of any neighboring access terminals that may be affected. The way to come.

FIG. 3 illustrates a path selection tree structure 300 in accordance with a plurality of items in a time-sharing technique for facilitating either or both of the scheduling of the transmitting end and the receiving end. For example, some nodes may choose to alternate between a schedule that is primarily a sender and a schedule that is dominated by a receiver. Node A 115542.doc • The descendant of the 15-system, which has many children; among its children, node A acts as a relay to node C. If the node (4) wants to transmit the packet to point A, the node B can use the sender as the cookie and does not need to send the message to the node A. In addition, the node sends the data packet to the node on the selected subcarrier of the node B itself. Hey. Conversely, if node C wants to transmit a packet to node A' then node C can send a request to node A, and node A can know to the node (3) the subcarriers that are allowed to be used (e.g., granted). According to this, in this case, the communication between the node and the node B is in the "schedule-based scheduling" mode, and the communication system with the node C is based on the receiving end. In the mode, the mode can be described as follows: the node wire node is called "subordinate node" (the node B is the main control of the field), and the node A is the subordinate "the node"栌Node丨, please refer to Figure 4 to Figure 6, which shows the methodology of scheduling with the sender and scheduling with the LIS. For example, the methodology can be related to the environment, the Cong A environment, CDMA environment, (4) Caihua 7 TMMA environment, SDMA environment or any other suitable wireless environment ^ ^ delivery-based scheduling and receiving-based scheduling. Although for the purpose of resolution, methodology (d) and described as - a series of actions, = 疋 (four) solution 'methodology is not limited by the sequence of actions, according to one or more states / or far-reaching actions can occur in a different order than the ones shown and described herein: : Actions occur at the same time. For example, those who are familiar with this technology = ^ Methodology alternative surface For a series of interrelated states or things: as represented by a state diagram. In addition, according to one or more aspects, not all illustrated actions are necessary to implement the methodology. 115542.doc 1328949 Figure 4 illustrates the basis of - or One of a plurality of aspects facilitates the implementation of a methodology 400 for determining whether to use a data packet scheduling technique based on the sender or a dynamic decision of the data packet scheduling technique based on the receiver based on the plurality of scheduling factors. In step 4〇2, the scheduling factors may be analyzed and/or evaluated to permit estimation of resource occupancy examples at respective transmitting end nodes and receiving end nodes, and the scheduling factor may include associations to be transmitted between them. : the weight of the node of the bedding package, the physical distance between the nodes, the traffic mix between the nodes (for example, data traffic, control signal traffic, paging signals, etc.), interference caused by nearby nodes, and Similarly, on the step side, it is determined whether the transmitting end node should schedule the data packet for transmission (for example, the scheduling based on the transmitting end), or whether the receiving end node should schedule the data. Packet transmission (scheduled by the receiver). The scheduling protocol based on the sender may include, for example, a sender node notifying the receiver node (eg, through the paging channel) that there is a need to queue The data packet used for transmission. Then, the receiving end node can respond to the sending end node with an indication that it is ready to receive the data packet. The transmitting end node can select - or multiple channels or subcarriers, and transmit the data packet to the receiving point. The scheduling technique based on the receiving end may include, for example, a transmitting node transmitting request 'to send a data packet to the receiving end node. Then, the receiving end point will indicate one or more channels or subcarriers The grant is sent back to the = end node's sender node through which the channel or subcarrier:: beacon packet is transmitted. In step Yang, based on the analysis of the scheduling factor, the edge: the node and the receiving end node can initiate and execute the scheduling schedule based on the transmitting end or the scheduling protocol based on the receiving end. In this way, 115542.doc (s > -17-1328949 can be dynamically used to dynamically determine the congestion of the sender node at the pure (four) node to facilitate the selection of efficient scheduling agreements. - A pattern based on the packet transmitted by the recanalization schedule data packet. In step (10) 2 = the scheduling factor, the scheduling factor can be a knife, and the .sa ^ is included (for example, not limited to) the path selection topology (for example, Associated with the phantoms, clusters (eg, node clusters) of the nodes involved in the transmission, traffic mixing, interference from other nodes, and the like. In step 5〇4, based on the analysis of the scheduling factor, determine whether to use for receiving The terminal-based scheduling agreement or the scheduling protocol based on the transmitting end. The determination may be based only on the analysis of the scheduling factor performed in step (10), or may include an additional determination in step 506 whether the considered transmission is large. Most are download-oriented or large: the number is upload-oriented (for example, whether the amount of downloaded data is greater than the amount of uploaded data, or vice versa). If it is determined that the downloaded amount is greater than the uploaded amount, the method can proceed to step 5〇8. In this step, the scheduling of the scheduled data packet can be initiated by the receiving end. If the downloading amount is not greater than the uploading, then in step 51, the scheduling based on the transmitting end can be started. Agreement, the transmission of the schedule data packet. If the download portion of the data is equal to the upload portion, it is expected to use any schedule agreement. Or, if desired, when the data transfer includes equal download and upload portions, then The item scheduling agreement is designated as a preferred agreement. Method 500 can terminate after the data packet has been scheduled in accordance with the selected association. Additionally or alternatively, method 5 can be returned to step 5 according to various aspects. 2 for further reversal (eg 'arrangement of scheduling factors, transmission characteristics and protocol selection for additional data packets) to provide dynamic scheduling of transmissions. 115542.doc -18- 1328949

Thus, method 500 can be utilized to ensure that nodes in the network operate on a schedule that is primarily a sender or a receiver that is primarily a receiver. Depending on the situation, the schedule based on the sender or the schedule based on the receiver can be implemented in a static manner. According to other aspects, a dynamic determination can be made at any given point as to whether to implement a schedule based on the sender or a schedule based on the receiver. The dynamic decision can be based, for example, on a large time scale; for example, a wired access point can be set to use a word processor-based schedule as a preset value. Additionally or alternatively, the dynamic determination may be based on a relatively small time scale, for example, a wireless access point acting as a repeater may be implemented between a server-based schedule or a receiver-based schedule. Time-sharing agreement. According to other aspects, 'four nodes' can be used as the preset mode. The following examples relate to an access point that wants to transmit a packet to an access terminal. According to the "receiving terminal as the main " scheduling, the access point sends the request to the access terminal', which does not need to be implemented through separate transmissions, but can be embedded in the access point and the access terminal The packet between. If the access terminal has sufficient resources (such as 'subcarrier or code), the access terminal will assign a channel to the access point, and access the channel (four) channel for transmission according to the sender's primary address. The scheduling, access point to the access terminal = (through the material channel) (four) material packet "access terminal" can respond to and notify it to receive the packet. Then, the access point transmits the packet β map on the selected channel (for example, subcarrier group, time slot, code signature, ...), which will show a basis according to the - or multi-state pattern. 115542.doc 1328949 The number of connections at the node to dynamically schedule data packet transmission method method. According to an example 'node may have upcoming data transmission' and may want to determine whether it should be scheduled The transmission (eg, as a transmitting end node) 'or whether it should listen to the receiving end node to schedule the transmission β. In step 602', the scheduling factor can be analyzed. The scheduling factor can include path selection topology, node clustering, and traffic mixing. Interference from neighboring nodes and the like, the item may be determined or selected in step 6〇4'. The decision may be based solely on the analysis of the scheduling factor performed in step 602, or may include an additional step 606. Determine the ratio of the internal connection to the outgoing connection (for example, whether the number of received signals is greater than the number of transmitted signals, or vice versa). If it is determined that the number of internal connections is greater than If the number of connections is reached, the method can continue. Step 6 to 8. In this step, the scheduling protocol based on the receiving end can be started to transmit the scheduled data packet. If the number of internal connections is smaller than the outgoing connection The quantity, in step 61, can initiate the transmission of the scheduling protocol, which is mainly based on the transmitting end. If the number of internal connections is equal to the external connection, the arbitrage can be utilized. According to another aspect, when the data transmission includes an equal download portion and an upload portion, the item schedule agreement may be designated as a better agreement. Method 6 may terminate the schedule data according to the selected agreement. After the packet, in addition or alternatively, 'in accordance with various aspects, method 600 may return to step 6〇2 for further reversal (eg, analysis of scheduling factors, transmission characteristics, and protocol selection for additional data packets) to provide transmission. Dynamic scheduling. ° 1 Use method 6GG to ensure that the nodes in the network operate according to the scheduling schedule of the sender or the receiver. According to various aspects, 115542.doc -20 · 1328949 State mode to implement the secret of the sender is your ^_ 圯鲕 Ma main schedule or the receiver-based schedule. According to other aspects, Λ ^ J 彳 彳 彳 7 A dynamic decision based on the schedule of the sender or the traveler to receive the master schedule. It can be based on, for example, a large time scale. For example, the line access point can be used as a feeder. The main schedule is used as a preset value. Additionally or alternatively, the 'dynamic decision can be based on a relatively small time scale. For example, a wireless access point acting as a repeater can be scheduled for a feeder or A time-sharing agreement is implemented between the schedules based on (4). According to other aspects, at some of the points, β ΒΒ 1 可 can be used for server-based scheduling as the default technology 0, Figure 7 Depicting an access terminal device that selects and implements between a transmitting end and a receiving end based on a special wireless communication network towel according to one or more aspects The terminal machine includes the receiver 702 'receiver via (for example) a receiving antenna (not shown) The signal is received and typical actions (e.g., filtering, • amplification, and down conversion) are performed on the received signal and the modulated signal is digitized to obtain a sample. Receiver 702 can include a demodulation transformer 7〇4 that demodulates the received signal and provides it to processor 7〇6' for channel estimation. The processor 706 may be: a processor dedicated to analyzing information received by the receiver m and/or generating information for transmission by the transmitter m; a process n for controlling one or more components of the access terminal 7; And/or a processor that analyzes information received by receiver 7G2, generates information for transmission by transmitter 716, and controls one or more components of access terminal 700. In addition, the processor can be hacked to the decision module 718, and the decision module can execute instructions for the following purposes: 115542.doc • 21·

1328949 compares the download amount and upload amount of the access terminal 700; compares the number of intranet connections and the number of outgoing connections; evaluates the scheduling factor' and determines whether to execute the scheduling protocol based on the sender or the row based on the receiver Agreement and so on. Access terminal 700 can additionally include a memory 708' memory operatively coupled to processor 706 and capable of storing data to be transmitted, received data, and the like. The memory 708 can store the following information: the number of internal connections, the number of outgoing connections, the amount of downloads, the amount of uploads, the protocol for comparing the values, the scheduling technology based on the sender, and the receiving end. Agreement between the main-scheduled technology and so on. It should be understood that the data store (e.g., memory 708) described herein may be a volatile memory device or a non-volatile memory device' or may include both volatile memory devices and non-volatile memory devices. By way of illustration (and not limitation), non-volatile memory can include read-only memory (R〇M), programmable ROM (PROM), electrically programmable ROM (EPROM), and electrically erasable PROM (EEPROM). ) or flash memory. Volatile memory can include random access memory (RAM), which can be used as an external cache memory. By interpreting (rather than limiting) 'available in many forms of RAM, such as Synchronous RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced SDRAM ( ESDRAM), Synchlink DRAM (SLDRAM) and direct Rambus RAM (DRRAM). The memory memory 708 of the subject systems and methods is intended to include, but is not limited to, the same as any other suitable memory. Receiver 702 is further operatively coupled to a dispatcher 710 that is primarily a sender, which can generate a signal to the receiving end node (eg, access point, 115542.doc • 22 - another access terminal, ...) informs that the data packet is ready for transmission, as described above. After receiving the response from the receiving end node, the dispatcher based on the transmitting end can schedule the data packet on the selected channel group or subcarrier group for transmission by the transmitter 716 to the receiving end node. The access terminal may additionally include a receiver 712 based on the receiving end, which can receive resources from the transmitting node (eg, 'access point, another access terminal, ...) • 纟 & The node indicates in the resource request that it wants to transmit the data seal & The scheduler 712, which is mainly on the receiving end, can confirm that it has sufficient resources (for example, channel, subcarrier, code, carrier tone, and), and generates - grants a subset of available resources to the sender node, and then sends The end node may transmit the data packet to the access terminal 700 via the granted resource subgroup. The access terminal 700 further includes a modulator 714 and a transmitter 716 that transmits signals to, for example, a base station, an access point, another access terminal, a remote agent, and the like. Although the figure is shown as being separate from the processor 7〇6, it should be understood that the scheduler 71, which is mainly based on the transmitting end, and the scheduler 712 and/or the decision module 718, which are mainly based on the receiving end, may be A processor 7〇6 or a component of several processors (not shown). 8 is a diagram of a system 80 促进 according to one or more aspects to facilitate the implementation of dynamic decision making using a data packet scheduling technique based on the transmitting end or a data packet scheduling technique based on the receiving end. System 8A includes an access point 802, the access point includes: a receiver 81A that receives signals from one or more access terminals 8.4 via a plurality of receive antennas 806; and a transmitter 824, which transmits a signal to one or more access terminals 804 through a transmitting antenna 8〇8. The receiver 810 can release 115542.doc •23- 1328949 from the receiving antenna 8〇6 and is operationally associated. The demodulation transformer 812, which demodulates the received information, can analyze the modulated symbols by a processor 814, which is similar to the processor described in relation to FIG. 7 and coupled to the processor Memory 816, δ mnemonic stores the following related information: number of internal connections; number of outgoing connections, downloads; upload amount; agreement for comparing these values; used for scheduling technology based on the sender Scheduling technology based on the receiving end

Agreement between choices; and/or any other suitable information for the various actions and functions presented herein. The processor 814 can be further coupled to the scheduler 818 that is primarily the sender and the scheduler that is the receiver of the receiver, which can facilitate the determination at the processor that any of the schedulers 818 and 820 will be utilized. The data package is then scheduled. Processor 814 and/or decision module 826 can execute instructions similar to those described above with respect to processor and/or decision module 718. For example, the sender-based scheduler 818 can generate a signal to inform the receiving node (eg, another access point access terminal, ...) that the data packet is ready for transmission as described above. Said. Upon receipt of the response from the receiving end node, 'the sender-based scheduler 818 can schedule the data packet on a selected channel group or sub-carrier group' for transmission by the transmitter 824 to the receiving end node. According to another example f, the receiver 820, which is mainly based on the receiving end, can receive the resource request from the transmitting end node (for example, 'other_access point, access terminal, .). The transmitting end node uses the resource request. Indicates that it wants to transmit a data packet. The receiver-based scheduler 82 can grant a subset of available resources. The sender node can then transmit the data packet to the access point 8〇2 via the granted resource subset. Although the figure is shown as being separate from the processor 115542.doc •24-f C*.%, 814, but it should be understood that the dispatcher 818 based on the transmitting end and the dispatcher 820 based on the receiving end are adjusted. The transformer 822 and/or the decision module 826 may be part of the processor 814 or a number of processors (not shown). 9 is a diagram of a wireless communication system 900 that can be employed with the various systems and methods described herein. For the sake of brevity, the wireless communication system 9 depicts an access point and a terminal. However, it should be understood that the system can include more than one access point and/or more than one terminal, wherein the additional access points and/or terminals can be substantially similar or different than the exemplary access points and terminals described below. machine. In addition, it should be understood that the access point and/or terminal can employ the methods (Fig. 4-6) and/or systems (Figs. 13, 7, 8 and 1) described herein to facilitate wireless communication there between. Referring now to FIG. 9, on the downlink, at the access point 9〇5, a transmission (TX) data processor 910 receives, formats, codes, interleaves, and modulates (or symbol maps) the traffic data. And providing a modulation symbol (data symbol one symbol 915 receives and processes the data symbol and the leading symbol, and provides a symbol stream. The symbol modulator 915 multiplexes the data symbol and the leading symbol And providing a data element it and a preamble to a transmitter unit (tmtr) 920. Each transmission symbol can be a data symbol, a preamble or a zero value signal. It can be continuously sent in a per-it period. The preamble ^ preamble can be divided into frequency division multiplexing (FDM), orthogonal frequency division multi-wei ((4) m), time division multiplexing (TDM) or code division multiplexing (CDM). TMTR 920 receives the symbol stream and Converting the symbol stream into - or a plurality of daisy-like signals, and further adjusting (eg, amplifying, filtering, and up-converting the analog signals to produce a lower (4) 115542.doc • 25· 1328949 suitable for transmission over a wireless channel. Road signal. Then 'transmit the downlink signal to the terminal through an antenna 925° At terminal 930, an antenna 935 receives the downlink signal and provides a received signal to a receiver unit (RCVR) 940. Receiver unit 940 conditions (e.g., 'filter, amplifies, and upconverts) the received signal and digitizes The adjusted signal 'receives the sample. The one-element demodulation transformer 945 solves' the modulation and provides the received pre-derivation element to a processor 950 for frequency-channel estimation. 945 further receiving a frequency response estimate from the downlink key of the processor 950 'to perform data demodulation on the received data symbols to obtain a data symbol estimate (which is an estimated S' of the transmitted data symbols) *) 'and provide data symbol estimates to a receiving (RX) data processor 955 'demodulation (eg, symbol de-mapping), de-interlacing, and decoding data symbol estimates to recover transmitted traffic data The processing performed by the symbol demodulation transformer 945 and the receiving (RX) data processor 955 is complemented by the symbol modulator 91 5 at the access point 905 and the transmission (TX) data processor 910, respectively. Processing Φ on the uplink A transmit (TX) data processor 960 processes the traffic data and provides data symbols. A symbol modulator 965 receives and multiplexes the data symbols and preamble symbols, performs modulation, and provides a symbol stream. A transmitter unit 970 receives and processes the symbol stream to generate an uplink signal, which is transmitted by the antenna 935 to the access point 905. At the access point 905, the uplink from the terminal 930 The signal is received by antenna 925 and processed by receiver unit 975 to obtain samples. Next, a symbol demodulator 980 processes the samples and provides received preamble and data symbol estimates for the uplink. A receiving (RX) data processor 985 115542.doc -26· 1328949 processes the data symbol estimate, and the coarse south 4 recovers the traffic transmitted by the terminal 930. - The processor 990 implements channel estimation for each of the active U-machines transmitted on the terminal in the round. Multiple Μ ^ ^ έ θ μη * % machines can be interleaved before they are assigned to the previous singapore group. Transmission wheel, which is the leading band wave

The processors 990 and 950 respectively indicate (example, pull, say, control, coordinate, manage, etc.) that the access point 9G5 and the terminal 990 and 950 are associated with the respective processors. ._ The code of the code and the memory unit of the company (not shown in the figure). The processors 990 and 95〇 can also perform calculations to derive the frequency response estimation and impulse response estimation of the uplink and downlink links respectively. To the proximity system (for example, FDMA, 〇fdma, CDMA, TDMA, etc.), multiple terminals can simultaneously share the leading sub-bands on the uplink key for the (four) system. If the terminal is adjacent to each terminal The channel estimation technique can be used when the frequency band spans the entire operating frequency band (except for the edge of the possible frequency band). In order to obtain the frequency diversity of each terminal, such a leading sub-band structure will be the required one. The method can be implemented by various means. Described techniques. For example, these techniques can be implemented using a combination of hardware, software, or software. For hardware implementation, one or more dedicated integrated circuits (ASIC), digital signal processors (D) Sp), digital signal processing device (DSPD), programmable logic device (pLD), field programmable gate array (FPGA), processor, controller, microcontroller, microprocessor, designed to perform this document Other electronic units that illustrate the functions or combinations of these devices implement a processing unit for channel estimation. Using software, modules that perform the functions described herein (eg, program, 115542.doc 27·1328949, etc.) The software code can be stored in the memory unit and executed by the processors 990 and 950. Figure 10 continued to promote the dynamic scheduling of data packet transmission according to a plurality of factors according to one or more aspects A diagram of device 1000. Device 1000 is depicted as a series of interrelated functional blocks that may represent functions implemented by a processor, software, or a combination thereof (e.g., 'firmware'). For example, device 1 A module device 1000 for performing various actions, such as the actions described above, includes a decision module 〇〇2 that determines the upload activity at the node relative to The amount of activity is downloaded and/or the ratio is determined. The decision module 1002 can additionally evaluate - or a plurality of schedule factors, which can include, but are not limited to, a routing selection topology (eg, associated with a node involved in transmission) Weights), clusters (eg, node clusters), traffic mixes, interference from neighboring nodes, ratio of downloaded data to uploaded data, ratio of inbound and outbound connections, and the like. Scheduling module 1〇 〇4 can select the scheduling agreement according to the analysis of the scheduling factor, and the scheduling module can determine whether to use the scheduling protocol based on the receiving end or the scheduling agreement based on the transmitting end. Based on the analysis of the scheduling factors implemented by group 1002 or may include additional considerations, the transmission A is recorded in order to download the steering or most of the upload-oriented (for example, whether the amount of downloaded data is greater than the amount of uploaded data, or vice versa Also). If it is determined that the download amount is greater than the upload amount, the receiving end can be used as the main scheduling agreement to transmit the scheduled data packet. If the download volume is not greater than the upload amount, the dispatcher based on the sender may be used to schedule the data transfer. If the download portion of the data is partially equal, any schedule agreement can be utilized. Or, Shi Keli, when the transfer of the material 115542.doc -28- U28949 includes equal parts of the load and the upload part, one of the contractual agreements can be deducted as a better agreement. Therefore, depending on the situation, the device facilitates dynamic scheduling transmission. The device 1 can be utilized in a manner similar to that described above with respect to the previous figures to ensure that the nodes of the network t operate according to a schedule based on the sender or a schedule based on the receiver. For software implementations, the techniques described herein can be implemented using modules (eg, # ' programs, functions, etc.) that perform the functions described herein. The software program # is stored in the memory unit and executed by the processor. The memory unit 3 is implemented internal to the processor or external to the processor, in which case the memory unit can be communicatively coupled to the processor via various means well known in the art. The foregoing description includes examples of one or more aspects. Of course, it is not possible to describe all conceivable components or combinations of methods for describing the above-mentioned aspects, but those skilled in the art will appreciate that further combinations and permutations of many aspects are possible. Accordingly, all such substitutions, modifications, and variations are intended to be included within the spirit and scope of the appended claims. In addition, to a certain extent, the term "includes" is used in the [embodiment] or the scope of the patent application, and when such terms are used as conversion words in the scope of patent application, such terms are expected to be similar. The term "includes" is incorporated. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 illustrates a diagram of a special or random wireless communication environment in accordance with various aspects. 2 illustrates a path selection tree node according to a plurality of aspects described herein that facilitates the implementation of a 115542.doc •29· composition or receiver-based schedule or both. In the case where the transmitting end is the main disk, the receiving end is the main one, and the time-sharing technique is implemented between the selected tree structure or both, according to a 哎吝^5 / One of the multiple modes promotes the implementation of the method of determining whether to operate the technique based on the complement term schedule factor or the data center of the == main data packet scheduling method based on the receiving end (4) The dynamic determination of the packet scheduling technique A diagram showing a method for transmitting a packet according to a plurality of factors according to a plurality of factors, and a method for transmitting a packet according to a plurality of factors. Figure 6 shows a basis according to - or a plurality of aspects in the data map = point Figure 7 of the method for the number of connections to dynamically schedule data packet transmission shows that the selection of the scheduling protocol based on the transmitting end and the receiving end is based on one of the - or multiple modes in the special wireless communication network. And implement the schema of the access terminal. 8 depicts a system based on - or a plurality of aspects to promote the implementation of dynamic judgment 曰 == = main data packet scheduling technology or the receiving end of the two systems 枓 scheduling technology. The description can be combined with the four (4) systems and methods described herein - a diagram of the wireless network environment. Figure 10 illustrates a device for facilitating dynamic scheduling of data packet transmission according to a plurality of aspects. The pattern of 115654.doc 1328949

[Main component symbol description] 100 Special or random wireless communication environment (system) 102 Access point 104, 106, 108 Access terminal 200 Path selection tree structure 300 Path selection tree structure 700 Access terminal 702 Receiver 704 Demodulation 706 Processor 708 Memory 710 Transmitter-based scheduler 712 Receiver-based scheduler 714 Modulator 716 Transmitter 718 Decision Module 800 System 802 Access Point 804 Take terminal 806 receive antenna 808 transmit antenna 810 receiver 812 demodulation 814 processor 115542.doc • 31 · 1328949

816 Memory 818 Scheduler 820 with the sender as the receiver Scheduler 822 with the receiver as the receiver 822 Modulator 824 Detector Module 900 Wireless Communication System 905 Access Point 910 Transmission (TX) Data Processor 915 Symbol Modulator 920 Transmitter Unit (TMTR) 925 Antenna 930 Terminal 935 Antenna 940 Receiver Unit (RCVR) 945 Symbol Demodulator 950 Processor 955 Receive (RX) Data Processor 960 Transmission (TX) Data processor 965 symbol modulator 970 transmitter unit 975 receiver unit 980 symbol demodulator 985 receive (RX) data processor 115542.doc -32- 1328949 990 processor 1000 device 1002 decision module 1004 row Cheng Module 115542.doc 33-

Claims (1)

1328949 Patent No. 095138841 Patent Application No. Patent Renewal (April, 1999) X. Application Patent Range: 1. A type of wireless network that uses 拙4呀τ to speak for transmission: In the method of encapsulation, the amount of downloading of a heart at a first-node is relative to that of one by using - the sender is in the middle of the main drain + potassium cylinder technology and the receiving end is king. At least one package, using the eve to sneak a message for the amount of data to be transferred to the brakes ~ download volume relative to the battle. Hai Juezhi - the function to choose. 2. If the requester's method 'into one, θ and the download amount is greater than the lean upload, then use the to send and the download amount is less than ^ 〇 (discounting technology; and if the battle j is equal to or equal to the upload amount, Scheduling technology. 〇 Receiver-based 3. For the method of claim 2, the profit factor is used to determine the step-by-step analysis including at least the schedule. The receiving end is a primary selection:: item, where the at least one scheduling factor includes at least one of a path selection =::! cluster, a traffic mix, and an interference associated with the neighboring node. Item: The method of item 4, wherein the traffic mixing includes a ratio of downloading data to uploading a poor material. τ,, upper 6·, such as requesting item 4$t, + u, , wherein the path is selected Topology involves 偟铨夕—^ The glaze chopsticks have been associated with the weight of one or more nodes transmitted. 7. If the scheduling of claim 1 is entrenched, further includes: using the receiver The main i, between the first node and a second node - to II5542-9904] 5 .di 二·w 二·w I " ** ' " ' I '----- t^年φ月矿日私t) 正Λ:土-求:授m 8. As requested in item 1 The method, the data sealing to be scheduled further comprises: permitting the first node to inform the point to be ready to send 2 and granting - the second node makes the second section. The main schedule is to receive the data packet Back to 9. As requested by the method of item 8, the channel is selected by: the selected point through the first node. The '4 packet is transmitted from the first node to the second section. 10. Request The party 8 of the item 8 informs the line. The first node uses a paging channel to enter a device that transmits (a) dynamic scheduling data packet, including: uploading on a ^ and determining at the - node The download amount is relative to a scheduler, which utilizes a scheduling technology based on the transmitting end and at least one of the receiving and discharging technologies, which are mainly based on the receiving end. To schedule a data packet for transmission, wherein the software/schedule technology is determined according to the download 篁 relative to the upload amount One of the functions of the Battle · Lennon is selected. 12. If the download amount is greater than the upload amount in the device of the request item, the decision module selects the one that is to be issued by ^, Zanda The scheduling technique; and if the download/download is smaller than the upload summer, the decision module selects the scheduling technology based on the receiving end. 13 · The device of claim i 2, wherein the judgment module of Y analyzes at least one schedule factor, so as to whether to use the schedule based on the sender or the receiver as the main 0 I15542-9904I5.doc throw: 4 ·· i 5月日修修(更) is replacing the device of claim 13 wherein the at least one scheduling factor comprises a path selection topology, a node cluster and at least adjacent to the first node - At least one of the interferences of the lang points, such as the device of claim 14, wherein the path selection topology includes weights associated with one or more nodes involved in the transmission. The device of claim 9, wherein the determining module uses the scheduling with the receiving end as the master, and performs a request_grant agreement between the first node and a second node. 17. If the device of claim 1 is ready for use, the second node is ready to use the packet and is ready to receive 18. The sender is the primary scheduling technology to receive a response to the data packet. The device of claim 17 further includes: a transmitter that transmits the data packet from the first node to the second node through a channel selected by the analysis module. 19. The device of claim 17, wherein the decision module utilizes a paging channel for notification. 20--A device for facilitating data packing for scheduling in a wireless communication environment, comprising: a download amount relative determining means at a node for determining a first-to-one upload amount; and a transmitting end Scheduling a scheduling component for at least one of the main scheduling technologies for use in the transmission of data by using one and one scheduling technology based on the receiving end. The scheduling technique is selected according to one of the functions of the download amount relative to the uploading battle. Π 5542-990415.doc 1 is called ....-- \ * ? * . '« · · 21.: Request item 2. The lending step includes: passing the information packet. Use equipment such as ° month item 21' further includes: analysis to small -u τ for analyzing the scheduling factor to determine whether to use the transmission-based or the terminal-based scheduling. Item 2: The apparatus, wherein the at least one scheduling factor comprises at least one of a path selection, a node cluster, and a correlation associated with a neighboring node to a + node. The device of 24.t = r3, wherein the path selection topology includes weights associated with one or more nodes of the /V and the transmitting wheel. a line-by-part agreement component for use with a receiving end to indicate a component, such as the device of claim 2, including Using a schedule based on the receiving end, a request-grant agreement is implemented between the nodes. 26. If the equipment of the request item 2,, the input ^, mouth, f, 1 丹, is used to refer to the information package for the one to be scheduled; and the receiving response component is used to connect the receiver node A response is received using the dispatcher-based schedule to receive the data packet. 27. The device of claim 26, wherein the transmitting component transmits the data packet from the transmitting end node to the receiving end node via a channel selected by the transmitting end node. 28. The device of claim 26, wherein the instructing means utilizes a paging channel to indicate that the data packet to be scheduled is ready. 29· - A computer readable medium comprising instructions for the transfer of the data packet of the communication-reducing environment towel, which, when executed, causes a machine to perform 115542-990415.doc W. 4. Year and month needles more)昝 昝 I 30. 31. 32. 33. 34. 35. The following actions are taken: Determining a use at a first node by using - with the sender as the primary & relative to the upload amount, and the main The scheduling technology is small - the scheduling technology and - the receiving end is a package, wherein the utilization row (four): to schedule - one of the functions of the determination of the data encapsulation amount for transmission is according to the The amount of download is selected relative to the upper ^ function. Such as the computer readable medium of claim 29, crying Xuan Xuan π further π further promote the machine. . Perform the following actions: pass the data packet. The computer readable medium and the physical order of claim 30 further cause the machine to perform the following actions: analyzing to the scheduling factor to determine whether to use the dispatcher-based schedule in the M protocol or the Receiver-based schedule: The computer-readable medium of claim 31, wherein the at least-schedule factor package 'four-topology' node cluster is associated with at least one node-independent interference of a neighboring sender node At least one. The computer readable medium of item 32, wherein the path selection topology comprises a weight associated with one or more nodes involved in the transmission. The computer readable medium of claim 29, wherein the instructions further cause the machine to perform the following action: using the scheduling protocol based on the receiving end, and implementing a request between the transmitting end node and a receiving end node - Grant the agreement. The computer readable medium of claim 29, wherein the instructions further cause the pirate to perform the following actions: informing a data packet to be scheduled; and receiving a receiving end node to prepare the scheduling protocol based on the transmitting end To receive 115542-990415.doc η f is: the response of the data packet ~ response. 3 6 · If the computer readable media of TE item 35 is spoken, the instructions execute the following 乂 乂 乂 乂 乂 乂 乂 乂 : : : : : : : : : : : : : : : : : : : Γ Γ Γ Γ Γ Γ Γ Γ The transmitting end node transmits to the receiving end node. The computer readable device of Bu Qiao 34 performs the following actions: through one. / Temple instructions further prompted the aircraft to indicate the package. , paging channel offer - about scheduling 115542-990415.doc