Geometric Methods of Information Storage and Retrieval in Sensor Networks

Sensor networks collect data from their environment. Locations of the sensors are an important attribute of that information and provide a context useful to understand, and use sensor data. In this chapter, we will discuss geometric ideas to organize sensor data by using their locations. We will consider distributed methods for managing queries about isolated events, queries about mobile objects, and queries for general signal fields. Location-based methods often require suitable simple geometric domains to operate, and we will discuss how they can be adapted to networks with complex shapes.

[1]  Young-Jin Kim,et al.  Multi-dimensional range queries in sensor networks , 2003, SenSys '03.

[2]  Antony Rowstron,et al.  Virtual ring routing: network routing inspired by DHTs , 2006, SIGCOMM 2006.

[3]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[4]  Jie Gao,et al.  Localization and routing in sensor networks by local angle information , 2005, MobiHoc '05.

[5]  Rik Sarkar,et al.  Hierarchical spatial gossip for multi-resolution representations in sensor networks , 2007, IPSN '07.

[6]  Wei Zeng,et al.  Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space , 2010, 2010 Proceedings IEEE INFOCOM.

[7]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[8]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[9]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.

[10]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[11]  James Newsome,et al.  GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information , 2003, SenSys '03.

[12]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[13]  Roger Wattenhofer,et al.  Convergence to Equilibrium in Local Interaction Games , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[14]  B. R. Badrinath,et al.  Routing on a curve , 2003, CCRV.

[15]  Robert D. Kleinberg.  Geographic Routing Using Hyperbolic Space , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[16]  Jie Gao,et al.  Shape Segmentation and Applications in Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[17]  Jie Gao,et al.  Differential forms for target tracking and aggregate queries in distributed networks , 2013, TNET.

[18]  Brian D. O. Anderson,et al.  Rigidity, computation, and randomization in network localization , 2004, IEEE INFOCOM 2004.

[19]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[20]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[21]  Wei Zeng,et al.  Covering space for in-network sensor data storage , 2010, IPSN '10.

[22]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[23]  Young-Jin Kim,et al.  Geographic routing made practical , 2005, NSDI.

[24]  Jon M. Kleinberg,et al.  The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.

[25]  Leonidas J. Guibas,et al.  GLIDER: gradient landmark-based distributed routing for sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[26]  Jie Gao,et al.  Double Rulings for Information Brokerage in Sensor Networks , 2006, IEEE/ACM Transactions on Networking.

[27]  Anne-Marie Kermarrec,et al.  Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach , 2012, TNET.

[28]  Jie Gao,et al.  Hierarchical Spatial Gossip for Multi-Resolution Representations in Sensor Networks , 2011, 2007 6th International Symposium on Information Processing in Sensor Networks.

[29]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[30]  Jie Gao,et al.  MAP: Medial axis based geometric routing in sensor networks , 2007, Wirel. Networks.

[31]  Wenyu Liu,et al.  Approximate convex decomposition based localization in wireless sensor networks , 2012, 2012 Proceedings IEEE INFOCOM.

[32]  Jie Gao,et al.  Greedy routing with guaranteed delivery using Ricci flows , 2009, 2009 International Conference on Information Processing in Sensor Networks.

[33]  Leonidas J. Guibas,et al.  Fractionally cascaded information in a sensor network , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[34]  A. Dimakis,et al.  Geographic gossip: efficient aggregation for sensor networks , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[35]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[36]  Leonidas J. Guibas,et al.  Landmark-Based Information Storage and Retrieval in Sensor Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[37]  Leonidas J. Guibas,et al.  Composable Information Gradients in Wireless Sensor Networks , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).

[38]  Deborah Estrin,et al.  Rumor Routing Algorithm For Sensor Networks , 2002 .

[39]  Deborah Estrin,et al.  Directed diffusion: a scalable and robust communication paradigm for sensor networks , 2000, MobiCom '00.

[40]  Yan Zhang,et al.  Geometric ad-hoc routing: of theory and practice , 2003, PODC '03.

[41]  Jie Gao,et al.  Geometric algorithms for sensor networks , 2012, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[42]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[43]  Jon M. Kleinberg,et al.  Spatial gossip and resource location protocols , 2001, JACM.

[44]  Danny Dolev,et al.  LLS: a locality aware location service for mobile ad hoc networks , 2004, DIALM-POMC '04.

[45]  Jie Gao,et al.  Segmenting a sensor field: Algorithms and applications in network design , 2009, TOSN.