TY - GEN
T1 - Energy-efficient transmission with data sharing
AU - Wu, Weiwei
AU - Wang, Jianping
AU - Li, Minming
AU - Liu, Kai
AU - Luo, Junzhou
N1 - Full text of this publication does not contain sufficient affiliation information. With consent from the author(s) concerned, the Research Unit(s) information for this record is based on the existing academic department affiliation of the author(s).
PY - 2015/4
Y1 - 2015/4
N2 - In a wireless system, when multiple applications can share data transmitted by rate-adaptive wireless devices, there exists a trade-off between transmission redundancy and energy efficiency. This paper conducts the first theoretical analysis on such a trade-off. We formulate the problem as a bi-objective optimization problem to simultaneously minimize the transmission redundancy and the energy consumption. In the offline setting that the full information is known in advance, we provide optimal algorithms for the bi-objective optimization problem. In the online setting, we provide an online algorithm with proven performance bound to approximate the optimal solution without relying on any assumed distribution or future information. The proposed online algorithm is proved O(ln T)-competitive with respect to transmission redundancy and also O(ln T)-competitive with respect to energy consumption, where T is the number of time slots. That is, the output of the algorithm always approximates the optimal solution within a logarithmic factor over all possible inputs. Our simulation results further validate the efficiency of our online algorithm.
AB - In a wireless system, when multiple applications can share data transmitted by rate-adaptive wireless devices, there exists a trade-off between transmission redundancy and energy efficiency. This paper conducts the first theoretical analysis on such a trade-off. We formulate the problem as a bi-objective optimization problem to simultaneously minimize the transmission redundancy and the energy consumption. In the offline setting that the full information is known in advance, we provide optimal algorithms for the bi-objective optimization problem. In the online setting, we provide an online algorithm with proven performance bound to approximate the optimal solution without relying on any assumed distribution or future information. The proposed online algorithm is proved O(ln T)-competitive with respect to transmission redundancy and also O(ln T)-competitive with respect to energy consumption, where T is the number of time slots. That is, the output of the algorithm always approximates the optimal solution within a logarithmic factor over all possible inputs. Our simulation results further validate the efficiency of our online algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84954200115&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84954200115&origin=recordpage
U2 - 10.1109/INFOCOM.2015.7218369
DO - 10.1109/INFOCOM.2015.7218369
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 9781479983810
VL - 26
SP - 73
EP - 81
BT - 2015 IEEE Conference on Computer Communications (INFOCOM)
PB - IEEE
T2 - 34th IEEE Annual Conference on Computer Communications and Networks, IEEE INFOCOM 2015
Y2 - 26 April 2015 through 1 May 2015
ER -
