NDLI: Joint $\textit{k}-coverage$ and data gathering in sparsely deployed sensor networks -- Impact of purposeful mobility and heterogeneity

Content Provider	ACM Digital Library
Author	Ammari, Habib M.
Copyright Year	2013
Abstract	Coverage is one of the fundamental concepts in the design of wireless sensor networks (WSNs) in the sense that the monitoring quality of a phenomenon depends on the quality of service provided by the sensors in terms of how well a field of interest is covered. It enables the sensors to detect any event that may occur in the field, thus, meeting the application-specific requirements. Several applications require $\textit{k}-\textit{coverage},$ where each point in the field is covered by at least $\textit{k}$ sensors, which helps increase data availability to ensure better data reliability. Achieving $\textit{k}-coverage$ of a field of interest becomes a more challenging issue in sparsely deployed WSNs. Though the problem of coverage in WSNs has been well studied in the literature, only little research efforts have been devoted to the case of sparsely deployed WSNs. Thus, in this article, we investigate the problem of $\textit{k}-coverage$ in sparse WSNs using static and mobile sensors, which do not necessarily have the same communication range, sensing range, and energy supply. Precisely, we propose an optimized, generalized framework for $\textit{k}-coverage$ in sparsely deployed WSNs, called $\textit{k}-SCHEMES,$ which exploits sensor heterogeneity and mobility. First, we characterize $\textit{k}-coverage$ using heterogeneous sensors based on $\textit{Helly}'s$ Theorem. Second, we introduce our energy-efficient four-tier architecture to achieve mobile $\textit{k}-coverage$ of a region of interest in a field. Third, on top of this architecture, we suggest two data-gathering protocols, called direct data-gathering and forwarding chain-based data-gathering, using the concept of mobile proxy sink. We found that the second data-gathering protocol outperforms the first one. For energy-efficient forwarding, we compute the minimum transmission distance between any pair of consecutive mobile proxy sinks forming the forwarding chain as well as the corresponding optimum number of mobile proxy sinks in this chain. We corroborate our analysis with several simulation results.
Starting Page	1
Ending Page	33
Page Count	33
File Format	PDF
ISSN	15504859
e-ISSN	15504867
DOI	10.1145/2529978
Volume Number	10
Issue Number	1
Journal	ACM Transactions on Sensor Networks (TOSN)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2013-12-06
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	$\textit{k}-covered$ wireless sensor networks Connectivity Coverage Data gathering Heterogeneity Mobility Sparse wireless sensor networks
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

$3D-\textit{k}Cov-ComFor:$ An Energy-Efficient Framework for Composite Forwarding in Three-Dimensional Duty-Cycled $\textit{k}-Covered$ Wireless Sensor Networks

Fault tolerance measures for large-scale wireless sensor networks

Adaptive $\textit{k}-coverage$ contour evaluation and deployment in wireless sensor networks

Coverage by randomly deployed wireless sensor networks

Results on finite wireless sensor networks: Connectivity and coverage

A novel framework for energy-efficient data gathering with random coverage in wireless sensor networks

A Study of k-Coverage and Measures of Connectivity in 3D Wireless Sensor Networks

Optimal deployment patterns for full coverage and k- connectivity (k ≤ 6) wireless sensor networks

Asynchronous random sleeping for sensor networks

Joint $\textit{k}-coverage$ and data gathering in sparsely deployed sensor networks -- Impact of purposeful mobility and heterogeneity

Similar Documents

$3D-\textit{k}Cov-ComFor:$ An Energy-Efficient Framework for Composite Forwarding in Three-Dimensional Duty-Cycled $\textit{k}-Covered$ Wireless Sensor Networks

Fault tolerance measures for large-scale wireless sensor networks

Adaptive $\textit{k}-coverage$ contour evaluation and deployment in wireless sensor networks

Coverage by randomly deployed wireless sensor networks

Results on finite wireless sensor networks: Connectivity and coverage

A novel framework for energy-efficient data gathering with random coverage in wireless sensor networks

A Study of k-Coverage and Measures of Connectivity in 3D Wireless Sensor Networks

Optimal deployment patterns for full coverage and k- connectivity (k ≤ 6) wireless sensor networks

Asynchronous random sleeping for sensor networks

Joint $\textit{k}-coverage$ and data gathering in sparsely deployed sensor networks -- Impact of purposeful mobility and heterogeneity