TY - GEN
T1 - Towards energy-efficient collision-free data aggregation scheduling in wireless sensor networks with multiple sinks
AU - Saginbekov, Sain
AU - Jhumka, Arshad
AU - Shakenov, Chingiz
N1 - Publisher Copyright:
© Copyright 2016 by SCITEPRESS- Science and Technology Publications, Lda. All rights reserved.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2016
Y1 - 2016
N2 - Traditionally, Wireless Sensor Networks (WSNs) are deployed with a single sink. Due to the emergence of sophisticated applications, WSNs may require more than one sink, where many nodes forward data to many sinks. Moreover, deploying more than one sink may prolong the network lifetime and address fault tolerance issues. Several protocols have been proposed for WSNs with multiple sinks. However, they are either routing protocols or forward data from many nodes to one sink. In this paper, we propose data aggregation scheduling and energy-balancing algorithms for WSNs with multiple sinks that forward data from many nodes to many sinks. The algorithm first forms trees rooted at virtual sinks and then balances the number of children among nodes to balance energy consumption. Further, the algorithm assigns contiguous slots to sibling nodes to avoid unnecessary energy waste due to active-sleep transitions. We prove a number of theoretical results and the correctness of the algorithms. Simulation and testbed results show the correctness and performance of our algorithms.
AB - Traditionally, Wireless Sensor Networks (WSNs) are deployed with a single sink. Due to the emergence of sophisticated applications, WSNs may require more than one sink, where many nodes forward data to many sinks. Moreover, deploying more than one sink may prolong the network lifetime and address fault tolerance issues. Several protocols have been proposed for WSNs with multiple sinks. However, they are either routing protocols or forward data from many nodes to one sink. In this paper, we propose data aggregation scheduling and energy-balancing algorithms for WSNs with multiple sinks that forward data from many nodes to many sinks. The algorithm first forms trees rooted at virtual sinks and then balances the number of children among nodes to balance energy consumption. Further, the algorithm assigns contiguous slots to sibling nodes to avoid unnecessary energy waste due to active-sleep transitions. We prove a number of theoretical results and the correctness of the algorithms. Simulation and testbed results show the correctness and performance of our algorithms.
KW - Data aggregation scheduling
KW - Mac
KW - Many-to-many communication
KW - Multiple sinks
KW - Routing
KW - Wireless sensor networks
UR - http://www.scopus.com/inward/record.url?scp=84971382240&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84971382240&partnerID=8YFLogxK
U2 - 10.5220/0005735000770086
DO - 10.5220/0005735000770086
M3 - Conference contribution
AN - SCOPUS:84971382240
T3 - SENSORNETS 2016 - Proceedings of the 5th International Confererence on Sensor Networks
SP - 77
EP - 86
BT - SENSORNETS 2016 - Proceedings of the 5th International Confererence on Sensor Networks
A2 - Ahrens, Andreas
A2 - Postolache, Octavian
A2 - Benavente-Peces, Cesar
PB - SciTePress
T2 - 5th International Confererence on Sensor Networks, SENSORNETS 2016
Y2 - 19 February 2016 through 21 February 2016
ER -