Energy-Efficient Data Transmission With Non-FIFO Packets With Processing Cost
In this paper, we consider the energy-efficient transmission problem with non-first-in-first-out (FIFO) packets for a point-to-point additive white Gaussian noise channel with processing cost. This work can be considered as a generation of previous work in terms of the assumption of the FIFO transmi...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2017-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/7898819/ |
| _version_ | 1828412084627439616 |
|---|---|
| author | Qing Zhou Zhuoqi Yang Nan Liu Zhiwen Pan Xiaohu You |
| author_facet | Qing Zhou Zhuoqi Yang Nan Liu Zhiwen Pan Xiaohu You |
| author_sort | Qing Zhou |
| collection | DOAJ |
| description | In this paper, we consider the energy-efficient transmission problem with non-first-in-first-out (FIFO) packets for a point-to-point additive white Gaussian noise channel with processing cost. This work can be considered as a generation of previous work in terms of the assumption of the FIFO transmission order, which means the earlier arrived packet must have an earlier deadline. Assuming non-causal data arrival information, we first formulate the objective as a non-convex optimization problem, and then investigate the necessary and sufficient conditions of the optimal offline transmission schedule. Based on the optimal properties of these conditions, an efficient offline algorithm that finds the optimal transmission schedule minimizing the total energy consumption is proposed. Next, we identify the optimality of the proposed offline algorithm by proving it satisfies the sufficient conditions of optimality, and further, respectively, analyze the computational complexity in the best case: <inline-formula> <tex-math notation="LaTeX">$\mathcal {O}(N^{2})$ </tex-math></inline-formula> and in the worse case: <inline-formula> <tex-math notation="LaTeX">$\mathcal {O}(N^{3})$ </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> is the packet number of the sequence. Finally, based on the insights obtained from the offline transmission schedule, an efficient heuristic online algorithm performing close to the offline transmission schedule is proposed under the assumption that the data arrival information is known causally at the transmitter. |
| first_indexed | 2024-12-10T12:42:49Z |
| format | Article |
| id | doaj.art-da37442169814df5b69db681d2a6941c |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-10T12:42:49Z |
| publishDate | 2017-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-da37442169814df5b69db681d2a6941c2022-12-22T01:48:30ZengIEEEIEEE Access2169-35362017-01-0155158517010.1109/ACCESS.2017.26938267898819Energy-Efficient Data Transmission With Non-FIFO Packets With Processing CostQing Zhou0https://orcid.org/0000-0002-8083-152XZhuoqi Yang1Nan Liu2Zhiwen Pan3Xiaohu You4National Mobile Communications Research Laboratory, Southeast University, Nanjing, ChinaThird Research Institute of the Ministry of Public Security, Shanghai, ChinaNational Mobile Communications Research Laboratory, Southeast University, Nanjing, ChinaNational Mobile Communications Research Laboratory, Southeast University, Nanjing, ChinaNational Mobile Communications Research Laboratory, Southeast University, Nanjing, ChinaIn this paper, we consider the energy-efficient transmission problem with non-first-in-first-out (FIFO) packets for a point-to-point additive white Gaussian noise channel with processing cost. This work can be considered as a generation of previous work in terms of the assumption of the FIFO transmission order, which means the earlier arrived packet must have an earlier deadline. Assuming non-causal data arrival information, we first formulate the objective as a non-convex optimization problem, and then investigate the necessary and sufficient conditions of the optimal offline transmission schedule. Based on the optimal properties of these conditions, an efficient offline algorithm that finds the optimal transmission schedule minimizing the total energy consumption is proposed. Next, we identify the optimality of the proposed offline algorithm by proving it satisfies the sufficient conditions of optimality, and further, respectively, analyze the computational complexity in the best case: <inline-formula> <tex-math notation="LaTeX">$\mathcal {O}(N^{2})$ </tex-math></inline-formula> and in the worse case: <inline-formula> <tex-math notation="LaTeX">$\mathcal {O}(N^{3})$ </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> is the packet number of the sequence. Finally, based on the insights obtained from the offline transmission schedule, an efficient heuristic online algorithm performing close to the offline transmission schedule is proposed under the assumption that the data arrival information is known causally at the transmitter.https://ieeexplore.ieee.org/document/7898819/Energy efficiencynon-FIFO packetsprocessing costconvex optimization |
| spellingShingle | Qing Zhou Zhuoqi Yang Nan Liu Zhiwen Pan Xiaohu You Energy-Efficient Data Transmission With Non-FIFO Packets With Processing Cost IEEE Access Energy efficiency non-FIFO packets processing cost convex optimization |
| title | Energy-Efficient Data Transmission With Non-FIFO Packets With Processing Cost |
| title_full | Energy-Efficient Data Transmission With Non-FIFO Packets With Processing Cost |
| title_fullStr | Energy-Efficient Data Transmission With Non-FIFO Packets With Processing Cost |
| title_full_unstemmed | Energy-Efficient Data Transmission With Non-FIFO Packets With Processing Cost |
| title_short | Energy-Efficient Data Transmission With Non-FIFO Packets With Processing Cost |
| title_sort | energy efficient data transmission with non fifo packets with processing cost |
| topic | Energy efficiency non-FIFO packets processing cost convex optimization |
| url | https://ieeexplore.ieee.org/document/7898819/ |
| work_keys_str_mv | AT qingzhou energyefficientdatatransmissionwithnonfifopacketswithprocessingcost AT zhuoqiyang energyefficientdatatransmissionwithnonfifopacketswithprocessingcost AT nanliu energyefficientdatatransmissionwithnonfifopacketswithprocessingcost AT zhiwenpan energyefficientdatatransmissionwithnonfifopacketswithprocessingcost AT xiaohuyou energyefficientdatatransmissionwithnonfifopacketswithprocessingcost |