### Citations

14074 |
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...owing theorem. Theorem 2. Problem 4 is NP-hard. Proof. We prove the theorem by reduction from the Betweenness problem which is known to be NP-hard. It is defined as follows. Definition 1 (Betweenness =-=[20]-=-). Given a finite set A, a collection C of ordered triples ða; b; cÞ of distinct elements from A, is there a one-to-one function g : A! f1;2; . . . ; jAjg such that for each ða; b; cÞ 2 C, we have eit... |

2006 | Wireless sensor networks: a survey
- Akyildiz, Su, et al.
- 2002
(Show Context)
Citation Context ...s. Results show that the proposed method achieves an accuracy of over 99%. 2013 Elsevier B.V. All rights reserved. 1. Introduction Location information is critical for many wireless sensor networks =-=[2,3]-=-. Relative localization is to locate sensors with respect to each other such that the resulting locations may be up to an arbitrary rotation and translation to the ground-truth. It is often performed ... |

954 | Location systems for ubiquitous computing
- Hightower, Borriello
- 2001
(Show Context)
Citation Context ...s. Results show that the proposed method achieves an accuracy of over 99%. 2013 Elsevier B.V. All rights reserved. 1. Introduction Location information is critical for many wireless sensor networks =-=[2,3]-=-. Relative localization is to locate sensors with respect to each other such that the resulting locations may be up to an arbitrary rotation and translation to the ground-truth. It is often performed ... |

525 | Range-Free Localization Schemes for Large Scale Sensor Networks
- He, Huang, et al.
- 2003
(Show Context)
Citation Context ... are not in the same direction from any other node. Instead, they are at different directions from a sender. In different directions, signals propagate differently, which has already been established =-=[22]-=-. We use this scenario to show the robustness of our algorithm. Fig. 14 shows degraded performance of our algorithm in terms of reliability. The reliability without smoothing is about 60%, much less t... |

493 | Convex position estimation in wireless sensor networks,” - Doherty, Pister, et al. - 2001 |

367 | Localization from mere connectivity,” - Shang, Ruml, et al. - 2003 |

335 | Collection tree protocol
- Gnawali, Fonseca, et al.
- 2009
(Show Context)
Citation Context ... the network sample matrix. We can verify that, as long as all nodes have broadcast a message, this uncontrolled approach can also generate a sample. Second, any data collection protocol, such as CTP =-=[21]-=-, can be used to collect all tuples to the sink node, which then executes Algorithm 3 and gives the ordering. If the current sample cannot generate an ordering, a new sample should be collected. In ma... |

187 | Health monitoring of civil infrastructures using wireless sensor networks
- Kim, Pakzad, et al.
- 2007
(Show Context)
Citation Context ... in 1-dimensional (1-D) sensor networks. Practical 1-D networks include sensor networks deployed along a road to facilitate vehicular networks and that along a bridge for structural health monitoring =-=[4]-=-. We define the relative locations to be the ordering of nodes in the network field. Such ordering is important for functions like object tracking and monitoring in the network. We target at deriving ... |

115 | Localization of wireless sensor networks with a mobile beacon
- Sichitiu, Ramadurai
- 2004
(Show Context)
Citation Context ...ser a node is to the sender, the stronger signal it receives. This assumption uses more information than the connectivity approach, and it has been utilized in localization scenarios in several works =-=[15,19,16]-=-. Unfortunately, schemes under this assumption are unable to deal with propagation anomaly mentioned before. To see this, note that the assumption implicitly requires closer nodes to receive signals r... |

111 |
Radio tomographic imaging with wireless networks.
- Wilson, Patwari
- 2010
(Show Context)
Citation Context ...3 and 4, and the midpoint between nodes 5 and 6. Note that human body can block the line-of-sight signal, which is actually the foundation of device-free localization techniques using sensor networks =-=[23]-=-. We also observe this effect in our experiment. Fig. 15 shows node 2’s RSSI of signals sent from node 1 when the man stands at the three different locations. It is obvious that when the man stands be... |

54 |
Range-Free Sensor Localization with Ring Overlapping Based on
- Liu, Scott, et al.
- 2007
(Show Context)
Citation Context ...en only using it to indicate near-far relationship, which leads to better solutions for localization problems [14–16]. The observation they rely on is that shorter distance results in larger RSSI. In =-=[15]-=-, a node estimates its distance to different anchors by comparing the observed RSSI values. This information helps refine the node’s location to be within intersection of different rings. Zhong et al.... |

38 | Achieving range-free localization beyond connectivity.
- Zhong, He
- 2009
(Show Context)
Citation Context ... a node estimates its distance to different anchors by comparing the observed RSSI values. This information helps refine the node’s location to be within intersection of different rings. Zhong et al. =-=[16]-=- propose signature distance to measure the distance between neighboring nodes. The key is to characterize each node by a signature, a neighbor list ordered by their RSSI. Guo et al. [14] use a mobile ... |

22 |
Location, localization, and localizability,”
- Liu, Yang, et al.
- 2010
(Show Context)
Citation Context ... in Section 6 and evaluate the approach in Section 7. Section 8 concludes the paper. 2. Related work Localization methods can be divided into two categories: rangebased methods and range-free methods =-=[6]-=-. Range-based methods usually assume that nodes can estimate the distance or angle, which requires extra hardware. Thus we focus on the range-free methods, which use readily available information, suc... |

20 | Sensor network localization from local connectivity: Performance analysis for the mds-map algorithm. - Oh, Karbasi, et al. - 2010 |

20 | Analyzing connectivity-based multi-hop ad-hoc positioning.
- Bischoff, Wattenhofer
- 2004
(Show Context)
Citation Context ... two nodes can hear from each other if and only if they are within a certain distance. Various works follow this assumption [7–13]. Among them, some researchers consider 1-D scenario. Bischoff et al. =-=[12]-=- give a range-free localization method for 1-D sensor networks. Their work has provable performance guarantee. Lotker et al. [13] give range free ranking for nodes in 1-D networks. In this approach, t... |

19 | A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Corneil
(Show Context)
Citation Context ...ctivity assumption. Though seemingly hard, this problem can actually be solved in linear time by the following transformation. The problem can be transformed to the recognition of unit interval graph =-=[18]-=-. A graph G is a unit interval graph if and only if we can find a set of unit intervals in a real line such that each interval represents a distinct vertex in G and two intervals have intersections if... |

10 | Range-Free Ranking in Sensors Networks and Its Applications to Localization, in
- Lotker, Albeniz, et al.
- 2004
(Show Context)
Citation Context ...]. Among them, some researchers consider 1-D scenario. Bischoff et al. [12] give a range-free localization method for 1-D sensor networks. Their work has provable performance guarantee. Lotker et al. =-=[13]-=- give range free ranking for nodes in 1-D networks. In this approach, the two end nodes are given as anchor nodes with one flooding a message and the other terminating the flooding. During the floodin... |

9 | Perpendicular Intersection: Locating Wireless Sensors with Mobile Beacon
- Guo, Hong, et al.
- 2010
(Show Context)
Citation Context ... Zhong et al. [16] propose signature distance to measure the distance between neighboring nodes. The key is to characterize each node by a signature, a neighbor list ordered by their RSSI. Guo et al. =-=[14]-=- use a mobile beacon to locate sensor nodes. The beacon moves along designed routes and continuously broadcasts messages. Each node records the observed RSSI and compares these RSSI values to locate i... |

8 | On distinguishing the multiple radio paths in rss-based ranging - Zhang, Liu, et al. - 2012 |

5 | Spatial ordering derivation for one-dimensional wireless sensor networks
- Zhu, Chen
- 2011
(Show Context)
Citation Context ...ly requires that closer nodes 0140-3664/$ - see front matter 2013 Elsevier B.V. All rights reserved. http://dx.doi.org/10.1016/j.comcom.2013.07.007 q A preliminary version of this paper appeared in =-=[1]-=-. ⇑ Corresponding author. Tel.: +8613505184210. E-mail addresses: gxjzhu@gmail.com (X. Zhu), wuxb@nju.edu.cn (X. Wu), gchen@nju.edu.cn (G. Chen). Computer Communications 36 (2013) 1581–1591 Contents l... |

5 | Refining hop-count for localisation in wireless sensor networks - Zhu, Wu, et al. - 2012 |

4 | Component-based localization in sparse wireless networks - Wang, Luo, et al. |