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

Sain Saginbekov; Arshad Jhumka; Yerzhan Medemikhanov

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

Sain Saginbekov, Arshad Jhumka, Yerzhan Medemikhanov

Department of Computer Science

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 language	English
Title of host publication	SENSORNETS 2017 - Proceedings of the 6th International Conference on Sensor Networks
Publisher	SciTePress
Pages	202
Number of pages	206
Publication status	Published - 2017

Fingerprint Dive into the research topics of 'A lower bound on the number of nodes with multiple slots in wireless sensor networks with multiple sinks'. Together they form a unique fingerprint.

Cite this

@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 -