Back to search

North Dakota State University

Wireless Sensor Network Scheduling and Coverage Using an ABC Algorithm

Abstract

dc:description.abstract

Limited sensor battery capacity is a major issue in wireless sensor networks. If all of the sensors in a network need not be in an awake state to provide adequate coverage at any given time, it is possible to strategically schedule their awake and sleep times to extend useful network lifetime. In this paper we present two heuristic methods for sensor scheduling using an Artificial Bee Colony metaphor. The methods maintain a threshold coverage level. The first method uses a fitness measure aimed at prolonging the network lifetime and the second method combines network lifetime with coverage. Both methods run until the coverage level fails to meet a threshold. Experiments show that both methods produce extended network lifetime. Comparisons are made with a method in which awake and sleep times are set randomly.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2015

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Pachaiyappan, Sathya

Subjects

dc:subject × 3

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/24812

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Pachaiyappan, Sathya. Wireless Sensor Network Scheduling and Coverage Using an ABC Algorithm. North Dakota State University, 2015. https://hdl.handle.net/10365/24812