The following pages link to Geometric ad-hoc routing (Q2943747):
Displaying 25 items.
- Category-based routing in social networks: membership dimension and the small-world phenomenon (Q386908) (← links)
- Compact and low delay routing labeling scheme for unit disk graphs (Q419502) (← links)
- A generalized greedy routing algorithm for 2-connected graphs (Q606989) (← links)
- A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles (Q635380) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- Routing of single-source and multiple-source queries in static sensor networks (Q924537) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- Constant memory routing in quasi-planar and quasi-polyhedral graphs (Q1003732) (← links)
- Geometric approach for optimal routing on a mesh with buses (Q1362339) (← links)
- Routing in unit disk graphs (Q1742368) (← links)
- How to use spanning trees to navigate in graphs (Q2375948) (← links)
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms (Q2415369) (← links)
- The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds (Q2415370) (← links)
- Local solutions for global problems in wireless networks (Q2466005) (← links)
- On a conjecture related to geometric routing (Q2575088) (← links)
- Theoretical aspects of connectivity-based multi-hop positioning (Q2575092) (← links)
- Collective tree spanners for unit disk graphs with applications (Q2839219) (← links)
- How to Use Spanning Trees to Navigate in Graphs (Q3182932) (← links)
- Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs (Q3183486) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- Directional Geometric Routing on Mobile Ad Hoc Networks (Q5323100) (← links)
- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks (Q5445787) (← links)
- Route discovery with constant memory in oriented planar geometric networks (Q5487818) (← links)
- Structural Information and Communication Complexity (Q5710092) (← links)
- Routing schemes for hybrid communication networks (Q6145044) (← links)
