Scheduling method in a wireless network

• US 20060126559A1
• Filed: 12/15/2005
• Published: 06/15/2006
• Est. Priority Date: 12/15/2004
• Status: Abandoned Application

• Current Assignee: Samsung Electronics Co. Ltd. (Samsung Group), Seoul National University Industry Foundation (Seoul National University)
• Original Assignee: Samsung Electronics Co. Ltd. (Samsung Group), Seoul National University Industry Foundation (Seoul National University)
• Inventors: Lee, Ok-Seon, Bahk, Sae-Woong, Choi, Young-June, Jun, Jung-Hyun
• Application Number:
  US11/304,197
• Publication Number:
  US 20060126559A1
• Time in Patent Office: Days
• US Class Current: 370/329
• CPC Class Codes: H04L 12/2854 Wide area networks, e.g. public data networks
• CPC Class Codes: H04L 47/10 Flow control; Congestion control
• CPC Class Codes: H04L 47/2433 Allocation of priorities to traffic types
• CPC Class Codes: H04W 28/02 Traffic management, e.g. flow control or congestion control
• CPC Class Codes: H04W 72/23 in the downlink direction of a wireless link, i.e. towards a terminal
• CPC Class Codes: H04W 72/569 of the traffic information
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]

Abstract

A method for performing scheduling on tasks formed for communication between a plurality of nodes in a wireless network having the nodes and a coordinator for coordinating communication between the nodes. Each of the nodes calculates an affinity for at least one task in which the corresponding node participates, and transmits the calculated task affinity to the coordinator. The coordinator assigns priorities to the tasks in the order of level of the task affinities received from the nodes, and transmits the assigned priorities to the nodes.

Claims

1. A method for performing scheduling on tasks formed for communication between a plurality of nodes in a wireless network supporting communication between the nodes, the method comprising the steps of:

calculating affinities for the nodes;

calculating affinities for the tasks according to the calculated node affinities; and

assigning priorities to the tasks in the order of level of the calculated task affinities.

2. The method of claim 1, wherein each of the node affinities is the number of tasks formed by a corresponding node.

3. The method of claim 1, wherein each of the node affinities is the product of the number of tasks formed by a corresponding node and a task size.

4. The method of claim 1, wherein each of the task affinities is the sum of an affinity of a source node and an affinity of a destination node forming a corresponding task.

5. The method of claim 1, further comprising assigning priorities to tasks having the same affinity according to their amounts of required resources.

6. The method of claim 1, wherein the priority assigning step comprises assigning a higher priority to a lower-affinity task.

7. The method of claim 5, wherein the priority assigning step comprises assigning a higher priority to a task with smaller required resources among the tasks having the same affinity.

8. A method for performing scheduling on tasks by a coordinator in a wireless network in which the tasks are formed for communication between a plurality of nodes and the nodes transmit information on the tasks, the method comprising:

receiving information on the tasks from the nodes;

calculating affinities for the nodes according to the task information;

calculating affinities for the tasks according to the calculated node affinities;

assigning priorities to the tasks in the order of level of the calculated task affinities; and

transmitting the assigned priorities to the nodes.

9. The method of claim 8, wherein each of the node affinities is the number of tasks formed by a corresponding node.

10. The method of claim 8, wherein each of the node affinities is the product of the number of tasks formed by a corresponding node and a task size.

11. The method of claim 8, wherein each of the task affinities is the sum of an affinity of a source node and an affinity of a destination node forming a corresponding task.

12. The method of claim 8, further comprising assigning priorities to tasks having the same affinity according to their amounts of required resources.

13. The method of claim 8, wherein the priority assigning step comprises assigning a higher priority to a lower-affinity task.

14. The method of claim 12, wherein the priority assigning step comprises assigning a higher priority to a task having the smaller amount of required resources among the tasks having the same affinity.

15. A method for performing scheduling on tasks by a coordinator in a wireless network in which tasks are formed for communication between a plurality of nodes and the nodes transmit information on the tasks, the method comprising:

receiving information on the tasks from the nodes;

assigning priorities to the tasks according to their amounts of required resources, acquired from the task information;

if there are tasks having the same amount of required resources, calculating affinities for nodes forming the tasks having the same amount of required resources according to the task information;

calculating affinities for the tasks having the same amount of required resources according to the calculated node affinities;

assigning priorities to the tasks having the same amount of required resources in the order of level of the calculated task affinities; and

transmitting the priorities to the nodes.

16. The method of claim 15, wherein each of the node affinities is the number of tasks formed by a corresponding node.

17. The method of claim 15, wherein each of the node affinities is the product of the number of tasks formed by a corresponding node and a task size.

18. The method of claim 15, wherein each of the task affinities is the sum of an affinity of a source node and an affinity of a destination mode forming a corresponding task.

19. The method of claim 15, wherein the priority assigning step comprises assigning a higher priority to a task having the smaller amount of required resource.

20. The method of claim 19, wherein the priority assigning step comprises assigning a higher priority to a lower-affinity task among the tasks having the same amount of required resources.

21. A method for performing scheduling on tasks formed for communication between a plurality of nodes in a wireless network having the nodes and a coordinator for coordinating communication between the nodes, the method comprising:

calculating an affinity for at least one task in which the corresponding node participates, and transmitting the calculated task affinity to the coordinator;

assigning priorities to the tasks in the order of level of the task affinities received from the nodes; and

transmitting the assigned priorities to the nodes.

22. The method of claim 21, wherein each of the task affinities is calculated as the sum of an affinity of a source node and an affinity of a destination node forming a corresponding task, and the affinities of the source node and the destination node are calculated by the number of formed tasks.

23. The method of claim 21, wherein the priority assigning step comprises assigning a higher priority to a lower-affinity task.

24. The method of claim 23, further comprising assigning priorities to tasks having the same affinity according to their amounts of required resources.

25. The method of claim 24, wherein the priority assigning step comprises assigning a higher priority to a task having the smaller amount of required resources among the tasks having the same affinity.