System and method for collision-free transmission scheduling in a network
First Claim
Patent Images
1. A method for scheduling communication of a data packet in a network, comprising:
- sending a scheduling request over an access point tree to an access point, wherein the scheduling request comprises an aggregate of time slot requests associated with at least a node and a next hop node; and
receiving a scheduling decision over the access point tree at the node and the next hop node, wherein each time slot request in the scheduling decision is reserved for at least the next hop node and the node, and wherein the scheduling decision enables the node to communicate the data packet collision-free over orthogonal data channels associated with the next hop node and the node.
2 Assignments
0 Petitions
Accused Products
Abstract
A system and method is directed to enabling a collision-free transmission of a packet in a network by employing an access-point tree optimized MAC (ATOM) mechanism. The system enables a node in an ad hoc network to determine a collision-free transmission schedule based in part on information the node has about a distance to an access point along a routing tree rooted at the access point. The node may be assigned a time slot for collision-free transmission based in part on a bandwidth demand at the node, and traffic the node has to forward on behalf of a neighbor node.
191 Citations
36 Claims
-
1. A method for scheduling communication of a data packet in a network, comprising:
-
sending a scheduling request over an access point tree to an access point, wherein the scheduling request comprises an aggregate of time slot requests associated with at least a node and a next hop node; and
receiving a scheduling decision over the access point tree at the node and the next hop node, wherein each time slot request in the scheduling decision is reserved for at least the next hop node and the node, and wherein the scheduling decision enables the node to communicate the data packet collision-free over orthogonal data channels associated with the next hop node and the node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
15. A node for scheduling communication of a data packet in a network, comprising:
-
a transceiver for sending a scheduling request over an access point tree to an access point and for receiving a scheduling decision over the access point tree from the access point; and
a transcoder that is configured to perform actions, including;
enabling the scheduling request to comprise an aggregate of time slot requests associated with at least the node and a next hop node;
employing the scheduling decision to determine each time slot request that is reserved for at least the next hop node and the node, wherein the scheduling decision enables the node to communicate the data packet collision-free over orthogonal data channels associated with the next hop node and the node. - View Dependent Claims (16, 17, 18, 19, 20, 21, 22, 23, 24)
-
-
25. A system for scheduling communication of a data packet in a network, comprising:
a node that is configured to perform actions, including;
sending a scheduling request over an access point tree to an access point, wherein the scheduling request comprises an aggregate of time slot requests associated with at least the node and a next hop node; and
an access point that is configured to perform actions, including;
determining a scheduling decision over the access point tree in response to the aggregated request; and
transmitting the scheduling decision over the access point tree to the node and the next hop node, wherein each time slot request in the scheduling decision is reserved for at least the next hop node and the node, and wherein the scheduling decision enables the node to communicate the data packet collision-free over orthogonal data channels associated with the next hop node and the node. - View Dependent Claims (26, 27, 28, 29, 30, 31, 32, 33)
-
34. A method for scheduling communication of a data packet transmission in a network, comprising:
-
assigning a node to an access point;
selecting an anchor node for the node, wherein the anchor node is selected as a next hop node along a hop path to the access point;
determining an access point tree based in part on the selected anchor node;
sending a scheduling request over the access point tree to the access point, wherein the scheduling request comprises an aggregate of time slot requests associated with at least the node and the anchor node;
determining a scheduling decision in response to the scheduling request; and
receiving the scheduling decision over the access point tree at the node and the anchor node, wherein each time slot request in the scheduling decision is reserved for at least the anchor node and the node, and wherein the scheduling decision enables the node to communicate the data packet collision-free over orthogonal data channels associated with the anchor and the node.
-
-
35. A computer-readable medium encoded with a message packet, comprising a control packet means for communicating transmission-scheduling information between nodes in a network.
-
36. An apparatus for scheduling communication of a data packet in a network, comprising:
-
a means for sending a scheduling request over an access point tree to an access point, wherein the scheduling request comprises an aggregate of time slot requests associated with at least a node and a next hop node; and
a means for receiving a scheduling decision over the access point tree at the node and the next hop node, wherein each time slot request in the scheduling decision is reserved for at least the next hop node and the node, and wherein the scheduling decision enables the node to communicate the data packet collision-free over orthogonal data channels associated with the next hop node and the node.
-
Specification