Along with the rapid growth of Wireless Sensor Networks, a wide range of challenges have come to existence to make the network more robust and versatile. Gaining energy efficiency and maximizing network lifetime are the most important of all that can affect the performance of the network directly. In this thesis, a number of research aspects related to energy efficient data gathering have been investigated and some promising proposals are presented. In large, hierarchical multi-hop Wireless Sensor Networks, power consumption characteristics of the static sensor nodes and data traffic distribution across the network are largely determined by the node position and the adopted routing protocol. In this thesis, these phenomena of the network are addressed analytically and we proposed some methods to divide the monitoring field into partitions that act as the basis for even load distribution in the network. We proposed an algorithm to calculate the area of the partitions that exploits the energy efficient features of optimal transmission range. The partition works as the bedrock of the other proposals in this thesis. Considering the influential factors of the proximity and the recent state of the network, we also developed a routing protocol that minimises over all energy consumption of the network and is able to dynamically select a route to the sink. Further, we proposed a rotational order for data gathering scheme that works along with the routing protocol to ensure load balancing and to alleviate data congestion around the sink. Clustered organization of the nodes in sensor networks can further save energy consumption and facilitates scope for better network management. In this thesis, we address the fact that equal sized clusters can cause unbalanced data traffic around the sink. So, we propose a method to calculate suitable cluster radii in different regions of the monitoring field in order to form clusters of different sizes. To ensure unequal clusters in the field, a cluster construction procedure is also proposed targeting minimal data generation, minimal energy consumption and providing capacity for reliability preservation. Furthermore, the notion of redundant nodes and the outlines of a possible solution to identify and deactivate redundant nodes are explained in this thesis. Since the clusterheads play an important role as coordinators in the clusters, it is vital that there is a clusterhead in every cluster all the time. In this thesis, a message optimal and distributed leader election algorithm is proposed to select a new clusterhead in case of unexpected and unnoticed failure of a clusterhead node. Detailed analysis and simulation of the proposed methods clarify the effectiveness of the research. In comparison with other methods of similar kind, our methods confirm better balanced energy dissipation, energy efficient route selection, message optimal clusterhead selection and prolonged lifetime of the network.
| Identifer | oai:union.ndltd.org:bl.uk/oai:ethos.bl.uk:606437 |
| Date | January 2013 |
| Creators | Murshed, Md. Golam |
| Publisher | University of Aberdeen |
| Source Sets | Ethos UK |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Source | http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=210783 |
Page generated in 0.0025 seconds