scispace - formally typeset
Search or ask a question
Author

Sercan Demirci

Other affiliations: Ege University
Bio: Sercan Demirci is an academic researcher from Ondokuz Mayıs University. The author has contributed to research in topics: Routing protocol & Cognitive radio. The author has an hindex of 5, co-authored 34 publications receiving 78 citations. Previous affiliations of Sercan Demirci include Ege University.

Papers
More filters
Journal ArticleDOI
TL;DR: This paper proposes a novel distributed shortest hop multipath algorithm for WSNs in order to generate energy efficient paths for data dissemination or routing and guarantees the BFS tree and generates near optimal paths.
Abstract: Shortest hop or distance path is one of the most common methods used for relaying messages in a wide variety of networks. It provides an efficient message relaying to destination in terms of energy and time. There are many algorithms for constructing shortest hop or distance path. However, according to our knowledge, no algorithm for constructing a shortest hop multipath for wireless sensor networks (WSNs) has yet been proposed in the literature. In this paper, we propose a novel distributed shortest hop multipath algorithm for WSNs in order to generate energy efficient paths for data dissemination or routing. The proposed algorithm generates shortest hop braided multipath to be used for fault-tolerance or load-balancing. It guarantees the BFS tree and generates near optimal paths in O(V.D+V) message complexity and O(D^2) time complexity regarding the communication costs towards the sink after termination of algorithm.

32 citations

Journal ArticleDOI
TL;DR: In this article, a new meta-heuristic called Immune Plasma (IP) algorithm was introduced to transfer the antibody rich part of the blood taken from the patients who are recovered previously to the critical individuals and its efficiency has been proven by successfully using against great influenza of 1918, H1N1 flu, MERS, SARS and Ebola.
Abstract: The recent global health crisis also known as the COVID-19 or coronavirus pandemic has attracted the researchers’ attentions to a treatment approach called immune plasma or convalescent plasma once more again. The main idea lying behind the immune plasma treatment is transferring the antibody rich part of the blood taken from the patients who are recovered previously to the critical individuals and its efficiency has been proven by successfully using against great influenza of 1918, H1N1 flu, MERS, SARS and Ebola. In this study, we modeled the mentioned treatment approach and introduced a new meta-heuristic called Immune Plasma (IP) algorithm. The performance of the IP algorithm was investigated in detail and then compared with some of the classical and state-of-art meta-heuristics by solving a set of numerical benchmark problems. Moreover, the capabilities of the IP algorithm were also analyzed over complex engineering optimization problems related with the noise minimization of the electro-encephalography signal measurements. The results of the experimental studies showed that the IP algorithm is capable of obtaining better solutions for the vast majority of the test problems compared to other commonly used meta-heuristic algorithms.

16 citations

Journal ArticleDOI
TL;DR: This article forms the joint frequency assignment and scheduling problem for multihop industrial CR networks with a single transceiver by considering varying amounts of energy consumption that occurs while CR devices switch to different frequency bands and proposes a polynomial-time heuristic algorithm to solve the energy consumption problem due to channel switching.
Abstract: The problem of inefficient and unevenly distributed spectrum usage in industrial wireless networks has led to the emergence of the concept of industrial cognitive radio (CR) networks, which have particularly important applications in automotive industry. Industrial CR networks are planned to function in a wide spectrum range; therefore, they have high energy consumption because of frequency switching while other wireless technologies do not have this problem. A distinctive feature of this switching cost is that it depends on the wideness between the two frequency bands. In this article, we formulate the joint frequency assignment and scheduling problem for multihop industrial CR networks with a single transceiver by considering varying amounts of energy consumption that occurs while CR devices switch to different frequency bands. Our optimization problem, which we formulate as an integer linear program, minimizes the energy cost related to frequency switching while making frequency and time slot allocation to the cognitive devices. We prove that even on star graphs, our formulated problem is inapproximable within any polynomial-time computable function $f(n)$ in addition to being $\textsc {NP}\text {-Hard}$ in the strong sense. Therefore, we propose a polynomial-time heuristic algorithm to solve the energy consumption problem due to channel switching. Simulation results demonstrate that the performance of our heuristic algorithm is very close to the results obtained from the integer linear programming implementation by CPLEX optimization software. We also compare our proposed method with the corresponding constant energy consumption for frequency switching case and two state-of-the-art algorithms and demonstrate that taking into account the different energy consumption while switching to different frequency bands is vital for joint frequency assignment and scheduling in multihop industrial CR networks with a single transceiver.

16 citations

Journal ArticleDOI
TL;DR: Streaming tests show that video streaming applications perform well in terms of received video quality if hierarchical clusters considering delay proximity are used as underlying network architecture.

12 citations

Proceedings ArticleDOI
01 Sep 2019
TL;DR: Experimental studies carried out with different building scenarios showed that ABC algorithm is capable of finding more appropriate location for the UAV compared to the Particle Swarm Optimization (PSO) algorithm.
Abstract: Driven by the wireless communication, sensor, vision system and battery technologies, unmanned aerial vehicles for short UAVs have started to be used for solving social, commercial or military applications including traffic surveillance, package transportation, wildlife research and critical area monitoring. In addition to the mentioned usage scenarios of the UAVs, an UAV or a set of UAVs can be successfully used as wireless base station or stations for the users inside a building when mobile cellular networks are down. In this study, wireless base station role is assigned to a UAV and its optimal location is tried to be determined with the Artificial Bee Colony (ABC) algorithm. Experimental studies carried out with different building scenarios showed that ABC algorithm is capable of finding more appropriate location for the UAV compared to the Particle Swarm Optimization (PSO) algorithm.

9 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: Experimental data demonstrate that the WSN topology obtained has the property of weighted networks of the IOT: the edge weight, vertex degree, and strength follow a power-law distribution.
Abstract: In this paper, we propose a new constructing approach for a weighted topology of wireless sensor networks (WSNs) based on local-world theory for the Internet of Things (IOT). Based on local-world theory, an uneven clustering weighted evolving model of WSNs is designed. The definitions of edge weight and vertex strength take sensor energy, transmission distance, and flow into consideration. The vertex strengths drive the growth of topology; meanwhile, the edge weights change correspondingly. Experimental data demonstrate that the WSN topology we obtain has the property of weighted networks of the IOT: the edge weight, vertex degree, and strength follow a power-law distribution. Related IOT research work shows that weighted WSNs not only share the robustness and fault tolerance of weight-free networks, but also reduce the probability that successive node breakdowns occur; furthermore, they enhance the synchronization of WSNs.

192 citations

Journal ArticleDOI
TL;DR: This paper reviews the literature with specific attention to aspects of wireless networking for the preservation of energy and aggregation of data in IoT-WSN systems.

105 citations

Journal ArticleDOI
TL;DR: A novel and comprehensive trust estimation approach (LTS) for large-scale WSN that employs clustering to improve cooperation, trustworthiness, and security by detecting malicious sensor nodes with reduced resource (memory and power) consumption is proposed.
Abstract: With the wide applications of wireless sensor networks (WSNs) in various fields, such as environment monitoring, battlefield surveillance, healthcare, and intrusion detection, trust establishment among sensor nodes becomes a vital requirement to improve security, reliability, and successful cooperation. The existing trust management approaches for large-scale WSN are failed due to their low dependability (i.e., cooperation), higher communication, and memory overheads (i.e., resource inefficient). In this paper, we propose a novel and comprehensive trust estimation approach (LTS) for large-scale WSN that employs clustering to improve cooperation, trustworthiness, and security by detecting malicious (faulty or selfish) sensor nodes with reduced resource (memory and power) consumption. The proposed scheme (LTS) operates on two levels, namely, intra-cluster and inter-cluster along with distributed approach and centralized approach, respectively, to make accurate trust decision of sensor nodes with minimum overheads. LTS consists of unique features, such as robust trust estimation function, attack resistant, and efficient trust aggregation at the cluster, head to obtain the global feedback trust value. Data trust along with communication trust plays a significant role to cope with malicious nodes. In LTS, punishment and trust severity can be tuned according to the application requirement, which makes it an innovative LTS. Moreover, dishonest recommendations (outliers) are eliminated before aggregation at the base station by observing the statistical dispersion. The theoretical and mathematical validations along with simulation results exhibit the great performance of our proposed approach in terms of trust evaluation cost, prevention, and detection of malicious nodes as well as communication overhead.

100 citations

Journal ArticleDOI
10 May 2017-Sensors
TL;DR: An extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols for WSNs is presented and possible research directions in order to optimize the energy consumption in sensor networks are suggested.
Abstract: Wireless sensor networks (WSNs) form an important part of industrial application. There has been growing interest in the potential use of WSNs in applications such as environment monitoring, disaster management, health care monitoring, intelligence surveillance and defence reconnaissance. In these applications, the sensor nodes (SNs) are envisaged to be deployed in sizeable numbers in an outlying area, and it is quite difficult to replace these SNs after complete deployment in many scenarios. Therefore, as SNs are predominantly battery powered devices, the energy consumption of the nodes must be properly managed in order to prolong the network lifetime and functionality to a rational time. Different energy-efficient and energy-balanced routing protocols have been proposed in literature over the years. The energy-efficient routing protocols strive to increase the network lifetime by minimizing the energy consumption in each SN. On the other hand, the energy-balanced routing protocols protract the network lifetime by uniformly balancing the energy consumption among the nodes in the network. There have been various survey papers put forward by researchers to review the performance and classify the different energy-efficient routing protocols for WSNs. However, there seems to be no clear survey emphasizing the importance, concepts, and principles of load-balanced energy routing protocols for WSNs. In this paper, we provide a clear picture of both the energy-efficient and energy-balanced routing protocols for WSNs. More importantly, this paper presents an extensive survey of the different state-of-the-art energy-efficient and energy-balanced routing protocols. A taxonomy is introduced in this paper to classify the surveyed energy-efficient and energy-balanced routing protocols based on their proposed mode of communication towards the base station (BS). In addition, we classified these routing protocols based on the solution types or algorithms, and the input decision variables defined in the routing algorithm. The strengths and weaknesses of the choice of the decision variables used in the design of these energy-efficient and energy-balanced routing protocols are emphasised. Finally, we suggest possible research directions in order to optimize the energy consumption in sensor networks.

100 citations

Journal ArticleDOI
27 Mar 2012-Sensors
TL;DR: The main goals of data routing approach in sensor networks are described, and the best known and most recent data routing approaches in WSNs are classified and studied according to their specific goals.
Abstract: Recent years have witnessed a growing interest in deploying large populations of microsensors that collaborate in a distributed manner to gather and process sensory data and deliver them to a sink node through wireless communications systems. Currently, there is a lot of interest in data routing for Wireless Sensor Networks (WSNs) due to their unique challenges compared to conventional routing in wired networks. In WSNs, each data routing approach follows a specific goal (goals) according to the application. Although the general goal of every data routing approach in WSNs is to extend the network lifetime and every approach should be aware of the energy level of the nodes, data routing approaches may focus on one (or some) specific goal(s) depending on the application. Thus, existing approaches can be categorized according to their routing goals. In this paper, the main goals of data routing approaches in sensor networks are described. Then, the best known and most recent data routing approaches in WSNs are classified and studied according to their specific goals.

56 citations