NDLI: Cost-efficient sensor deployment in indoor space with obstacles

Content Provider	IEEE Xplore Digital Library
Author	Kouakou, M.T. Yasumoto, K. Yamamoto, S. Ito, M.
Copyright Year	2012
Description	Author affiliation: Nara Institute of Science and Technology, Ikoma, 630-0192, Japan (Kouakou, M.T.; Yasumoto, K.; Ito, M.) \|\| Tokyo University of Science, Yamaguchi, Sanyo-onoda, 756-0884, Japan (Yamamoto, S.)
Abstract	In this paper, we tackle the problem to achieve k-coverage of a target indoor space with obstacles, that is, any point in the target monitoring area has a line-of-sight to and is located in the sensing range rs of at least k sensors. We propose heuristic algorithms for computing a deployment pattern achieving the k-coverage in an arbitrary 3D target space with stationary and mobile obstacles, while minimizing the overall deployment cost. For the case with only stationary obstacles, we propose a greedy algorithm that puts sensor nodes one by one on a grid point of the deployable area in the descending order of the cost-performance value (i.e., how many monitoring points are covered by putting a sensor at the deployment point per unit deployment cost). In order to extend the algorithm for the case with a mobile obstacle, we define mobile k-coverage that guarantees k-coverage of a target space for arbitrary position of a mobile obstacle, then provide a sufficient condition for the mobile k-coverage: the half-sphere of radius rs centered at a monitoring point bounded by the vertical plane containing the point includes at least k sensor nodes. Based on this condition, we propose a heuristic algorithm that puts at least one sensor node in each π over k+1 spherical wedge for each monitoring point. With the proposed algorithms, we have computed the sensor nodes position in an existing indoor environment and confirmed that the obtained WSN deployment in the real space accurately achieves k-coverage.
Starting Page	1
Ending Page	9
File Size	1844143
Page Count	9
File Format	PDF
ISBN	9781467312387
e-ISBN	9781467312394
e-ISBN	9781467312370
DOI	10.1109/WoWMoM.2012.6263688
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-06-25
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Wireless sensor networks moving obstacles Heuristic algorithms Indoor environments k-coverage Mobile communication Sensors indoor WSN deployment Monitoring Equations
Content Type	Text
Resource Type	Article

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

Analysis of stochastic k-coverage in wireless sensor networks with boundary deployment

Efficient visual sensor coverage algorithm in Wireless Visual Sensor Networks

Modeling wireless sensor network coverage based on random radius

Location Uncertainty and Target Coverage in Wireless Sensor Networks Deployment

An efficient approach for sensor deployments in wireless sensor network

Visibility-Based Coverage of Mobile Sensors in Non-convex Domains

Energy Efficient Distributed Connected Coverage Algorithms with Dynamic Coverage Maintenance in Wireless Sensor Networks

Three dimensional mobile wireless sensor networks redeployment based on virtual forces

Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks

Cost-efficient sensor deployment in indoor space with obstacles

Similar Documents

Analysis of stochastic k-coverage in wireless sensor networks with boundary deployment

Efficient visual sensor coverage algorithm in Wireless Visual Sensor Networks

Modeling wireless sensor network coverage based on random radius

Location Uncertainty and Target Coverage in Wireless Sensor Networks Deployment

An efficient approach for sensor deployments in wireless sensor network

Visibility-Based Coverage of Mobile Sensors in Non-convex Domains

Energy Efficient Distributed Connected Coverage Algorithms with Dynamic Coverage Maintenance in Wireless Sensor Networks

Three dimensional mobile wireless sensor networks redeployment based on virtual forces

Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks

Cost-efficient sensor deployment in indoor space with obstacles