Energy harvesting cooperative multiple access channel with data arrivals
dc.authorid | 0000-0003-2592-3701 | |
dc.authorid | 0000-0002-8219-8190 | |
dc.contributor.author | Gürakan, Berk | en_US |
dc.contributor.author | Kaya, Onur | en_US |
dc.contributor.author | Ulukuş, Şennur | en_US |
dc.date.accessioned | 2016-10-24T20:32:28Z | |
dc.date.available | 2016-10-24T20:32:28Z | |
dc.date.issued | 2016 | |
dc.department | Işık Üniversitesi, Mühendislik Fakültesi, Elektrik-Elektronik Mühendisliği Bölümü | en_US |
dc.department | Işık University, Faculty of Engineering, Department of Electrical-Electronics Engineering | en_US |
dc.description.abstract | We consider an energy harvesting two user cooperative Gaussian multiple access channel (MAC), where both of the users harvest energy from nature. The data packets arrive intermittently over time. The users overhear each other's transmitted signals and can cooperate by forming common messages. We find the optimal offline transmit power and rate allocation policy that maximize the departure region. We first show that there exists an optimal policy, in which the single user rate constraints in each time slot are tight, yielding a one to one relation between the powers and rates. Then, we formulate the departure region maximization problem as a weighted sum rate maximization in terms of rates only. Next, we propose a sequential convex approximation method to approximate the problem at each step and show that it converges to the optimal solution. Finally, we solve the approximate problems using an inner outer decomposition method. Numerically, we observe that higher data rates can be supported with the same amount of energy. | en_US |
dc.description.version | Publisher's Version | en_US |
dc.identifier.citation | Gürakan, B., Kaya, O. & Ulukuş, Ş. (2016). Energy harvesting cooperative multiple access channel with data arrivals. Paper presented at the 2016 IEEE International Conference on Communications (ICC), 1-6. doi:10.1109/ICC.2016.7511171 | en_US |
dc.identifier.doi | 10.1109/ICC.2016.7511171 | |
dc.identifier.endpage | 6 | |
dc.identifier.isbn | 9781479966646 | |
dc.identifier.isbn | 9781479966653 | |
dc.identifier.issn | 1938-1883 | |
dc.identifier.issn | 1550-3607 | |
dc.identifier.scopus | 2-s2.0-84981331781 | |
dc.identifier.scopusquality | N/A | |
dc.identifier.startpage | 1 | |
dc.identifier.uri | https://hdl.handle.net/11729/1135 | |
dc.identifier.uri | http://dx.doi.org/10.1109/ICC.2016.7511171 | |
dc.identifier.wos | WOS:000390993203042 | |
dc.identifier.wosquality | N/A | |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.indekslendigikaynak | Conference Proceedings Citation Index – Science (CPCI-S) | en_US |
dc.institutionauthor | Kaya, Onur | en_US |
dc.institutionauthorid | 0000-0003-2592-3701 | |
dc.language.iso | en | en_US |
dc.peerreviewed | Yes | en_US |
dc.publicationstatus | Published | en_US |
dc.publisher | IEEE | en_US |
dc.relation.ispartof | 2016 IEEE International Conference on Communications (ICC) | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Communication channels (information theory) | en_US |
dc.subject | Energy harvesting | en_US |
dc.subject | Convex approximation methods | en_US |
dc.subject | Cooperative multiple access | en_US |
dc.subject | Decomposition methods | en_US |
dc.subject | Gaussian multiple-access channels | en_US |
dc.subject | Maximization problem | en_US |
dc.subject | Optimal solutions | en_US |
dc.subject | Transmitted signal | en_US |
dc.subject | Weighted sum-rate maximizations | en_US |
dc.subject | Problem solving | en_US |
dc.title | Energy harvesting cooperative multiple access channel with data arrivals | en_US |
dc.type | Conference Object | en_US |