NDLI: An Approximate Convex Decomposition Protocol for Wireless Sensor Network Localization in Arbitrary-Shaped Fields

Content Provider	IEEE Xplore Digital Library
Author	Wenping Liu Hongbo Jiang Wenyu Liu Chonggang Wang
Copyright Year	1990
Abstract	Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. In this paper, we develop a new localization protocol based on approximate convex decomposition (ACDL), with reliance on network connectivity information only. ACDL can calculate the node virtual locations for a large-scale sensor network with a complex shape. We first examine one representative localization algorithm and study the influential factors on the localization accuracy, including the sharpness of the angle at the concave point and the depth of the concave valley. We show that after decomposition, the depth of the concave valley becomes irrelevant. We thus define the concavity according to the angle at a concave point, which reflects the localization error. We then propose ACDL protocol for network localization. It consists of four main steps. First, convex and concave nodes are recognized and network boundaries are segmented. As the sensor network is discrete, we show that it is acceptable to approximately identify the concave nodes to control the localization error. Second, an approximate convex decomposition is conducted. Our convex decomposition requires only local information and we show that it has low message overhead. Third, for each convex section of the network, an improved MDS algorithm is proposed to compute a relative location map. Fourth, a fast and low complexity merging algorithm is developed to construct the global location map. Besides, by slight modification on the third step, we propose a variant of ACDL, denoted by ACDL-Tri, which is fully distributed and scalable while the localization accuracy is still comparable. We finally show the efficiency of ACDL by extensive simulations.
Sponsorship	IEEE Computer Society
Starting Page	3264
Ending Page	3274
Page Count	11
File Size	1259723
File Format	PDF
ISSN	10459219
Volume Number	26
Issue Number	12
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-12-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Approximation algorithms Wireless sensor networks Euclidean distance Complexity theory wireless sensor networks Localization approximate convex decomposition
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics Hardware and Architecture

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

(ε, δ)-Approximate Aggregation Algorithms in Dynamic Sensor Networks

Data Collection in Multi-Application Sharing Wireless Sensor Networks

Asynchronous Corona Training Protocols in Wireless Sensor and Actor Networks

Adaptive Approximate Data Collection for Wireless Sensor Networks

Localization-Oriented Network Adjustment in Wireless Ad Hoc and Sensor Networks

An Efficient Directed Localization Recursion Protocol for Wireless Sensor Networks

Secure Continuous Aggregation in Wireless Sensor Networks

Localization through Map Stitching in Wireless Sensor Networks

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

An Approximate Convex Decomposition Protocol for Wireless Sensor Network Localization in Arbitrary-Shaped Fields

Similar Documents

(ε, δ)-Approximate Aggregation Algorithms in Dynamic Sensor Networks

Data Collection in Multi-Application Sharing Wireless Sensor Networks

Asynchronous Corona Training Protocols in Wireless Sensor and Actor Networks

Adaptive Approximate Data Collection for Wireless Sensor Networks

Localization-Oriented Network Adjustment in Wireless Ad Hoc and Sensor Networks

An Efficient Directed Localization Recursion Protocol for Wireless Sensor Networks

Secure Continuous Aggregation in Wireless Sensor Networks

Localization through Map Stitching in Wireless Sensor Networks

Distributed Algorithms for Constructing Approximate Minimum Spanning Trees in Wireless Sensor Networks

An Approximate Convex Decomposition Protocol for Wireless Sensor Network Localization in Arbitrary-Shaped Fields