In Wireless Sensor Networks Efficient Data Aggregation With Multiple Sinks
Dr G Sanjay Gandhi,  Popuri Vyshnavi,  Rajaneni Manasa,  Nuthakki Vinuthna,  Manukonda Sai Satwika
A Wireless Sensor Network (WSN) is a network comprised of sensor nodes and a designated
device called a sink to which nodes transmit their sensed data. Existing efficient data aggregation
protocols developed for WSNs with a single sink may not show the similar efficiency in WSNs
with multiple sinks. Usually WSNs are deployed with a single sink and left unattended for a long
time, and the sink may go down or crash due to energy depletion, harsh environment, or for some
other reasons. If the sink crashes, then the network becomes useless as the sink will not be able
to collect data from nodes. One way of making the network more reliable is to deploy networks
with more than one sink. Here, we first define the data aggregation problem in WSNs with
multiple sinks, and then propose two data aggregation algorithms. The first one is based on a
Minimum Spanning Tree algorithm and the second one is based on a Shortest Path Tree
algorithm. Simulation results show the effectiveness of the proposed algorithms.
Keywords- Wireless Sensor Networks, Data aggregation, Multiple sinks, Routing, Scheduling.
Cite this Article
Dr G Sanjay Gandhi,  Popuri Vyshnavi,  Rajaneni Manasa,  Nuthakki Vinuthna,  Manukonda Sai Satwika,   "In Wireless Sensor Networks Efficient Data Aggregation With Multiple Sinks"
, International Journal of Engineering Development and Research (IJEDR), ISSN:2321-9939, Volume.8, Issue 1, pp.493-496, March 2020, Available at :http://www.ijedr.org/papers/IJEDR2001094.pdf