Authors:
Sain Saginbekov
1
;
Arshad Jhumka
2
and
Yerzhan Mademikhanov
1
Affiliations:
1
Nazarbayev University, Kazakhstan
;
2
Warwick University, United Kingdom
Keyword(s):
Wireless Sensor Networks, Multiple Sinks, Data Aggregation Scheduling, Lower Bound, Many-to-many Communication, Routing.
Related
Ontology
Subjects/Areas/Topics:
Obstacles
;
Routing Techniques
;
Sensor Networks
;
Wireless Information Networks
;
Wireless Network Protocols
Abstract:
Wireless Sensor Networks (WSNs) once deployed, are left unattended for extended periods of time. During
this time, the network can experience a range of faulty scenarios. If a sink node fails, data gathered by sensor
nodes may not be delivered to a destination. One way to increase the reliability of such WSNs is to deploy with
more than one sink. In this paper, we formalise the problem of many-to-many data aggregation scheduling in
WSNs with multiple sinks and establish a lower bound on the number of nodes with multiple slots.