Geometric algorithms for sensor networks
From MaRDI portal
Publication:2889031
zbMATH Open1239.90018MaRDI QIDQ2889031FDOQ2889031
Authors: Jie Gao, Leonidas Guibas 
Publication date: 4 June 2012
Published in: Philosophical Transactions of the Royal Society of London. Series A. Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Recommendations
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Cited In (21)
- Distributed Graph Layout for Sensor Networks
- Minimum cuts in geometric intersection graphs
- A scalable sensor network using a polar coordinate system
- On the planarization of wireless 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
- 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
- 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
- Self-approaching paths in simple polygons
- Maximum matchings in geometric intersection graphs
- 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
Uses Software
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)
