NDLI: Formal Theory of Noisy Sensor Network Localization

Content Provider	Society for Industrial and Applied Mathematics (SIAM)
Author	Shames, Iman Fidan, Bari Anderson, Brian D. O. Mao, Guoqiang
Copyright Year	2010
Abstract	Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs between which the distance is known, a significant result in the theory of range-based sensor network localization is that if the graph underlying the sensor network is generically globally rigid and there is a suitable set of anchors at known positions, then the network can be localized, i.e., a unique set of sensor positions can be determined that is consistent with the data. In particular, for planar problems, provided the sensor network has three or more noncollinear anchors at known points, all sensors are located at generic points, and the intersensor distances corresponding to the graph edges are precisely known rather than being subject to measurement noise, generic global rigidity of the graph is necessary and sufficient for the network to be localizable (in the absence of any further information). In practice, however, distance measurements will never be exact, and the equations whose solutions deliver sensor positions in the noiseless case in general no longer have a solution. This paper then argues that if the distance measurement errors are not too great and otherwise the associated graph is generically globally rigid and there are three or more noncollinear anchors, the network will be approximately localizable, in the sense that estimates can be found for the sensor positions which are near the correct values; in particular, a bound on the position errors can be found in terms of a bound on the distance errors. The sensor positions in this case can be found by minimizing a cost function which, although nonconvex, does have a global minimum.
Starting Page	684
Ending Page	698
Page Count	15
File Format	PDF
ISSN	08954801
DOI	10.1137/100792366
e-ISSN	10957146
Journal	SIAM Journal on Discrete Mathematics (SJDMEC)
Issue Number	2
Volume Number	24
Language	English
Publisher	Society for Industrial and Applied Mathematics
Publisher Date	2010-06-18
Access Restriction	Subscribed
Subject Keyword	localization inaccurate sensors fault tolerance Applications Sensitivity, stability, well-posedness Applications of graph theory sensor networks
Content Type	Text
Resource Type	Article
Subject	Mathematics

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

Poster abstract: online data cleaning in wireless sensor networks

Fault Tolerance in Networks of Bounded Degree

Hamming Codes, Hypercube Embeddings, and Fault Tolerance

Autonomous fault tolerance technology of emergency community in wireless sensor network

Fault diagnosis in multi layered De Bruijn based architectures for sensor networks

An Efficient De Bruijn Graph Based Fault Tolerant Sensor Networks Design

Fault Tolerant Maximum Likelihood Event Localization in Sensor Networks Using Binary Data

Deploying sensor networks with guaranteed capacity and fault tolerance

Fault-Tolerant Meshes with Small Degree

Formal Theory of Noisy Sensor Network Localization

Similar Documents

Poster abstract: online data cleaning in wireless sensor networks

Fault Tolerance in Networks of Bounded Degree

Hamming Codes, Hypercube Embeddings, and Fault Tolerance

Autonomous fault tolerance technology of emergency community in wireless sensor network

Fault diagnosis in multi layered De Bruijn based architectures for sensor networks

An Efficient De Bruijn Graph Based Fault Tolerant Sensor Networks Design

Fault Tolerant Maximum Likelihood Event Localization in Sensor Networks Using Binary Data

Deploying sensor networks with guaranteed capacity and fault tolerance

Fault-Tolerant Meshes with Small Degree

Formal Theory of Noisy Sensor Network Localization