Browsing by Author "Dagdeviren O."

Now showing 1 - 3 of 3

A 2-Hop Coloring-Based Collision Free Infrastructure Design for Wireless Sensor Networks
(Institute of Electrical and Electronics Engineers Inc., 2016) Korkmaz I.; Dagdeviren O.; Dalkilic M.E.
This paper mainly proposes a design for a communication infrastructure for Wireless Sensor Networks. The proposed design prevents message collisions by arranging the time schedules to send, receive, forward and overhear packets of the nodes considering 2-hop graph coloring mechanism. The system aims to exclude the compromised nodes in the network using the overhearing mechanism, and copes with recovering the paths of the legitimate nodes using multipath redundancy. The proposed scheduling-based and overhearing supported infrastructure brings the advantage of providing the Sensor Networks with both reliable communication using backup paths and energy conservation by preventing the collisions. © 2016 IEEE.
Citation - WoS: 13
Citation - Scopus: 12
Distributed Algorithms To Form Cluster Based Spanning Trees in Wireless Sensor Networks
(2008) Erciyes K.; Ozsoyeller D.; Dagdeviren O.
We propose two algorithms to form spanning trees in sensor networks. The first algorithm forms hierarchical clusters of spanning trees with a given root, the sink. All of the nodes in the sensor network are then classified iteratively as subroot, intermediate or leaf nodes. At the end of this phase, the local spanning trees are formed, each having a unique subroot (clusterhead) node. The communication and data aggregation towards the sink by an ordinary node then is accomplished by sending data to the local subroot which routes data towards the sink. A modified version of the first algorithm is also provided which ensures that the obtained tree is a breadth-first search tree where a node can modify its parent to yield shorter distances to the root. Once the sub-spanning trees in the clusters are formed, a communication architecture such as a ring can be formed among the subroots. This hybrid architecture which provides co-existing spanning trees within clusters yields the necessary foundation for a two-level communication protocol in a sensor network as well as providing a structure for a higher level abstraction such as the ? synchronizer where communication between the clusters is performed using the ring similar to an ? synchronizer and the intra cluster communication is accomplished using the sub-spanning trees as in the ? synchronizers. We discuss the model along with the algorithms, compare them and comment on their performances. © 2008 Springer-Verlag Berlin Heidelberg.
Citation - Scopus: 2
A Survey on Security in Wireless Sensor Networks: Attacks and Defense Mechanisms
(IGI Global, 2013) Korkmaz I.; Dagdeviren O.; Tekbacak F.; Dalkilic M.E.
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.