Abstract
Computing capacity bounds of ad hoc networks, as well as optimizing radio resource allocation in order to approach those bounds is a hard task that have recently attracted the interest of the research community. In this paper we address the problem of jointly optimizing the routing of flows, the transmission scheduling over wireless links along the path, and the emitted power for bandwidth guaranteed traffic demands. We propose a mixed integer linear programming model which considers the signal to interference and noise ratio at receiver and accounts for the effect of adaptive transmission rate through a set of discrete link capacity and power values. To find the optimal solution of the proposed problem we provide an algorithm based on column generation. Reported numerical results on networks with up to 50 nodes and 170 links show the effectiveness of the proposed approach even with quite bit problem instances.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the 5th IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS'2009 |
| Pages | 655-660 |
| Number of pages | 6 |
| DOIs | |
| Publication status | Published - 2009 |
| Event | 5th IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS'2009 - Rende, Italy Duration: Sep 21 2009 → Sep 23 2009 |
Other
| Other | 5th IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS'2009 |
|---|---|
| Country | Italy |
| City | Rende |
| Period | 9/21/09 → 9/23/09 |
Fingerprint
Keywords
- Ad-hoc networks
- Column generation
- Mathematical programming
- Optimal routing
- Power and capacity allocation
- Scheduling
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Science Applications
- Software
Cite this
Routing and scheduling in wireless ad hoc networks. / Capone, Antonio; Castorini, Elisa; Nobili, Paolo; Triki, Chefi.
Proceedings of the 5th IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS'2009. 2009. p. 655-660 5342894.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Routing and scheduling in wireless ad hoc networks
AU - Capone, Antonio
AU - Castorini, Elisa
AU - Nobili, Paolo
AU - Triki, Chefi
PY - 2009
Y1 - 2009
N2 - Computing capacity bounds of ad hoc networks, as well as optimizing radio resource allocation in order to approach those bounds is a hard task that have recently attracted the interest of the research community. In this paper we address the problem of jointly optimizing the routing of flows, the transmission scheduling over wireless links along the path, and the emitted power for bandwidth guaranteed traffic demands. We propose a mixed integer linear programming model which considers the signal to interference and noise ratio at receiver and accounts for the effect of adaptive transmission rate through a set of discrete link capacity and power values. To find the optimal solution of the proposed problem we provide an algorithm based on column generation. Reported numerical results on networks with up to 50 nodes and 170 links show the effectiveness of the proposed approach even with quite bit problem instances.
AB - Computing capacity bounds of ad hoc networks, as well as optimizing radio resource allocation in order to approach those bounds is a hard task that have recently attracted the interest of the research community. In this paper we address the problem of jointly optimizing the routing of flows, the transmission scheduling over wireless links along the path, and the emitted power for bandwidth guaranteed traffic demands. We propose a mixed integer linear programming model which considers the signal to interference and noise ratio at receiver and accounts for the effect of adaptive transmission rate through a set of discrete link capacity and power values. To find the optimal solution of the proposed problem we provide an algorithm based on column generation. Reported numerical results on networks with up to 50 nodes and 170 links show the effectiveness of the proposed approach even with quite bit problem instances.
KW - Ad-hoc networks
KW - Column generation
KW - Mathematical programming
KW - Optimal routing
KW - Power and capacity allocation
KW - Scheduling
UR - http://www.scopus.com/inward/record.url?scp=74549149040&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=74549149040&partnerID=8YFLogxK
U2 - 10.1109/IDAACS.2009.5342894
DO - 10.1109/IDAACS.2009.5342894
M3 - Conference contribution
AN - SCOPUS:74549149040
SN - 9781424448821
SP - 655
EP - 660
BT - Proceedings of the 5th IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications, IDAACS'2009
ER -