Demirci, Serkan

Profile Picture
Profile URL
https://hdl.handle.net/20.500.14365/7575
Name Variants
Demirci, S.
Job Title
Email Address
Main Affiliation
05.05. Computer Engineering
Status
Former Staff
Website
ORCID ID
Scopus Author ID
Turkish CoHE Profile ID
Google Scholar ID
WoS Researcher ID

Sustainable Development Goals

SDG data is not available
This researcher does not have a Scopus ID.
This researcher does not have a WoS ID.
Scholarly Output

1

Articles

1

Views / Downloads

0/0

Supervised MSc Theses

0

Supervised PhD Theses

0

WoS Citation Count

25

Scopus Citation Count

35

WoS h-index

1

Scopus h-index

1

Patents

0

Projects

0

WoS Citations per Publication

25.00

Scopus Citations per Publication

35.00

Open Access Source

1

Supervised Theses

0

Google Analytics Visitor Traffic

JournalCount
Computers & Mathematıcs Wıth Applıcatıons1
Current Page: 1 / 1

Scopus Quartile Distribution

Competency Cloud

GCRIS Competency Cloud

Filters

20121
Reset filters

Settings

Scholarly Output Search Results

Now showing 1 - 1 of 1
  • Thumbnail Image
    Article
    Citation - WoS: 25
    Citation - Scopus: 35
    Shortest Hop Multipath Algorithm for Wireless Sensor Networks
    (Pergamon-Elsevier Science Ltd, 2012) Yilmaz, Onur; Demirci, Serkan; Kaymak, Yagiz; Ergun, Serkan; Yildirim, Ahmet
    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. (C) 2011 Elsevier Ltd. All rights reserved.