Selcuk Okdem

Bio: Selcuk Okdem is an academic researcher from Erciyes University. The author has contributed to research in topics: Wireless Routing Protocol & Link-state routing protocol. The author has an hindex of 7, co-authored 15 publications receiving 677 citations.

Cluster based wireless sensor network routing using artificial bee colony algorithm

Abstract: Due to recent advances in wireless communication technologies, there has been a rapid growth in wireless sensor networks research during the past few decades. Many novel architectures, protocols, algorithms, and applications have been proposed and implemented. The efficiency of these networks is highly dependent on routing protocols directly affecting the network life-time. Clustering is one of the most popular techniques preferred in routing operations. In this paper, a novel energy efficient clustering mechanism, based on artificial bee colony algorithm, is presented to prolong the network life-time. Artificial bee colony algorithm, simulating the intelligent foraging behavior of honey bee swarms, has been successfully used in clustering techniques. The performance of the proposed approach is compared with protocols based on LEACH and particle swarm optimization, which are studied in several routing applications. The results of the experiments show that the artificial bee colony algorithm based clustering can successfully be applied to WSN routing protocols.

Routing in Wireless Sensor Networks Using an Ant Colony Optimization (ACO) Router Chip

Abstract: Wireless Sensor Networks consisting of nodes with limited power are deployed to gather useful information from the field. In WSNs it is critical to collect the information in an energy efficient manner. Ant Colony Optimization, a swarm intelligence based optimization technique, is widely used in network routing. A novel routing approach using an Ant Colony Optimization algorithm is proposed for Wireless Sensor Networks consisting of stable nodes. Illustrative examples, detailed descriptions and comparative performance test results of the proposed approach are included. The approach is also implemented to a small sized hardware component as a router chip. Simulation results show that proposed algorithm provides promising solutions allowing node designers to efficiently operate routing tasks.

Routing in Wireless Sensor Networks Using Ant Colony Optimization

Abstract: This paper introduces a new approach to routing operations in wireless sensor networks (WSNs). We have developed a routing scheme and adapted ant colony optimization (ACO) algorithm to this scheme to get a dynamic and reliable routing protocol. We have also implemented our approach to a small sized hardware component as a router chip to propose sensor node designers an easy handling of WSN routing operations. The chip is tested and its performance results are obtained by using Proteus simulation program. The ACO approach and its hardware implementation seem to provide a promising solution for node designers to operate routing tasks easily and effectively.

An application of Wireless Sensor Network routing based on Artificial Bee Colony Algorithm

Abstract: Reliable communication and effective routing methods are required for Wireless Sensor Network (WSN) structures having many application areas such as military, medical, meteorology, and geology. In this paper, the performance of Artificial Bee Colony Algorithm (ABC) on routing operations in WSNs is studied. Obtained performance result shows that the used protocol provides longer network life time by saving more energy. Complexity analysis of cluster-based routing strategy using ABC algorithm is made. Performance and analysis results approve that ABC algorithm presents promising solutions on WSN routings.

Cluster based wireless sensor network routings using Artificial Bee Colony Algorithm

Abstract: In this paper, we propose a novel hierarchical clustering approach for wireless sensor networks to maintain energy depletion of the network in minimum using Artificial Bee Colony Algorithm which is a new swarm based heuristic algorithm. We present a protocol using Artificial Bee Colony Algorithm, which tries to provide optimum cluster organization in order to minimize energy consumption. In cluster based networks, the selection of cluster heads and its members is an essential process which affects energy consumption. Simulation results demonstrate that the proposed approach provides promising solutions for the wireless sensor networks.

A comprehensive survey: artificial bee colony (ABC) algorithm and applications

Abstract: Swarm intelligence (SI) is briefly defined as the collective behaviour of decentralized and self-organized swarms. The well known examples for these swarms are bird flocks, fish schools and the colony of social insects such as termites, ants and bees. In 1990s, especially two approaches based on ant colony and on fish schooling/bird flocking introduced have highly attracted the interest of researchers. Although the self-organization features are required by SI are strongly and clearly seen in honey bee colonies, unfortunately the researchers have recently started to be interested in the behaviour of these swarm systems to describe new intelligent approaches, especially from the beginning of 2000s. During a decade, several algorithms have been developed depending on different intelligent behaviours of honey bee swarms. Among those, artificial bee colony (ABC) is the one which has been most widely studied on and applied to solve the real world problems, so far. Day by day the number of researchers being interested in ABC algorithm increases rapidly. This work presents a comprehensive survey of the advances with ABC and its applications. It is hoped that this survey would be very beneficial for the researchers studying on SI, particularly ABC algorithm.

A survey on nature inspired metaheuristic algorithms for partitional clustering

Abstract: The partitional clustering concept started with K-means algorithm which was published in 1957. Since then many classical partitional clustering algorithms have been reported based on gradient descent approach. The 1990 kick started a new era in cluster analysis with the application of nature inspired metaheuristics. After initial formulation nearly two decades have passed and researchers have developed numerous new algorithms in this field. This paper embodies an up-to-date review of all major nature inspired metaheuristic algorithms employed till date for partitional clustering. Further, key issues involved during formulation of various metaheuristics as a clustering problem and major application areas are discussed.

Adaptive network based fuzzy inference system (ANFIS) training approaches: a comprehensive survey

Abstract: In the structure of ANFIS, there are two different parameter groups: premise and consequence. Training ANFIS means determination of these parameters using an optimization algorithm. In the first ANFIS model developed by Jang, a hybrid learning approach was proposed for training. In this approach, while premise parameters are determined by using gradient descent (GD), consequence parameters are found out with least squares estimation (LSE) method. Since ANFIS has been developed, it is used in modelling and identification of numerous systems and successful results have been achieved. The selection of optimization method utilized in training is very important to get effective results with ANFIS. It is seen that derivate based (GD, LSE etc.) and non-derivative based (heuristic algorithms such us GA, PSO, ABC etc.) algorithms are used in ANFIS training. Nevertheless, it has been observed that there is a trend toward heuristic based ANFIS training algorithms for better performance recently. At the same time, it seems to be proposed in derivative and heuristic based hybrid algorithms. Within the scope of this study, the heuristic and hybrid approaches utilized in ANFIS training are examined in order to guide researchers in their study. In addition, the final status in ANFIS training is evaluated and it is aimed to shed light on further studies related to ANFIS training.

Cluster based wireless sensor network routing using artificial bee colony algorithm

Abstract: Due to recent advances in wireless communication technologies, there has been a rapid growth in wireless sensor networks research during the past few decades. Many novel architectures, protocols, algorithms, and applications have been proposed and implemented. The efficiency of these networks is highly dependent on routing protocols directly affecting the network life-time. Clustering is one of the most popular techniques preferred in routing operations. In this paper, a novel energy efficient clustering mechanism, based on artificial bee colony algorithm, is presented to prolong the network life-time. Artificial bee colony algorithm, simulating the intelligent foraging behavior of honey bee swarms, has been successfully used in clustering techniques. The performance of the proposed approach is compared with protocols based on LEACH and particle swarm optimization, which are studied in several routing applications. The results of the experiments show that the artificial bee colony algorithm based clustering can successfully be applied to WSN routing protocols.