Minimum-length scheduling with rate control in wireless networks: a shortest path approach
<p>Abstract</p> <p>In this paper, the minimum-length scheduling problem in wireless networks is studied, where each source of traffic has a finite amount of data to deliver to its corresponding destination. Our objective is to obtain a joint scheduling and rate control policy to mi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2011-01-01
|
| Series: | EURASIP Journal on Wireless Communications and Networking |
| Subjects: | |
| Online Access: | http://jwcn.eurasipjournals.com/content/2011/1/115 |
| _version_ | 1818757008445145088 |
|---|---|
| author | Ephremides Anthony Pantelidou Anna |
| author_facet | Ephremides Anthony Pantelidou Anna |
| author_sort | Ephremides Anthony |
| collection | DOAJ |
| description | <p>Abstract</p> <p>In this paper, the minimum-length scheduling problem in wireless networks is studied, where each source of traffic has a finite amount of data to deliver to its corresponding destination. Our objective is to obtain a joint scheduling and rate control policy to minimize the total time required to deliver this finite amount of data from all sources. First, networks with time-invariant channels are considered. An optimal solution is provided by formulating the minimum-length scheduling problem as finding a shortest path on a single-source directed acyclic graph. However, finding the shortest paths is computationally hard since the number of vertices and edges of the graph increases exponentially in the number of network nodes, as well as in the initial traffic demand values. Toward this end, a simplified version of the problem is considered for which we explicitly characterize the optimal solution. Next, our results are generalized to time-varying channels. First, it is shown that in case of time-varying channels, the minimum-length scheduling problem can be formulated as a stochastic shortest path problem and then an optimal policy is provided that is based on stochastic control. Finally, our analytical results are illustrated with a set of numerical examples.</p> |
| first_indexed | 2024-12-18T06:04:06Z |
| format | Article |
| id | doaj.art-bed512dd3ed645d48bf94678f0a065d8 |
| institution | Directory Open Access Journal |
| issn | 1687-1472 1687-1499 |
| language | English |
| last_indexed | 2024-12-18T06:04:06Z |
| publishDate | 2011-01-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | EURASIP Journal on Wireless Communications and Networking |
| spelling | doaj.art-bed512dd3ed645d48bf94678f0a065d82022-12-21T21:18:35ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14721687-14992011-01-0120111115Minimum-length scheduling with rate control in wireless networks: a shortest path approachEphremides AnthonyPantelidou Anna<p>Abstract</p> <p>In this paper, the minimum-length scheduling problem in wireless networks is studied, where each source of traffic has a finite amount of data to deliver to its corresponding destination. Our objective is to obtain a joint scheduling and rate control policy to minimize the total time required to deliver this finite amount of data from all sources. First, networks with time-invariant channels are considered. An optimal solution is provided by formulating the minimum-length scheduling problem as finding a shortest path on a single-source directed acyclic graph. However, finding the shortest paths is computationally hard since the number of vertices and edges of the graph increases exponentially in the number of network nodes, as well as in the initial traffic demand values. Toward this end, a simplified version of the problem is considered for which we explicitly characterize the optimal solution. Next, our results are generalized to time-varying channels. First, it is shown that in case of time-varying channels, the minimum-length scheduling problem can be formulated as a stochastic shortest path problem and then an optimal policy is provided that is based on stochastic control. Finally, our analytical results are illustrated with a set of numerical examples.</p>http://jwcn.eurasipjournals.com/content/2011/1/115Cross-layer designMinimum-length schedulingRate controlStochastic shortest paths |
| spellingShingle | Ephremides Anthony Pantelidou Anna Minimum-length scheduling with rate control in wireless networks: a shortest path approach EURASIP Journal on Wireless Communications and Networking Cross-layer design Minimum-length scheduling Rate control Stochastic shortest paths |
| title | Minimum-length scheduling with rate control in wireless networks: a shortest path approach |
| title_full | Minimum-length scheduling with rate control in wireless networks: a shortest path approach |
| title_fullStr | Minimum-length scheduling with rate control in wireless networks: a shortest path approach |
| title_full_unstemmed | Minimum-length scheduling with rate control in wireless networks: a shortest path approach |
| title_short | Minimum-length scheduling with rate control in wireless networks: a shortest path approach |
| title_sort | minimum length scheduling with rate control in wireless networks a shortest path approach |
| topic | Cross-layer design Minimum-length scheduling Rate control Stochastic shortest paths |
| url | http://jwcn.eurasipjournals.com/content/2011/1/115 |
| work_keys_str_mv | AT ephremidesanthony minimumlengthschedulingwithratecontrolinwirelessnetworksashortestpathapproach AT pantelidouanna minimumlengthschedulingwithratecontrolinwirelessnetworksashortestpathapproach |