4-connected projective-planar graphs are Hamiltonian
Journal of Combinatorial Theory Series B
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Deterministic boundary recognition and topology extraction for large sensor networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On a conjecture related to geometric routing
Theoretical Computer Science - Algorithmic aspects of wireless sensor networks
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
Distributed computation of virtual coordinates
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Greedy drawings of triangulations
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Visualization and Computer Graphics
Some Results on Greedy Embeddings in Metric Spaces
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Geometric spanners for routing in mobile networks
IEEE Journal on Selected Areas in Communications
Covering space for in-network sensor data storage
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
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
A generalized greedy routing algorithm for 2-connected graphs
Theoretical Computer Science
Hardness results for homology localization
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Distributed computation of virtual coordinates for greedy routing in sensor networks
Discrete Applied Mathematics
Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Fast decentralized averaging via multi-scale gossip
DCOSS'10 Proceedings of the 6th IEEE international conference on Distributed Computing in Sensor Systems
A case for hierarchical routing in low-power wireless embedded networks
ACM Transactions on Sensor Networks (TOSN)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Geographic routing in d-dimensional spaces with guaranteed delivery and low stretch
IEEE/ACM Transactions on Networking (TON)
Differential forms for target tracking and aggregate queries in distributed networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Greedy forwarding with geographical locations in a wireless sensor network may fail at a local minimum. In this paper we propose to use conformal mapping to compute a new embedding of the sensor nodes in the plane such that greedy forwarding with the virtual coordinates guarantees delivery. In particular, we extract a planar triangulation of the sensor network with non-triangular faces as holes, by either using the nodes' location or using a landmark-based scheme without node location. The conformal map is computed with Ricci flow such that all the non-triangular faces are mapped to perfect circles. Thus greedy forwarding will never get stuck at an intermediate node. The computation of the conformal map and the virtual coordinates is performed at a preprocessing phase and can be implemented by local gossip-style computation. The method applies to both unit disk graph models and quasi-unit disk graph models. Simulation results are presented for these scenarios.