Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Help & Advice
University of Warwick

The Library

  • Login
  • Admin

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

Tools
- Tools
+ Tools

Saginbekov, Sain and Jhumka, Arshad (2017) Many-to-many data aggregation scheduling in wireless sensor networks with two sinks. Computer Networks, 123 . pp. 184-199. doi:10.1016/j.comnet.2017.05.022

[img]
Preview
PDF
WRAP-many-to-man-aggregation-scheduling-Jhumka-2017.pdf - Accepted Version - Requires a PDF viewer.

Download (1500Kb) | Preview
Official URL: http://dx.doi.org/10.1016/j.comnet.2017.05.022

Request Changes to record.

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.

Item Type: Journal Article
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions: Faculty of Science > Computer Science
Library of Congress Subject Headings (LCSH): Wireless sensor networks--Computer programs, Energy consumption --Computer programs., Data compression (Computer science), Aggregation operators
Journal or Publication Title: Computer Networks
Publisher: Elsevier BV * North-Holland
ISSN: 1389-1286
Official Date: 4 August 2017
Dates:
DateEvent
4 August 2017Available
23 May 2017Accepted
Volume: 123
Page Range: pp. 184-199
DOI: 10.1016/j.comnet.2017.05.022
Status: Peer Reviewed
Publication Status: Published
Access rights to Published version: Restricted or Subscription Access

Request changes or add full text files to a record

Repository staff actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics

twitter

Email us: wrap@warwick.ac.uk
Contact Details
About Us