Optimal routing and resource allocation in multi-hop wireless networks

Authors:
Elisa Castorini;Paolo Nobili;Chefi Triki
Affiliations:
Dipartimento di Statistica, Probabilita e Statistiche Applicate, Universita degli studi di Roma 'La Sapienza', Roma, Italy;Dipartimento di Matematica 'Ennio De Giorgi, Universita del Salento Arnesano, Lecce, Italy;Dipartimento di Matematica 'Ennio De Giorgi, Universita del Salento Arnesano, Lecce, Italy
Venue:
Optimization Methods & Software - Mathematical programming in data mining and machine learning
Year:
2008

Citing 4
Cited 1

Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
A Cross-Layer Optimization Framework for Multicast in Multi-hop Wireless Networks

WICON '05 Proceedings of the First International Conference on Wireless Internet
QoS routing in multi-hop wireless networks: a new model and algorithm

QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Cross-layer optimization of wireless networks using nonlinear column generation

IEEE Transactions on Wireless Communications

GUB Covers and Power-Indexed Formulations for Wireless Network Design

Management Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of simultaneously optimizing power consumption and routing in multi-hop wireless networks while forcing the satisfaction of the required transmission demands between given origin-destination pairs. We devise a linear programming model for the selection of optimal routes and transmission schemes where both the power and link capacity levels are suitably discretized. Since the constraint matrix of such a model contains a huge number of columns, we propose an exact algorithm for its solution based on a column-generation approach. The associated column-generation procedure is based on the solution of linear integer programming models. We report some computational results on networks with up to 65 nodes, showing the feasibility of our solution approach.