WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7150
Browse
9 results
Search Results
Article Modıfıed Mergıng Clusterıng And Backbone Formatıon Algorıthms For Mobıle Ad Hoc Networks(Azerbaijan National Academy of Sciences, 2012) Dağdeviren, Orhan; Erciyes, Kayhan; Çokuslu, DenizClustering and backbone formation are widely used techniques to manage the routing operation in mobile ad hoc networks (MANET)s. In this work, we provide algorithms to form a backbone that is highly resilient to mobility and topology variations in mobile ad hoc networks. The first algorithm forms clusters of nodes in the mobile network each with a leader. The clusters are constructed in a balanced way to distribute the network load evenly. The second algorithm builds a ring network among the leaders of the clusters. The ring backbone is constructed in a fault tolerant and energy efficient way. These two algorithms are integrated in a communication architecture. To the best of our knowledge, our algorithms are the first attempts that construct balanced clusters with a ring backbone. We show the operation of the algorithms, analyze their proof of correctness, time and message complexities and provide the simulation results in ns2 environment against the density, number of clusters, and mobility of the network. We compare our proposed algorithms with the existing algorithms, and show that our algorithms create a controllable number of balanced clusters and robust ring backbone infrastructures while, providing low message count and run-time.Conference Object Citation - WoS: 37Graph Theoretic Clustering Algorithms in Mobile Ad Hoc Networks and Wireless Sensor Networks (survey)(Azerbaijan National Academy of Sciences, 2007) Erciyeş, Kayhan; Dağdeviren, Orhan; Çokuslu, Deniz; Özsoyeller, DenizClustering in mobile ad hoc networks (MANETs) and wireless sensor networks (WSNs) is an important method to ease topology management and routing in such networks. Once the clusters are formed, the leaders (coordinators) of the clusters may be used to form a backbone for efficient routing and communication purposes. A set of clusters may also provide the underlying physical structure for multicast communication for a higher level group communication module which may effectively be used for fault tolerance and key management for security purposes. We survey graph theoretic approaches for clustering in MANETs and WSNS and show that although there is a wide range of such algorithms, each may be suitable for a different cross-layer design objective.Conference Object Citation - Scopus: 15Gezgin Tasarsız Ağlar için Taşırma Tabanlı Yönlendirme Yordamı(IEEE, 2008) Çokuslu, Deniz; Erciyeş, KayhanMobile Ad Hoc Networks (MANETs) are videly in use in rescue, military operations, scientific and business areas. Many studies are addressed in MANETs because of their need to long lasting liveness, fault tolerance, dynamic addressing, collusion prevention, mobility management and security. Especially, self clustering, backbone construction and routing are the most interesting academic and industrial research areas in MANETs. A wide range of studies addressed the routing problem in MANETs. Many previous studies address the clustering and routing problems as seperate subjects. However, rowing approaches which are specific to the clustering methodologies may have many advantages in terms of efficiency and availability. In this study, a flooding based routing algorithm is proposed. First, a detailed description of the algorithm is explained, then the analysis and test results using the ns2 simulator are given which show that the designed algorithm is scalable and has favorable performance.Book Part Citation - WoS: 2Modeling and Simulation Tools for Mobile Ad Hoc Networks(Taylor and Francis Ltd., 2012) Erciyes, Kayhan; Dağdeviren, Orhan; Çokuslu, Deniz; Yılmaz, Onur; Gümüş, Hasan[No abstract available]Article Citation - WoS: 1Citation - Scopus: 7Resource Allocation for Query Processing in Grid Systems: a Survey(CRL Publishing, 2012) Çokuslu, Deniz; Hameurlain, Abdelkader; Erciyeş, KayhanGrid systems are very useful platforms for distributed databases, especially in some situations in which the scale of data sources and user requests is very high. However, the main characteristics of grid systems such as dynamicity, large size and heterogeneity, bring new problems to the query processing domain such as resource discovery and resource allocation. In this paper, we provide a survey related to resource allocation methods for query processing In data grid systems. We provide a classification for existing studies considering their approaches to the resource allocation problem. We provide a synthesis of the studies and propose evaluations and comparisons for the different classes of studies. ©2012 CRL Publishing Ltd.Conference Object Citation - WoS: 6Citation - Scopus: 6A Merging Clustering Algorithm for Mobile Ad Hoc Networks(Springer Verlag, 2006) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, DenizClustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We propose a new fully distributed algorithm for clustering in MANETs that merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities and provide results in the simulation environment of ns2. Our results conform that the algorithm proposed is scalable and has a lower time and message complexities than the other algorithmsConference Object Citation - WoS: 23Citation - Scopus: 31A Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks(Springer Verlag, 2006) Çokuslu, Deniz; Erciyeş, Kayhan; Dağdeviren, OrhanWe propose a new Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is based on Wu and Li's [14] algorithm, however we provide significant modifications by considering the degrees of the nodes during marking process and also provide further heuristics to determine the color of a node in the initial phase. We describe, analyze and measure performance of this new algorithm by simulation and show that it performs better than Wu and Li's [14] algorithm especially in the case of dense networks.Conference Object Citation - WoS: 7Citation - Scopus: 16A Hierarchical Connected Dominating Set Based Clustering Algorithm for Mobile Ad Hoc Networks(Institute of Electrical and Electronics Engineers Inc., 2007) Çokuslu, Deniz; Erciyeş, KayhanWe propose a hierarchical Connected Dominating Set (CDS) based algorithm for clustering in Mobile Ad hoc Networks (MANETs). Our algorithm is an extension of our previous Connected Dominating Set Based Clustering (CDSC) Algorithm [1]. We extended the levels of the CDS to two levels and improved functionality at each level by providing additional rules to make sure that every node belongs to a single cluster. In the first level of the algorithm, the elements of the CDS are formed, based on CDSC Algorithm heuristics with improved functionality. The second level of the algorithm is executed among the CDS elements to find the second level CDS where each element belonging to the set represents a group of CDS elements, therefore a group of clusters. We show that this approach is more scalable and simpler to implement than a single level algorithm and that it also provides more balanced two level clusters due to its distributed nature. We also show that the number of levels of the algorithm can be extended to more than two layers providing more populated clusters, therefore providing a level of cluster and group membership structure within the MANET. This hierarchical groups can be used for different application needs at each level such as multi-cast communication or security purposes in MANETs.Conference Object Citation - WoS: 4Citation - Scopus: 4Merging Clustering Algorithms in Mobile Ad Hoc Networks(Springer Verlag, 2005) Dağdeviren, Orhan; Erciyeş, Kayhan; Çokuslu, DenizClustering is a widely used approach to ease implementation of various problems such as routing and resource management in mobile ad hoc networks (MANET)s. We first look at minimum spanning tree(MST) based algorithms and then propose a new algorithm for clustering in MANETs. The algorithm we propose merges clusters to form higher level clusters by increasing their levels. We show the operation of the algorithm and analyze its time and message complexities.