We study the problem of minimising the power consumption of wireless networks when the traffic is specified. Initially we consider single-hop networks that model currently existing Frequency Division Multiplex (FDM) and Code Division Multiple Access (CDMA) networks and discuss the power minimisation problem for these networks. Next we consider networks where multi-hop transmission is deployed and where a source is allowed to partition its outgoing information flow into several sub-flows each delivered through different multi-hop routes. We present a simple, versatile, suboptimum algorithm for the power minimisation in these Multi-hop, Load Partitioning (MLP) networks. Finally we carry out a simulation campaign in order to quantify the power savings that are attainable by means of the proposed algorithm. © 2008 IEEE.
A practical algorithm for power minimisation in wireless networks by means of multi-hop and load partitioning / Piazzo, Lorenzo. - In: IEEE TRANSACTIONS ON COMMUNICATIONS. - ISSN 0090-6778. - 56:2(2008), pp. 270-278. [10.1109/tcomm.2008.050162]
A practical algorithm for power minimisation in wireless networks by means of multi-hop and load partitioning
PIAZZO, Lorenzo
2008
Abstract
We study the problem of minimising the power consumption of wireless networks when the traffic is specified. Initially we consider single-hop networks that model currently existing Frequency Division Multiplex (FDM) and Code Division Multiple Access (CDMA) networks and discuss the power minimisation problem for these networks. Next we consider networks where multi-hop transmission is deployed and where a source is allowed to partition its outgoing information flow into several sub-flows each delivered through different multi-hop routes. We present a simple, versatile, suboptimum algorithm for the power minimisation in these Multi-hop, Load Partitioning (MLP) networks. Finally we carry out a simulation campaign in order to quantify the power savings that are attainable by means of the proposed algorithm. © 2008 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.