Geometric algorithms for sensor networks
From MaRDI portal
Recommendations
Cited in
(27)- Distributed Graph Layout for Sensor Networks
- Minimum cuts in geometric intersection graphs
- Free regions of sensor nodes
- A scalable sensor network using a polar coordinate system
- On the planarization of wireless sensor networks
- Localization and scheduling protocols for actor-centric sensor networks
- Virtual coordinates in hyperbolic space based on Ricci flow for WLANs
- A Computational Geometry Framework for Efficient Network Localization
- Surrounding nodes in coordinate-free networks
- Network sketching or: ``How much geometry hides in connectivity? II
- Algorithms and Simulation Methods for Topology-Aware Sensor Networks
- Geometric spanners with applications in wireless networks
- Similarity-based analysis for large networks of ultra-low resolution sensors
- Position-based routing in wireless ad hoc and sensor networks
- Geometric structure of the joint N-voM distribution manifold and its applications to sensor networks
- Editorial for algorithms for sensor systems, wireless ad hoc networks and autonomous mobile entities
- Estimating the free region of a sensor node
- Graph Drawing
- Centdian Computation for Sensor Networks
- Formation of a geometric pattern with a mobile wireless sensor network
- Some \(k\)-hop based graph metrics and node ranking in wireless sensor networks
- Self-approaching paths in simple polygons
- Maximum matchings in geometric intersection graphs
- Geometric buildup algorithms for sensor network localization
- Euclidean greedy drawings of trees
- Heuristic algorithm for finding boundary cycles in location-free low density wireless sensor networks
- Two optimization problems for unit disks
This page was built for publication: Geometric algorithms for sensor networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2889031)
