Many-to-many data aggregation scheduling in wireless sensor networks with two sinks

Sain Saginbekov, Arshad Jhumka

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

Traditionally, wireless sensor networks (WSNs) have been deployed with a single sink. Due to the emergence of sophisticated applications, WSNs may require more than one sink. 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, most of them are routing protocols. Differently, our main contribution, in this paper, is the development of a distributed data aggregation scheduling (DAS) algorithm for WSNs with two sinks. We also propose a distributed energy-balancing algorithm to balance the energy consumption for the aggregators. The energy-balancing algorithm first forms trees rooted at nodes which are termed virtual sinks and then balances the number of children at a given level to level the energy consumption. Subsequently, the DAS algorithm takes the resulting balanced tree and assigns contiguous slots to sibling nodes, to avoid unnecessary energy waste due to frequent active-sleep transitions. We prove a number of theoretical results and the correctness of the algorithms. Through simulation and testbed experiments, we show the correctness and performance of our algorithms.

Original languageEnglish
Pages (from-to)184-199
Number of pages16
JournalComputer Networks
Volume123
DOIs
Publication statusPublished - Aug 4 2017

Fingerprint

Wireless sensor networks
Agglomeration
Scheduling
Scheduling algorithms
Energy utilization
Fault tolerance
Testbeds
Routing protocols
Network protocols
Experiments

Keywords

  • Data aggregation scheduling
  • Many-to-many communication
  • Medium access control
  • Two sinks
  • Wireless sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Many-to-many data aggregation scheduling in wireless sensor networks with two sinks. / Saginbekov, Sain; Jhumka, Arshad.

In: Computer Networks, Vol. 123, 04.08.2017, p. 184-199.

Research output: Contribution to journalArticle

@article{44525696c2e54822879c016b85cb7ac8,
title = "Many-to-many data aggregation scheduling in wireless sensor networks with two sinks",
abstract = "Traditionally, wireless sensor networks (WSNs) have been deployed with a single sink. Due to the emergence of sophisticated applications, WSNs may require more than one sink. 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, most of them are routing protocols. Differently, our main contribution, in this paper, is the development of a distributed data aggregation scheduling (DAS) algorithm for WSNs with two sinks. We also propose a distributed energy-balancing algorithm to balance the energy consumption for the aggregators. The energy-balancing algorithm first forms trees rooted at nodes which are termed virtual sinks and then balances the number of children at a given level to level the energy consumption. Subsequently, the DAS algorithm takes the resulting balanced tree and assigns contiguous slots to sibling nodes, to avoid unnecessary energy waste due to frequent active-sleep transitions. We prove a number of theoretical results and the correctness of the algorithms. Through simulation and testbed experiments, we show the correctness and performance of our algorithms.",
keywords = "Data aggregation scheduling, Many-to-many communication, Medium access control, Two sinks, Wireless sensor networks",
author = "Sain Saginbekov and Arshad Jhumka",
year = "2017",
month = "8",
day = "4",
doi = "10.1016/j.comnet.2017.05.022",
language = "English",
volume = "123",
pages = "184--199",
journal = "Computer Networks",
issn = "1389-1286",
publisher = "Elsevier",

}

TY - JOUR

T1 - Many-to-many data aggregation scheduling in wireless sensor networks with two sinks

AU - Saginbekov, Sain

AU - Jhumka, Arshad

PY - 2017/8/4

Y1 - 2017/8/4

N2 - Traditionally, wireless sensor networks (WSNs) have been deployed with a single sink. Due to the emergence of sophisticated applications, WSNs may require more than one sink. 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, most of them are routing protocols. Differently, our main contribution, in this paper, is the development of a distributed data aggregation scheduling (DAS) algorithm for WSNs with two sinks. We also propose a distributed energy-balancing algorithm to balance the energy consumption for the aggregators. The energy-balancing algorithm first forms trees rooted at nodes which are termed virtual sinks and then balances the number of children at a given level to level the energy consumption. Subsequently, the DAS algorithm takes the resulting balanced tree and assigns contiguous slots to sibling nodes, to avoid unnecessary energy waste due to frequent active-sleep transitions. We prove a number of theoretical results and the correctness of the algorithms. Through simulation and testbed experiments, we show the correctness and performance of our algorithms.

AB - Traditionally, wireless sensor networks (WSNs) have been deployed with a single sink. Due to the emergence of sophisticated applications, WSNs may require more than one sink. 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, most of them are routing protocols. Differently, our main contribution, in this paper, is the development of a distributed data aggregation scheduling (DAS) algorithm for WSNs with two sinks. We also propose a distributed energy-balancing algorithm to balance the energy consumption for the aggregators. The energy-balancing algorithm first forms trees rooted at nodes which are termed virtual sinks and then balances the number of children at a given level to level the energy consumption. Subsequently, the DAS algorithm takes the resulting balanced tree and assigns contiguous slots to sibling nodes, to avoid unnecessary energy waste due to frequent active-sleep transitions. We prove a number of theoretical results and the correctness of the algorithms. Through simulation and testbed experiments, we show the correctness and performance of our algorithms.

KW - Data aggregation scheduling

KW - Many-to-many communication

KW - Medium access control

KW - Two sinks

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=85019745995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85019745995&partnerID=8YFLogxK

U2 - 10.1016/j.comnet.2017.05.022

DO - 10.1016/j.comnet.2017.05.022

M3 - Article

VL - 123

SP - 184

EP - 199

JO - Computer Networks

JF - Computer Networks

SN - 1389-1286

ER -