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