A three-tiered node scheduling scheme for sparse sensing in wireless sensor networks

Authors:
Babak Pazand;Amitava Datta
Affiliations:
School of Computer Science and Software Engineering, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia;School of Computer Science and Software Engineering, The University of Western Australia, 35 Stirling Highway, Crawley, WA 6009, Australia
Venue:
Computer Communications
Year:
2010

Citing 12
Cited 1

Introduction to algorithms

Introduction to algorithms
Wireless Communications: Principles and Practice

Wireless Communications: Principles and Practice
A coverage-preserving node scheduling scheme for large wireless sensor networks

WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks

ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
The coverage problem in a wireless sensor network

WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
A MAC Protocol to Reduce Sensor Network Energy Consumption Using a Wakeup Radio

IEEE Transactions on Mobile Computing
Optimal Transmit Power in Wireless Sensor Networks

IEEE Transactions on Mobile Computing
A randomized energy-conservation protocol for resilient sensor networks

Wireless Networks
Determining active sensor nodes for complete coverage without location information

International Journal of Ad Hoc and Ubiquitous Computing
FlexiTP: A Flexible-Schedule-Based TDMA Protocol for Fault-Tolerant and Energy-Efficient Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
An energy-efficient node-scheduling scheme for wireless sensor networks based on minimum dominating sets

International Journal of Network Management

A clique base node scheduling method for wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.24

Visualization

Abstract

In wireless sensor networks, when the sensing range is significantly higher than the transmission range, a very large amount of sensing redundancy is created. Sparse sensing indicates the case of selecting a small number of representative nodes to cover the sensor field while other nodes relay their data. In this paper we propose a location-free, three-tiered node scheduling protocol to address the sparse sensing problem. These layers are coverage, connectivity and coverage management layers. Coverage tier is responsible for covering the sensor field. Connectivity tier relays the collected data at the coverage tier back to the base station. The coverage management tier is responsible for implementing different coverage patterns.