Computational Geometry in C
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Distributed localization in wireless sensor networks: a quantitative comparison
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Error characteristics of ad hoc positioning systems (aps)
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Topological hole detection in wireless sensor networks and its applications
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
An Analysis of Error Inducing Parameters in Multihop Sensor Node Localization
IEEE Transactions on Mobile Computing
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Hole detection or: "how much geometry hides in connectivity?"
Proceedings of the twenty-second annual symposium on Computational geometry
The effects of ranging noise on multihop localization: an empirical study
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Boundary recognition in sensor networks by topological methods
Proceedings of the 12th annual international conference on Mobile computing and networking
Beacon vector routing: scalable point-to-point routing in wireless sensornets
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
A mapping of wireless network boundaries using localised alpha-shapes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
RETRACTED: Impacts of sensor node distributions on coverage in sensor networks
Journal of Parallel and Distributed Computing
Adaptive edge detection with distributed behaviour-based agents in WSNs
International Journal of Sensor Networks
Hi-index | 0.00 |
Intuitively, identification of nodes close to the network edge is key to the successful setup, and continued operation, of many sensor network protocols and applications. Many virtual coordinate constructions rely on the furthest set of nodes as beacons, and sensing applications may find useful the knowledge of the network edge. In this paper, we propose local convex view (lcv) as a means to identify nodes close to the network edge. It is motivated by the hypothesis that some structural information relevant to the network is buried within view of many nodes. The lcv differs from most previous methods in that it is a localised algorithm. Nodes using lcv may establish neighbourhood coordinates if no location information is available a priori. In those cases where needed information is missing, we adopt a simple probabilistic model to decide the boundary status of a node. We identify two metrics for evaluation and compare via simulation the performance of lcv against two methods with similar properties. Further simulations reveal the surprising observation that lcv seems unaffected by position estimation error. We enumerate and analyse a complete set of node configurations seen by lcv. We conclude that the geometric properties underlying lcv are responsible for its resilience to error.