Next Article in Journal
Reduced Graphene Oxide Modified the Interdigitated Chain Electrode for an Insulin Sensor
Next Article in Special Issue
An Efficient Virtual Machine Consolidation Scheme for Multimedia Cloud Computing
Previous Article in Journal
Decision-Level Fusion of Spatially Scattered Multi-Modal Data for Nondestructive Inspection of Surface Defects
Previous Article in Special Issue
Wireless Relay Selection in Pocket Switched Networks Based on Spatial Regularity of Human Mobility
Article Menu

Export Article

Open AccessArticle
Sensors 2016, 16(1), 104; doi:10.3390/s16010104

On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks

1
School of Information Science and Engineering, Qufu Normal University, Rizhao 276826, Shandong, China
2
Department of Computer Science, Texas Christian University, Fort Worth, TX 298850, USA
3
Department of Computer Science, The George Washington University, Washington, DC 20052, USA
*
Author to whom correspondence should be addressed.
Academic Editors: Yunchuan Sun, Antonio Jara and Shengling Wang
Received: 11 November 2015 / Revised: 4 January 2016 / Accepted: 8 January 2016 / Published: 15 January 2016
(This article belongs to the Special Issue Identification, Information & Knowledge in the Internet of Things)
View Full-Text   |   Download PDF [478 KB, uploaded 15 January 2016]   |  

Abstract

Coverage and connectivity are two important performance evaluation indices for wireless sensor networks (WSNs). In this paper, we focus on the connected target k-coverage (CTC k ) problem in heterogeneous wireless sensor networks (HWSNs). A centralized connected target k-coverage algorithm (CCTC k ) and a distributed connected target k-coverage algorithm (DCTC k ) are proposed so as to generate connected cover sets for energy-efficient connectivity and coverage maintenance. To be specific, our proposed algorithms aim at achieving minimum connected target k-coverage, where each target in the monitored region is covered by at least k active sensor nodes. In addition, these two algorithms strive to minimize the total number of active sensor nodes and guarantee that each sensor node is connected to a sink, such that the sensed data can be forwarded to the sink. Our theoretical analysis and simulation results show that our proposed algorithms outperform a state-of-art connected k-coverage protocol for HWSNs. View Full-Text
Keywords: heterogeneous wireless sensor networks (HWSNs); k-coverage; connectivity; connected cover set heterogeneous wireless sensor networks (HWSNs); k-coverage; connectivity; connected cover set
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Yu, J.; Chen, Y.; Ma, L.; Huang, B.; Cheng, X. On Connected Target k-Coverage in Heterogeneous Wireless Sensor Networks. Sensors 2016, 16, 104.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top