Minimum weight convex Steiner partitions
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Constrained Delaunay triangulation for ad hoc networks
Journal of Computer Systems, Networks, and Communications
Greedy routing with guaranteed delivery using Ricci flows
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Virtual-coordinate-based delivery-guaranteed routing protocol in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Covering space for in-network sensor data storage
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Localized spanner construction for ad hoc networks with variable transmission range
ACM Transactions on Sensor Networks (TOSN)
On the necessity of using delaunay triangulation substrate in greedy routing based networks
IEEE Communications Letters
Resilient routing for sensor networks using hyperbolic embedding of universal covering space
INFOCOM'10 Proceedings of the 29th conference on Information communications
Differential forms for target tracking and aggregate queries in distributed networks
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Almost all Delaunay triangulations have stretch factor greater than π/2
Computational Geometry: Theory and Applications
Success guaranteed routing in almost Delaunay planar nets for wireless sensor communication
International Journal of Sensor Networks
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Clustering routing protocol based on location node in wireless sensor networks
SEPADS'11 Proceedings of the 10th WSEAS international conference on Software engineering, parallel and distributed systems
Journal of Parallel and Distributed Computing
Routing algorithm using GPSR and fuzzy membership for wireless sensor networks
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Communication-efficient construction of the plane localized delaunay graph
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Constructing efficient rotating backbones in wireless sensor networks using graph coloring
Computer Communications
Fault-tolerant spanners for ad hoc networks
International Journal of Network Management
Improved local algorithms for spanner construction
Theoretical Computer Science
Differential forms for target tracking and aggregate queries in distributed networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.07 |
We propose a new routing graph, the restricted Delaunay graph (RDG), for mobile ad hoc networks. Combined with a node clustering algorithm, the RDG can be used as an underlying graph for geographic routing protocols. This graph has the following attractive properties: 1) it is planar; 2) between any two graph nodes there exists a path whose length, whether measured in terms of topological or Euclidean distance, is only a constant times the minimum length possible; and 3) the graph can be maintained efficiently in a distributed manner when the nodes move around. Furthermore, each node only needs constant time to make routing decisions. We show by simulation that the RDG outperforms previously proposed routing graphs in the context of the Greedy perimeter stateless routing (GPSR) protocol. Finally, we investigate theoretical bounds on the quality of paths discovered using GPSR.