Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | SENSORNETS 2016 - Proceedings of the 5th International Confererence on Sensor Networks |
| Publisher | SciTePress |
| Pages | 77-86 |
| Number of pages | 10 |
| ISBN (Electronic) | 9789897581694 |
| Publication status | Published - 2016 |
| Event | 5th International Confererence on Sensor Networks, SENSORNETS 2016 - Rome, Italy Duration: Feb 19 2016 → Feb 21 2016 |
Other
| Other | 5th International Confererence on Sensor Networks, SENSORNETS 2016 |
|---|---|
| Country | Italy |
| City | Rome |
| Period | 2/19/16 → 2/21/16 |
Fingerprint
Keywords
- Data aggregation scheduling
- Mac
- Many-to-many communication
- Multiple sinks
- Routing
- Wireless sensor networks
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Computer Networks and Communications
- Computer Science Applications
- Information Systems
Cite this
Towards energy-efficient collision-free data aggregation scheduling in wireless sensor networks with multiple sinks. / Saginbekov, Sain; Jhumka, Arshad; Shakenov, Chingiz.
SENSORNETS 2016 - Proceedings of the 5th International Confererence on Sensor Networks. SciTePress, 2016. p. 77-86.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
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
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
M3 - Conference contribution
SP - 77
EP - 86
BT - SENSORNETS 2016 - Proceedings of the 5th International Confererence on Sensor Networks
PB - SciTePress
ER -