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: | Ephremides Anthony, Pantelidou Anna |
---|---|
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 |
Similar Items
-
Distributional Properties of Stochastic Shortest Paths for Smuggled Nuclear Material
by: Leticia Cuellar, et al.
Published: (2012-10-01) -
On the Maximal Shortest Paths Cover Number
by: Iztok Peterin, et al.
Published: (2021-07-01) -
Non-crossing Rectilinear Shortest Minimum Bend Paths in the Presence of Rectilinear Obstacles
by: Shylashree Nagaraja
Published: (2018-09-01) -
Multi-Objective Decision-Making Meets Dynamic Shortest Path: Challenges and Prospects
by: Juarez Machado da Silva, et al.
Published: (2023-03-01) -
Reinforcement Learning Based Stochastic Shortest Path Finding in Wireless Sensor Networks
by: Wenwen Xia, et al.
Published: (2019-01-01)