Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Life time sensitive weighted clustering on wireless sensor networks
Download
index.pdf
Date
2013
Author
Alizadeh Jarchlo, Elnaz
Metadata
Show full item record
Item Usage Stats
161
views
101
downloads
Cite This
Wireless Sensor Networks typically include wireless sensor nodes with limited energy. Network lifetime and scalability are considered as two significant requirements for sensor network applications. In order to decrease energy consumption and increase network lifetime one can apply an efficient clustering method. The application of the clustering method proposed in this thesis (LTS-WCA) leads to reducing the energy cost and the transmission distance of each node by grouping the nodes in several clusters and assigning specific cluster heads for each group. This study aims to compare existing clustering algorithms and make modifications to enhance their performance. The study includes the implementation of LTS-WCA, which is proposed within the scope of this work, in a simulation environment and its evaluation in order to demonstrate its effectiveness.
Subject Keywords
Wireless sensor networks.
,
Wireless sensor nodes.
,
Wireless communication systems.
,
World Wide Web
,
Web search engines.
URI
http://etd.lib.metu.edu.tr/upload/12616280/index.pdf
https://hdl.handle.net/11511/23099
Collections
Graduate School of Informatics, Thesis
Suggestions
OpenMETU
Core
Path planning and localization for mobile anchor based wireless sensor networks
Erdemir, Ecenaz; Tuncer, Temel Engin; Department of Electrical and Electronics Engineering (2017)
In wireless sensor networks, sensors with limited resources are distributed in a wide area. Localizing the sensors is an important problem. Anchor nodes with known positions are used for sensor localization. A simple and efficient way of generating anchor nodes is to use mobile anchors which have built-in GPS units. In this thesis, a single mobile anchor is used to traverse the region of interest to communicate with the sensor nodes and identify their positions. Therefore planning the best trajectory for th...
Immune system based distributed node and rate selection in wireless sensor networks
Atakan, Baris; Akan, Ozguer B. (2006-12-13)
Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of dense deployed sensor nodes. Due to the dense deployment, since sensor observations are spatially correlated with respect to spatial location of sensor nodes, it may not be necessary for every sensor node to transmit its data. Therefore, due to the resource constraints of sensor nodes it is needed to select the minimum number of sensor nodes to transmit the data to the sink. Furthermore, to achieve the application-...
Communication Coverage in Wireless Passive Sensor Networks
Bereketli, Alper; Akan, Ozgur B. (2009-02-01)
System lifetime of wireless sensor networks (WSN) is inversely proportional to the energy consumed by critically energy-constrained sensor nodes during RF transmission. In that regard, modulated backscattering (MB) is a promising design choice, in which sensor nodes send their data just by switching their antenna impedance and reflecting the incident signal coming from an RF source. Hence, wireless passive sensor networks (WPSN) designed to operate using MB do not have the lifetime constraints of convention...
Analysis and modeling of routing and security problems in wireless sensor networks with mathematical programming
İncebacak, Davut; Baykal, Nazife; Bıçakcı, Kemal; Department of Information Systems (2013)
Wireless Sensor Networks (WSNs) are composed of battery powered small sensor nodes with limited processing, memory and energy resources. Self organization property together with infrastructureless characteristics of WSNs make them favorable solutions for many applications. Algorithms and protocols developed for WSNs must consider the characteristics and constraints of WSNs but since battery replenishment is not possible or highly challenging for sensor nodes, one of the major concerns in designing network p...
Immune system-based energy efficient and reliable communication in wireless sensor networks
Atakan, Baris; Akan, Oezguer B. (2006-12-01)
Wireless sensor networks (WSNs) are event-based systems that rely on the collective effort of densely deployed sensor nodes. Due to the dense deployment, since sensor observations are spatially correlated with respect to location of sensor nodes, it may not be necessary for every sensor node to transmit its data. Therefore, due to the resource constraints of sensor nodes, it is imperative to select the minimum number of sensor nodes to transmit the data to the sink. Furthermore, to achieve the application-s...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
E. Alizadeh Jarchlo, “Life time sensitive weighted clustering on wireless sensor networks,” M.S. - Master of Science, Middle East Technical University, 2013.
