A novel disjoint set division algorithm for joint scheduling and routing in wireless sensor networks

Jie Tian, Xiaoyuan Liang, Tan Yan, Mahesh Kumar Somashekar, Guiling Wang, Cesar Bandera

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

High network connectivity and low energy consumption are two major challenges in wireless sensor networks (WSNs). It is even more challenging to achieve both at the same time. To tackle the problem, this paper proposes a novel disjoint Set Division (SEDO) algorithm for joint scheduling and routing in WSNs. We finely divide sensors into different disjoint sets with guaranteed connectivity based on their geographical locations to monitor the interested area. We propose a class of scheduling and routing algorithms, which sequentially schedule each disjoint set to be on and off and balance the energy consumption during packet transmission. Simulation results show that SEDO outperforms existing schemes with lower packet delivery latency and longer network lifetime.

Original languageEnglish (US)
Pages (from-to)1443-1455
Number of pages13
JournalWireless Networks
Volume21
Issue number5
DOIs
StatePublished - Nov 29 2015

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Keywords

  • Disjoint set division
  • Joint scheduling and routing algorithm
  • Wireless sensor networks

Fingerprint Dive into the research topics of 'A novel disjoint set division algorithm for joint scheduling and routing in wireless sensor networks'. Together they form a unique fingerprint.

Cite this