Author Type

Graduate Student

Date of Award

2006

Document Type

Thesis

Publication Status

Version of Record

Submission Date

October 2026

Thesis/Dissertation Advisor [Chair]

Cardei, Mihaela

Abstract

We consider a heterogeneous wireless sensor network, which has several supernodes for data relay and a large number of energy-constrained sensor nodes that are deployed randomly to cover certain targets. Since targets are covered by many sensors, we create several cover sets that are active successively to save power. We introduce the Heterogeneous Connected Set Covers (HCSC) which aims to find at least one cover set that covers all the targets and is connected to a data-relaying supernode. A sensor node can participate in different set covers but the sum of energy spent in all sets is constrained by the initial energy resources of that sensor node. This is the first solution proposed for the target coverage in heterogeneous wireless sensor networks. We show that the HCSC is an NP-Complete problem and propose three distributed algorithms for it and showing simulation results to verify the proposed approaches.

Extent

65 p.

Comments

College of Engineering and Computer Science|FAU Electronic Theses and Dissertations Collection|Thesis (M.S.)--Florida Atlantic University, 2006.|College of Engineering and Computer Science

Identifier

FADT13342

Format

pdf

Download

Share

COinS