Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Optimized Asymmetric Cooperation for Downlink Cloud Radio Access Network under per-Base Station Data Transfer Constraint
Date
2017-01-01
Author
Kadan, Fehmi Emre
Yılmaz, Ali Özgür
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
222
views
0
downloads
Cite This
Using multicell cooperation between several base stations (BSs) connected to a central processor (CP) via finite capacity digital backhaul links, the inter-cell interference, which is known to limit the standard cellular systems, can be mitigated. When all user data is sent to each BS through the CP, which is referred as the full cooperation, the interference can be perfectly eliminated, however, this may cause the capacity of backhaul links to be exceeded. In this study, it is aimed to find the optimal asymmetric cooperation strategy for downlink cloud radio access network (C-RAN) which minimizes the total transmitted power from BSs where each user's signal-to-interference-and-noise ratio (SINR) is lower bounded and the number of user data streams sent by each BS is limited. The original problem is NP-hard and requires a combinatorial search. In this paper, we propose two sub-optimal cooperation methods. The first method is based on iteratively increasing the number of users served by the BSs until all users are chosen, and the second is based on iteratively adding a user data stream to be sent to a BS. We also consider a known method, iterative link removal, which is based on iteratively removing a user data from a BS by starting the full cooperation scheme, and a modified version of this method as a comparison. The simulation results show that the proposed methods can provide better performance in comparison to other methods in the literature.
Subject Keywords
TRANSMISSION
URI
https://hdl.handle.net/11511/57658
DOI
https://doi.org/10.1109/iccw.2017.7962646
Conference Name
IEEE International Conference on Communications (ICC) / Wireless Communications Symposium / 3rd Workshop on Optical Wireless Communications (OWC)
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Game Theory Based Secure Wireless Powered D2D Communications with Cooperative Jamming
Chu, Zheng; Nguyen, Huan X.; Tuan Anh Le, Tuan Anh Le; Karamanoglu, Mehmet; Duc To, Duc To; Ever, Enver; Al-Turjman, Fadi; Yazıcı, Adnan (2017-03-31)
In this paper, we consider a secure wireless powered device-to-device (D2D) communication in the presence of the multiple eavesdroppers, where a smart hybrid base station (BS) in cellular network not only charges for the D2D transmitter to guarantee power efficiency for the D2D network, but also serves as a cooperative jammer (CJ) to interfere with the eavesdroppers. Although the cellular networks share their own spectrum with the D2D underlay network, both of them may not belong to the same service provide...
Optimal resource allocation algorithms for efficient operation of wireless networks
Özel, Ömür; Uysal Bıyıkoğlu, Elif; Department of Electrical and Electronics Engineering (2009)
In this thesis, we analyze allocation of two separate resources in wireless networks: transmit power and buffer space. Controlled allocation of power can provide good performance for both users and the network. Although centralized mechanisms are possible, distributed power control algorithms are preferable for efficient operation of the network. Viewing distributed power allocation as the collection of rational decisions of each user, we make game theoretic problem formulations, devise distributed algorith...
Performance of IRI-based ionospheric critical frequency calculations with reference to forecasting
ÜNAL, İBRAHİM; Senalp, Erdem Turker; YEŞİL, ALİ; Tulunay, Ersin; Tulunay, Yurdanur (American Geophysical Union (AGU), 2011-01-27)
Ionospheric critical frequency (foF2) is an important ionospheric parameter in telecommunication. Ionospheric processes are highly nonlinear and time varying. Thus, mathematical modeling based on physical principles is extremely difficult if not impossible. The authors forecast foF2 values by using neural networks and, in parallel, they calculate foF2 values based on the IRI model. The foF2 values were forecast 1 h in advance by using the Middle East Technical University Neural Network model (METU-NN) and t...
Finite Horizon Online Packet Scheduling with Energy and Delay Constraints
Bacınoğlu, Baran Tan; Uysal, Elif (2013-07-05)
A finite horizon optimal packet scheduling problem with data and energy causality constraints is posed. The slotted structure of the problem makes discrete time stochastic dynamic programming suitable for obtaining its optimal solution. This structure also enables an offline optimal solution that facilitates an online scheduling heuristic. The online heuristic, which does not require prior knowledge of data and energy arrival statistics, is observed (via simulations) to perform closely to the online optimal...
Cost aware TCP scheduler for bandwidth aggregation
Ağırbaş, Serhat; Koçyiğit, Altan; Sevgi, Cüneyt; Department of Information Systems (2018)
Constant bit rate, time sensitive data delivery is needed for many network applications and these applications usually require high throughput and less variable delay. When such applications run on mobile devices, the bandwidth available and the other characteristics of the primary network connection may not be sufficient to provide necessary quality of service. On the other hand, most of the mobile devices are multihomed that is they are equipped with more than one network interface, hence they can be conn...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
F. E. Kadan and A. Ö. Yılmaz, “Optimized Asymmetric Cooperation for Downlink Cloud Radio Access Network under per-Base Station Data Transfer Constraint,” presented at the IEEE International Conference on Communications (ICC) / Wireless Communications Symposium / 3rd Workshop on Optical Wireless Communications (OWC), Paris, FRANCE, 2017, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/57658.