Scheduling algorithm for linear networks
In accordance with the present disclosure, embodiments of an exemplary scheduling controller module or device implement and improved scheduling process such that the targeted reduction in schedule length can be achieve while incurring minimal energy penalty by allowing for a large rate (or duration) selection alphabet.
1. A link scheduling controller device comprising:
a controller that assigns different duration slots to a plurality of sensor nodes within a linear wireless sensor network; and
a transmitter that communicates a schedule of the assigned duration slots to the respective sensor nodes within the linear wireless sensor network,
wherein the controller calculates the different duration slots to minimize an average power consumption of the plurality of sensor nodes, based on a search matrix X, and subject to an upper bound on a total length of the schedule.
2. The link scheduling controller device of claim 1 , wherein the schedule of the assigned duration slots utilizes a duration alphabet of size M whose members comprise x 1 , x 2 , . . . , x m , . . . , x M , where x 1 <x 2 <x m <x M .
3. The link scheduling controller device of claim 1 , wherein the controller utilizes a punctured forward error correction technique to define the respective length of time for the duration slots, and is further configured to,
generate a utilization matrix U for the plurality of sensor nodes;
generate, using the utilization matrix U, a rate matrix T;
generate, using the rate matrix T, a translation matrix T′, wherein the translation matrix T′ is smaller than the rate matrix T; and
generate, using the translation matrix T′, the search matrix X.
4. The link scheduling controller device of claim 1 , wherein the schedule is communicated to the plurality of sensor nodes at startup of the link scheduling controller device.
5. The link scheduling controller device of claim 1 , further comprising a receiver that receives a message from the respective node that was transmitted by the respective node during the assigned duration slot for the respective sensor node.
6. The link scheduling controller device of claim 1 , wherein the link scheduling controller device comprises a base station device.
7. The link scheduling controller device of claim 1 , wherein a rate at which data is routed over the linear wireless sensor network changes from link to link and from time to time over the linear wireless sensor network.
8. The link scheduling controller device of claim 1 , wherein the respective sensor node transmits data during the assigned duration slot for the respective sensor node.
9. A link scheduling method comprising:
assigning different duration slots to a plurality of sensor nodes within a linear wireless sensor network; and
communicating a schedule of the assigned duration slots to the respective sensor node within the linear wireless sensor network,
wherein the different duration slots are calculated, with a controller of the linear wireless sensor network, to minimize an average power consumption of the plurality of sensor nodes, based on a search matrix X, and subject to an upper bound on a total length of the schedule.
10. The link scheduling method of claim 9 , wherein the schedule of the assigned duration slots utilizes a duration alphabet of size M whose members comprise x 1 , x 2 , . . . , x m , . . . , x M , where x 1 <x 2 <x m <x M .
11. The link scheduling method of claim 9 , further comprising:
generating a utilization matrix U for the plurality of sensor nodes;
generating, using the utilization matrix U, a rate matrix T;
generating, using the rate matrix T, a translation matrix T′, wherein the translation matrix T′ is smaller than the rate matrix T; and
generating, using the translation matrix T′, the search matrix X.
12. The link scheduling method of claim 9 , wherein the schedule is communicated to the plurality of sensor nodes at startup of a link scheduling controller device.
13. The link scheduling method of claim 12 , wherein the link scheduling controller device comprises a base station device.
14. The link scheduling method of claim 9 , wherein a rate at which data is routed over the linear wireless sensor network changes from link to link and time to time over the linear wireless sensor network.
15. The link scheduling method of claim 9 , further comprising receiving a message from the respective node that was transmitted by the respective node during the assigned duration slot for the respective sensor node.
16. A link scheduling method comprising:
generating a utilization matrix for a plurality of sensor nodes in a linear wireless sensor network;
generating, using the utilization matrix, a rate matrix;
generating, using the rate matrix, a translation matrix, wherein the translation matrix is smaller than the rate matrix;
generating, using the translation matrix, a search matrix that minimizes average power consumption by the plurality of sensor nodes subject to an upper bound on a total length of a schedule;
assigning, using the search matrix, duration slots to the plurality of sensor nodes; and
communicating a schedule of the assigned duration slots to at least one of the plurality of sensor nodes.
17. The link scheduling method of claim 16 , wherein the minimization of the average power consumption is based on a selection vector used with the search matrix.
18. The link scheduling method of claim 16 , wherein the schedule of the assigned duration slots utilizes a duration alphabet of size M whose members comprise x 1 , x 2 , . . . , x m , . . . , x M , where x 1 <x 2 <x m <x M .
19. The link scheduling method of claim 16 , further comprising:
defining a respective length of time for the duration slots utilizing a punctured forward error correction technique.
20. The link scheduling method of claim 16 , wherein a rate at which data is routed over the linear wireless sensor network based on the schedule changes from link to link and time to time over the linear wireless sensor network.