Optimal routing and resource allocation in multi-hop wireless networks

被引:5
作者
Castorini, Elisa [1 ]
Nobili, Paolo [2 ]
Triki, Chefi [2 ]
机构
[1] Univ Roma La Sapienza, Dipartimento Stat Probabil & Stat Applicate, Rome, Italy
[2] Univ Salento Arnesano, Dipartimento Matemat Ennio De Giorgi, Lecce, Italy
关键词
multi-hop wireless networks; power and capacity allocation; optimal routing; column-generation;
D O I
10.1080/10556780801995907
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:593 / 608
页数:16
相关论文
共 13 条
[1]  
CAPONE A, 2005, 3 INT WORKSH QOS MUL, P533
[2]  
CRUZ RL, 2003, P 2003 INF SAN FRANC
[3]  
ELBATT T, 2002, P IEEE INFOCOM JUN, V2, P23
[4]  
Johansson M, 2006, IEEE T WIREL COMMUN, V5, P435, DOI [10.1109/TWC.2006.1611067, 10.1109/TWC.2006.02023]
[5]  
JOHANSSON M, 2003, P 2003 IEEE INT C CO
[6]  
Kelly FP, 1998, J OPER RES SOC, V49, P237, DOI 10.1038/sj.jors.2600523
[7]  
RADUNOVIC B, 2003, JOINT SCHEDULING POW, P31
[8]  
TOUMPIS S, 2002, P 2002 IEEE INT C CO
[9]  
VARBRAND P, 2003, P 2003 INF SAN FRANC
[10]  
Varbrand P., 2004, AD HOC NETW, V2, P405, DOI 10.1016/j.adhoc.2003.09.002