Locating Sensors in Concave Areas

@article{Wang2006LocatingSI,
  title={Locating Sensors in Concave Areas},
  author={Chen Wang and Li Xiao},
  journal={Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications},
  year={2006},
  pages={1-12}
}
  • Chen Wang, Li Xiao
  • Published 23 April 2006
  • Computer Science
  • Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances between pairwise sensors. A good approximation can be achieved when sensors are densely deployed in a convex area, where the shortest paths are close to straight lines connecting pairwise sensors. However, in a concave network, the shortest paths may deviate far away from straight lines, which leads to erroneous distance estimation and inaccurate localization results… 
Reliable Anchor-Based Sensor Localization in Irregular Areas
TLDR
A novel scheme called reliable anchor-based localization (RAL) is proposed, which can greatly reduce the localization error due to the irregular deployment areas of wireless sensor networks and improve the localization accuracy.
A beacon selected localization algorithm for Ad-Hoc networks of sensors
TLDR
Simulation results show that the performance of BSLA outweighs the traditional DV-Hop and DV-distance algorithms whether in regular networks or in irregular networks (C shape networks).
Anchor supervised distance estimation in anisotropic wireless sensor networks
TLDR
This paper proposes an anchor supervised distance estimation approach which can simultaneously cope with both of the two aspects of the anisotropy of sensor networks: uneven nodal distribution and irregularity of deployment region.
A Distributed Node Localization Scheme for Wireless Sensor Networks
TLDR
Simulation shows that the proposed scheme can perform more robust than some representative distributed node localization schemes presented in previous researches in terms of the trade-off among accuracy, coverage, computation cost, and communication overhead.
Multihop Range-Free Localization in Anisotropic Wireless Sensor Networks: A Pattern-Driven Scheme
TLDR
This paper proposes a pattern-driven localization scheme, inspired by the observation that in an anisotropic network the hop count field propagated from an anchor exhibits multiple patterns, under the interference of multiple anisotrop factors, which can satisfy the needs of many location-dependent protocols and applications, including geographical routing and tracking.
Detour Path Angular Information Based Range-Free Localization in Wireless Sensor Network
TLDR
This paper has proposed Detour Path Angular Information (DPAI) based sensor localization algorithm to accurately estimate the distance between an anchor node and a sensor node to determine whether the path is straight or detoured by anisotropic factors.
Locating Nodes in Mobile Sensor Networks More Accurately and Faster
TLDR
This paper proposes a localization algorithm that can reduce the computation cost of obtaining the samples and improve the location accuracy, and shows several other benefits: it enables each determined node to know its maximum location error, and it achieves higher location accuracy under higher density of common nodes.
A Range-Free Localization Algorithm in Concave Areas
TLDR
A range-free localization method WSAN (weight-based selective anchor nodes localization algorithm) used in the anisotropic networks based on each anchor's weight is proposed, which has been demonstrated that it has a lower localization error rate comparing with traditional localization algorithms; hence, making it suitable for anisotrop sensor areas.
A locality-based range-free localization algorithm for anisotropic wireless sensor networks
TLDR
This paper proposes AnSuper, a novel range-free localization algorithm that provides accurate location estimates in anisotropic WSNs and discusses how to suppress error accumulation in the localization process.
Collaborative Localization in Wireless Sensor Networks
TLDR
This paper analyzes the key aspects that have to be considered when designing or choosing a solution for the localization problem, and presents the types of current localization algorithms, making a broad comparison among the most relevant algorithms.
...
...

References

SHOWING 1-10 OF 28 REFERENCES
Localization from mere connectivity
TLDR
An algorithm that uses connectivity information who is within communications range of whom to derive the locations of the nodes in the network is presented, based on multidimensional scaling, a data analysis technique that takes O(n3) time for a network of n nodes.
Convex position estimation in wireless sensor networks
  • L. Doherty, K. Pister, L. El Ghaoui
  • Computer Science
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
TLDR
A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described, and a method for placing rectangular bounds around the possible positions for all unknown nodes in the network is given.
Robust distributed network localization with noisy range measurements
TLDR
A distributed, linear-time algorithm for localizing sensor network nodes in the presence of range measurement noise is described and the probabilistic notion of robust quadrilaterals is introduced as a way to avoid flip ambiguities that otherwise corrupt localization computations.
Sensor Localization in an Obstructed Environment
TLDR
A new algorithm for sensor localization based on Multiscale Radio Transmission Power (MRTP) is proposed, which gradually increases the scale level of transmission power, and the distance is determined by the minimal scale of received signals.
Semidefinite programming for ad hoc wireless sensor network localization
  • P. Biswas, Y. Ye
  • Computer Science
    Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004
  • 2004
TLDR
An SDP relaxation based method for the position estimation problem in wireless sensor networks where very few anchor nodes are required to accurately estimate the position of all the unknown nodes in a network.
Improved MDS-based localization
TLDR
This paper presents a new variant of the MDS-MAP method, which it is shown that the new algorithm not only preserves the good performance of the original method on relatively uniform layouts, but also performs much better than the original on irregularly-shaped networks.
Ad hoc positioning system (APS)
TLDR
This work is proposing APS - a distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate location for all nodes in a network where only a limited fraction of nodes have self location capability.
Localization for anisotropic sensor networks
  • Hyuk Lim, J. Hou
  • Computer Science
    Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
TLDR
A linear mapping method is devised that transforms proximity measurements between sensor nodes into a geographic distance embedding space by using the truncated singular value decomposition-based (TSVD-based) pseudo-inverse technique and retains as much topological information as possible and reduces the effect of measurement noises on the estimates of geographic distances.
Range-free localization schemes for large scale sensor networks
TLDR
This paper presents APIT, a novel localization algorithm that is range-free, and shows that the APIT scheme performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired.
The n-Hop Multilateration Primitive for Node Localization Problems
TLDR
The n-hop multilateration primitive presented here, enables ad-hoc deployed sensor nodes to accurately estimate their locations by using known beacon locations that are several hops away and distance measurements to neighboring nodes to prevent error accumulation in the network.
...
...