NDLI: Minimizing Movement for Target Coverage in Mobile Sensor Networks

Content Provider	IEEE Xplore Digital Library
Author	Zhuofan Liao Shigeng Zhang Jiannong Cao Weiping Wang Jianxin Wang
Copyright Year	2012
Abstract	Target coverage is an important problem in wireless sensor networks (WSNs), whose goal is to cover points of interest to collect data for further processing. With the emergence of mobile sensors, many researchers have exploited the mobility of sensors to improve coverage quality. However, little attention has been paid to minimize the sensor's movement, which consumes the majority of a sensor's limited energy. Since sensors have limited energy supply and their operation continues until their energy drains, movement of mobile sensors should be minimized to extend the lifetime of sensors. In this paper, we first formulate the problem of minimizing sensor's movement to achieve target coverage (MMTC), and prove it is at least NP-complete. Then for a special case of MMTC when targets are spacing greater than twice of the coverage radius, we transform MMTC into a typical assignment problem, and get the optimal solution by an extended Hungarian method. For general cases of MMTC, we further propose a target based Voronoi greedy algorithm (TV-Greedy) to find approximate optimal solutions. Analysis results show that TV-Greedy has a low complexity, can enhance the robustness of WSNs to sensor failure. Extensive simulations are conducted to evaluate our solutions, which exhibit good performance in large scale WSNs.
Starting Page	194
Ending Page	200
File Size	615997
Page Count	7
File Format	PDF
ISBN	9781467314237
ISSN	15450678
e-ISBN	9781467314237
DOI	10.1109/ICDCSW.2012.38
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-06-18
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Servers Mobile communication Robot sensing systems Complexity theory Wireless sensor networks Mobile computing Greedy algorithms placement WiMAX mesh network multi-hop relay
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

Relay Node Placement Algorithm Based on Grid in Wireless Sensor Network

Optimal transmission range for multi-hop communication in wireless sensor and actor networks

Clique partition based relay placement in WiMAX mesh networks

ADSR: Angle-Based Multi-hop Routing Strategy for Mobile Wireless Sensor Networks

ISOGRID: an Efficient Algorithm for Coverage Enhancement in Mobile Sensor Networks

Understanding spatial and temporal coverage in participatory sensor networks

Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks

Movement strategies for improving barrier coverage in wireless sensor networks: A survey

Minimizing the Maximum Sensor Movement towards Grid Points for Barrier Coverage

Minimizing Movement for Target Coverage in Mobile Sensor Networks

Similar Documents

Relay Node Placement Algorithm Based on Grid in Wireless Sensor Network

Optimal transmission range for multi-hop communication in wireless sensor and actor networks

Clique partition based relay placement in WiMAX mesh networks

ADSR: Angle-Based Multi-hop Routing Strategy for Mobile Wireless Sensor Networks

ISOGRID: an Efficient Algorithm for Coverage Enhancement in Mobile Sensor Networks

Understanding spatial and temporal coverage in participatory sensor networks

Minimizing Movement for Target Coverage and Network Connectivity in Mobile Sensor Networks

Movement strategies for improving barrier coverage in wireless sensor networks: A survey

Minimizing the Maximum Sensor Movement towards Grid Points for Barrier Coverage

Minimizing Movement for Target Coverage in Mobile Sensor Networks