Sürdürülebilir Yeşil Kampüs Koleksiyonu / Sustainable Green Campus Collection

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

Browse

Filters

2010 - 20112

Settings

Department: search.filters.department.İzmir Institute of Technology. Computer EngineeringScopus Q: search.filters.scopusQuartile.Q2

Search Results

Now showing 1 - 2 of 2
  • Article
    Citation - WoS: 14
    Citation - Scopus: 21
    A Survey of Agent Technologies for Wireless Sensor Networks
    (Medknow Publications and Media, 2011) Dagdeviren, Orhan; Korkmaz, İlker; Tekbacak, Fatih; Erciyeş, Kayhan
    Wireless sensor networks (WSNs) do not have a fixed infrastructure and consist of sensor nodes that perform sensing and communicating tasks. The WSNs have large application spectrum such as habitat monitoring, military surveillance, and target tracking, where sensor nodes may operate distributed in highly dynamic environments. Battery-constrained sensor nodes may aggregate the sensed data, localize themselves, and route the packets in an energy-efficient and decentralized manner to enable running the applications. Agents are capable of independent and autonomous action, so that they can successfully carry out tasks that have been delegated to them, thus agent-based approaches are very suitable to apply as the solution of the problems occurring in WSNs. So far many agent-based approaches were proposed for WSNs. This paper surveys the agent technologies for sensor networks by providing a classification, objectives and costs of these approaches with the open research problems. To the best of our knowledge, this is the first study that covers the intersection of the agent technology and sensor networks from a wide perspective.
  • Article
    Citation - WoS: 13
    Citation - Scopus: 18
    Graph Matching-Based Distributed Clustering and Backbone Formation Algorithms for Sensor Networks
    (Oxford University Press, 2010) Dağdeviren, Orhan; Erciyeş, Kayhan
    Clustering 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.