Distributed construction of a planar spanner and routing for ad hoc wireless networks

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2002, Pages 1268-1277

  Li, Xiang Yang ^a   Calinescu, Gruia ^a   Wan, Peng Jun ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC WIRELESS NETWORK; DELAUNAY TRIANGULATION; NETWORK TOPOLOGY; PLANAR SPANNER; ROUTING; UNIT DISK GRAPH;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; NETWORK PROTOCOLS; PACKET SWITCHING; TELECOMMUNICATION LINKS; THEOREM PROVING;

WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 0036346602     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2002.1019377     Document Type: Conference Paper

References (29)

1. Online routing in triangulations
2. Dynamic source routing in ad hoc wireless networks
3. The dynamic source routing protocol for mobile ad hoc networks
4. An efficient routing protocol for wireless networks
5. A highly adaptive distributed routing algorithm for mobile wireless networks
6. Ad-hoc on-demand distance vector routing
7. Highly dynamic destination-sequenced distance-vector routing
8. Cedar: Core extraction distributed ad hoc routing
9. A review of current routing protocols for ad-hoc mobile wireless networks
10. A survey of routing techniques for mobile communication networks
11. GPS based distributed routing algorithms for wireless networks
12. Routing with guaranteed delivery in ad hoc wireless networks
13. Gpsr: Greedy perimeter stateless routing for wireless networks
14. Compass routing on geometric networks
15. On constructing minimum spanning trees in k-dimensional spaces and related problems
16. Classes of graphs which approximate the complete euclidean graph
17. Delaunay graphs are almost as good as complete graphs
18. The delaunay triangulation closely approximates the complete euclidean graph
19. There is a planar graph as good as the complete graph
20. Power efficient and sparse spanner for wireless ad hoc networks
21. A new statistical approach to geographic variation analysis
22. The region approach for computing relative neighborhood graphs in the 1p metric
23. The relative neighborhood graph of a finite planar set
24. On the spanning ratio of gabriel graphs and beta-skeletons
25. Partitioned neighborhood spanners of minimal outdegree
26. Online routing in convex subdivisions
27. Coverage in wireless ad-hoc sensor networks