default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavut Incebacak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j6]Huseyin Ugur Yildiz
, Bekir Sait Ciftler, Bülent Tavli, Kemal Bicakci, Davut Incebacak:
The Impact of Incomplete Secure Connectivity on the Lifetime of Wireless Sensor Networks. IEEE Syst. J. 12(1): 1042-1046 (2018)- 2016
- [j5]Huseyin Ugur Yildiz, Kemal Bicakci, Bülent Tavli, Hakan Gultekin, Davut Incebacak:
Maximizing Wireless Sensor Network lifetime by communication/computation energy optimization of non-repudiation security service: Node level versus network level strategies. Ad Hoc Networks 37: 301-323 (2016) - 2015
- [j4]Davut Incebacak, Ruken Zilan, Bülent Tavli, José M. Barceló-Ordinas, Jorge García-Vidal:
Optimal data compression for lifetime maximization in wireless sensor networks operating in stealth mode. Ad Hoc Networks 24: 134-147 (2015) - [j3]Davut Incebacak, Kemal Bicakci, Bülent Tavli:
Evaluating energy cost of route diversity for security in wireless sensor networks. Comput. Stand. Interfaces 39: 44-57 (2015) - [c7]Nursultan Turdaliev, Burcu Bilgin, Gencay Deniz, Pinar Onay Durdu, Davut Incebacak, Alev Mutlu:
UYMS Araştırma Eğilimleri: Bir Sistematik Eşleme Çalışması. UYMS 2015 - 2014
- [j2]Erkam Uzun, Bülent Tavli, Kemal Bicakci, Davut Incebacak:
The impact of scalable routing on lifetime of smart grid communication networks. Ad Hoc Networks 22: 27-42 (2014) - [c6]Davut Incebacak, Halim Yanikomeroglu, Bülent Tavli:
Trade-offs in sum-rate maximization and fairness in relay-enhanced OFDMA-based cellular networks. GLOBECOM 2014: 4770-4775 - 2013
- [b1]Davut Incebacak:
Analysis and modeling of routing and security problems in wireless sensor networks with mathematical programming ; Kablosuz algılayıcı ağlarda yönlendirme ve güvenlik problemlerinin matematiksel programlama vasıtasıyla modellenmesi ve analizi. Middle East Technical University, Çankaya, Ankara, Turkey, 2013 - [j1]Davut Incebacak, Bülent Tavli, Kemal Bicakci, Aysegül Altin-Kayhan:
Optimal number of routing paths in multi-path routing to minimize energy consumption in wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 2013: 252 (2013) - [c5]Anil Ufuk Batmaz, Bülent Tavli, Davut Incebacak, Kemal Bicakci:
The impact of link unidirectionality and reverse path length on wireless sensor network lifetime. ICC 2013: 1795-1799 - [c4]Anil Ufuk Batmaz, Bülent Tavli, Davut Incebacak, Kemal Bicakci:
Effects of handshake hop length of unidirectional links on the lifetime of wireless sensor networks. SIU 2013: 1-4 - [c3]Erkam Uzun, Alper Aksaç, Orkun Ozturk, Hakan Ezgi Kiziloz, Davut Incebacak, Bülent Tavli, Kemal Bicakci:
Network lifetime maximization and localized routing tradeoff in wireless sensor networks. SIU 2013: 1-4 - 2012
- [c2]Davut Incebacak, Kemal Bicakci, Bülent Tavli:
Energy Cost of Mitigating Physical Attacks in Wireless Sensor Networks. NTMS 2012: 1-5 - 2010
- [c1]Davut Incebacak, Kemal Bicakci, Bülent Tavli:
Investigating the Tradeoffs between Spatial Granularity and Energy Requirements in Wireless Sensor Networks. EMS 2010: 414-419
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-07 20:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
