• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Comparison and Application of Probabilistic Clustering Methods for System Improvement Prioritization

Lee, Soo Ho 19 July 2012 (has links)
No description available.
2

Fuzzy Unequal Clustering In Wireless Sensor Networks

Bagci, Hakan 01 January 2010 (has links) (PDF)
In order to gather information more efficiently, wireless sensor networks are partitioned into clusters. The most of the proposed clustering algorithms do not consider the location of the base station. This situation causes hot spots problem in multi-hop wireless sensor networks. Unequal clustering mechanisms, which are designed by considering the base station location, solve this problem. In this thesis, we propose a fuzzy unequal clustering algorithm (EAUCF) which aims to prolong the lifetime of wireless sensor networks. EAUCF adjusts the cluster-head radius considering the residual energy and the distance to the base station parameters of the sensor nodes. This helps decreasing the intra-cluster work of the sensor nodes which are closer to the base station or have lower battery level. We utilize fuzzy logic for handling the uncertainties in cluster-head radius estimation. We compare our algorithm with some popular algorithms in literature, namely LEACH, CHEF and EEUC, according to First Node Dies (FND), Half of the Nodes Alive (HNA) and energy-efficiency metrics. Our simulation results show that EAUCF performs better than other algorithms in most of the cases considering FND, HNA and energy-efficiency. Therefore, our proposed algorithm is a stable and energy-efficient clustering algorithm.

Page generated in 0.1321 seconds