Efficient Method for Data Aggregation for K-coverage in Wireless Sensor Networks

Please enable javascript in your browser.

Movaffagh, Ali | 2015

487 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 47540 (19)
University: Sharif University of Technology
Department: Computer Engineering
Advisor(s): Hemmatyar, Ali Mohammad Afshin
Abstract:
Technology advances in the era of wireless communications leads to the birth of a very useful network called Wireless sensor Network which is very interesting for scientists and researchers. While these networks consist of tens to thousands of tiny sensor nodes, they consume their energy from none-rechargeable batteries. Reducing energy consumption and extend the life of network is the most challenging requirement for these kinds of networks; in some environments like military training which precision and sensitivity are critical, it might take at least K sensors to cover the whole area and these conditions leads to a vast data repetition in network and as a result energy exhaustions in network nodes. The aim of this report is to provide a solution for networks with K nodes which operates based on data aggression and by identifies sensors producing same data and stop sending repeated packets in network. In this solution at first we divide the whole environment to different areas based on coverage level of sensors in a way that all nodes connect to main station via their leader node in their area
Keywords:
Clustering ; Data Aggregation ; Wireless Sensor Network ; Energy Consumption Reduction ; Hash Table

No TOC