Position-based routing algorithms for three-dimensional ad hoc networks

Explore this paper's citation graph

Summary

This thesis proposes several localized power-aware 3D position-based routing algorithms that increase the lifetime of a network by maximizing the average lifetime of its nodes and proposes the first local, constant time algorithm that constructs an independent dominating set and connected dominating set of a Unit Disk Graph in a 3D environment.

Type
dissertation
Published
2009-01-01
Cited by
1
References
108

Keywords

Connected dominating set, Computer science, Spanning tree, Algorithm, Destination-Sequenced Distance Vector routing

References

Cited by

Related papers