Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
Permanent URI for this collectionhttps://hdl.handle.net/11147/7148
Browse
5 results
Search Results
Conference Object Duyarga Ağları için Bir Γ Eşuyumcusu Tasarım ve Uygulaması(IEEE, 2008) Özsoyeller, Deniz; Erciyeş, Kayhan; Dağdeviren, OrhanImplementation of synchronous algorithms in distributed systems in general is less troublesome than the implementation of asynchronous algorithms. Synchronizers provide synchronous execution of an asynchronous algorithm in distributed systems. In this study, we propose a gamma synchronizer for Wireless Sensor Networks (WSNs). This synchronizer consists of a and beta synchronizers. In our work, the WSN is first divided into clusters and then these clusters are connected using a ring protocol. Synchronization is provided using the beta synchronizer in the cluster and a synchronizer among the clusters. We describe the clustering algorithm and the ring formation algorithm for the WSNs and give the results obtained so far.Conference Object Citation - Scopus: 8Localization of a Passive Molecular Transmitter With a Sensor Network(Springer, 2020) Güleç, Fatih; Atakan, BarışMacroscale molecular communication (MC), which has a potential for practical applications, is a promising area for communication engineering. In a practical scenario such as monitoring air pollutants released from an unknown source, it is essential to estimate the location of the molecular transmitter (TX). This paper presents a novel Sensor Network-based Localization Algorithm (SNCLA) for passive transmission by using a novel experimental platform which mainly comprises a clustered sensor network (SN) with 24 sensor nodes and evaporating ethanol molecules as the passive TX. With the usage of the SN concept, novel methods can be developed for the problems in macroscale MC by utilizing the wide literature of sensor networks. In SNCLA, Gaussian plume model is employed to derive the location estimator. The parameters such as transmitted mass, wind velocity, detection time and actual concentration are calculated or estimated from the measured signals via the SN to be employed as the input for the location estimator. The numerical results show that the performance of SNCLA is better for stronger winds in the medium. Our findings show that evaporated molecules do not propagate homogeneously through the SN due to the presence of the wind. In addition, the estimation error of SNCLA decreases for higher detection threshold values. © 2020, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.Conference Object The Influence of the Surface Topography of Distributed Sensor Networks on Perception(CSREA Press, 2012) Özkan, Özün Beyhan; Tosun, Öykü Ece; Arslan, Arda; Gençer, İsmail Cenk; Özçetin, Mustafa; Serindağ, Yelda; Memiş, Korhan; Özdemir, SerhanThis work investigates the effects of surface topography of the distributed sensor networks on perception through the differences in sensor readings. Compound eyes are found in some insects and crustaceans. Lateral inhibition is a biological signal processing which can increase contrast, enhancing perception. It is known that eye convexity helps increase field of view (FOV). A series of experiments were carried out to understand the effect of surface topography on local contrast gradient. Two sets of sensor networks of 5 × 5 were constructed. In the first network the board holding the sensors was a flat circuit board, whereas the second one was given a radius of curvature of roughly 30 cm. All readings were recorded in a dark chamber. Sensor networks were illuminated by a light source whose coordinates could be adjusted. Results are tabulated. It is seen that eye convexity in compound eyes improves perception, as well as FOV.Article Citation - WoS: 13Citation - Scopus: 18Graph Matching-Based Distributed Clustering and Backbone Formation Algorithms for Sensor Networks(Oxford University Press, 2010) Dağdeviren, Orhan; Erciyeş, KayhanClustering is a widely used technique to manage the essential operations such as routing and data aggregation in wireless sensor networks (WSNs). We propose two new graph-theoretic distributed clustering algorithms for WSNs that use a weighted matching method for selecting strong links. To the best of our knowledge, our algorithms are the first attempts that use graph matching for clustering. The first algorithm is divided into rounds; extended weighted matching operation is executed by nodes in each round; thus the clusters are constructed synchronously. The second algorithm is the enhanced version of the first algorithm, which provides not only clustering but also backbone formation in an energy-efficient and asynchronous manner. We show the operation of the algorithms, analyze them, provide the simulation results in an ns2 environment. We compare our proposed algorithms with the other graph-theoretic clustering algorithms and show that our algorithms select strong communication links and create a controllable number of balanced clusters while providing low-energy consumptions. We also discuss possible applications that may use the structure provided by these algorithms and the extensions to the algorithms. © The Author 2009. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.Conference Object Citation - WoS: 13Citation - Scopus: 12Distributed Algorithms To Form Cluster Based Spanning Trees in Wireless Sensor Networks(Springer Verlag, 2008) Erciyeş, Kayhan; Özsoyeller, Deniz; Dağdeviren, OrhanWe 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.