GHT: a geographic hash table for data-centric storage
By Sylvia Ratnasamy, Brad Karp, Li Yin, Fang Yu, Deborah Estrin, Ramesh Govindan, Scott Shenker. ACM International Conference on Wireless Sensor Networks and Applications, 2002
1,011 citations recorded by the source corpus.
Subfields: Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/19d9d5e14d4d3f3e4ef66e00cdbc11ff6a93e9d5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Scott Shenker
- Adrian Perrig
- Sencun Zhu
- Sushil Jajodia
- Sanjeev Setia
- Hari Balakrishnan
- Deborah Estrin
- Ramesh Govindan
Citations in the corpus
- An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks (2004, methodology): “Our approach for local repair is based on the right-hand rule in the greedy parameter stateless routing (GPSR) protocol [11].”
- Vehicular networks and the future of the mobile internet (2011, background): “OLS is maintained within the Internet infrastructure with overlay technology; VLS is maintained entirely in the vehicle grid, possibly using Geo Hash Table (GHT) technology [36].”
- Locating and bypassing routing holes in sensor networks (2004, methodology): “Furthermore, the definition of weak stuck nodes is not inclusive enough for applications where the destination may not be a node in the network, as the scenarios discussed in the geographic hash table [2].”
- A Survey of Network Lifetime Maximization Techniques in Wireless Sensor Networks (2017, background): “ination The geographic hash table [151], line based data”
- The ACQUIRE mechanism for efficient querying in sensor networks (2003, background): “[11] presents a geographic hash table technique for data-centric storage (DCS) in sensor networks.”
- Recent and Emerging Topics in Wireless Industrial Communications: A Selection (2008, background): “It occurs only rarely that a sensor node communicates with a sensor node more than a few hops away (a notable example are distributed or geographic hash tables in sensor networks [68]).”
- Geographic routing without location information (2003, background): “The initial incarnations of data-centric storage, such as [25] and [24], used geographic routing as the underlying routing algorithm.”
- Sift: A MAC Protocol for Event-Driven Wireless Sensor Networks (2006, background): “There have been a number of proposals [11–14] for controlling the flow of information in a sensor network at the application layer.”
- Survey of research towards robust peer-to-peer networks: Search methods (2006, methodology): “Communication [12, 92, 119, 229-247] Multicasting Streaming Media Mobility Sensors.”
- PIKE: peer intermediaries for key establishment in sensor networks (2005, methodology): “An example of such a globally addressable communications infrastructure is geographically addressed networking using GPSR as a routing protocol [12] and a geographic hash table (GHT) as a address lookup service [19].”
- Mobeyes: smart mobs for urban monitoring with a vehicular sensor network (2006, background): “Third, in the data-centric storage model, or a Geographic Hash Table (GHT) [22], a sensor node hashes meta-data into geographic coordinates and stores a key-value pair at the sensor node geographically nearest to the hash of its key.”
- Geographic routing made practical (2005, background): “More recently, geographic routing algorithms have been proposed for use as a routing primitive for static sensor networks, as building blocks for data storage and flexible query processing in sensor networks [20, 23], and even”
- Exploiting Virtual Coordinates for Improved Routing Performance in Sensor Networks (2011, methodology): “As analyzed, for example, in the context of GHTs, a clear improvement can be expected in case of frequent node failures [29].”
- The Tenet architecture for tiered sensor networks (2006, background): “This principle has governed the design of data-centric routing and storage schemes [14, 28], sensor network databases [23], programming environments that promote active sensor networks [19], and a flexible yet narrow-waisted networking stack [26].”