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
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
Density-aware Joint Optimization of Cell Scheduling and User Association
Date
2018-04-15
Author
Çalık, Mert
Mollahasani, Shahram
Onur, Ertan
Metadata
Show full item record
Item Usage Stats
54
views
0
downloads
Cite This
URI
https://edas.info/showManuscript.php?m=1570435652ext=pdfrandom=1684772881type=final
https://hdl.handle.net/11511/76221
Collections
Unverified, Conference / Seminar
Suggestions
OpenMETU
Core
Density-aware outage in clustered Ad Hoc networks
Eroğlu, Alperen; Onur, Ertan (2018-02-28)
Density of ad hoc networks may vary in time and space because of mobile stations, sleep scheduling or failure of nodes. Resources such as spectrum will be wasted if the network is not density-aware and -adaptive. Towards this aim, distributed and robust network density estimators are required. In this paper, we propose a novel cluster density estimator in random ad hoc networks by employing distance matrix. Monte-Carlo simulation results validate the proposed estimator. The accuracy of the estimator is impr...
Density-Aware Probabilistic Clustering in Ad Hoc Networks
Ergenç, Doǧanalp; Eksert, Levent; Onur, Ertan (2018-06-07)
Clustering makes an ad hoc network scalable forming easy-to-manage local groups. However, it brings an extra control overhead to create and maintain clustered network topology. In this paper, we propose Probabilistic Clustering Algorithm that is a simple and efficient clustering algorithm with minimal overhead. In this algorithm, cluster heads are determined probabilistically in a distributed fashion. An analytic model is introduced for nodes to compute the probability of declaring themselves as cluster hea...
Density-aware power allocation in mobile networks using edge computing
MOLLAHASANİ, Shahram; Onur, Ertan (2018-05-05)
While the main concern in mobile networks was increasing network capacity and expanding coverage in the past, green operation have recently become a major concern. To conserve energy in mobile networks, we employ mobile edge computing to access real-time data and offload processing tasks to the edges for reducing complexity and latency. An edge cloud has a larger view of the network than a base station. Therefore, it can evaluate the probability of coverage by considering the density of base stations to enh...
Density-aware cellular coverage control: Interference-based density estimation
Eroğlu, Alperen; Onur, Ertan (2019-12-24)
Density estimation in large-scale wireless sensor networks
Eroğlu, Alperen; Onur, Ertan; Oğuztüzün, Mehmet Halit S.; Department of Computer Engineering (2015)
Density estimation is a significant problem in large-scale wireless ad-hoc networks since the density drastically impacts the network performance. It is crucial to make the network adaptive in the run-time to the density changes that may not be predictable in advance. Local density estimators are required while taking run-time control decisions to improve the network performance. A wireless node may estimate the density locally by measuring the received signal strength (RSS) of packets sent by its neighbour...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
M. Çalık, S. Mollahasani, and E. Onur, “Density-aware Joint Optimization of Cell Scheduling and User Association,” 2018, Accessed: 00, 2021. [Online]. Available: https://edas.info/showManuscript.php?m=1570435652ext=pdfrandom=1684772881type=final.