Applied and computational complex analysis. Vol. 3: discrete Fourier analysis—Cauchy integrals—construction of conformal maps---univalent functions
Directed diffusion: a scalable and robust communication paradigm for sensor networks
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
A two-tier data dissemination model for large-scale wireless sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
GHT: a geographic hash table for data-centric storage
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Dimensions: why do we need a new data handling architecture for sensor networks?
ACM SIGCOMM Computer Communication Review
ACM SIGCOMM Computer Communication Review
Multi-dimensional range queries in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Fractionally cascaded information in a sensor network
Proceedings of the 3rd international symposium on Information processing in sensor networks
Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Combs, needles, haystacks: balancing push and pull for discovery in large-scale sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Locating and bypassing holes in sensor networks
Mobile Networks and Applications
Double rulings for information brokerage in sensor networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Lazy cross-link removal for geographic routing
Proceedings of the 4th international conference on Embedded networked sensor systems
Geographic routing made practical
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Network sketching or: "How Much Geometry Hides in Connectivity?--Part II"
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Visualization and Computer Graphics
Greedy routing with guaranteed delivery using Ricci flows
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Canopy closure estimates with GreenOrbs: sustainable sensing in the forest
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems
Geometric spanners for routing in mobile networks
IEEE Journal on Selected Areas in Communications
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
Hi-index | 0.00 |
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibly holes, the mapping of data to sensors often creates unbalanced storage load with high data concentration on nodes near network boundaries. In this paper we propose to map data to a covering space, which is a tiling of the plane with copies of the sensor network, such that the sensors receive uniform storage load and traffic. We propose distributed algorithms to construct the covering space with Ricci flow and Möbius transforms. The use of the covering space improves the performance of many in-network storage and retrieval schemes such as geographical hash tables (GHTs) or the double rulings (quorum based schemes), and provides better load balanced routing.