JAMMING GRAPH AND ITS APPLICATION IN NETWORK RESOURCE ASSIGNMENT
First Claim
1. A method for allocation of wireless resources between nodes, comprising:
- employing a processor executing computer executable instructions stored on a computer readable storage medium to implement the following acts;
determining at least one over-the-air resource used by a node and used by neighboring nodes of a neighborhood; and
negotiating with a neighboring node to assign resources without shared resource use between a pair of nodes in a jamming relationship.
1 Assignment
0 Petitions
Accused Products
Abstract
A wireless communication network uses backhaul negotiation based upon static and dynamic resource assignment on jamming graphs. Static reuse factor design methods including fractional frequency reuse (FFR) are addressed. The jamming graph is used to summarize the interfering relationship between transmitters (nodes in the jamming graph). Negotiation-based algorithm is used to arrive at a static resource assignment so that a large reuse factor can be achieved while jamming scenario can be avoided. As a result of such algorithm, each transmitter is assigned some resources, over which traffic transmission can be done instantaneously to reduce the packet delay for short packets. Based on the result of static resource negotiation algorithm, a dynamic resource algorithm can be run, such that the resources assigned to different nodes can be share in a bursty traffic scenario to further reduce packet delay for larger packet size cases, while jamming be also avoided.
-
Citations
98 Claims
-
1. A method for allocation of wireless resources between nodes, comprising:
-
employing a processor executing computer executable instructions stored on a computer readable storage medium to implement the following acts; determining at least one over-the-air resource used by a node and used by neighboring nodes of a neighborhood; and negotiating with a neighboring node to assign resources without shared resource use between a pair of nodes in a jamming relationship. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A computer program product for allocation of wireless resources between nodes, comprising:
-
computer readable storage medium having stored thereon the following computer executable components; a first set of instructions for determining at least one over-the-air resource used by a node and used by neighboring nodes of a neighborhood; a second set of instructions for negotiating with a neighboring node to assign resources without shared resource use between a pair of nodes in a jamming relationship.
-
-
15. An apparatus for allocation of wireless resources between nodes, comprising:
-
at least one processor; at least one computer readable storage medium storing computer executable instructions that when executed by the at least one processor implement components comprising; means for determining at least one over-the-air resource used by a node and used by neighboring nodes of a neighborhood; and means for negotiating with a neighboring node to assign resources without shared resource use between a pair of nodes in a jamming relationship.
-
-
16. An apparatus for allocation of wireless resources between nodes, comprising:
-
a transmitter for transmitting data packet communication to a served terminal; a receiver for receiving data packet communication from the served terminal; and a backhaul communication component for determining at least one over-the-air resource used by a node and used by neighboring nodes of a neighborhood, and for negotiating with a neighboring node to assign resources use without shared resource use between a pair of nodes in a jamming relationship. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29)
-
-
30. A method for centralized static allocation of wireless resources between nodes, comprising:
-
employing a processor executing computer executable instructions stored on a computer readable storage medium to implement the following acts; defining a wireless communication network comprising a plurality of nodes that serve respective terminals; determining nodes that are linked based upon serving or jamming a selected terminal; and assigning resources by backhaul signaling to the plurality of nodes for efficient resource use without shared resource use between a pair of nodes in a jamming relationship. - View Dependent Claims (31, 32, 33, 34, 35, 36, 37, 38)
-
-
39. A computer program product for centralized static allocation of wireless resources between nodes, comprising:
-
computer readable storage medium having stored thereon the following computer executable components; a first set of instructions for defining a wireless communication network comprising a plurality of nodes that serves respective terminals; a second set of instructions for determining nodes that are linked based upon serving or jamming a selected terminal; and a third set of instructions for assigning resources by backhaul signaling to the plurality of nodes for efficient resource use without shared resource use between a pair of nodes in a jamming relationship.
-
-
40. An apparatus for centralized static allocation of wireless resources between nodes, comprising:
-
at least one processor; at least one computer readable storage medium storing computer executable instructions that when executed by the at least one processor implement components comprising; means for defining a wireless communication network comprising a plurality of nodes that serve respective terminals; means for determining nodes that are linked based upon serving or jamming a selected terminal; and means for assigning resources by backhaul signaling to the plurality of nodes for efficient resource use without shared resource use between a pair of nodes in a jamming relationship.
-
-
41. An apparatus for centralized static allocation of wireless resources between nodes, comprising:
-
a transmitter for transmitting data packet communication to a served terminal; a receiver for receiving data packet communication from the served terminal; and a backhaul communication component for defining a wireless communication network comprising a plurality of nodes that serve respective terminals, for determining nodes that are linked based upon serving or jamming a selected terminal, and for assigning resources by backhaul signaling to the plurality of nodes for efficient resource use without shared resource use between a pair of nodes in a jamming relationship. - View Dependent Claims (42, 43, 44, 45, 46, 47, 48, 49, 50)
-
-
51. A method for dynamically requesting grant of resources in order to transmit data packet communication, comprising:
-
employing a processor executing computer executable instructions stored on a computer readable storage medium to implement the following acts; receiving a data packet for transmission at a first node in communication with a neighboring node of a network neighborhood; accessing information for over-the-air resources assigned to the neighboring node; requesting a temporary grant for the resources from the neighboring node; receiving a grant for the resources from the neighboring node; and transmitting the data packet using the granted resources. - View Dependent Claims (52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73)
-
-
74. A computer program product for dynamically requesting grant of resources in order to transmit data packet communication, comprising:
-
at least one computer readable storage medium storing computer executable instructions that when executed by at least one processor implement components comprising; a first set of instructions for receiving a data packet for transmission at a first node in communication with a neighboring node of a network neighborhood; a second set of instructions for accessing information for over-the-air resources assigned to the neighboring node; a third set of instructions for requesting a temporary grant for the resources from the neighboring node; a fourth set of instructions for receiving a grant for the resources from the neighboring node; and a fifth set of instructions for transmitting the data packet using the granted resources.
-
-
75. An apparatus for dynamically requesting grant of resources in order to transmit data packet communication, comprising:
-
means for employing a processor executing computer executable instructions stored on a computer readable storage medium to implement the following acts; means for receiving a data packet for transmission at a first node in communication with a neighboring node of a network neighborhood; means for accessing information for over-the-air resources assigned to the neighboring node; means for requesting a temporary grant for the resources from the neighboring node; means for receiving a grant for the resources from the neighboring node; and means for transmitting the data packet using the granted resources.
-
-
76. An apparatus for dynamically requesting grant of resources in order to transmit data packet communication, comprising:
-
a receiver for receiving a data packet for transmission at a first node in communication with a neighboring node of a network neighborhood; a computer readable storage medium for accessing information for over-the-air resources assigned to the neighboring node; a backhaul communication component for requesting a temporary grant for the resources from the neighboring node and for receiving a grant for the resources from the neighboring node; and a transmitter for transmitting the data packet using the granted resources. - View Dependent Claims (77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98)
-
Specification