Routing with guaranteed delivery in ad hoc wireless networks
From MaRDI portal
(Redirected from Routing with guaranteed delivery in ad hoc wireless networks)
Recommendations
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
- Directional Geometric Routing on Mobile Ad Hoc Networks
- A unified view to greedy geometric routing algorithms in ad hoc networks
- Geometric ad-hoc routing, of theory and practice
- Greedy localized routing for maximizing probability of delivery in wireless ad hoc networks with a realistic physical layer
Cited in
(70)- 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
- 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
- Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
- 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
- Greedy localized routing for maximizing probability of delivery in wireless ad hoc networks with a realistic physical layer
- On a conjecture related to geometric routing
- Theoretical aspects of connectivity-based multi-hop positioning
- Virtual coordinates in hyperbolic space based on Ricci flow for WLANs
- A general framework for searching on a line
- Geometric ad-hoc routing, of theory and practice
- Research of reliable routing in wireless Ad Hoc network
- 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
- 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
- Algorithms for computing message delay for wireless networks
- scientific article; zbMATH DE number 1785574 (Why is no real title available?)
- On the efficiency of routing in sensor networks
- Competitive online routing on Delaunay triangulations
- An optimal algorithm to compute the inverse beacon attraction region
- Local routing in convex subdivisions
- Local construction and coloring of spanners of location aware unit disk graphs
- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs
- Structural Information and Communication Complexity
- Distributed computation of virtual coordinates for greedy routing in sensor networks
- Directional Geometric Routing on Mobile Ad Hoc Networks
- Partitioning Graph Drawings and Triangulated Simple Polygons into Greedily Routable Regions
- Construction and Local Routing for Angle-Monotone Graphs
- Position-based routing in wireless ad hoc and sensor networks
- Overlay networks for wireless ad hoc networks
- Proxy Assignments for Filling Gaps in Wireless Ad-Hoc Lattice Computers
- Modelling gateway placement in wireless networks: geometric \(k\)-centres of unit disc graphs
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks
- Analysis of Link Reversal Routing Algorithms
- Minimum weight convex Steiner partitions
- A unified view to greedy geometric routing algorithms in ad hoc networks
- A routing algorithm for wireless ad hoc networks with unidirectional links
- Geographic routing on virtual raw anchor coordinate systems
- Some results on greedy embeddings in metric spaces
- Competitive routing in hybrid communication networks
- Communication costs in a geometric communication network
- A generalized greedy routing algorithm for 2-connected graphs
- Local routing algorithms on Euclidean spanners with small diameter
- Graph product structure for non-minor-closed classes
- 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
- Existence of connected intersection-free subgraphs in graphs with redundancy and coexistence property
- Routing on heavy path WSPD spanners
- 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
This page was built for publication: Routing with guaranteed delivery in ad hoc wireless networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952560)
