Covering space for in-network sensor data storage

Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageEnglish
Title of host publicationProceedings of the 9th International Conference on Information Processing in Sensor Networks, IPSN 2010, April 12-16, 2010, Stockholm, Sweden
Number of pages12
ISBN (Print)978-1-60558-988-6
Publication statusPublished - 2010


Dive into the research topics of 'Covering space for in-network sensor data storage'. Together they form a unique fingerprint.

Cite this