Skip navigation

Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/195
Title: Approaches to improve efficiency of data gathering in wireless sensor networks
Other Titles: https://shodhganga.inflibnet.ac.in/handle/10603/195709
https://shodhganga.inflibnet.ac.in/bitstream/10603/195709/2/02_certificate.pdf
Authors: Sujithra, T
Venkatesan, R
Keywords: Assumptions
Cluster
Scalability
Threshold
Tolerant
Issue Date: 2016
Publisher: ANNA UNIVERSITY
Abstract: iii ABSTRACT Data gathering plays a pivotal role in wireless sensor networks as it affects the lifetime of the sensor network, and has higher energy consumption than that of communication. The possible ways of initiating the data transfer from the sensors to the sink are event driven, query based, time driven and hybrid. For any data gathering scheme, sensors send their readings to the sink, which is classified into two namely, static sink and mobile sink based on the sink mobility. In the static sink approach, sink is placed permanently in the sensing environment, and the data are collected via multi-hop communication. Due to this, the nodes near the sink deplete its energy at the earliest, and result in energy hole problem. In order to address this issue, cluster based data gathering approaches are proposed. In the cluster based data gathering approach, the nodes that are close to each other are grouped together, and a node in the group is randomly selected as cluster head, which collects the information from the remaining nodes in the group called cluster members. This approach reduces the number of nodes that participate in the forwarding of data to the sink. It also reduced the energy hole problem, whereas the lifetime of the CH near the sink remained an issue, which was addressed by the ME data gathering approach. In ME data gathering, ME visits every sensor node in its transmission range and collects the information from it. Though it reduce the energy hole problem. The data gathering latency is an open issue which is addressed by introducing rendezvous points. v Further to improve the performance of T-TEEBDG, the SEEBDG approaches are proposed. It is a cluster free energy conservation scheme for heterogeneous wireless sensor networks. In order to reduce the multi-hop communication, region partitioning is carried out based on the communication range of the resource rich node named local data collector (LDC). LDC transmits its request using free space model because of its high transceiver capacity. But data is collected from the sensor nodes in the local sensing region via multi-hop communication. Hence, energy hole problem still remains. In order to reduce the multi-hop communication, the nodes that are communicating with the ME is controlled based on the threshold value. Therefore, only minimal amount of nodes goes for multi-hop communication. For further improvement, an Unmanned Aerial vehicle (UAV) is used not only to collect the information but also to improve the speed of the data gathering. However, it reduces the data gathering latency by introducing LDC; ME should visit every LDC and collects the information from it. Hence, the data gathering latency still remains unsolved. In order to improve this, EEMDG approach is proposed. In EEBDG approach, ME collects the information from only the special nodes named buffering nodes and visits its entire Buffering Node (BN). But, it collects the information only from the BNs that are in critical situation and thus increases the speed of the data gathering and network lifetime. QDC approach is proposed to improve the performance of the cluster based static sink data gathering approach. In traditional clustering, all the sensor nodes in the sensing environment is considered while forming the cluster and it increases the cluster count and its density. Furthermore, cluster head transmits its collected information to the static sink via other cluster heads, which makes the CH near the sink deplete its energy quickly. The main objective of the QDC approach is to reduce the energy consumption by controlling cluster count and its density, and increase the network lifetime by using relay element based routing. In which, the nodes satisfying the query are only allowed to participate in the clustering process. Others immediately go to the sleep mode. It reduces the count of clusters formed and increases the network lifetime. The cluster head that proximate to BS is taken as the first level cluster head and it uses a free space model to transmit the data to BS. The cluster heads, which are out of BS proximity is taken as the second level cluster head, which transmits data to BS with the help of relay node. The relay nodes are resource rich nodes that transmit the data to BS via other relay node. Hence, the load is balanced. To further improve the performance of the QDC approach, a GAEEDG approach has been proposed. In which, the Genetic Algorithm (GA) is applied to minimize the count of the cluster formed and maximize the network lifetime in terms of rounds. From the simulation results, it can be concluded that these proposed approaches outperforms the benchmarking system in various aspects viz network lifetime, data gathering latency and packet delivery ratio.
URI: http://localhost:8080/xmlui/handle/123456789/195
Appears in Collections:Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
03_abstract(12).pdfABSTRACT17.59 kBAdobe PDFView/Open
Show full item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.