Routing with guaranteed delivery in ad hoc wireless networks
From MaRDI portal
Publication:5952560
DOI10.1023/A:1012319418150zbMath0996.68012OpenAlexW2156689181MaRDI QIDQ5952560
Ivan Stojmenović, Prosenjit Bose, Jorge Urrutia, Pat Morin
Publication date: 14 January 2002
Published in: Wireless Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1012319418150
Related Items
Virtual coordinates in hyperbolic space based on Ricci flow for WLANs ⋮ Bounding the locality of distributed routing algorithms ⋮ Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs ⋮ Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions ⋮ Competitive Online Routing on Delaunay Triangulations ⋮ Directional Geometric Routing on Mobile Ad Hoc Networks ⋮ Some results on greedy embeddings in metric spaces ⋮ A generalized greedy routing algorithm for 2-connected graphs ⋮ A general framework for searching on a line ⋮ Category-based routing in social networks: membership dimension and the small-world phenomenon ⋮ Compact routing messages in self-healing trees ⋮ Communication costs in a geometric communication network ⋮ Balancing Traffic Load Using One-Turn Rectilinear Routing ⋮ Computational complexity for the problem of optimal intersection of straight line segments by disks ⋮ Routing schemes for hybrid communication networks ⋮ Local routing algorithms on Euclidean spanners with small diameter ⋮ Graph product structure for non-minor-closed classes ⋮ Local 7-coloring for planar subgraphs of unit disk graphs ⋮ Balanced energy allocation scheme for a solar-powered sensor system and its effects on network-wide performance ⋮ A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles ⋮ End-to-end maxmin fairness in multihop wireless networks: theory and protocol ⋮ On certain geometric properties of the Yao-Yao graphs ⋮ Construction and Local Routing for Angle-Monotone Graphs ⋮ On the efficiency of routing in sensor networks ⋮ Position-Based Routing in Wireless Ad Hoc and Sensor Networks ⋮ Scalable continuous object detection and tracking in sensor networks ⋮ Forwarding via checkpoints: geographic routing on always-on sensors ⋮ Local Routing in Convex Subdivisions ⋮ Routing in unit disk graphs ⋮ Local solutions for global problems in wireless networks ⋮ On the expected maximum degree of Gabriel and Yao graphs ⋮ Attraction-convexity and normal visibility ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs ⋮ Distributed computation of virtual coordinates for greedy routing in sensor networks ⋮ Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs ⋮ Minimum weight convex Steiner partitions ⋮ Automatic approach for lung segmentation with juxta-pleural nodules from thoracic CT based on contour tracing and correction ⋮ The relative neighbourhood graph is a part of every \(30^\circ \)-triangulation ⋮ Virtual raw anchor coordinates: a new localization paradigm ⋮ Improved local algorithms for spanner construction ⋮ LOCAL CONSTRUCTION AND COLORING OF SPANNERS OF LOCATION AWARE UNIT DISK GRAPHS ⋮ Exploiting slack time for just-in-time scheduling in wireless sensor networks ⋮ Some problems in distributed computational geometry ⋮ Navigation in spatial networks: a survey ⋮ On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks ⋮ On planar greedy drawings of 3-connected planar graphs ⋮ Succinct Greedy Graph Drawing in the Hyperbolic Plane ⋮ Every Schnyder drawing is a greedy embedding ⋮ Geographic routing on virtual raw anchor coordinate systems ⋮ Constrained routing between non-visible vertices ⋮ A General Framework for Searching on a Line ⋮ Constant memory routing in quasi-planar and quasi-polyhedral graphs ⋮ Optimal placement of base stations in border surveillance using limited capacity drones ⋮ An optimal algorithm to compute the inverse beacon attraction region ⋮ On a conjecture related to geometric routing ⋮ Theoretical aspects of connectivity-based multi-hop positioning ⋮ Navigating planar topologies in near-optimal space and time ⋮ There are plane spanners of degree 4 and moderate stretch factor
