NDLI: Distributed localization using noisy distance and angle information

Please wait, while we are loading the content...

MISTRAL: efficient flooding in mobile ad-hoc networks

Performance analysis of mobility-assisted routing

Balancing distance and lifetime in delay constrained ad hoc networks

Deploying wireless sensors to achieve both coverage and connectivity

Interaction of rate and medium access control in wireless networks: the single cell case

MLS: an efficient location service for mobile ad hoc networks

Throughput and delay optimization in interference-limited multihop networks

Wakeup scheduling in wireless sensor networks

Minimizing recovery state In geographic ad-hoc routing

Model T++: an empirical joint space-time registration model

An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces

Energy conservation via domatic partitions

DRAND: distributed randomized TDMA scheduling for wireless ad-hoc networks

RaWMS -: random walk based lightweight membership service for wireless ad hoc network

Proportionally fair allocation of end-to-end bandwidth in STDMA wireless networks

Fundamental scaling laws for energy-efficient storage and querying in wireless sensor networks

Asymptotic critical transmission radius for greedy forward routing in wireless ad hoc networks

Analysis of random mobility models with PDE's

Jamming and sensing of encrypted wireless ad hoc networks

Delay of intrusion detection in wireless sensor networks

Adaptive splitting protocols for RFID tag collision arbitration

Robust distributed node localization with error management

Algorithmic aspects of communication in ad-hoc networks with smart antennas

Data storage placement in sensor networks

Message ferry route design for sparse ad hoc networks with mobile nodes

Modeling steady-state and transient behaviors of user mobility: formulation, analysis, and application

Mobile backbone networks --: construction and maintenance

Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks

Distributed localization using noisy distance and angle information

Topology control meets SINR: the scheduling complexity of arbitrary topologies

SDAP: a secure hop-by-Hop data aggregation protocol for sensor networks

Distributed localization using noisy distance and angle information

Content Provider	ACM Digital Library
Author	Mitchell, Joseph S. B. Gao, Jie Sabhnani, Girishkumar Basu, Amitabh
Abstract	Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes,along with additional local information (e.g. distances, angles, orientations etc.), the goal is to reconstruct the global geometry of the network. In this paper, we study the problem of localization with noisy distance and angle information. With no noise at all, the localization problem with both angle (with orientation) and distance information is trivial. However, in the presence of even a small amount of noise, we prove that the localization problem is NP hard.Localization with accurate distance information and relative angle information is also hard. These hardness results motivate our study of approximation schemes. We relax the non-convex constraints to approximating convex constraints and propose linear programs (LP) for two formulations of the resulting localization problem, which we call the weak deployment and strong deployment problems.These two formulations give upper and lower bounds on the location uncertainty respectively: No sensor is located outside its weak deployment region, and each sensor can be anywhere in its strong deployment region without violating the approximate distance and angle constraints. Though LP-based algorithms are usually solved by centralized methods, we propose distributed, iterative methods, which are provably convergent to the centralized algorithm solutions. We give simulation results for the distributed algorithms, evaluating the convergence rate, dependence on measurement noises,and robustness to link dynamics.
Starting Page	262
Ending Page	273
Page Count	12
File Format	PDF
ISBN	1595933689
DOI	10.1145/1132905.1132934
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2006-05-22
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Sensor networks Linear programming Localization
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

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