Density-Aware Probabilistic Clustering in Ad Hoc Networks

Date

2018-06-07

Author

Ergenç, Doǧanalp
Eksert, Levent
Onur, Ertan

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

135
views

0
downloads

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 heads. We validate the analytic model by Monte-Carlo simulations. Furthermore, we propose a cross-layer clustered stack and simulate simple applications in stationary and dynamic topologies using OMNeT++. Discrete event simulation results show that Probabilistic Clustering Algorithm eliminates a significant amount of control overhead and the performance of the algorithm is considerably better compared to its opponent, Identity-based Clustering Algorithm.

Subject Keywords

Ad hoc networks, Cross-layer architecture, Probabilistic model, Clustering

URI

https://hdl.handle.net/11511/37547

DOI

https://doi.org/10.1109/blackseacom.2018.8433605

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Cost-Aware Strategies for Query Result Caching in Web Search Engines Ozcan, Rifat; Altıngövde, İsmail Sengör; Ulusoy, Ozgor (Association for Computing Machinery (ACM), 2011-05-01) Search engines and large-scale IR systems need to cache query results for efficiency and scalability purposes. Static and dynamic caching techniques (as well as their combinations) are employed to effectively cache query results. In this study, we propose cost-aware strategies for static and dynamic caching setups. Our research is motivated by two key observations: (i) query processing costs may significantly vary among different queries, and (ii) the processing cost of a query is not proportional to its po...
Relay Selection for Efficient HARQ-IR Protocols in Relay-Assisted Multisource Multicast Networks Quoc-Tuan Vien, Quoc-Tuan Vien; Nguyen, Huan X.; Shah, Purav; Ever, Enver; Duc To, Duc To (2014-05-21) This paper investigates relay selection for reliable data transmission in relay-assisted multisource multicast networks (RMMNs) where multiple source nodes distribute information to a set of destination nodes with the assistance of multiple relay nodes. Hybrid automatic repeat request with incremental redundancy (HARQ-IR) is used and supported by either a physical-layer network coding (PNC) or an analog network coding (ANC) technique employed at the relays. By deriving efficiency metrics of the HARQ-IR prot...
BB-graph: a new subgraph isomorphism algorithm for querying big graph databases Asiler, Merve; Yazıcı, Adnan; Department of Computer Engineering (2016) With the emergence of the big data concept, the big graph database model has become very popular since it provides very flexible and quick querying for the cases that require costly join operations in RDBMs. However, it is a big challenge to find all exact matches of a query graph in a big database graph, which is known as the subgraph isomorphism problem. Although many related studies exist in literature, there is not a perfect algorithm that works for all types of queries efficiently since it is an NP-har...
Evolutionary Multiobjective Query Workload Optimization of Cloud Data Warehouses Dokeroglu, Tansel; Sert, Seyyit Alper; Cinar, Muhammet Serkan (Hindawi Limited, 2014) <jats:p>With the advent of Cloud databases, query optimizers need to find paretooptimal solutions in terms of response time and monetary cost. Our novel approach minimizes both objectives by deploying alternative virtual resources and query plans making use of the virtual resource elasticity of the Cloud. We propose an exact multiobjective branch-and-bound and a robust multiobjective genetic algorithm for the optimization of distributed data warehouse query workloads on the Cloud. In order to investigate th...
Dynamic modularity based community detection for large scale networks Aktunç, Rıza; Toroslu, İsmail Hakkı; Department of Computer Engineering (2015) In this work, a new fast dynamic community detection framework for large scale networks is presented. Most of the previous community detection algorithms are designed for static networks. Static modularity optimizer framework (SMO), which is introduced by Waltman & Van Eck, consists of such community detection algorithms. However, large scale social networks are dynamic and evolve frequently over time. To quickly detect communities in dynamic large scale networks, we proposed dynamic modularity optimizer fr...

Citation Formats

D. Ergenç, L. Eksert, and E. Onur, “Density-Aware Probabilistic Clustering in Ad Hoc Networks,” 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37547.