A sparse graph almost as good as the complete graph on points in K dimensions
Discrete & Computational Geometry
A new way to weigh Malnourished Euclidean graphs
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Topology control and routing in ad hoc networks: a survey
ACM SIGACT News
Online Routing in Triangulations
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Ad-hoc networks beyond unit disk graphs
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Deformable spanners and applications
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On hierarchical routing in doubling metrics
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Broadcasting and Gathering in Wireless Ad-Hoc Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Searching dynamic point sets in spaces with bounded doubling dimension
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Localized topology control for heterogeneous wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
Mobile Networks and Applications
Planar Point Location in Sublogarithmic Time
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Geometric Spanner Networks
Efficient Delaunay-based localized routing for wireless sensor networks: Research Articles
International Journal of Communication Systems - Energy-Efficicent Network Protocols and Algorithms for Wireless Sensor Networks
Distributed proximity maintenance in ad hoc mobile networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Geometric spanners for routing in mobile networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variabletransmission range. Almost all previous spanner constructions for ad hoc networks assumed that all nodes in the network have the same transmission range. This allowed a succinct representation of the network as a unit disk graph, serving as the basis for the construction. In contrast, when nodes have variable transmission range, the ad hoc network must be modeled by a general disk graph. Whereas unit disk graphs are undirected, general disk graphs are directed. This complicates the construction of a spanner for the network, since currently there are no efficient constructions of low-stretch spanners for general directed graphs. Nevertheless, in this paper it is shown that the class of disk graphs enjoys (efficiently constructible) spanners of quality similar to that of unit disk graph spanners. Moreover, it is shown that the new construction can be done in a localized fashion.