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

Document Type

Article

Publication Date

11-29-2015

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.

Identifier

84930872655 (Scopus)

Publication Title

Wireless Networks

External Full Text Location

https://doi.org/10.1007/s11276-014-0862-3

e-ISSN

15728196

ISSN

10220038

First Page

1443

Last Page

1455

Issue

5

Volume

21

This document is currently not available here.

Share

COinS