A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks

Sain Saginbekov, Arshad Jhumka, Yerzhan Medemikhanov

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationSENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks
PublisherSciTePress
Pages202
Number of pages206
Publication statusPublished - 2017

Fingerprint

Wireless sensor networks
Sensor nodes
Agglomeration
Scheduling

Cite this

Saginbekov, S., Jhumka, A., & Medemikhanov, Y. (2017). A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks. In SENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks (pp. 202). SciTePress.

A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks. / Saginbekov, Sain; Jhumka, Arshad; Medemikhanov, Yerzhan.

SENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks. SciTePress, 2017. p. 202.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Saginbekov, S, Jhumka, A & Medemikhanov, Y 2017, A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks. in SENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks. SciTePress, pp. 202.
Saginbekov S, Jhumka A, Medemikhanov Y. A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks. In SENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks. SciTePress. 2017. p. 202
Saginbekov, Sain ; Jhumka, Arshad ; Medemikhanov, Yerzhan. / A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks. SENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks. SciTePress, 2017. pp. 202
@inproceedings{43fad72a0e884f4c8ea448ac0ea79f62,
title = "A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks",
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.",
author = "Sain Saginbekov and Arshad Jhumka and Yerzhan Medemikhanov",
year = "2017",
language = "English",
pages = "202",
booktitle = "SENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks",
publisher = "SciTePress",

}

TY - GEN

T1 - A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks

AU - Saginbekov, Sain

AU - Jhumka, Arshad

AU - Medemikhanov, Yerzhan

PY - 2017

Y1 - 2017

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 202

BT - SENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks

PB - SciTePress

ER -