Traffic-based topology control algorithm for energy savings in multi-hop wireless networks

被引:0
作者
Steven Martin
Khaldoun Al Agha
Guy Pujolle
机构
[1] LRI—University Paris 11,
[2] LiP6—University Paris 6,undefined
来源
annals of telecommunications - annales des télécommunications | 2012年 / 67卷
关键词
Green networking; Ad hoc; Power; Interference;
D O I
暂无
中图分类号
学科分类号
摘要
This paper presents a traffic-based topology control algorithm for multi-hop wireless networks, in order to optimize the global energy consumption while maximizing the aggregate throughput. Contrary to major related works, we do not consider that reducing transmission powers implies reducing interferences and that the traffic is uniformly distributed among the links. Thus, we propose to dynamically calculate the transmission power of nodes depending on the traffic. First, we redefine the N-hop interference model for varying transmission powers. Then, we define a function giving the minimum interference according to the transmission powers. We propose several algorithms minimizing this function: global optimization, local optimization, and distributed optimization for a limited computation cost. Our first algorithm is used as a reference for limited cases. We show by simulation that our heuristics are relevant compared to existing works.
引用
收藏
页码:181 / 189
页数:8
相关论文
共 23 条
[1]  
Gomez J(2006)Variable-range transmission power control in wireless ad hoc networks IEEE Trans Mobile Comput 6 87-99
[2]  
Campbell AT(2006)Localized fault-tolerant topology control in wireless ad hoc networks IEEE Trans Parallel Distrib Syst 17 307-320
[3]  
Li N(2002)Topology control for multihop packet radio networks IEEE Trans Commun 41 1474-1481
[4]  
Hou JC(2005)A cone-based distributed topology-control algorithm for wireless multi-hop networks IEEE/ACM Trans Netw 13 147-159
[5]  
Hu L(2004)A minimum-energy path-preserving topology-control algorithm IEEE Trans Wirel Commun 3 910-921
[6]  
Li L(1956)On the shortest spanning subtree of a graph and the traveling salesman problem Proc Am Math Soc 7 48-50
[7]  
Halpern JY(1973)Algorithm 457: finding all cliques of an undirected graph Commun ACM 16 575-577
[8]  
Bahl P(2007)Sufficient rate constraints for QoS flows in ad-hoc networks Ad Hoc Networks 5 429-443
[9]  
Wang YM(2009)Feba: a bandwidth allocation algorithm for service differentiation in ieee 802 IEEE/ACM Trans Netw 17 884-897
[10]  
Wattenhofer R(2000)The capacity of wireless networks IEEE Trans Inf Theory 46 388-404