ES2633122T3 - Traffic load management for uplink network traffic - Google Patents

Abstract

A method for controlling a size of a contention window (220) at a node (102) in a network (100), wherein a contention window is a period of time during which a node waits to transmit, upon interruption of radio frequency signals on a particular channel, before transmitting, comprising: under the control of one or more processors (114) at the node (102) and configured with executable instructions: maintaining a list (212), wherein the list (212) is maintained at the node (102) and comprises a size of a contention window (220) of a primary node (102) of the node (102); setting a contention window (220) for the node (102) to be no shorter than a contention window (220) of the primary node (102) of the node (102), as indicated by the list (212); and sending data to the primary node (102) of the node (102), commencing the sending after a wait indicated by the contention window (220) of the node (102), wherein: maintaining the list (212) includes: associating a plurality of primaries in the list (212) with a plurality of contention windows (220), respectively, and a plurality of wait time periods, respectively, each wait time period governing the expiration of an associated contention window (220); and setting the contention window (220) includes: monitoring the plurality of wait time periods for expiration; and upon expiration of a wait time period, using a default contention window to replace a contention window (220) associated with the expired wait time period.

Description

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

DESCRIPTION

Load upload management for uplink network traffic Background

A mesh network may include a plurality of nodes, many of which may include software to produce data for transmission. Many of the nodes may also have associated devices, including sensors, counters, etc., that can collect data. Collectively, nodes can cause a considerable amount of data to be sent upstream to a root node for transmission to a central office.

Existing networks and systems create bottlenecks on certain upstream nodes, resulting in transmission delays and quality of service problems. A second problem with existing systems involves the equitable and efficient division of available bandwidth between nodes in the network and the software running on these nodes.

Document US2007 / 0214379A1 refers to techniques for controlling transmissions in wireless communication networks such as mesh networks.

Summary

In one aspect a method is provided as defined in claim 1.

In another aspect a node is provided in a network as defined in claim 10.

Brief description of the drawings

The detailed description is described with reference to the attached figures. In the figures, the leftmost digit or digits of a reference number identify the figure in which the reference number appears first. The same numbers are used throughout the drawings to refer to similar features and components. In addition, the figures are intended to illustrate general concepts, and not to indicate required and / or necessary elements.

Figure 1 is a diagram showing a network that has a plurality of nodes, some detail of a node, a connection to an additional network such as the internet and a central office.

Figure 2 is a diagram showing sample details of an individual node.

Figure 3 is a timing diagram showing an example of how collisions are avoided by the example node configured as seen in Figure 2.

Figure 4 is a flow chart illustrating an example method by which uplink network traffic can be managed.

Figure 5 is a flow chart illustrating an example method by which information can be managed with respect to windows containing neighboring nodes.

Figure 6 is a flowchart illustrating an example method by which timeout periods of content windows of other nodes can be managed.

Figure 7 is a flow chart illustrating an example method by which a node can establish its own containment window, using as input indications of containment windows of other nodes. Figure 8 is a flow chart illustrating an additional example method by which a node can establish its own containment window, using as input indications of containment windows of other nodes.

Detailed description

General view

As discussed above, existing networks do not provide an effective way to manage uplink network traffic in a network, such as a multi-channel wireless mesh network. A particular problem in existing networks is that traffic between networks can increase for nodes closer to the root node. This increase can result in a bottleneck, which can degrade network performance. A number of factors may be the culprits. For example, existing networks may include nodes that have longer content windows that do not allow them to participate in bandwidth and process data at the required speed, based on the data they receive from downstream nodes. As used herein, a "contention window" refers to a period of time during which a node waits to transmit, after the interruption of radio frequency (RF) signals on a particular channel, before transmission. Therefore, because different nodes have containment windows of different lengths, the containment windows provide a "staggered start", in which one node is allowed to start RF transmission before the other nodes, forcing this way that the other nodes waiting to transmit suspend a

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

calculation of waiting time in their own containment windows. Therefore, the containment windows are part of a collision avoidance system in the wireless networks.

This disclosure describes techniques for providing traffic load management for uplink network traffic. The uplink network traffic may include data that flows from node to node within a mesh network in an upstream direction, that is, to a root node. The network, nodes and data may include, for example, smart public service meters (for example, electricity, gas and / or water meters), sensors (for example, temperature sensors, weather stations, frequency sensors, etc.). ), control devices, transformers, routers, servers, retransmitters (for example, cellular retransmitters), switches, valves and other network devices and the data generated and / or transmitted from any of the above. From the rafz node, the data can be transferred to an additional network for transport to a central office. For example, the root node can be configured as a cellular router in a context of an autonomous routing area (ARA) of intelligent public service meters, can receive data from the mesh network and can transmit that data to servers within the Internet to transfer to a central office, server or other desired location.

An example that illustrates some of the techniques discussed in this document that is not to be considered a complete or comprehensive analysis can help the reader. A node can assist in managing upstream network traffic in part by managing a contention window used through the node. When the transmission is stopped on a channel (that is, when the radio frequency (RF) signal is not currently heard) the nodes that wish to begin the transmission must each wait until the expiration of their own contention windows. A node that has a shorter containment window can start transmission first, thus preventing other nodes from transmitting. Therefore, the length of a contention window is a factor that governs traffic in an RF network, such as a mesh network comprising a plurality of nodes, which can be configured as an ARA of smart meters of public services.

Within the previous example, a node can assist in managing upstream network traffic in part by managing a contention window used through the node. The node can maintain a list of size or window sizes or node containment windows or primary nodes of the node. The node can set its own contention window to be longer (ie, a longer period of time) than the upstream neighboring nodes and / or primary nodes. With a contention window longer than its node or primary nodes, the node will refrain from using an RF channel needed by a primary node. That is, the primary nodes will generally have a higher priority (i.e. shorter window size) than their secondary nodes. Therefore, upstream nodes can better transmit any accumulated data delay before receiving additional data from downstream nodes. This can better distribute data across the network and can better manage the data flow.

The analysis of this document includes several sections. Each section is intended to be non-limiting. More particularly, this complete description is intended to illustrate components and techniques that can be used in uplink network traffic load management, but not components and techniques that are necessarily required. The analysis begins with a section entitled “Example network architecture,” which describes an ARA, which includes smart public service meters and other devices as a representative environment that can implement the techniques described in this document. Next, a section entitled "Example node configuration" illustrates and describes an example configuration for a node usable in a network such as an ARA and that provides uplink network traffic load management. Next, a section entitled "Example Content Window Operation" illustrates and describes an example of contention window techniques that provide uplink network traffic load management. Additional sections, titled "Example methods" and "Example uplink network traffic load management methods" illustrate and describe techniques that can be used to manage node content windows and to provide network traffic load management. uplink. Finally, the analysis ends with a brief conclusion.

This brief introduction, which includes section titles and corresponding summaries, is provided for the convenience of the reader and is not intended to describe and / or limit the scope of the claims or any section of this disclosure.

Sample Network Architecture

Figure 1 is a schematic diagram showing the example architecture 100 of a network, such as for example a multi-channel wireless mesh network, in which uplink transmissions can be routed at least in part according to windows of content established in each node according to the techniques prescribed in this document. The architecture 100 includes a plurality of nodes 102A, 102B, 102C, 102d, ... 102N (collectively referred to as nodes 102) communicatively coupled to each other via direct communication radio frequency (RF) signals, transmissions or links . In this example, N represents a number of example nodes in an autonomous routing area (ARA),

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

which can be configured as a wide area network (WAN), metropolitan area network (MAN), local area network (LAN), neighboring area network (NAN), personal area network (PAN) or the like.

As discussed above, the expression “contention window” refers to a waiting period that a node must wait, after the transmission in a channel is terminated by another node, and before the node can start its own transmission. If another node begins transmission before the end of the node's contention window, the node must suspend a back account associated with its own contention window, and allow the other node to use the channel. In a multi-channel environment, each of the plurality of channels can be defined by a frequency range that is the same or different for each of the plurality of channels, and each channel can be centered around a different frequency. In some cases, the plurality of channels comprises RF channels, which typically have a frequency width appropriate to anticipated modulation and environmental condition or conditions. The plurality of channels may comprise a control channel and multiple data channels. In some cases, the control channel is used to communicate one or more short messages between the nodes to specify one of the data channels to be used to transfer data. Additionally, the control channel can be used by a plurality of nodes to transmit information indicating its content window length. The length of the contention window can be expressed as a period of time, a number of "intervals" of time, or any agreed technique. In general, the transmissions in the control channel are shorter in relation to the transmissions in the data channels.

In the example of Figure 1, nodes 102 are also configured to communicate with a central office 104 via a root node, such as an edge device (for example, cellular relay, cellular router, edge router, DODAG root, etc. .), which serves as an ARA connection point to a network or backhaul networks 106, such as the internet or an intranet. The central office 104 can be implemented by one or more computer devices, such as servers, personal computers, laptops, etc. The one or more computer devices may be equipped with one or more processors or processors communicatively coupled to memory. In some examples, the central office 104 includes a centralized meter data management system that performs processing, analysis, storage and / or management of data received from one or more of the nodes 102. For example, the central office 104 can process , analyze, store and / or manage data obtained from an intelligent public services meter, sensor, control device, router, regulator, server, relay, switching, valve and / or other nodes. Although the example in Figure 1 illustrates the central office 104 in a single location, in some examples the central office can be distinguished between multiple locations and / or can be eliminated in its entirety (for example, in the case of a highly decentralized distributed computing platform ).

The network or networks 106 may comprise a wireless network or a wire network, or a combination thereof and may be a collection of individual networks interconnected with each other and functioning as a single large network. In the illustrated example, node 102A serves as a root node, configured as a cellular relay to retransmit conminations to and / or from the other nodes 102B-102N of the ARA to and / or from the central office 104 via the network or networks 106.

Node 102D is representative of each of the nodes 102 and includes a radio 108, configured for communication by means of RF signals 110, and a processing unit 112. Radio 108 comprises a radio frequency (RF) transceiver configured to transmit and / or receive RF signals through one or more of a plurality of channels / frequencies. In some implementations, each of the nodes 102 includes a single radio 108 configured to send and receive data on multiple different channels, such as the control channel and multiple data channels of each communication link 110. Radio 108 can also be configured to implement a plurality of different modulation techniques, data rates, protocols, signal intensities and / or power levels. Additionally, the radio can be configured to sequentially tune a plurality of different frequencies, each for a short period of time, in a "frequency hopping" scheme. The architecture 100 may represent a heterogeneous network of nodes, in which nodes 102 may include different types of nodes (for example, smart meters, cell relays, sensors, etc.), different generations or models of nodes, and / or nodes otherwise they are capable of transmitting on different channels and using different modulation techniques, data rates, protocols, signal intensities and / or power levels.

The processing unit 112 may include one or more processors or processors 114 communicatively coupled to the memory 116. The processor 114 may execute, and the memory 116 may contain, various modules, managers, algorithms, etc. The modules can be configured in software and / or firmware, and can be executed in the processor. In alternative embodiments, any or all modules may be implemented in whole or in part by hardware. Examples of hardware include a microcontroller or other device, such as a specific application integrated circuit (ASIC) or another device configured to perform the described functions.

Memory 116, although shown as a monolithic entity, can also be configured as a plurality of devices configured differently, such as read-only memory, writable memory, persistent or non-persistent memory, etc. Memory 116 can be configured to store one or more modules

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

of software and / or firmware, which are executable in the processor or processors 114 to implement various functions.

Memory 116 may comprise computer-readable media and may take the form of volatile memory, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Computer-readable medium includes extrafole and non-extrafole, volatile and non-volatile memory, implemented in accordance with any technology or information storage techniques such as computer readable instructions, data structures, program modules or other data for execution by one or more processors of a computer device. Examples of computer readable media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile discs (DVD) or other optical storage , magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission means that can be used to store information for access through an information device. As defined herein, a computer-readable medium does not include communication media, such as modulated data signals and carrier waves.

The functionality of the content window 118 can be defined in the memory 116 and maintained by the actions of the processor 114. The content window information may include information about the duration of the neighbor content windows upstream of the node 102D. According to the techniques discussed above, the functionality of the containment window 118 can operate to select a containment window for node 102D that is longer than the neighbor containment windows at 1 hop upstream. The use of a containment window in node 102D that is longer than that of the upstream neighbors (for example, node 102B) helps network 100 to eliminate bottlenecks in the transmission.

Sample Node Configuration

Figure 2 is a diagram showing additional details of an individual example node 200. The node can be configured to provide traffic load management for uplink network traffic. The uplink network traffic may include data flowing from the node to the node in a mesh network in an upstream direction, that is, to a root node.

Node 200 can be configured to assist in managing upstream network traffic in part by managing a contention window used by the node. When the transmission is stopped on a channel (that is, when the radio frequency (RF) signal is not currently heard) the nodes that wish to begin the transmission must each wait until an expiration indicated by their own content windows. A node that has a shorter content window can start the transmission first (assuming it has data to transmit), and its transmission has the effect of preventing the other nodes from transmitting. If the node that has the shortest contention window has no data to transmit, a node with a shorter contention window size will have an opportunity to transmit, and so on. Therefore, the length of a contention window is a factor that governs traffic in an RF network, such as a mesh network comprising a plurality of nodes, which can be configured as an ARA of smart meters of public services.

Radio 108 may be configured for communication with a processing unit 112 through a communications bus 202. In the example configuration of Figure 2, the radio may include an antenna 204 that provides an input signal to a front end of RF 206. The front end of RF 206 can be configured to tune an RF signal among many provided by the antenna 204, and provide a baseband signal to the baseband processor 208.

The front end of RF 206 can be configured using high frequency hardware components to tune one or more frequencies of RF signals obtained from nodes within the network. In an analog (or analogue and mixed digital) configuration, the front end of RF 206 can be configured as a radio or transceiver using conventional or advanced technology, which allows tuning of one or more frequencies. The front end of RF 206 can be configured to process signals, as provided by an antenna 204, which includes RF signals (for example, signal 110 of Figure 1) obtained from network devices. As an output, the front end of Rf 206 can provide data that is generally in the form of an analog or digitized baseband signal sent to the baseband processor 208.

In an example of the front end of RF 206, a single frequency, for example, a center frequency of the same channel, is used for RF communications via one or more of the nodes (for example, nodes 102 of Figure 1) of a network. In such an example, the front end of RF 206 can tune in or listen to a central frequency through a bandwidth as large as a wider bandwidth used by any supported protocol. In a second example of the front end of RF 206, a plurality of channels and / or frequencies can be used, and the front end of RF 206 can be configured to perform a functionality of

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

frequency jump between the plurality of channels. In some applications, the front end of RF 206 will be configured to tune between a channel used as a control channel and other channels used as data channels. The nodes can communicate in brief conversations on the control channel, and agree to transfer data in one of the data channels. Therefore, the front end of RF 206 can be configured to perform frequency hopping through a plurality of channels defined in a bandwidth.

The baseband processor 208 can be configured to modulate and / or demodulate data heard on any channel tuned or transmitted via the front end of RF 206. In particular, the baseband processor 208 can be configured for modulation and demodulation according to one or more protocols required by one or more nodes 102 (as seen in Figure 1).

The processing unit 112 may include a processor 114, a memory 116 and a clock 210. The clock 210 may be used to measure and / or timing windows of contention, frequency hopping, network and / or node functions and the like.

The memory 116 may include a list 212. In one example, the list comprises one or more of: indications of primary nodes (for example, by network ID); an associated contention window (CW) length; and a timeout associated with one or more of the containment windows. In one example, if a node has a single primary node, list 212 may contain indications of the primary's name or network ID, length indications of a primary contention window, and a timeout of the contention window of the primary primary. The waiting time is a period of time or an expiration time. Once the period has expired, or the expiration time has been reached, the content window of the primary node becomes “prescribed” and is no longer considered by the node when the node's own contention window is calculated. In one example, after the expiration of a primary window containing a primary, the node may instead establish its own contention window based on a CSMA / CA algorithm, without considering the prescribed content window of the primary node.

In some example implementations, the clock 210 may be a hardware device, while a timer 214 may be a program or module defined in memory 116, executable by processor 114 and configured to use the clock, in conjunction with one or more more algorithms, instructions, variables or flags. As such, timer 214 can be programmed to use clock 210 to time events, including skip channel, window or content windows and the like.

An algorithm 216 of multiple access by carrier detection with collision avoidance (CSMA / CA) can be defined in the memory 116, executable by the processor 114 and configured to calculate a "default" contention window for the node 200. In particular , the CSMA / CA algorithm 216 can calculate a contention window used in conventional nodes, and that is used only in certain circumstances by node 200.

A content window size calculation module 218 can be defined in the memory 116, executable by the processor 114 and configured to calculate a size (length and / or duration) of a content window 220. In one example, the content module Calculation of size of contention window 218 obtains the contention window or windows of the primary or primary of the list 212. If the time or wait times associated with the contention window or windows indicate that the contention windows are still valid and / or "in effect" is then used / used as input by the content window size calculation module 218. Additionally, the content window size calculation module 218 can obtain a contention window from algorithm 216 of CSMA / CA for use as input. This content window, from the CSMA / CA algorithm, is used by the node in a conventional network application. The content window size calculation module 218 of node 200 below determines the largest of the contention windows used as input and sets the contention window 220 for node 200 as the largest of the input contention windows.

A content window manager 222 can be defined in memory 116, executable by processor 114 and configured for any of several purposes. For example, the content window manager 222 can be configured to assist in the maintenance of the list 212. Additionally and / or as an alternative, the content window manager 222 can be configured to announce, in messages to neighbors, the size of the containment window 220 of the node, as calculated by the calculation module of size of containment window 218.

Sample Containment Window Operation

Figure 3 is a timing diagram 300 showing an example of how collisions of data packets transmitted through RF signals can be avoided. In one example, collisions are avoided by the use and / or operation of list 212, timer 214, CSMA / CA algorithm 216, contention window size calculation module 218 and contention window manager 222 of Figure 2. Timing diagram 300 shows time lines associated with a node, its primary and its secondary. The node is located upstream of the secondary node, but downstream of the primary node. In the example of Figure 1, the primary is closer to the cellular router 102A and the network 106. The example of Figure 3 illustrates how the node is given priority

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

primary, over the node, to transmit data through the operation of the containment window functions 212222 (as seen in Figure 2). And in particular, as a node, by assigning itself a window of content longer than its primary, it can provide priority to the primary.

In diagram 300, a first containment window 302 has just finished. The secondary node may have been alone between the nodes that wish to transmit and sends a request packet to send (RTS) 304 to the node (which may be the primary of the secondary node). The node responds with a free to send packet (CTS) 306. In response, the secondary node sends data 308. Upon completion of the transmission of the data 308, the node sends an acknowledgment 310.

During the transmission of data 308, at times 312 and 314, the primary node and the node, respectively, both decide that they have data that they wish to transmit. Therefore, the stage is set so that there are differences in the contention windows to avoid an RF collision. And in addition, the stage is set so that the contention window adjustment functionality, observed in node 200 of Figure 2, gives priority to the primary node. In the example in Figure 3, the primary node wishes to transmit data to the node. However, the primary node may alternatively wish to transmit to another node, such as its primary node. In addition, to avoid collisions, only one of the node and the primary node will be allowed to transmit after the conclusion of the transmission of the secondary node. Therefore, after the node provides an acknowledgment 310 of the transmission of the secondary node, a second containment period 316 begins, which will determine which, between the node and the primary node, is allowed to transmit next.

After acknowledgment 310, the transmission is stopped by all nodes. The next node allowed to transmit will be the node with the shortest contention period. Since all nodes have different periods of containment, potential collisions are avoided. In the example of Figure 3, after the primary node counts five empty time slots in the containment window, the containment window of the primary node terminates and sends an RTS 318 to the node. The node, whose containment window has not yet run out, realizes that this is not your turn to transmit. Therefore, the node sends a CTS 320 to the primary node, which indicates that the primary node is free to send (ie, to transmit). Therefore, the primary node sends data 322. Upon completion of the transmission of the data 322, the node sends an acknowledgment 324. In response to the acknowledgment 324, a third contention window 326 is initiated.

Therefore, Figure 3 illustrates that the primary node and the node both wish to send data at the next opportunity, that is, after the second containment window. However, since the node sets its containment window to be longer than its primary's containment window, the primary one terminates its containment window first, and sends the RTS 318, thereby causing the node have to wait until a subsequent contention window to send your data. From the network perspective, the behavior illustrated by Figure 3 provides an advantage, in that the upstream nodes are given priority, having shorter content windows, and therefore can send more data during intense network traffic . For example, as the network traffic approaches a network root node, the traffic is assumed by nodes that have shorter content windows than downstream nodes. Shorter content windows help these nodes to transmit more frequently on busy links.

Example methods

The example processes of Figures 4-8 can be understood in part by reference to the configurations of Figures 1-3. However, Figures 4-8 have general applicability, and are not limited by other figures in the drawings and / or analysis above.

Each process described in this document is illustrated as a collection of acts, blocks or operations in a logic flow chart, which represents a sequence of operations that can be implemented in hardware, software or a combination thereof. The processes may include storing, in a memory communicatively coupled to a processor, computer executable instructions for performing a method, such as a method of providing traffic load management for uplink network traffic, and executing the instructions in the processor

In the software context, the operations represent computer-executable instructions stored in one or more computer-readable storage media (for example, memory 116 of Figures 1 and 2) which, when executed by one or more processors (by For example, processors 114 of Figures 1 and 2) perform the indicated operations. Such a computer-readable storage medium, processors and instructions can be located in a system (for example, the system 100 of Figure 1 or the system 200 of Figure 2) according to a desired design or implementation. The storage medium 116 observed in Figures 1 and 2 is representative of the storage medium in general, both removable and non-removable and of any technology. Therefore, the indicated operations represent actions, such as those described in Figures 4-8, and are performed under the control of one or more processors configured with executable instructions to perform the indicated actions. In general, computer executable instructions include routines, programs, objects, components, data structures and the like that perform particular functions or

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

They implement particular abstract data types. The order in which the operations are described is not intended to be interpreted as a limitation, and the operations described can be combined in different orders and / or in parallel to implement the process. The above analysis can be applied to other processes described in this document.

The memory 116 may comprise computer-readable media that may take the form of volatile memory, such as random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Computer-readable media include removable and non-removable, volatile and non-volatile memory, implemented in any method or technology for storing information such as computer readable instructions, data structures, program modules or other data for execution by one or more. more processors of a computer device. Examples of computer readable media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, compact disc read-only memory (CD-ROM), digital versatile discs (DVD) or other optical storage , magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission means that can be used to store information for access through an information device. As defined herein, computer readable media does not include media, such as modulated data signals and carrier waves.

Additionally, for the purposes of this document, a computer-readable medium may include all or part of a specific application integrated circuit (ASIC) or other hardware device. Such a hardware device can be configured to include other functionality, which includes functions that provide traffic load management for uplink network traffic. Therefore, within such an integrated circuit, one or more processors are configured with executable instructions, which can be defined by logic, transistors or other components or in integrated memory.

Example uplink network traffic load management methods

Figure 4 is a flowchart illustrating an example method 400 by which the uplink network traffic can be managed. In step 402, a node maintains a list, database, data structure and / or data storage that includes information about the node or primary nodes of the node. In the example of Figure 2, list 212 includes information about the primary nodes, their containment windows and their expiration times and / or waiting times. The list can be maintained, for example, by the containment window manager 222. The list can include the node or network ID of the node's primary or primary. The list may include a size or an indicator of a size of a window containing one or more primary nodes in the list. Additionally, for each contention window, the list may include a timeout and / or expiration time of the contention window. After the timeout period has elapsed, or the expiration time has been reached, the content window with which the timeout is associated is no longer considered valid and / or usable. Therefore, the node can set its contention window to another value entered in a contention window adjustment algorithm. For example, the node can set its containment window to a calculated value of CSMA / CA. The node can keep the list listening on a control channel when the node is not transmitting or receiving data on other channels. In particular, the nodes can use the control channel to publish content window information. The nodes can also use RTS and / or CTS packages to publish or declare contention window information.

In operation 404, a containment window may be set to be longer than a containment window of a node primary. Therefore, a node, which has maintained the list analyzed in step 402, may establish a containment window to be longer than the containment windows of any, some or all of its primary or primary. This tends to put the node or primary nodes at an advantage, following the conclusion of the transmission over a channel, in which the node's primary, which has a shorter content window, will have priority over the node when both wish to use a channel / frequency. In the example of Figure 2, the content window size calculation module 218 can be used to perform operation 404.

In step 406, a size of a containment window can be announced, at least to neighbors 1 hop downstream from the node. Neighbors at 1 hop downstream may include nodes that are within the RF signal range of the node, that is, nodes with which the node can communicate. The announcement of the size of the node containment window can be made particularly to nodes of the secondary node (downstream), that is, nodes that are downstream of the node. The announcement can be considered a publication, and can be used for the receiving nodes to update their list (see step 402). In the example of Figure 2, the content window manager 222 can be configured to perform operation 406. Note that while a node can set its contention window to be longer than the contention windows of its primary ones, the Secondary node can also set their containment windows to be longer than the node containment window. Therefore, downstream nodes may generally have longer containment windows, thus helping upstream nodes where a bottleneck is most likely.

5

10

fifteen

twenty

25

30

35

40

Four. Five

fifty

55

60

65

In operation 408, the node can exchange RTS and / or CTS packets with another node. One or both of such packages may include content window size information. Therefore, the nodes that listen to a control channel can by chance listen to nodes that reveal information of contention window size. Having heard this information by chance, the node can update its list, if appropriate (for example, as in operation 402).

In step 410, data can be sent via a node to its primary node. The shipment can begin after a wait indicated by the containment window. Since the node will have set its containment window to be longer than that of the primary node (see operation 404), the node will not transmit data to the primary if the primary needs the transmission channel during the node's waiting period.

In step 412, data can be received by the node from a 1-hop neighbor, such as a node node. Reception can begin after a longer period of time than the content window of the announced node. Therefore, if the node needs the channel for its own transmission, its own shorter content window will allow it to start using the channel before the downstream neighbors at 1 hop (for example, secondary nodes) can begin use .

Figure 5 is a flow chart illustrating an example method 500 by which information can be managed with respect to windows containing neighboring nodes. As such, method 500 provides an example and / or additional information on how contention window information can be obtained, and how list 212 of Figure 2 can be maintained, as discussed in step 402 of Figure 4. In the operation 502, the indications of the content window lengths can be received by a node from one or more primary of the node. The indications can be provided by the publications, by means of RTS / CTS packages, or other packages expressly intended to transfer information of content window size, or the like.

In step 504, a publication can be received from the root node that serves as a connection point for the ARA to a backhaul network (for example, node 102A in Figure 1). From the point of view of uplink communication, the root node is a single upstream primary of all neighboring nodes at 1 hop. Since the root node has no upstream primary, it will not maintain a containment window size for its own uplink communication. However, the root node can monitor uplink communications from all neighbors at 1 hop and can calculate and / or optimize the content window size to be used by its neighboring nodes that can increase or maximize the overall uplink flow or minimize uplink delay. This calculation can be done using the content window size calculation module 218 in Figure 2. The root node can then announce the optimal content window size to all neighboring nodes. In one example, the containment window sizes announced by the root to a plurality of downstream neighbors at 1 jump from the root are sized and / or calculated by the root to provide shorter content windows to neighbors at 1 jump from the root. root required to transmit more data and longer content windows to neighbors within 1 jump of the root required to transmit less data. Publication from the root node can also be, or as an alternative, to other means by which a node can receive contention window information. In the example of Figure 2, the content window manager 222 can receive and / or manage this publication.

In step 506, a plurality of primaries of a node, a plurality of containment windows (for example, indications of containment window times), and a plurality of wait times the containment windows, respectively, can be organized into a list. In the example of Figure 2, the list 212 may be maintained by the content window manager 222, or the like.

Figure 6 is a flowchart illustrating an example method 600 by which timeout periods of containing windows of other nodes can be managed. As such, method 600 provides an example and / or additional information on how the contention window information can be made to expire and be maintained in list 212 of Figure 2, as discussed in step 402 of Figure 4. In general , a contention window is used only before the expiration of its timeout period. The contention window is not used following the timeout period, which can be expressed as a back account period or a date and time, or the like. Since the contention window is not used, another input to the contention window size calculation module 218 can be used instead (see Figure 2). For example, the content window calculated using CSMA / CA algorithm 216 can be used.

In step 602, one or more window timeout periods are monitored for expiration. This may include counting back the waiting periods or observing the arrival of a time in which the contention window expires.

In step 604, a default contention window is used after the expiration of a timeout period. The default contention window can be used in any algorithm configured to select a contention window for the node. In the example of Figure 2, list 212 can be used to record the primary node ID, the content window size and the contention window timeout. The module of

5

10

fifteen

twenty

25

30

35

40

Four. Five

Containment window size calculation 218 can manage list 212 and determine if a containment window of a primary node has expired. If it has expired, the content window size calculation module 218 may instead use a contention window provided by, for example, the default CSMA / CA algorithm.

Figure 7 is a flow chart illustrating an example method 700 by which a node can select its own containment window, using as input indications of containment windows from other nodes. As such, method 700 provides an example and / or additional information on how containment windows can be selected, as discussed in step 404 of Figure 4. In general, method 700 provides selection of a containment window for a node that is longer than the upstream neighbors at 1 jump (for example, primary) of the node.

In step 702, a publication received by a node, or the list (for example, list 212 of Figure 2) maintained by the node, is consulted, and the indications of (for example, information about) windows are obtained. content of upstream neighbors at 1 jump.

In step 704, the node containment window is set as long as, or longer than, the longest of: the longest containment window used by upstream neighbors 1 hop from the node; and, a contention window based on a CSMA / CA algorithm. In one example, only upstream 1-hop neighbors who are primary to the node are considered. In another example, the expiration of the windows containing neighbors upstream at 1 jump is considered.

Figure 8 is a flow chart illustrating an additional example method by which a node can select its own containment window, using as input indications of containment windows from other nodes. As such, method 800 provides an example and / or additional information on how content windows can be selected, as discussed in step 404 of Figure 4. In general, method 800 provides the selection of a content window for a node that is longer than known upstream neighbors and / or primaries. For example, a contention window can be selected that is equal to, or longer than, neighbors upstream at 1 hop (for example, primary) of the node, and equal to, longer than, a default contention window of CSMA /AC.

In operation 802, a contention window is calculated based on a default algorithm, such as the CSMA / CA algorithm. An algorithm of this type can be used in known networks, to establish a window containing a node. In step 804, the content window obtained from the CSMA / CA algorithm is compared with one or more content windows taken from a list of content windows (for example, list 212 of Figure 2). The list may include windows containing the node's primary, upstream neighbors, 1 hop neighbors and the like. In step 806, a containment window is selected as long as, or longer than, the containment windows in the comparison of step 804. Therefore, the node is configured with a containment window that is not shorter than its primary and / or neighbors upstream at 1 jump.

Conclusion

Although the subject matter has been described in specific language to structural features and / or methodological acts, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described. Instead, specific features and acts are disclosed as exemplary ways of implementing the claims.

Claims (12)

5 10 fifteen twenty 25 30 35 40 Four. Five fifty 55 60 1. A method for controlling a size of a containment window (220) in a node (102) in a network (100), in which a containment window is a period of time during which a node waits to transmit, after the interruption of radio frequency signals in a particular channel, before transmitting, comprising: under the control of one or more processors (114) on node (102) and configured with executable instructions: maintaining a list (212), in which the list (212) is maintained in the node (102) and comprises a size of a window containing (220) a primary node (102) of the node (102); establish a containment window (220) for the node (102) so that it is not shorter than a containment window (220) of the primary node (102) of the node (102), as indicated by the list (212); and send data to the primary node (102) of the node (102), starting the shipment after a wait indicated by the contention window (220) of the node (102), in which: Maintain the list (212) includes: associating a plurality of primaries in the list (212) with a plurality of containment windows (220), respectively, and a plurality of timeouts, respectively, each timeout period governing the expiration of a contention window (220) associate; Y set the contention window (220) includes: monitor the plurality of waiting periods in terms of expiration; Y After the expiration of a timeout period, use a default contention window to replace a contention window (220) associated with the expired timeout period. 2. The method of claim 1, wherein: maintaining the list (212) of sizes of containment windows (220) comprises: receiving a publication from a root node (102); and establishing the contention window (220) comprises: check the publication for the longest containment window (220) used by neighbors 1 hop upstream of the node (102); Y set the contention window (220) to be the longest of: the longest containment window (220) used by neighbors 1 hop upstream of the node (102); and a contention window (220) based on a multiple access algorithm (216) by carrier detection with collision avoidance (CSMA / CA). 3. The method of claim 1, wherein establishing the contention window (220) comprises: calculate a contention window (220) based on a multiple access algorithm (216) by carrier detection with collision avoidance (CSMA / CA); compare the contention window (220) calculated with a contention window (220) in the list (212) of size window sizes (220); Y select the longest of the calculated containment window (220) and the containment window (220) in the list (212) of containment window sizes (220). 4. The method of claim 1, wherein establishing the contention window (220) comprises: set the containment window (220) to be longer than containment windows (220) used by neighbors 1 hop upstream of the node (102). 5. The method of claim 1, wherein establishing the contention window (220) comprises: expire a contention window (220) from the list (212) according to its timeout period; and set the contention window (220) of the node (102) so that it is not shorter than the primary ones of the node (102) using unexpired portions of the list (212) as input. 5 10 fifteen twenty 25 30 35 40 Four. Five fifty 55 60 6. The method of claim 1, further comprising: exchange RTS (304) and CTS (306) packets with neighbors of the node (102); and include a size of the contention window (220) in the exchange. 7. The method of claim 1, further comprising: receive data from a secondary node (102) of node (102), in which the data is received on a channel after a period of time after the channel is free, the period of time being longer than the window of containment (220) of the node (102); in which sending data to the primary node (102) of the node (102) includes sending in a second channel after a second period of time after the second channel becomes free, the second period of time being longer than a window of announced content (220) of the primary node (102). 8. The method of claim 1, further comprising: announce a size of the contention window (220) of the node (102) to neighbors 1 hop from the node (102); and receive data from a node (102) neighbor 1 hop downstream in a channel, in which the data was received after a period of time after the channel was free, being the period of time longer than the size of contention window (220) announced. 9. The method of any of the preceding claims, implemented in a computer-readable medium. 10. A node (102) in a network (100), comprising: a processor (114); memory (116), in communication with the processor (114); a list (212), defined in memory (116) and which includes indications of a node primary (102), a size of a containment window (220) associated with the primary, and a timeout associated with the window of contention (220); a timer (214) to manage the waiting times in the list (212); a contention window size calculation module (218), defined in the memory (116) and configured to calculate a size of a contention window (220) of the node (102), using as input: a multiple access algorithm (216) by carrier detection with collision avoidance (CSMA / CA); and list data (212); wherein the size of the contention window (220) of the node (102) is determined by comparing the input; and a contention window manager defined in memory (116) and configured to announce, in messages to neighbors, the size of the contention window of the node (102), as calculated by the calculation module of window size of containment (218), in which the size of the containment window (220) of the node (102) is not shorter than the containment window (220) of the primary of the node (102); and in which a containment window is a period of time during which a node waits to transmit, after the interruption of radio frequency signals on a particular channel, before transmitting, in which the window size calculation module of Content (218) is additionally configured to: associating a plurality of primaries in the list (212) with a plurality of timeouts, respectively, each timeout period governing the expiration of an associated content window (220); monitor the plurality of waiting periods in terms of expiration; Y After the expiration of a timeout period from among the plurality of timeout periods, use a default contention window to replace a contention window (220) associated with the expired timeout period. 11. The node (102) of claim 10, wherein the content window size calculation module (218) is further configured to: calculate a contention window (220) based on a CSMA / CA algorithm (216); maintain the list (212) using a publication from a root node (102); compare the contention window (220) calculated with a contention window (220) in the list (212); and select the longest of the calculated content window (220) and the content window (220) in the list (212). 12. The node (102) of claim 10, wherein the content window size calculation module (218) is further configured to: calculate the size of the contention window (220) of the node (102) based in part on an indication of a size of a contention window (220) from a network root (100), if the root is located at 1 jump upstream of the node (102), in which the indication of the size of the containment window (220) from the root is based in part on indications of size of containment windows (220) sent to other neighbors within 1 hop of the rafz 10 13. The node (102) of claim 10, wherein the content window manager is configured additionally for: announce the size of the containment window (220) to downstream neighbors 1 hop from the node (102); in which data is received from a neighbor 1 hop downstream in a channel after a period of time after the channel is free, the period of time being greater than the size of the contention window (220) announced.