Dyuthi @ CUSAT >
Ph.D THESES >
Faculty of Technology >
Please use this identifier to cite or link to this item:
http://purl.org/purl/2774
|
Title: | Energy-Efficient Cluster based Routing Schemes for Static and Mobile Sensor Networks |
Authors: | Santhosh Kumar, G Dr.Poulose Jacob, K |
Keywords: | Sensor Network wireless sensor network Mobile Sensor Network Routing protocols Clustering TAR Protocol EACM LEACH Mobile Enhanced protocol Computer Science |
Issue Date: | Apr-2011 |
Publisher: | Cochin University of Science and Technology |
Abstract: | The theme of the thesis is centred around one important aspect of wireless sensor
networks; the energy-efficiency.The limited energy source of the sensor nodes
calls for design of energy-efficient routing protocols. The schemes for protocol
design should try to minimize the number of communications among the nodes to
save energy. Cluster based techniques were found energy-efficient. In this method
clusters are formed and data from different nodes are collected under a cluster
head belonging to each clusters and then forwarded it to the base station.Appropriate cluster head selection process and generation
of desirable distribution of the clusters can reduce energy consumption of the
network and prolong the network lifetime. In this work two such schemes were
developed for static wireless sensor networks.In the first scheme, the energy wastage due to cluster rebuilding incorporating
all the nodes were addressed. A tree based scheme is presented to alleviate this problem by rebuilding only sub clusters of the network. An analytical model of
energy consumption of proposed scheme is developed and the scheme is compared
with existing cluster based scheme. The simulation study proved the energy
savings observed.The second scheme concentrated to build load-balanced energy efficient clusters
to prolong the lifetime of the network. A voting based approach to utilise
the neighbor node information in the cluster head selection process is proposed.
The number of nodes joining a cluster is restricted to have equal sized optimum
clusters. Multi-hop communication among the cluster heads is also introduced
to reduce the energy consumption. The simulation study has shown that the
scheme results in balanced clusters and the network achieves reduction in energy
consumption.The main conclusion from the study was the routing scheme should pay
attention on successful data delivery from node to base station in addition to the
energy-efficiency. The cluster based protocols are extended from static scenario
to mobile scenario by various authors. None of the proposals addresses cluster
head election appropriately in view of mobility. An elegant scheme for electing
cluster heads is presented to meet the challenge of handling cluster durability
when all the nodes in the network are moving. The scheme has been simulated
and compared with a similar approach.The proliferation of sensor networks enables users with large set of sensor information
to utilise them in various applications. The sensor network programming
is inherently difficult due to various reasons. There must be an elegant
way to collect the data gathered by sensor networks with out worrying about the
underlying structure of the network. The final work presented addresses a way
to collect data from a sensor network and present it to the users in a flexible way.A service oriented architecture based application is built and data collection task
is presented as a web service. This will enable composition of sensor data from
different sensor networks to build interesting applications.
The main objective of the thesis was to design energy-efficient routing schemes
for both static as well as mobile sensor networks. A progressive approach was
followed to achieve this goal. |
Description: | Department of Computer Science,
Cochin University of Science and Technology |
URI: | http://dyuthi.cusat.ac.in/purl/2774 |
Appears in Collections: | Faculty of Technology
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|