Back to results
US 8,027,327 B2Granted
Distributed scheduling in wireless networks with service differentiation
AssigneeAlcatel Lucent
InventorsPiyush Gupta, Yogesh Sankarasubramaniam, Aleksandr Stolyar
Life of this patent
Estimating the term…
Abstract
An apparatus includes a first node configured to transmit both data frames and requests for channel reservations to a local contention neighborhood of a network. The first node is configured to compete with other nodes of the neighborhood for reservations to the channel. The first node is configured to dynamically update a stored value of an access priority for the first node and to transmit said requests with a rate that depends on the stored value.
Claims26
An apparatus, comprising:
- a first node configured to transmit both data frames and requests for channel reservations to a local contention neighborhood of a network, the first node being configured to compete with other nodes of the neighborhood for reservations to the channel;
- and
- wherein the first node is configured to:
- dynamically update an access contention level from monitoring collisions between requests or grants of channel reservations from the other nodes during contention time slots;
- dynamically update a stored value of an access priority for the first node that corresponds to the access contention level;
- and
- transmit the requests with a rate responsive to the stored value of the access priority.
4 more elements
A method, comprising:
- storing a value of an access priority for a first node of a local contention neighborhood, the neighborhood having a plurality of other nodes that compete with the first node for access to a channel, wherein the access priority corresponds to a contention level of the neighborhood, the contention level dynamically updated from a monitoring of collisions between requests or grants of channel reservations from the plurality of other nodes during contention time slots;
- transmitting a plurality of requests for reservations of the channel from the first node, the rate of the transmitting the requests depending on the stored value of the access priority;
- and
- wherein the storing includes updating the stored value of the access priority between transmitting ones of the requests.
1 more element
A method, comprising:
- monitoring for requests of channel reservation or grants of channel reservations to nodes of a local contention neighborhood and for collisions between the requests or grants, the monitoring being performed by one of the nodes;
- and
- updating a value of an access threshold stored in the one of the nodes in response to the monitoring sensing a request or grant of a channel reservation to one of the other nodes, the updating replacing the stored value of the access threshold with a value obtained from the sensed request or grant;
- and
- transmitting a request for a channel reservation from the one of the nodes in response to an access priority of the one of the nodes passing a threshold associated with the stored value of the access threshold, wherein the access priority corresponds to a contention level of the neighborhood, the contention level dynamically updated from the monitoring of collisions during contention time slots.
2 more elements
A system for distributed scheduling, comprising:
- a plurality of nodes belonging to a local contention neighborhood, each node being configured to transmit requests for channel reservations and data frames to other nodes of the neighborhood and being able to compete with the other nodes for access to the channel;
- and
- wherein each node is configured to:
- store a value for an access contention level in the neighborhood, the stored value dynamically updated from a monitoring of collisions between the requests or grants of channel reservations from the plurality of nodes during contention time slots;
- transmit the requests at a rate that decreases as the stored value increases;
- and
- decrease the stored value in a manner proportional to the stored value in response to sensing a successful transmission of a request for a channel reservation between two of the nodes in the neighborhood.
4 more elements
A method for operating a node in a wireless network, comprising:
- receiving a request for a channel reservation from a first node of a local contention neighborhood of the network, wherein the request includes an access priority corresponding to a contention level of the neighborhood, the contention level dynamically updated from a monitoring of collisions between requests or grants of channel reservations from nodes in the neighborhood during a contention time;
- and
- transmitting a grant of the channel reservation to the local contention neighborhood in response to the deciding to grant the request from the first node;
- and
- wherein the transmitted grant includes a new value of a channel access threshold for the neighborhood, nodes of the neighborhood having access priorities below a threshold fixed by the channel access threshold being unable to transmit a request for a channel reservation.
2 more elements
A system, comprising:
- plurality of nodes capable of transmitting data frames in a local contention neighborhood of a wireless network, the nodes being configured to compete with each other for access to a shared channel of the wireless network;
- and
- wherein each node is configured to store and dynamically update an associated access priority variable, the access priority variable corresponding to a contention level of the neighborhood which is dynamically updated from a monitoring of collisions between requests or grants of channel reservations from the plurality of nodes during contention time slots, a probability of one of the nodes of requesting access to the channel depending on a value of the access priority variable stored in the one of the nodes.
Dependencies are inferred from the claim text.