TWI328948B - Flow based fair scheduling in multi-hop wireless networks - Google Patents

Description

1328948 IX. INSTRUCTIONS: TECHNICAL FIELD OF THE INVENTION The following description relates to wireless communication and, more particularly, to scheduling communications in a multi-hop wireless network. [Prior Art] A wireless communication network can be used to transmit information regardless of where the user is located (e.g., internal or external) and whether the user is in motion or stationary. The wireless communication network can communicate between the mobile device and the base station or access point. The access point covers a geographic area or cell, and when the mobile device is used, the mobile device can move and move out of the geographic cell in the geographic cell. In order to achieve a virtually uninterrupted communication, the mobile device is allocated resources of the cell in which it enters and is relieved of the resources of the cell from which it has left. In a multi-hop topology, the communication transmission is transmitted to the base station by several hops instead of directly to the base station. A jump is referred to herein as a particular portion or segment of a communication path between a sender and a receiver, with another device acting as a relay point to effect the communication. In a cellular system, resource competition is usually based on each "community" and the fairness of resource sharing is handled one by one. In a multi-hop wireless network, resource competition can exist on a large number of nodes. Traditional methods (such as carrier sense multi-directional proximity media access control in 802.U ((Multiple Access Medium Access Control > CSMA MAC)) can be used to ensure that in the upcoming "jump" Fairness, but may not be able to ensure fairness in all the hops that the packet passes. To overcome the above and other deficiencies, it is necessary to have a kind of use in a multi-hop 113452.doc •6·1328948 network from the source node to The technique of achieving fair scheduling in all the material skipping paths of the destination node. BRIEF DESCRIPTION OF THE DRAWINGS [0007] A brief summary of the embodiments of the present invention is provided below to provide a basic understanding of certain aspects of the embodiments. The summary is not an extensive overview of the one or more embodiments, and is intended to identify the key or critical elements of the embodiments, and is not intended to limit the scope of the embodiments. One

The concept is to provide some of the concepts of the embodiments in the form of a Various aspects are illustrated in connection with a fair schedule based on traffic, in accordance with one or more embodiments and their corresponding disclosures. Fair scheduling based on traffic includes multi-hop deviation of rate control and multi-hop scheduling of power control. Control is provided regardless of the direction of the service (for example, from a terminal access point to an access point or a self-access point to an access terminal).

A method for providing data communication is provided, for example, in accordance with some embodiments. The method includes receiving, at a parent node, one of each of the 'beauty reservoirs associated with each child node a desired amount of delivery. The child node is communicatively coupled to the parent node. The method also includes determining, according to the expected throughput, a time for each child node to perform scheduling and determining according to the The scheduling time is used to determine whether the parent node is an obstacle. The method also includes determining a throughput for supporting each data collector if the parent node is an obstacle. According to some embodiments, a method is provided. A device for supporting data communication. The device may include a receiver, a scheduler, and a value adjuster, and the receiver 113452.doc can receive and connect each of the W-types to the mother. Each of the nodes of the node is associated with the data collector - configured to deliver according to the desired: central volume. The scheduler can be determined by "transportation - response time for each-sub-point And according to Whether the determined row is a barrier or not, the value adjuster can be used to support the throughput of each of the museum collectors. Providing a computer readable medium comprising instructions, 7 performing, when the device receives at the parent node a desired throughput of each data reservoir associated with each subsection 2 and delivering as desired The amount is determined to be a time for each child node to be scheduled. The material node is communicatively coupled to the parent node. The instructions further cause the device to determine whether the parent node is determined according to the determined scheduling time. A barrier is imposed and if the parent node is an obstacle, then 4 is used to support the throughput of each data collector. According to some embodiments, a processor is provided for supporting data communication. Configuring to receive a desired throughput of each of the data reservoirs associated with each of the child nodes at a parent node. The processor is further configured to determine a response to each of the desired throughputs One child node implementation row The child node is communicatively coupled to the parent node. The processor is further configured to determine whether the parent node is an obstacle based on the determined scheduling time and if the parent node is an obstacle, Determining a throughput for supporting each data store. According to some embodiments, an apparatus for supporting data communication is provided. The apparatus includes a means for receiving at a parent node associated with each child node 113452.doc The data storage device - the component of the desired delivery volume is determined by the component and one is used according to the component. The subnode is used for the execution of the scheduling by the sub-node. The method is coupled to the parent node. The device is also used to determine whether the parent node is used according to the schedule of the determined obstacles, and is used to determine if the parent node is an obstacle. A component that supports the throughput of each-data reservoir. The method embodiment provides a method for supporting data communication. The party includes the desired throughput of the data store f1" associated with each parent node at the root node. The parent node communicatively merges to the root point. The method further includes: determining, according to the desired delivery amount, a time division rate for scheduling each parent node, and performing scheduling according to the response to each parent node: The time fraction is used to determine a scheduling strategy. An apparatus for supporting data communication is provided in accordance with some embodiments. The apparatus includes a receiver that receives a desired throughput of each of the data banks associated with each of the parent nodes. The parent node is communicatively coupled to the root node. The device also includes a scheduler that determines a time fraction for scheduling each parent node based on the desired throughput. The scheduler also formulates a scheduling strategy based on the time rate at which each parent node is scheduled to be scheduled. In accordance with some embodiments, a computer readable medium containing instructions that, when executed, cause a device to receive a desired throughput of a data store associated with each parent node at a node. The parent node is communicatively coupled to the root node. The instructions further cause the device to determine, according to the desired throughput, a time division rate 113452.doc -9 - 1328948 for each parent node to be scheduled and according to the time (four) for scheduling each parent node to be ^ _ scheduling strategy. A processor for supporting data communication is provided in accordance with the embodiments. The processor is configured to receive a desired throughput of each of the data reservoirs associated with each of the parent nodes and determine a time division rate for each parent node to schedule based on the desired delivery amount The parent node is lightly coupled to the root node in a communication manner. The processor is further configured to determine a scheduling strategy based on the time division rate at which each parent node performs the scheduling. According to - some real customs, provide - equipment support (four) communication equipment. That. A spare package is a component that receives the desired throughput of each data store associated with each parent node. The apparatus also includes means for determining, based on the desired amount of delivery, a time division rate for each parent node to perform scheduling, and - for determining the time division rate for each parent node to implement the scheduling A component of a scheduling strategy. In accordance with some embodiments, a method for supporting data communication is provided. The method includes: at a parent node point, receiving a desired throughput amount of each data collector associated with each __ child node (four) and determining, according to the desired delivery amount, a relationship with each + node One of the #射 power and at least one of the received power. The child node is communicatively coupled to each parent node. The method advancement includes determining, based on the determined transmit power and the received power, whether the parent node is an obstacle and if the parent node is an obstacle, determining that one is used to support each data store The amount of transport of the collector. In accordance with some embodiments, an apparatus for supporting data communication is provided. The device includes a receiver, a calculator, and a value adjuster. The receiver 113452.doc is configured to receive a desired throughput for each of the material reservoirs associated with each sub-segment. The child node is communicatively coupled to the parent node. The calculator determines, based on the desired throughput, at least one of - transmit power and a received power associated with each of the child nodes. The calculator further determines whether the parent node is a barrier based on at least one of the determined transmit power and the received power. If the parent node is an obstacle, the value is selected to support the throughput of each data collector.

According to some embodiments, there is provided a computer readable medium comprising instructions that, when executed, cause a device to receive a data-gatherer associated with each child node at a parent node The amount of delivery is desired and the at least one of the transmit power and the power to be connected associated with each of the __child nodes is determined based on the desired transport 1 . The child node is communicatively coupled to each of the parent nodes to further cause the device to determine whether the parent node is an obstacle and if the parent node is based on the determined at least one of the transmit power and the received power. One obstacle is determined, one is used to support each data collection

The amount of delivery. In accordance with some embodiments, a processor for supporting data communication is provided. The processor is configured to receive a desired throughput of each of the data reservoirs associated with each of the child nodes and determine a transmit power and a received power associated with the parent and child nodes based on the desired amount of delivery At least one of them. The processor is further configured to determine whether a parent node is an obstacle and the right parent node is an obstacle based on the determined one of the transmit power and the received power, determining that one is used to support each data The amount of transport of the reservoir.

113452.doc • 11 - 1328948 provides an apparatus for supporting data communication in accordance with the embodiments. And a component for receiving a desired throughput of each data collector associated with each child node at the parent node and a component for determining A component of a transmit power and at least one of the received power associated with the node. The child node is communicatively coupled to each parent node. The device further includes: determining, according to the determined transmission power, at least one of the received powers, whether the typhoon component and the component (4) - the obstacle is determined to be used to support each The component of the data storage capacity of the reservoir. In accordance with some embodiments, a method of supporting data communication is provided. The method includes receiving, at a node, a desired throughput of each of the data reservoirs associated with each of the parent nodes. The parent node is communicatively coupled to the root node. The method further comprises: determining at least one of a transmit power and a receive (four) associated with each parent node and determining _ scheduling based on the determined at least one of the transmit power and the received power Strategy. In accordance with some embodiments, an apparatus for supporting data communication is provided. The device includes a - receiver and - a computer. The receiver receives a desired throughput for each data store associated with each parent node. The parent node is communicatively coupled to a node. The calculator determines at least one of transmit power and received power associated with each of the master nodes and formulates a scheduling policy based on at least one of the determined transmit power and received power. According to some embodiments, a computer readable medium containing instructions is provided that, when executed, cause a device to receive with each parent node at a node 113452.doc •12·

1328948 points associated with each - the data collector - the expected delivery volume. The parent node is communicatively coupled to the root node. The instructions further cause the device to determine at least one of a transmit power and a receive power associated with each parent node and to arbitrate a schedule based on the determined one of the transmit power and the receive power Strategy. In accordance with some embodiments, a processor for supporting data communication is provided that is configured to receive each asset associated with each parent node

A desired throughput of the reservoir. The parent node is communicatively coupled to a node. The processor is further configured to determine at least one of associated transmit power and receive power and to determine at least one of the transmit power and the pull rate - scheduling strategy 0, according to some embodiments, Provide a device that supports data communication. The apparatus includes - means for the desired throughput of each - data reservoir associated with each parent node at the -root node. The parent node is communicatively coupled to the root node. The apparatus further includes a means for determining at least one of a transmit power and a received power associated with each of the parent nodes and a means for determining at least one of the transmit power and the received power based on the determined To determine the components of a scheduling strategy. In order to achieve the above and related ends, one or more embodiments include the features that are fully described hereinafter and are particularly pointed out in the scope of the claims. The following description and the annexed drawings are a singer of the exemplifications of the embodiments of the invention. Further advantages and novel features of the present invention will become apparent from the following description in conjunction with the accompanying <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> </ RTI> </ RTI> </ RTI> </ RTI> </ RTI> and the disclosed embodiments are intended to encompass all such aspects and their equivalents. Embodiments Various embodiments of the present invention will now be described with reference to the drawings. In the following, for the convenience of explanation, a large number of specific details are stated in order to achieve a thorough understanding of one or more columns. However, it may be apparent that the (these) embodiments may be implemented without the use of such. In other instances, the public broadcasts are well known in the form of block diagrams. Structures and devices are provided to facilitate the description of such embodiments. The term &quot;component&quot;, system, and like terms used in this application are intended to mean a computer-related entity that can be either a hard body, a _, a combination of hardware and software, a software, or an implementation. Software. For example, a component can be, but is not limited to, a method of processing a hard processor, a processor, an object, an executable, a thread of execution, a program, and/or a computer. For example, an application that runs on a computing device can be a component. One or more components may reside in a method and/or an execution line, and the components may be limited to one computer and/or distributed to two or more Thunderbolt computers. between. In addition, the components can be executed on a variety of computer readable media having various data structures stored thereon. These components can communicate by local and/or remotely, for example, according to (4) having one or a household packet (4), for example, from a local system, distributed Additional-component interactions in the system, and/or by means of signals across the network (eg, the Internet) and other components of the components). 113452.doc • 14- 1328948 Further, various embodiments are described herein in connection with user devices. The user device may also be referred to as a system, a subscriber unit, a subscriber station, a mobile station, a mobile device, a remote station access point, a base station, a remote terminal, and an access terminal. , mobile phone, host, user terminal, user agent, data collector or user device. The user device can be a cellular phone, a cordless phone, a sip phone, a wireless local loop (WLL) station, a personal digital assistant (pDA), a handheld device with wireless connectivity, or other connection to a Processing device for wireless data machines. In addition, the various aspects or features described herein can be constructed as a method, apparatus, or article of manufacture using standard stylized and/or engineering techniques. The art article as used herein is intended to encompass a computer program accessible from any computer-readable device, carrier, or media. For example, a computer-readable medium can include, but is not limited to, a magnetic storage device (eg, a hard disk, Soft disks, magnetic strips...), optical discs (such as compact discs (CDs), digital versatile discs (DVD)...), smart cards, and flash memory devices (such as cards, sticks, and pocket-type secure disks). Various embodiments are provided below by a system that can include a number of stages, modules, and the like. It should be understood and appreciated that different systems may include other components, modules, etc., and/or may not include all of the components, modules, etc. discussed in connection with the drawings. A combination of one of these methods can also be used. Referring now to the drawings, Figure 1 is a schematic illustration of a multi-hop communication system 100 in accordance with various embodiments disclosed herein. The circle item 1〇2_116 represents the access point node that is connected (for example, wirelessly) into a tree configuration, and the block item 113452.doc -15. U28948 is used for both. In addition, for the purpose of illustration rules. In the eg_ process, follow, an equal service level (E, scheduled delivery, unless you can provide the same high-to-multiple flow or any other traffic volume for all flows) For other fairness measures, the example "outside of 7^" can also be used at the following level and by rate fairness. * The following is a symbol for the sender-based schedule as follows: It will be used from the description of 俜#Ap, It is shared with the access-level candlestick (data collector) associated with access point 0. &quot; and AA takes the sharing of the terminal device associated with the terminal device (the fund storage ι§) Transfer 詈 ^ ^ The system is from a node (access point or access terminal) / the mother node to the node "·". The point is the time transfer rate (access point or access terminal).卽 , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , Terminals 204, 206, 208, 210, 212, 214, 216, 218 and 220» access terminal 204_220 are data collectors. Point 2〇2 is a data source. Nodes 222, 224, 226, 228 and 230 are leaf nodes that communicate directly with access terminals 204-220. However, it should be understood that the access terminal can also be associated with node 232. Communication, the definition of a leaf node as used herein, is that the leaf node only communicates with the access terminal on the forward link. For example, on the forward link, node 222 sends data to the access terminal without Another access point sends the data. Thus, node 232 is considered to be the parent node of the directional nodes 222, 224, and 226 (child nodes of node 232). A subtree of node 232 is illustrated at 236, which is below node 232. U3452.doc -19· £ 1328948 There is a point and terminal. Assuming that node 232 is a node and derives the tree, each element below it is treated as a subtree. Similarly, the child of node 234 is displayed everywhere. The figure illustrates a wireless communication system using a fair scheduling technique. The system 301 includes one or more access terminals 302 that are smashed by one or more leaf nodes 306 ( For example, directly with the access terminal 3 〇 2 Point) and one or more parent nodes 3〇8 are connected to a node 3〇4 (for example, by communication). The access terminal 3 〇2 can be a &quot;bee material reservoir or a The source of the data, depending on the traffic flow, system 300 can be coupled in a tree configuration similar to that shown and described with respect to the previous figures. It should be understood that although the illustrated communication path includes A second jump, however, in some embodiments, the communication path may also include more or fewer hops between the access terminal 302 and the root node 〇4. By way of example, the access terminal 302 can communicate directly with the root node 304 or the access terminal 3 〇 2 or the access terminal 302 can communicate with the root node 304 via a single leaf node 〇6. The leaf point 306 may include a transmitter/receiver 310 that may be configured to receive data from and to its child nodes (e.g., access terminal 302) and/or its parent node 308. Its child nodes and/or its parent node 3〇8 send data. For rate controlled multi-hop scheduling, the information may include the number of access terminals 302 below leaf node 306 and the amount of throughput available for each access terminal 302, or the product of the information. For multi-hop scheduling of power control, this information may include the access power below the leaf node 306 and the transmit power required by the terminal 302. 113452.doc • 20· 1328948 The leaf node 306 can also include a delivery amount determination module 312 that can be configured to determine that the leaf node 306 can provide access to the access terminal 302 below it The amount of delivery. For example, the throughput determination module 312 can formulate or determine a maintainable &quot;maximum minimum&quot; throughput for each access terminal 302. Among them, the number of access terminals, the &quot;maximum and minimum&quot; can be expressed as: U =

Each access terminal 302 should be represented by the corresponding time fraction of the servo /, = Λ Λ Λ

For multi-hop scheduling determination of power control, leaf node 306 can include a transmit power calculator 3丨4 configured to calculate the transmit power required by the access terminal below it. As shown, the receiver can calculate the transmit power associated with each child node based on a determined throughput. However, in some embodiments, the receiver determines 2 the received power associated with each of the child nodes based on a determined amount of delivery. The receiver can reverse the transmitter (e.g., by increasing/decreasing the command) to cause the transmitter to change its transmit power. Thereby, the desired received power is obtained. It should be noted that pure power is the transmission power multiplied by: channel gain. The carrier-to-interference (C/I) ratio is the ratio of the amplitude of the RF carrier to the amplitude of the interference. The C/I ratio measured at the receiver is a function of the received power. Therefore, the receiver can control its C/I 113452.doc • 21 - 1328948 ratio by controlling its received power. Information from the delivery amount determination module 312 (for scheduling of rate control) and/or the transmit power calculator 314 (for scheduling of power control) is transmitted to the parent node, or, in some embodiments, transmitted To the root node 304. A fair schedule based on traffic is calculated for each node up (or up) along the tree and repeated until the root node 304 is reached. Further details on fair routing based on traffic are provided below. The leaf node 306 can also include a value adjuster 316 that can be configured to be based on a flow-based schedule determined by each __ node along the tree-up and whether the any-ascending node is within the system The obstacle is to adjust the number of examples. 5, the total amount of delivery that the right leaf node 306 can deliver to its child nodes (eg, the access terminal 302) cannot be made by its parent node (eg, the parent node) and/or root. The node 304 is maintained to modify the schedule time fraction. In some embodiments, each node may desire to know the maintainable throughput calculated for each of the access terminals below its subtree so that the node can recalculate its time fraction. For example, consider the forward link from the root node 3〇4 to the access terminal 3〇2. Leaf node 306 can calculate the amount of traffic to its end of service (including access terminal 302), but parent node 3〇8 or root node 3〇4 may determine that it can only support a lower value. Node 3() 6 may wish to know the information and adjust its rate accordingly, so that root node 3〇4 or parent node 3〇8 can transmit the information to node 3G6. In some embodiments, the node 确 can implicitly determine the information by observing the slower rate at which the parent node (e.g., node 3G8) picks up the data. Therefore, in these embodiments, the root node is deleted

113452.doc • 22· The parent point 308 does not need to transmit the delivery amount information to the node 306. 'The rate can be modified based on other factors to provide an on-board fair schedule throughout the system. If an ascending node (eg, parent node 〇8 gP points 304) determines that there is a violation of peak power constraints and/or heat, a rise-over-thermal constraint, the value adjuster 316 may also adjust The target delivery amount for each access terminal 302 is used, and thereby the desired transmit power of the machine is known. In this example, the data traffic is from the access terminal to the root node. A lieutenant node (such as a parent node) may need to know if there is an upstream bottleneck and correspondingly slow down the amount of traffic it is receiving from its child nodes. The slowing of the delivery volume is translated into a previously calculated or found transmission. Or receive power adjustment. Leaf node 306 can also be associated with a lookup table 318. The access terminal 3〇2 can provide feedback channel quality information (e.g., signal to interference ratio) to the leaf node 306. The channel quality information can be mapped by leaf node 306 to the rate contained in lookup table 318. The rate that is mapped is the rate that it can provide to its child nodes. This rate can be stored in lookup table 3 18 for later retrieval. The transmitter, receiver or one may include, but is not limited to, a communication interface component such as a serial port, a universal serial bus (USB), a parallel port, and a wired and/or empty interposer component for performing, for example, The following communication protocols/standards. Worldwide Interoperability Standards for Microwave Access (WiMAX), such as infrared protocols such as the Infrared Data Association (IrDA), short-range wireless protocols/technologies, Bluetooth® technology, ZigBee® protocols, ultra-wideband (UWB) protocols , using radio frequency (HomeRF), shared wireless access protocol (SWAp), such as wireless Ethernet compatibility alliance (WECA) and other broadband technologies, wireless fidelity 113452.doc -23- ψ-» 1328948 alliance ( Wi-Fi Alliance), 802.11 network technology, public switched telephone network, public multi-mode communication network technology such as the Internet, dedicated wireless communication network, land mobile radio network, code division multi-directional proximity (CDMA) , Wideband Coded Multi-Directional Near-Connect (WCDMA), Universal Mobile Telecommunications System (UMTS), Advanced Mobile Phone Service (AMPS), Time Division Multi-Directional (TDMA), Frequency Division Multi-Direction (FDMA), Orthogonal Frequency Division Approaching (OFDMA), Global System for Mobile Communications (GSM), Single Carrier (IX) Radio Transmission Technology (RTT), Evolutionary Data (EV-DO), General Packet Radio Service (GPRS), Enhanced Data GSM Environment (EDGE) , High Speed Downlink Packet Access (HSPDA), analog and digital satellite systems, and any other technology/agreement that can be used in at least one of a wireless communication network and a data communication network. Referring now to Figure 4, another embodiment of a system 400 for providing a fair schedule based on traffic is illustrated. System 400 is similar to the system described in connection with the previous figures. System 400 includes one or more access terminals 402 that can communicate with a node 404. The communication between the access terminal 402 and the root node 404 can be implemented using a multi-hop topology in which the communication system is transmitted by various access points or hops and can be configured in a tree configuration. . As shown, in the reverse link, communications within system 400 can be communicated via three hops (from a secondary access terminal to a leaf node 406, then to a parent node 408, and then to a node 404). In forward link communication, communication will begin at root node 404 and the designated destination system access terminal 402. System 400 can be configured to provide a flow-based fairness 113452.doc -24 - 1328948 in all traffic or paths between root node 404 and one or more access terminals 402. It should be appreciated that system 400 can include more than one access terminal 々ο, leaf node 406' and/or parent node 408, and can, for example, be in a configuration similar to that shown in FIG. According to some embodiments, root node 4〇4 communicates directly with access terminal 402. Although FIG. 4 is described with reference to parent node 408, it is equally applicable to root node 404. In other words, root node 4〇4 includes elements, functions, or both similar to those described below with reference to parent node 408. Furthermore, in the following description 'some elements are suitable for rate control and some elements are for power control' - the parent node 408 may comprise a transmitter/receiver 41 〇, the transmitter/receiver 41 〇 configurable The number of access terminals 402 under the leaf nodes 406 and the throughput rate that the leaf nodes 4〇6 can provide to the access terminals 402 below the leaf nodes are received from their child nodes (e.g., leaf nodes 4〇6). (or the number of accesses = the product of the number of machines and the rate of delivery). The transmitter/receiver 4 〇 can also be configured to receive from its child nodes (e.g., leaf nodes 4 〇 6 below it) the calculated transmit power required by the access terminal 402 below each leaf node. The parent node 408 includes a scheduler 412 and a calculator 414 that can individually determine whether the parent node 4〇8 is an obstacle. At the rate (four) multi-hop schedule: the inter-schedule 412 receives the number of sub-nodes and the amount of delivery information for each leaf node strip below the parent node 4〇8. The time fraction required to be scheduled to meet each leaf node side requirement is determined and the sum of all time fractions of all leaf nodes 406 below the parent node is determined. If the sum of the scores is less than or equal to the value of the parent node, it is not the obstacle 2, and the amount of the parent node is the number of the lower node 4〇6: 曰'^输 U3452.doc -25- Sending information to Below the tree - ascending nodes (such as the root node tear). It can be propagated up until the information is received by the root node 4〇4. . If the sum of all right time divisions is greater than i, then the parent node is thorough—the obstacle and can determine the best shared throughput that it can support for its child nodes. Such a determination may include the lowest amount of traffic required to identify the data store of that child node (e.g., leaf node 4〇6) (e.g., access terminal 4G2). Associate all child nodes of the lowest delivery volume and (by using the lowest delivery value) calculate the time division of the point: the point to determine whether the sum is less than or equal to i. If the transmission is still greater than 1 ', the delivery amount is adjusted downward by the value adjuster 416 until the sum of the delivery turns is less than or equal to i. If the sum is less than i, then the - maximum and minimum fairness concept (which will be described in further detail below) can be used to provide commission capacity for their data storage (four) request - higher throughput sub-nodes. Thus, the value adjuster 416 can selectively adjust the determined time division rate for scheduling the at least one child node according to the requirements of each data collector. The parent node 408 can be associated with a lookup table 418, which can be stored in the parent node 4G8 or can be accessed by the parent node. The lookup table 418 can be configured to provide the parent node 4 〇 8 by mapping the throughput to the offline traffic ratio - values that can be assigned to its child nodes and can be stored in the lookup table 41 8 . For power control scheduling, the calculator 414 can be configured to determine if the transmit power requested by each of the sub-nodes satisfies a C/I&amp; This determination can be made in the number of child nodes and the amount of traffic to each child node. According to one 113452.doc

• 26 - 1328948 In an embodiment, such a determination can be performed by obtaining a threshold and mapping the value to a desired C/Ι value. The c/丨 value can be stored, for example, in lookup table 418 and can be found by determining the delivery volume location. Once the C/Ι value is determined, the power control problem can be solved to determine the transmit (or receive) power that will be able to obtain the C/Ι value.

According to some embodiments, information about the available clear space for reaching peak transmit power from all child nodes can be obtained periodically. There are two constraints, the maximum transmit power of the child nodes and the parent node. The ratio of the total received power of the thermal noise power to normalization - which is called the amount of thermal noise increment (ROT). The peak power limit is associated with the transmit power and is caused by the child node, which is the data source (e.g., transmitter) in the reverse link. The ROT level or constraint is then dependent on the receiver or parent node and is associated with a total received power. The R0T can be used to keep the received power within the allowable dynamic range of the receiver and to achieve overall stability of the power control loops in all cells. If neither the threshold nor the peak power limit is reached, the material point can automatically allocate the reverse link capacity according to the needs of the parent node. And if the Xie's limit and/or if the material value power limit is met, the parent node 408 may request each of the following _ via the transmitter/receiver 4U): the point 406 is one by &quot;maximum The minimum ·, fair way to calculate the rate 4 to reduce its rate. This calculation can be performed in an iterative manner. For example, the rate is reduced in several steps or increments until the -to-heart": the fair and maintainable rounds of the child nodes. For example; - the point has two child nodes and where _ There are five data sources (i Π 3452.ά〇, -27- access terminal) and the other one can request two data sources for each sub-section (four) face eight, then the parent node can maintain the delivery volume... The rate is low until a ratio of 5:2 is initially requested: delivery: the excess capacity is scheduled during the collection: the scheduling of the schedule 4 power control schedule determines the straight point 406 to determine and Climbing along the tree, the Dagen point 404 is positive. The root node 404 can determine or calculate the maintainable throughput of the data storage device (access terminal machine) in the tree. 404 determines the final delivery amount value and adjusts the respective scheduling time division according to the final threshold from the root node. The time range in which the equalization rate is satisfied may depend on the rate of change of the particular application and channel. According to some embodiments, if the (the) nodes are unable to obtain the same transport to their parent nodes, the nodes may reduce the total throughput received by each of the sub-nodes by the fraction. In some implementations, the parent node may require one or more child nodes to slow down. The method shown and described herein can also be used to implement scheduling, in which each time a problem of one power (four) is solved, there is a subset of the child nodes to transmit to the mother node. This can be included when solving the power control equation. They are actually implemented by the child nodes of the transmission. For example, a reasonable scheduling strategy can be used to enable the parent node to make the best use of the minimum subset of reverse link capacity (eg, allowed ROT) under packet delay constraints and to change the row 113452.doc in time. -28- 1328948 Cheng Jiji. In addition or alternatively, flow control can be used as a mechanism to maintain fairness. Assuming that the phase level is achieved according to traffic fairness, then the transmitter can transmit on all of its child nodes' traffic - equal speed 2 sub-points can use a certain metric (for example, an average queue size for transmitting data to the next hop) ) sends a power control signal to the transmitter. Flow control can be an on/off mechanism or a decrease or increase rate = number. For example, queue A can be extrapolated to calculate - move the flat value and use a first threshold to slow down the rate while using the second threshold to cut off traffic. The same threshold or a different threshold can be used to switch the flow on and/or increase the flow rate. In view of the exemplary systems shown and described above, a method constructed in accordance with the disclosed subject matter will be better appreciated with reference to the flowcharts illustrated in Figures 5-8. Although the methods are shown and described in the form of a series of blocks for clarity of the description, it should be understood and understood that the claimed subject matter is not limited by the number or order of the blocks. The blocks may appear in an order different from that shown and described herein and/or concurrently with other blocks. Moreover, not all illustrated blocks are required to implement the methods described below. It should be understood that the functions associated with such blocks may be performed by software, hardware, a combination thereof, or by any other suitable means such as devices, systems, processes and components. In addition, it should be further appreciated that the methods disclosed below and throughout the specification can be stored on an article to facilitate transfer or transfer of such methods to various devices. For example, those skilled in the art will understand and appreciate that a method can also be represented as a series of interrelated states or events, such as state diagrams. Figure 5 shows a flow chart of a method 500 for supporting the communication 2, for example, via a multi-hop schedule of rate control, in which each transmitter transmits at full power I while controlling it to each of its The time at which the node implements the launch is divided. The main problem is that the minimum flow rate (10) that can be maintained within the tree is increased. It is assumed that the instantaneous rate ship correlation of each node in the tree is fixed. "Outside" assumes that each parent node is aware of the instantaneous speed to its per-child nodes, for example S, which can be achieved by implementing periodic rate feedback from the child nodes. The time division rate at which the mother-access point transmits to each of its child nodes is controlled. The method 500 begins at 502, where a particular node (eg, a parent node, a root node = receives its child nodes (which is communicatively coupled to the parent node (or root node)): a throughput specification (eg, requiring the information to be self-sub- The node request to get or stamp the point can automatically send the information. The throughput specification can be the desired amount of delivery per data collector associated with each child node. In the state: 'determine - for pair Each sub-band implements a time fraction of the schedule so that the parent-child node can have its specified throughput. This determination can be repeated for each point until the root node. Such determination can include self-providing a child. The node y receives the total number of child nodes 纥 and the shared transport volume %. The time division rate for each child node that should be scheduled to meet its specified delivery amount is expressed as: Λ = In some embodiments, the calculation of the 'delivery amount may not Consider the constraints in the network H3452.doc 1328948 conditions, including the constraints of any parent node. The leaf nodes may provide a similar throughput for each node. However, according to some embodiments, one or more child nodes may provide One Different throughputs. Thus, the amount of rotation can be equally divided or the amount of delivery can be adjusted according to, for example, a quality of service (Q〇s) measure. In some embodiments, one can be utilized as described in more detail below. The concept of minimum fairness is used to calculate the amount of each child node.a sent in 506, the node determines whether it is a bottleneck or obstacle in the tree. This can be based, for example, on the equal service level of its child nodes and its child nodes. It needs to be achieved by the time division rate of the schedule. Such a decision may include determining the allocation, and whether the total time division rate of its child nodes is less than or equal to 1 or the number one, which can be expressed as: Σ/y^l Determining that the total time fraction is less than or equal to the number! (&quot;Yes&quot;), then the node that implements the equation is not an obstacle and passes the vector of its child nodes and the G value up to 5〇8 Its parent node. It should be noted that, according to some embodiments, it may be very important to transfer the value to the product of the source to the parent node using a non-EGoS throughput allocation to the access terminal. Knot If the total time division rate is large (··No &quot;), then the node is an obstacle and in the case, for example, a maximum and minimum fairness concept as described in detail with reference to FIG. 6 is used to determine that the node can be in the tree. The maximum shared throughput supported by all subnodes below the node. For each ascending section 113452.dOC.31- ( ft 1328948 points repeat this determination as to whether the node is an obstacle until the root node. After the delivery amount of each child node, the information is sent to the parent node in 5. 8. If the node root node of the delivery amount is determined for each child node, the information is not sent to the parent node at 508. Method 5 (10) can be repeated for the down-sequence node to calculate the scheduling time of its child nodes. It should be understood that the job can be recursive so that any number of ascending nodes can calculate the schedule time of its child nodes and determine whether it is a barrier.

Obsessed until the root node (wired node or data source) is reached. In 51〇, the root node can determine the I scheduling strategy based on the calculated time division rate. The scheduling policy can be implemented without notifying the child node of the policy, or can send scheduling policy information to its child nodes according to the embodiment (4) points. Further &apos;should be understood&apos; According to some embodiments, automatic and/or dynamic calculations of scheduling time may be employed. Referring now to Figure 6, there is shown a flow chart of a method for determining the amount of delivery based on a concept of maximum and minimum fairness. If a node is determined to be an obstacle in the network' then it cannot satisfy the specified delivery volume of its child nodes and therefore should determine the optimal delivery amount that its child node can provide, the optimal delivery volume is available - maximum The concept of minimum impartiality is determined. In 602, a considered set of node assignments is initialized to all child nodes under the node containing the = analysis (e.g., the barrier node). This includes stylizing the allocation set equal to {from}. In 6〇4, the data collector under the node specifies or needs the lowest input. When (4) is at most ~ equal to the minimum %, you can leave the sub-point. In other words, all sub-sections under the obstacle node 113452.doc -32- 1328948 have sub-nodes that request the lowest delivery value. The information can be stored, recorded, and guaranteed (4) equal to - processing ^, memory or storage medium. 'The information should be in the captureable format β in 606, and the lowest data is temporarily assigned to the remaining data reservoirs below the obstacle node. The magnitude (determined at 604) or associated with the lowest throughput value' and calculates the time fraction based on all data reservoirs having the same minimum delivery value. The equation can be expressed as .fj Μη R; at 608, 'determine that the sum of the fractions of the material is less than the value—or if it is less than 1 Γ is &quot;), then it represents all the information below the obstacle node. After the reservoir assigns the lowest transport value identified, there is still the remaining spare capacity that can be allocated between other data reservoirs with higher throughput requirements. In 610, the lowest delivery is specified for their data collectors:!: (as determined in 604) the child node is assigned the lowest amount of delivery identified and the child node is no longer considered. The method 600 can return to 604' to analyze the remaining child nodes considered in 604 to determine that the next required data storage capacity of the data collector is higher than the identified minimum delivery amount or its data storage device-lowest rotation amount The child of the value. The same method can be continued for other sub-nodes in a similar manner until the judgment result in 608 is ·, ν〇η, and the sum of the fractions is greater than 1. If it is determined in 608 that the sum of the time-rates is greater than 1 (&quot;no&quot;), it indicates that it cannot support all the child nodes below the obstacle node. The method continues to push in 612#, ,, ^ ^ In 2, determine the remaining value of 113452.doc • 33- art. For the remaining child nodes, this should be determined in a way that the sum of the time fractions is not greater than the 丨 or value. The a^J&quot; should be in the following format... U =

The time fraction for scheduling each sub-node in order to obtain a maintainable wheel derivative at 612 can be expressed as . The vector or the barrier

The node is passed to its parent node. Newly, the value of Μ is transmitted to the parent node only when there is a change in the value of the dowry.

For example, s, a parent node has two child nodes (child node 1 and child node „). The food item P point 1 has five access terminals with a specified number of rotations, and the child node 2 has three specified transmissions. An access terminal with a quantity of 2. It is assumed that the sum of the time points of the parent node cannot be determined according to the specified value is less than or equal to 1 male point f. First, all eight access terminals are assigned a delivery amount equal to 丄 ( It is the minimum throughput and determines if it can support this value. If it can support this value for all eight access terminals, it is the access terminal under child node i (for example, receiving under child node i) The data storage device for the specified delivery amount) "with a delivery value of 1". Next, the parent node determines the value it can provide to the access terminal below node 2 (between #2). In this manner, the access terminal below node 2 does not get the specified delivery value. However, 1 will get the best throughput available using the maximum and minimum fairness. For further illustration, reference is again made to Figure 2 to provide the following monthly specifics, which will focus on subtree 236 of node 232. All the data reservoirs in the subtree 23 6 2〇4 2. 6 2〇8, 21〇, 113452.doc

• 34- 1328948 212 and 214, data reservoirs 204 and 2〇6 specify the minimum throughput. For the sake of simplicity, it is assumed that the data reservoirs below a common leaf node have the same throughput. Each node 222, 224, and 226 transmits its required throughput to node 232, which then calculates the time fraction for which each node 222, 224, 226 is scheduled to meet these requirements. If the value of the sum of the fractions is greater than the value 1, node 232 determines if it can support the minimum throughput for all of the data reservoirs 204-214, i.e., the throughput of data collectors 2〇4214. If the sum of the fractions is less than the value 1, it is the necessary amount of delivery for the data collectors 2〇4 and 206, determines the time division rate for the schedule of the node 222, and continues to determine whether it can be implemented for the nodes 224 and 226. Better assignment. To this end, it selects a smaller data reservoir delivery volume from 208, 210, 212, and 214. Assuming that the required delivery volume of 208 is less than 21 〇, 212, or 214, node 232 will attempt to assign a throughput of 2 〇 8 for all remaining data reservoirs (2〇8, 21〇, mouth, and 句). If, after the assignment, the node still has the excess valley I', it assigns the remaining capacity to 21〇, 212, and 214. If there is no excess capacity, then node 232 is the data collector 2〇8, 21 〇, 212, and 214 find a common delivery amount such that the sum of their time divisions is a value of 1. The weight can be weighted with the user (eg, data collector) by determining the maintainable throughput to the child node. Associated and achieve unequal target delivery in the tree: !: For example, a node has two child nodes with % and 1^2 data collectors at a rate of heart and ruler 2, and the parent node wishes to The data collector on child node 1 provides more than a multiple of the data collector on child node 2. This can be solved by solving /1=_%, /2=from 2^ and /1+/2 A similar method can be used for the power control case described below. 113452.doc • 35· 1328948 h shows a type, for example via A flow chart of a method 700 of rate control to support data communication. In the following detailed description for illustrative purposes, the reverse link will be described and all child nodes should be assumed to be simultaneously implemented to their parent nodes. Transmission and power control by the parent node. There are two constraints that should be considered, the ratio of the maximum transmission power of the subsystem and the total received power at the parent node that is normalized by the thermal noise power - a system The amount of thermal noise increment. The peak power limit or constraint is associated with the child node, which is the source of the data on the reverse link (eg, the transmitter). The ROT level or constraint depends on or receives The machine or parent node is associated and associated with the total received power. R〇T is a well-known measure of CDMA systems and is used to help ensure that the received power is within the dynamic range allowed by the receiver and is used in The overall stability of the power control loop is achieved in all cells. Before the method 700 is described in detail, the basic power control problem will be proposed and solved. The channel gain is expressed as "[WA], the transmission power is shame [A decay...N, other cell interference power is /oc and the thermal noise power is # node. It should be understood that although the thermal noise power can be used for a long time) The segment remains fairly constant' however, /oc can vary over a short period of time. This faster change can occur because users in other cells may be modifying their power substantially simultaneously. Power control problems and their solutions are illustrated herein in terms of a linear system of equations, however, in some embodiments, there is a separate and independent power control loop for each transmitter. ROT constraints attempt to ensure that the loops have a system range The stability and the loops can converge to a solution that is substantially similar to the analytical solution described in 113452.doc • 36· 1328948. Thus, power control other than those shown and described herein can also be utilized. If a self-rate to target carrier-to-interference ratio (c/i) mapping function is known at each node, the parent node can calculate the required rate given a requested rate from a child node. ^^ ratio, which is expressed as 卜...μ. In a CDMA system, for example, this can be achieved by means of an &quot;external loop&quot; power control that raises or lowers the C/I target value based on frame/bit error rate performance. The goal is to calculate the power [A decay...仏] so that each user gets their target C/I value while satisfying the peak power and R〇T constraints. Each solution can be obtained by solving the following equation:

Η p = (J〇c + Ν)γ where -Κϊχ ...-Kh~ H= K ... • . . . . -\Υκ -V* • · ... hK Constraints are as follows: °&lt;Pj^P^ ^J (peak power constraint condition) h_p + Ioc + N^r (R〇T constraint condition) The power control equation can be solved analytically to obtain the following power values

Where ξ -^+1 J yj 113452.doc •37- 1328948 If the calculated power value violates one or both of the two constraints, the rate requested by the child node cannot be maintained or equivalently cannot be maintained. Request = c/m. In this case, the material point can be broken for all child nodes - the lower rate of the group. The maintainable rate of each sub-node can be determined to achieve maximum and minimum fairness per flow, as will be explained below with reference to (d). / Referring to Figure 7, in 702, - a particular node (e.g., parent node, root node) receives - the amount of traffic specified by its child nodes (the child nodes are communicatively interfaced to the parent node (or root node)) . The received throughput may be the desired throughput of each data reservoir associated with each child node. In '704' the field determines a transmit power and a received power associated with each child node based on the expected throughput information received. Such determination may include calculating the maintainable throughput by solving the power control problems previously described. It is assumed that the node has recently measured other cell interference power and thermal noise power and that the amount changes relatively slowly over time. The total required rate '%, which can be used in conjunction with the rate, can be used to calculate the total required rate '% of each sub-node that should be available for each sub-node from each sub-node · and κ. The C/Ι mapping function is used to determine this value. At 706, it is determined if the node is an obstacle. Such a decision can consider whether the constraint is violated. This can be determined by solving power control problems and evaluating peak power constraints and ROT constraints. If the node is not an obstacle (eg, does not violate the constraints) (&quot;no&quot;), then method 7 continues, at 708, the vector (or product) of the slave is passed up to the parent node. And if the constraint is violated (&quot;is&quot;), the node is considered a barrier 113452.doc -38 - 1328948 and the method 700 continues, re-determining the power of each child node in 71〇 The maintainable throughput of each child node is found using, for example, the concept of maximum and minimum fairness as will be described below with reference to Figure s. At 704, the noise is sent to the parent node. The parent node (which can be a root node) can determine a scheduling policy based on at least one of the selected transmit power and received power. In some embodiments, the root node communicates scheduling policy information to its subsections. Figure 8 shows a flow chart of a method for finding an ugly throughput for a subnode below a barrier node. The method _ starts at 8 〇 2, and in the 8 〇 2, the considered - node (four) # ( (4) is transformed into all the child nodes under the hindering node. In the 8G4 towel, identify the transfer amount required. The lowest child node among the remaining child nodes considered and can record its value. This Z and the balling of the 1 set are equal to the inclusion of all the child nodes and will be defined equal to min £ /; and the mans are defined as equal to the number of the ^ can be recorded and stored in a permissible format , keep, etc. β can solve this power control problem in _, assuming that all data collectors in the subtree are all referred to |& the lowest throughput value (determined at 8). In 808, it is determined whether any of the child nodes violate the r〇t constraint power constraint or both. If the constraint is violated (&quot;is&quot;), the minimum data collector delivery cannot be maintained, and the method calculates the maximum amount of data to the remaining data collectors at 81〇 relay=^ in 81〇 The minimum dimension is ^^ to satisfy the constraint. This may involve (iv) solving the beam condition equation described above and selecting the smaller of the two values. The two constraints are not reduced in the user's delivery volume (assuming that the mapping of H3452.doc -39 - 1328948 c/i to rate is not reduced, it can help to ensure feasibility. Find the comparison condition and the parent node R0T constraint condition right = = = : Work: Constraint if the _ in the judgment Hr material misplacer delivery amount. Strict inequality is violated (4), or not constrained Child node ==:(&quot;No"), then in tree 812

In 814, there is no longer any minimum delivery in the storage step [going to the delivery amount assignment method to consider the subsection. Method 800 continues to enter the range. In 804, the remaining sub-nodes are considered.

To determine the sub-nodes whose data storage device requires the lowest throughput. Method _ can be continued in substantially the same way, - the amount of delivery is up. All sub-points are assigned to

Figure 9 is a system of the self-parent node used to support poor communication in a multi-hop wireless network. It will be appreciated that the systems described hereinafter with reference to Figures 9 through 12 are represented as functional blocks. The functional blocks represent functions implemented by a processor, software, or a combination thereof. System 900 can be constructed in a wireless device - and can include a receiving component 9 〇 2 ′ receiving component 902 can be configured to receive a desired amount of delivery for each of the data reservoirs associated with each of the child nodes. The child node is communicatively coupled to a parent node. Receiving member 902 can include a receiver or can be built into a processor. It also includes a component 904 for determining when each child node should be scheduled. The component 904 can include a scheduler or can be built into a processor. This determination can be made based on the desired throughput. One for 113452.doc •40· 1328948 Determine whether the parent node is a barrier-blocking component 9G6 can be determined by the scheduling time to determine whether the parent node is a barrier. The means for determining whether the nucleus ^ is a typhoon - may include - a scheduler or may be constructed in a processor towel. The means 9 for determining the amount of delivery may be included in the system 900 and may include a value adjuster or may be built into a processor. If the parent node is a barrier, the component 908 for determining the throughput can determine a throughput for supporting each of the data reservoirs. Used for the component—the concept of maximum and minimum fairness to determine the amount of delivery for a data collector. Figure 1: From the point of view of the root node, a system that supports data communication in a wireless network composed of a plurality of nodes can be constructed in two wireless devices. The system includes a receiving component 1002 that is configurable to receive (4) the amount of delivery of each of the data hubs associated with each parent node at a node. The receiving component deletion may include a receiver or may be built in the processor. The parent node, the root node, and the data collector are lightly coupled in a communication manner. The system 1A also includes a component 1004 for determining a time division, the component 1〇〇4 can include a scheduler or can be built into a processor that can be based on the desired throughput. Determining the time fraction at which each parent node should be scheduled... The component 1006 used to determine a scheduling strategy can be configured to determine a scheduling strategy based on the time division rate at which each parent node should be scheduled. The components 1-6 for determining the scheduling strategy may include a scheduler or may be built into a processor. Figure 11 is an additional embodiment of a system 1100 that supports data access in a multi-hop wireless network from the perspective of a parent node. Included in system 11 (10) is a 113452.doc • 41 - 1328948 2 component 1102, and receiving component 11〇2 can be configured to receive a desired delivery of each data reservoir associated with each child node at a parent node the amount. The receiving component 1102 can include a receiver or can be built into a processor. The child nodes are coupled to the parent node overnight. A means 11 4 for determining transmit power and/or receive power can be configured to determine transmit power or receive power associated with each child node based on the desired throughput. The means 1104 for determining transmit power and/or receive power may comprise a calculator or may be constructed in a processor. According to some embodiments, one or both of transmit power and received power may be determined. Also included in the system 11A is a component 11〇6 for determining whether the parent node is an obstacle, and the component 11〇6 is configurable to determine whether the parent node is based on at least one of the determined transmit power and received power. A barrier. The means 1106 for determining whether the parent node is an obstacle may include a calculator or may be built into a processor. A member 1108 for determining a delivery amount can include a value adjuster or can be constructed by a processor. The means 11 8 for determining a delivery amount can be configured to determine a delivery amount for supporting each data reservoir if the parent node is an obstacle. FIG. 12 is for use from the viewpoint of a node. Another embodiment of a system 12 for supporting data communication in a wireless network of a plurality of nodes. System 1200 includes a receiving component 1202 that can include a receiver or can be constructed by a processor. The receiving component 1202 can be configured to receive the desired amount of delivery for each data reservoir associated with each parent node at the - root node. The parent node, the root node, and the data store are communicatively coupled. A component used to determine transmit power and/or receive power 12 〇 4 113452.doc • 42· 1328948 and any other suitable information. Memory 1308 can additionally store protocols associated with coordinated communications. It should be understood that the data storage (e.g., memory) components described herein can be either volatile or non-volatile, or both volatile and non-volatile. By way of illustration and not limitation, non-volatile memory may include read only memory (ROM), programmable ROM (PROM), electrically erasable programmable ROM (EPROM), electrically erasable ROM (EEPROM), Or flash memory. Volatile memory can include random access memory (RAM) used as external cache memory. By way of illustration and not limitation, RAM can be in many forms, such as synchronous RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDR SDRAM), and enhanced SDRAM (ESDRAM). Synchlink DRAM (SLDRAM), and direct Rambus RAM (DRRAM). Memory 1308 in the systems and/or methods of the present invention is intended to comprise, without being limited to, such and any other suitable type of memory. The user device 1300 can further include a symbol modulator 1310 and a transmitter 1312 that transmits the modulated signal. Figure 14 is a graphical illustration of a system 1400 that facilitates coordination of flow-based fair scheduling in accordance with various embodiments. System 1400 includes a base station or access point 1402. As shown, base station 1402 receives signals from one or more user devices 1404 via a receive antenna 1406 and transmits to one or more user devices M〇4 via a transmit antenna 1408. However, according to some embodiments, an antenna can also be utilized to both transmit and receive signals. The base station 1402 includes a receiver 1410 that receives information from the receiving antenna 1406 and is operationally associated with demodulation of a demodulation-received information - 44-113452.doc 1328948 transformer 1412. The symbol is analyzed by a processor 14i4, and the processor 14M is coupled to a memory 1416. The memory 1416 stores the number of data collectors in a particular flow rate, the measured delivery rate, and the number of transmissions. The rate-specific information-modulator 1418 can multiplex the signals for transmission by a transmitter 420 via the transmit antennas 14A to the user device 1404. Figure 15 illustrates an exemplary wireless communication system 15 〇〇 β for simplicity, and the wireless communication system 1500 depicts a base station and a terminal. However, it should be appreciated that system 1500 can include more than one base station or access point and/or more than one terminal or user device, where additional base stations and/or terminals can be substantially similar or different than The example base station and terminal are described. In addition, it should be understood that base stations and/or terminals can use the systems and/or methods described herein to facilitate wireless communication therebetween. Referring now to Figure 15', on the downlink, at access point 15〇5, a transmit (ΤΧ) data processor 1510 receives, formats, codes, interleaves, and modulates (or symbol maps) the traffic and Provide a modulation symbol (&quot;data symbol&quot;). A symbol modulator 1515 receives and processes the data symbols and pilot symbols and provides a stream of symbols. A symbol modulator 1515 performs multiplexing on the data and pilot symbols and obtains a set of one transmitted symbols. Each transmitted symbol can be a data symbol, a pilot symbol, or a signal value 〇. The pilot symbols can be transmitted continuously in each symbol period. The pilot symbols can be divided into frequency division multiplexing (FDM), orthogonal frequency division multiplexing (OFDM), time division multiplexing (TDM), frequency division multiplexing (FDM), or code division multiplexing (CDM). A transmit unit (TMTR) 1520 receives and converts the stream of symbols into a 113452.doc • 45- or analog signal and further conditions (e.g., amplifies, filters, and upconverts) the analog signals to produce an appropriate Uplink signal on the radio channel. The downlink signal is then transmitted via an antenna 1525 to the terminals. At the terminal 1530, an antenna 1535 receives the downlink signal and provides the received signal to a receiving unit (RCVR) 154 (the receiving unit 1540 adjusts (eg, filters amplifies and downconverts) the received signal and adjusts The signals are digitized to obtain samples. A symbol demodulator 1545 obtains the iV received symbols and provides the received symbols to a processor 1550 for channel estimation. The symbol demodulator 1545 further receives the downlink from the processor 1550. Estimating the frequency response of the link, performing data demodulation on the received data symbols to obtain data symbol estimates (the estimated values of the transmitted data symbols), and providing the data symbol estimates to an RX data processing The processor 1555 demodulates the data symbol estimates (ie, symbol demaps and deinterleaves and decodes the recovered traffic data. Symbol demodulation transformer 1545 and RX data processor 1555) The processing performed is complementary to the processing performed by the symbol modulator 15 15 and the TX data processor 151 在 at the access point 15 〇 5, respectively. On the uplink A TX data processor 156 processes the traffic data and provides data symbols. A symbol modulator 1565 receives the data symbols and multi-tasks them with the pilot symbols, performs modulation, and then provides a stream of symbols. A transmit unit 157A then receives and processes the symbol stream to generate an uplink signal that is transmitted via an antenna 1535 to an access point 1505. 113452.doc -46- 1328948 At access point 1505 The 'uplink signal from the terminal 153' is received by the antenna 1525 and processed by a receiving unit 15 75 to obtain samples. Then, a symbol demodulator 158 processes the samples and The received uplink pilot symbols and data symbol estimates are provided. An RX data processor 1585 processes the data symbol estimates to recover the traffic data transmitted by the terminal device 1530. A processor 159 is each An active terminal that implements transmission on the uplink performs channel estimation. Processors 1590 and 1550 direct (e.g., control, coordinate, manage, etc.) access point 1505 and terminal 1530, respectively. Each of the processors 159A and 1550 can be associated with a memory unit (not shown) for storing code and data, respectively. Processors 1590 and 1550 can also perform computations to derive uplinks and downlinks, respectively. The frequency of the path and the estimated impulse response. For a multi-directional proximity system (e.g., FDMA, 〇FDMA, cdma, frequency diversity for each terminal), this pilot sub-band structure will be constructed from a variety of components. For example, TDMA, etc., multiple terminals can transmit simultaneously on the upper channel. For such a system, the pilot subbands can be shared by different terminals. The channel estimation technique can cover the situation where the per-terminal pilot sub-bands span the entire operating band (possibly except for the band edges). For

Column (FPGA), processor, controller, built into one or more application dedicated processor (DSP), digital signal processing equipment (PLD), field programmable gate array microcontroller, microprocessor, Li 113452. Doc -47· 〆V- 丄 is used in an electronic unit, or a combination thereof, for performing the functions described herein. The software can be implemented by a module (e.g., program, function, etc.) capable of performing the functions described herein. The software code can be stored in the memory unit and executed by the processor 159 and 155. It will be appreciated that the embodiments described herein can be constructed from hardware, software, firmware, a semaphore, microcode, or any combination thereof. When such systems and/or methods are constructed in software, firmware, intermediates or microcode, code or code segments

The device may be stored in a machine readable medium such as a storage component, and the code segment may represent a program, a function, a secondary program, a program, a routine, a subroutine, a module, a software package, a category, or any instruction or data structure. Or a combination of program statements. A code segment can be coupled to another code segment or a hardware circuit by passing and/or receiving information, data, arguments, parameters or memory contents. Information, variables, parameters, data, etc. can be transmitted, transferred or transmitted using any suitable means including memory sharing, messaging, token transfer, network transmission, and so on.

For a software build scheme, the techniques described herein can be implemented using modules (e.g., program 'functions, etc.) that perform the functions described herein. The software code can be stored in the memory unit and executed by the imaginary crying &gt; -^ τ Yatian processor. The memory unit can be built inside the processor or outside the processor. When the memory unit is built outside the processor, the memory is depleted. The invisible body can be communicatively coupled to the processor by methods known in the art. The above: includes an example of - or a plurality of embodiments. Of course, it is not possible to clarify every conceivable combination of components or methods for the purpose of illustrating the purpose of the foregoing embodiments. Instead, as will be appreciated by those skilled in the art, various embodiments may be 113452.doc - 48-s 1328948 has many other combinations and arrangements. Accordingly, the described embodiments are intended to cover all such modifications, modifications, and alternatives, which are still within the spirit and scope of the appended claims. In addition, for the purposes of this detailed description or the terms used in the scope of the patent, "including -) &quot;, the inclusion of the (4) method and the wording "including (eGmprising) &quot; in the - request item - The way to translate the words is the same. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a schematic illustration of a multi-hop communication system in accordance with various embodiments disclosed herein. Figure 2 illustrates a schematic diagram of a forward link communication. Figure 3 illustrates a wireless communication system utilizing a fair scheduling technique. 4 illustrates another embodiment of a system for providing a fair schedule based on traffic. FIG. 5 illustrates a flow chart of a method for supporting data communication by rate controlled multi-hop scheduling. FIG. 6 illustrates a A flow chart of a method for determining throughput based on a concept of maximum fairness. Figure 7 illustrates a flow chart of a method for supporting data communication by multi-hop scheduling of power control. Figure 8 illustrates a flow chart of a method for finding a common throughput for each of the child nodes under a barrier node. Figure 9 is a system for supporting data communication in a multi-hop wireless network from the perspective of a parent node. Figure 10 is a system for supporting data communication in a wireless network composed of a plurality of nodes 113452.doc -49- from the viewpoint of a node. Figure 11 is another embodiment of a system for supporting data communication in a multi-hop wireless network from a parent node perspective. Figure 12 is another embodiment of a system for supporting data communication in a wireless network of a plurality of nodes from a root node perspective. Figure 13 illustrates a system that facilitates fair flow-based scheduling in a multi-hop wireless communication environment in accordance with one or more disclosed embodiments. Figure 14 is a diagram of a system that facilitates coordination of flow-based fair scheduling in accordance with various embodiments of the present invention. Figure 15 illustrates a wireless communication environment that can be used in conjunction with the various systems and methods described herein. Glossary Forward link = data flow from an access point to an access terminal. Reverse link = data stream is from the access terminal to the wired access point. Leaf node = an access point node that is only communicatively coupled to the access terminal on the forward link. Parent node = an access point node communicatively coupled to at least one other access point node on the forward link. Child node = an access point that can receive data from another access point on the forward link is considered to be a child of the access point. Root node = wired access point. Subtree of Nodes = This node can use one or more hops on the forward link to aggregate all data collectors and access points to which data is sent. 113452.doc 1328948 资科储器 and data source = access terminal is the data on the forward link. The data source is on the reverse link. Wired access points are on the forward link and are on the reverse link as data collectors. [Main component symbol description]

100 multi-hop communication system 102 root node 104 access point 106 access point 108 access point 110 access point 112 access point 114 access point 116 access point 118 access terminal 120 access terminal 122 access Terminal 124 access terminal 126 access terminal 128 access terminal 130 access terminal 132 access terminal 134 access terminal 200 forward link communication 202 root node 113452.doc -51 - 1328948

204 Access terminal 206 Access terminal 208 Access terminal 210 Access terminal 212 Access terminal 214 Access terminal 216 Access terminal 218 Access terminal 220 Access terminal 222 Leaf node 224 Leaf Node 226 Leaf Node 228 Leaf Node 230 Leaf Node 232 Node 234 Node 236 Subtree 238 Subtree 300 Wireless Communication System 302 Access Terminal 304 Root Node 306 Leaf Node 308 Parent Node 310 Transmitter/Receiver

&gt; (W 113452.doc -52- 1328948 1102 Receiving member, % received power is used to determine the parent node is not yours. 疋 No is a component of the obstacle. It is used to determine the component of the conveying system.

Component for #transmit power and/or receive power Component for determining a scheduling strategy System Receiver Demodulator Processor Memory Modulator Transmitter

1104 1106 1108 1200 1202 1204 1206 1300 1302 1304 1306 1308 1310 1312 1400 1402 1404 1406 1408 1410 1412 1414 1416 System base station or access point user device receiving antenna transmit antenna receiver demodulator processor memory 113452.doc -54· 1328948 1418 Modulator 1500 Wireless Communication System 1505 Access Point 1510 Transmit (TX) Data Processor 1515 Symbol Modulator 1520 Transmitter Unit (TMTR) 1525 Antenna 1530 Terminal 1535 Antenna 1540 Receiver Unit (RCVR) 1545 Symbol Demodulation transformer 1550 processor 1555 receive data processor 1560 transmit data processor 1565 symbol modulator

1570 Transmitter Unit (TMTR) 1575 Receiver Unit (RCVR) 1580 Symbol Demodulation Transmitter 1585 Receive Data Processor 1590 Processor 113452.doc -55·

Claims (1)

1328948 Patent No. 095129645_Request for Chinese Patent Application Replacement (April, 1999) Amendment to the 2nd Anniversary of the Year of the Year; f. Application for Patent Fan Park---] A method for supporting data communication, including : 1. At point P, a desired round of delivery for each data bank state associated with each child node is received; the time of scheduling is based on the expected throughput; When the mother-child node is blocked, the material node is tied to the material of the shirt, and if the parent node is an obstacle, the round amount of the collector is determined.丨 - - used for supporting the mother - data storage 2.: two-two method 'repeated determination for each ascending node - to deal with each obstacle,: the time of the schedule and determine whether the parent node is a barrier until one The root node is up. Our method further includes the step of supporting each data storage to the root node if the parent node is an obstacle. (4) The delivery amount of the benefit is provided. 4. According to the method of claim 3, the first point is a row, and the scheduling strategy is based on the determined amount of the data collector. A is used to support the edge-five-item 1 method, and (4) the parent node is &quot;'the obstacle, then its further point, and at least its data storage device needs to be--the minimum delivery amount of the sub-section to deliver the minimum to each - the child node is associated with this to 4 113452-990402.doc 丄 a data reservoir; according to the minimum delivery amount assigned by the material ^ should be a time division of the schedule; and the sum of the Lang Lang delivery volume It is determined that the parent node is a barrier based on the minimum assigned. The external .3⁄4 is 6. The method of claim 5, which further includes: and right "that is, if the point is not _ obstacle, then it is determined whether there is excess capacity: the excess capacity|/ 斯谷礼礼 is allocated to its data storage The device needs to be assigned to the sub-node of the amount of transport in the space with the minimum throughput. The method of claim 5, further comprising: if the parent node is not an obstacle, the minimum delivery amount is assigned to the storage node, and the child node that needs the minimum delivery amount no longer considers at least one data storage. The collector needs the minimum delivery amount of the child node; and identifies from the remaining child nodes that the next at least one data collector needs the lower-minimum delivery amount of the child node; assigning the next minimum delivery amount to each of the remaining child nodes Associated with the at least one data store; determining a time rate for scheduling each of the remaining child nodes based on the minimum amount of delivery assigned to the other; and assigning the next one according to the The sum of the minimum throughputs is used to determine if the parent node is an obstacle. 8. The method of claim 1, wherein if the parent node is an obstacle, a 113452-990402.doc is determined to support the positive concept of each data store.疋 系 基于 最大 最大 最大 最大 最大 最大 最大 最大 最大 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如 如The sum of time is less than the point - not the obstacle. So! And determining the parent node 10. The method of claim 1, wherein at least - the tone is a terminal. An apparatus for supporting data communication, comprising: a receiver that receives a desired throughput amount of each data buffer associated with each of: a point of communication that is communicatively coupled to a parent node; a - scheduler 'determined according to the expected number of rotations - should deal with the phase of each (2) process and determine whether the parent node is an obstacle according to the schedule time determined by the material; and: The value adjuster determines a throughput for supporting the data storage device if the parent node is an obstacle. Long term 11 of. Further, the step further includes a transmitter that supplies the determined (four) domain per-data reservoir to the root node. 13. The apparatus of claim 12, the receiver further comprising receiving a scheduling policy from the root node, wherein the scheduling policy is based on the determined rounding amount for supporting each data store. , 14U item 11 device' The value adjuster is based on the concept of maximum and minimum fairness; t is used to support the round amount of each data collector. 113452-990402.doc 15. Two computer readable media containing instructions that, when executed, cause a device to: receive at the parent point a reference to each data store associated with each child node The expected delivery amount; determining the time for scheduling each sub-node according to the expected delivery amount; determining whether the parent node is an obstacle according to the scheduling time determined by β Xuan et al; and # When the node is an obstacle, it determines a throughput for supporting each data collector. 16. 2 Computer readable media of claim 15 'These instructions further enable the device to provide a round to the support set for the support set to the right node. In accordance with the computer readable medium of claim 15, the instructions for determining whether the parent is a barrier or not cause the device to: determine that the sum of the time to schedule the parent-child node is Or equal to 1; and π Right-Hai is the sum of the time is less than or equal to i, then the judgment point is not an obstacle. The mother is 18. The kind is used to support the information. a processor, comprising: means, at a parent point, receiving a desired throughput of each of the collectors associated with each of the child nodes, the child node being communicatively coupled to the parent node; Waiting for the expected throughput to determine the component that should be used to implement 113452.990402.doc -4- schedule for each child node; determine whether the parent node is defective based on the scheduling time of the sir &amp; + Λ 俜The components of the obstacle; and the guarantee. The mysterious mother node system—the obstacles are crying and confessing, so it is used for the components of the transport volume of each data storage. 19. The processor of claim 18, further comprising: identifying a component that at least one of the data stimulators requires a minimum delivery point; 卞 Μ Μ 丨 输送 输送 输送 输送 输送 输送 输送 输送 输送 相关 相关 相关 相关 相关 相关To, 丨, a component of a data reservoir; ν determine the component of a time rate for each child node schedule according to the minimum delivery amount assigned by s Xuan et al; and “according to the 4 The sum of the minimum delivery amount is used to determine whether the parent node is a component of the obstacle. 疋2〇. The processor of claim 18, further comprising: the right parent node is not an obstacle, the minimum delivery amount is Having at least one of its data collectors requires a sub-node of the minimum throughput; the structure no longer considers that at least one of the data reservoirs requires the minimum number of rotations of the sub-node; and is identified from the remaining sub-nodes a component of a child node whose at least one data collector requires a next minimum amount of delivery; assigning the next minimum amount of delivery to the at least one data collector associated with each of the remaining child nodes Component; outside 113452-990402.doc • 5- Determine the component of the time division rate for each remaining child node to be scheduled according to the minimum delivery amount assigned to the other; and according to the assigned The sum of the minimum throughput is used to determine whether the parent node is a component of the obstacle. 21. 22. 23. A device for supporting data communication, comprising: for receiving and each child at a parent node a component of a desired throughput of each data store associated with the node, the child node is communicatively coupled to the parent node; and each child node is configured to determine implementation based on the desired throughput a component of the time of scheduling; determining whether the parent node is used as a component of the obstacle according to the determined schedule; and determining the use of the reservoir by the parent for the parent node The component of the delivery amount of the device, such as the device of π item 2 1 , wherein the use &amp; also - for the mother node is a barrier read - for supporting the volume of each data reservoir Take the concept of big and minimum fairness Determining the number of rounds. Χ ^ A method of supporting data communication, comprising: receiving, at a node, a desired throughput for each of the books associated with each of the . The mother's parent fund + root node; · The k-time coupling J's a time division rate 疋 and 疋... For each-parent node implementation according to the response to each parent node implementation of the heart rate time rate to determine I13452-990402.doc -6 - ^328948 Scheduling strategy. 24. In the method of claim 23, the expected delivery volume of the parental reserve is used to support each of the data associated with 盥 _ #能日日ω, /,母即., 』 The amount of transport of the reservoir. 25. The method of claim 23, wherein the method further comprises notifying each of the parent nodes of the determined scheduling policy. 6. Apparatus for supporting data communication, comprising: - a receiver 'receives a desired amount of delivery in each - parent node associated coupler', the parent node communicates = - root node, and The eight-coupler-to-process device determines, according to the desired delivery amount, a time-scoring rate for each-major point to be scheduled, and according to the time for each parent node to be scheduled The rate is used to develop a scheduling strategy. 27. The device of claim 26, further comprising - transmitting the determined scheduling policy to each parent node. 4 camera set: package "the computer-readable medium of the θ order, these instructions are executed at the time of receiving a node associated with each of the ignoring points at a node; The communication method is lightly coupled to determine the time rate of each response according to the desired delivery amount; and the point κ fine scheduling is based on the scheduling strategy for implementing scheduling for each parent node. The knife rate determines an I13452 - 990402.doc 1328948 29. The computer readable medium of claim 28, the instructions further causing the device to provide the determined scheduling policy to each parent node. 3 0. - Processing for supporting data communication a processor component that receives a desired throughput of each data repository 相关3 associated with each parent node, the parent node communicatively coupling to a node; The amount of delivery determines the component of a schedule that is to be scheduled for each parent node; and determines the component of a scheduling strategy based on the time rate at which each parent node is scheduled to be scheduled. 31. Processor, its step-by-step The determined scheduling policy is transmitted to the components of each parent node. 32. - A device for supporting data communication, comprising: ; receiving "# mother is a desired expectation of each data collector associated with the point a component for conveying a quantity; a member for determining a time division rate for each-mother-schedule schedule according to the desired delivery amount; and for responding to each----UI, ^ The time division rate of the scheduling process is a component of a scheduling strategy. As early as 33. The device of claim 32, wherein each of the data collectors is used to support the throughput of each of the materials associated with the parent node. Two Rongyi 34. A method for domain data communication, comprising: receiving, at a parent point, each data storage associated with each child node 113452-990402.doc 1328948 the child node is communicatively coupled to each a desired delivery amount of the collector is a parent node; determining, according to the desired delivery amount, at least one of a transmit power and a received power associated with each of the child nodes; and determining the transmit power and the At least one of the blowing powers determines whether the parent node is an obstacle; and the right parent is a point that is determined to be used to support the throughput of each data collector. 35. 36. 37. 38. 39. The method of monthly claim 34&apos; includes the step of providing the determined round amount for the support data collector to a node. The method of two long items 35, further comprising receiving a row of policies from the root node, the row &amp; policy based on the determined at least one of the transmit power and the received power. The method of claim 34, further comprising determining whether to violate at least one of a peak rate constraint condition and a -thermal noise increment about east condition, ', Λ peak power about I condition and the transmit power phase The burial is buried, and the thermal noise increase constraint is associated with the total received power. The method of monthly claim 37, further comprising establishing at least one of the data reservoirs below each of the sub-points if the peak power constraint is violated and the at least one of the 3 heat fault constraints is violated A maximum and minimum maintainable delivery. The method of the monthly solution 38 establishes that the maximum and minimum maintainable rotation amount package solves a first constraint condition equation and a second constraint condition equation 113452-990402.doc, and a comparison of the equations solved by I, etc. Small value. 4. If the method of claim 37, the further steps include: multi-equalities, etc., determining (4) assigning the excess capacity at the point to other sub-sections associated with the parent node, such as 咕In the method of claim 37, the peak power-off condition is associated with the child node, and the thermal noise increment constraint is associated with the parent 42. The request method 34 is associated with the 法 „ point. The ascending node repeatedly determines at least the transmission power/and the received power, and the ancient stone Chinese sentence D is the first point until it reaches a node. The device supporting the data communication includes: 43. An under-machine that uses a buffer to receive each data store associated with a parent-child node =: a desired delivery amount 'the child node communicatively merges to a-counter' based on the desired throughput Determining, according to at least one of the determined transmit power and the received power, determining whether the parent node is an obstacle according to at least one of the determined transmit power and the received power; And - value adjuster 'if If the parent node is an obstacle, then it selects one to support the throughput of each data collector. 44. The device of claim 43 further includes a transmitter, and the transmitter is used to determine 4 The foot is used to support the throughput of each data collector. 113452-990402.doc •10· 1^28948 The root node I is sent to the device called item 44, and the receiver receives the step from the root node. a scheduling strategy, the scheduling strategy is based on the determined at least one of the transmit power and the received power. The monthly demand item 43 is not ready, the calculator further determines whether to violate a peak power constraint and a heat At least one of the noise increment constraints 'where the material value work (four) beam condition is associated with the transmit power, and 4 the thermal noise incremental constraint condition is associated with a total received power. Computer-readable medium, when executed, causes a device to: at a parent node, receive a desired amount of delivery in each data store associated with each child node, the child node being communicatively Hehe to mother and mother node; = Determining, by the at least one of a transmit power and a received power associated with each of the sub-nodes; determining whether the parent node is one according to the determined at least one of the transmit power and the received power Obstacles; and the right δ hai mother node is a barrier, then the transmission volume of the # _ collector. (4) 疋 1 in support of each data storage n? computer readable media, these instructions to make the injury: ...the peak power constraint is one of the thermal noise incremental constraint powers, wherein the peak power constraint is associated with the transmission, and the thermal noise incremental constraint and the total received power H3452-990402 Doc 1328948. The computer readable medium of claim 48, if at least one of the peak power constraint and the thermal noise incremental constraint is violated, the instructions further cause the device to be per-sub At least one of the data reservoirs below the node establishes a maximum and minimum maintainable throughput. 5. A processor for supporting data communication, the processor comprising: means for receiving each of the data reservoirs associated with each of the sub-nodes; u: according to the expected throughput Determining, by at least one of a transmit power and a receive power associated with each child node; determining, based on the determined at least one of the transmit power and the received power, whether a parent point is a barrier component And (4) the parent node system - the obstacle, then determine the component used to support the throughput of each data sink. The processor of claim 50, wherein the step-by-step includes whether the shirt violates a peak power constraint condition and at least one of a thermal noise increment constraint = where the peak power constraint condition and the transmission 52::= The thermal noise incremental constraint is associated with the total received power. • A brancher, the step of which includes the means for transferring the determined amount of transport for the branch---beech reservoir to a node. 53. An apparatus for supporting data communication, comprising: means for receiving, at a parent node, each of the assets associated with a parent-child point: a component of a desired throughput, the child The node is a communication party, a fault σ to a parent-child node; and is configured to determine, according to the desired delivery amount, at least one of a transmit power and a received power associated with each child node J13452-990402.doc •12· 1328948 a component for determining whether the parent node is an obstacle according to at least one of the determined transmit power and the received power; and for determining if the parent node is an obstacle A component that supports the throughput of each data collector. 54. The device of claim 53, which is a terminal. 55. A method of supporting data communication, comprising: receiving, at a node, a desired throughput of each data store associated with each parent node, a point that is coupled to the root in a 通通 manner Determining at least one of transmit power and received power associated with each parent node; and determining a scheduling policy based on the determined transmit power and the received work material. 5 6. According to the method of claim 5 5, the desired delivery volume of each asset port is used to support each data storage device associated with a parent node. Lost in confusion. 57. The method of claim 55, wherein each of the parent nodes is notified. And including the determined scheduling strategy 5 8. The device for supporting data communication includes: a receiver that receives each data storage associated with each parent 5^^ : a desired throughput I"-beta beta, which determines a transmit power associated with each parent point, at least one of 113452-990402.doc -13 · 1328948 received power' and is determined according to A scheduling strategy is formulated for at least one of the transmit power and the - received power. ', 59. The device of monthly claim 58' further includes a transmitter that determines the scheduled scheduling strategy Transmitting to each parent node. 60. A computer readable medium containing instructions that, when executed, cause a device to: receive, at a node, each data store associated with each parent node - a desired throughput "the parent node communicatively merging to the root node; determining at least one of transmit power and received power associated with each parent node; and determining the transmit power and the At least one of the received powers A scheduling policy. 61. The computer readable medium of claim 60, wherein the instructions further cause the device to transmit the scheduling policy to each parent node. 62. a processor for supporting data communication, The processor includes: means for receiving a desired throughput of each data store associated with each parent node, the parent node communicatively coupled to - the root node determines a transmit power associated with each parent node Means for determining a scheduling policy based on at least one of the determined transmit power and the received power. 63. The processor of claim 62, further comprising The scheduling policy is transmitted 113452-990402.doc 64. 64.1328948 to the components of each parent node. A device for supporting data communication, including: for receiving a point P with each mother at a node a component τ of a desired throughput of each associated data collector, the parent point is communicatively coupled to the root node; for confirming the transmit power associated with the parent-child point At least one of received power of the member;. And means for determining a scheduling policy based on the member of the transmission power of the received power of the determined at least one 113452-990402.doc 15-