Please use this identifier to cite or link to this item:
http://localhost:8081/jspui/handle/123456789/17891
Title: | SELF-ORGANIZING CLUSTERING METHODS FOR ENERGY-EFFICIENT DATA GATHERING IN SENSOR NETWORKS |
Authors: | Verma, Darvin |
Keywords: | Wireless Sensor;Behaviour;Sensor Network;Cluster Base |
Issue Date: | Jun-2013 |
Publisher: | I I T ROORKEE |
Abstract: | By deploying wireless sensor nodes and composing a sensor network. one can remotely obtain information about the behaviour, conditions. and positions of entities in a region. Since sensor nodes operate on batteries, energy-efficient mechanisms for gathering sensor data are indispensable to prolong the lifetime of a sensor network as long as possible. A sensor node consumes energy in observing its surroundings, transmitting data, and receiving data. Especially, energy consumption in data transmission scales proportionally to the n-th power of the radius of the radio signal. Therefore, cluster-based data gathering mechanisms effectively save energy. In cluster-based data gathering, since each node can save transmission power and the number of collisions is also reduced. sensor networks can live for longer period. In clustering, however, we need to consider that a cluster-head consumes more energy than the other nodes in receiving data from cluster members, fusing data to reduce the size, and sending the aggregated data to a base station. This dissertation synthesises existing clustering algorithms in WSNs and compare them in terms of their stable operation period (SOP) and highlights the challenges in clustering. |
URI: | http://localhost:8081/jspui/handle/123456789/17891 |
metadata.dc.type: | Other |
Appears in Collections: | MASTERS' THESES (E & C) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
G22505.pdf | 5.99 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.