Computer Engineering / Bilgisayar Mühendisliği

Permanent URI for this collectionhttps://hdl.handle.net/11147/10

Browse

Filters

2013 - 20182

Settings

Publisher: search.filters.publisher.IGI Global

Search Results

Now showing 1 - 2 of 2
  • Book Part
    Citation - Scopus: 2
    A Survey on Security in Wireless Sensor Networks: Attacks and Defense Mechanisms
    (IGI Global, 2013) Tekbacak, Fatih; Dalkılıç, Mehmet Emin; Korkmaz, İlker; Dağdeviren, Orhan
    Wireless Sensor Network (WSN) is a promising technology that has attracted the interest of research in the last decade. Security is one of the fundamental issues in sensor networks since sensor nodes are very resource constrained. An attacker may modify, insert, and delete new hardware and software components to the system where a single node, a specific part of the sensing area, and the whole network may become inoperable. Thus, the design of early attack detection and defense mechanisms must be carefully considered. In this chapter, the authors survey attacks and their defense mechanisms in WSNs. Attacks are categorized according to the related protocol layer. They also investigate the open research issues and emerging technologies on security in WSNs.
  • Article
    Citation - WoS: 1
    Citation - Scopus: 2
    Dynamic Itemset Hiding Algorithm for Multiple Sensitive Support Thresholds
    (IGI Global, 2018) Öztürk, Ahmet Cumhur; Ergenç, Belgin
    This article describes how association rule mining is used for extracting relations between items in transactional databases and is beneficial for decision-making. However, association rule mining can pose a threat to the privacy of the knowledge when the data is shared without hiding the confidential association rules of the data owner. One of the ways hiding an association rule from the database is to conceal the itemsets (co-occurring items) from which the sensitive association rules are generated. These sensitive itemsets are sanitized by the itemset hiding processes. Most of the existing solutions consider single support thresholds and assume that the databases are static, which is not true in real life. In this article, the authors propose a novel itemset hiding algorithm designed for the dynamic database environment and consider multiple itemset support thresholds. Performance comparisons of the algorithm is done with two dynamic algorithms on six different databases. Findings show that their dynamic algorithm is more efficient in terms of execution time and information loss and guarantees to hide all sensitive itemsets.