Matches in SemOpenAlex for { <https://semopenalex.org/work/W2159332974> ?p ?o ?g. }
Showing items 1 to 93 of
93
with 100 items per page.
- W2159332974 endingPage "25" @default.
- W2159332974 startingPage "5" @default.
- W2159332974 abstract "In recent years the popularity of multi-hop wireless networks has been growing. Its flexible topology and abundant routing path enables many types of applications. However, the lack of a centralized controller often makes it difficult to design a reliable service in multi-hop wireless networks. While packet routing has been the center of attention for decades, recent research focuses on data discovery such as file sharing in multi-hop wireless networks. Although there are many peer-to-peer lookup (P2P-lookup) schemes for wired networks, they have inherent limitations for multi-hop wireless networks. First, a wired P2P-lookup builds a search structure on the overlay network and disregards the underlying topology. Second, the performance guarantee often relies on specific topology models such as random graphs, which do not apply to multi-hop wireless networks. Past studies on wireless P2P-lookup either combined existing solutions with known routing algorithms or proposed tree-based routing, which is prone to traffic congestion. In this paper, we present two wireless P2P-lookup schemes that strictly build a topology-dependent structure. We first propose the Ring Interval Graph Search (RIGS) that constructs a DHT only through direct connections between the nodes. We then propose the ValleyWalk, a loosely-structured scheme that requires simple local hints for query routing. Packet-level simulations showed that RIGS can find the target with near-shortest search length and ValleyWalk can find the target with near-shortest search length when there is at least 5% object replication. We also provide an analytic bound on the search length of ValleyWalk." @default.
- W2159332974 created "2016-06-24" @default.
- W2159332974 creator A5034213143 @default.
- W2159332974 date "2009-02-25" @default.
- W2159332974 modified "2023-10-14" @default.
- W2159332974 title "Efficient Peer-to-Peer Lookup in Multi-hop Wireless Networks" @default.
- W2159332974 cites W1512961795 @default.
- W2159332974 cites W1527463082 @default.
- W2159332974 cites W1542269856 @default.
- W2159332974 cites W1567806735 @default.
- W2159332974 cites W1597141356 @default.
- W2159332974 cites W184771636 @default.
- W2159332974 cites W1991090759 @default.
- W2159332974 cites W1996632590 @default.
- W2159332974 cites W2000876023 @default.
- W2159332974 cites W2007219304 @default.
- W2159332974 cites W2090235425 @default.
- W2159332974 cites W2090609496 @default.
- W2159332974 cites W2096706512 @default.
- W2159332974 cites W2097105793 @default.
- W2159332974 cites W2097694588 @default.
- W2159332974 cites W2106101127 @default.
- W2159332974 cites W2107525211 @default.
- W2159332974 cites W2112090702 @default.
- W2159332974 cites W2119245106 @default.
- W2159332974 cites W2123080720 @default.
- W2159332974 cites W2123482462 @default.
- W2159332974 cites W2140400278 @default.
- W2159332974 cites W2140674577 @default.
- W2159332974 cites W2144381381 @default.
- W2159332974 cites W2146915023 @default.
- W2159332974 cites W2148570604 @default.
- W2159332974 cites W2148647281 @default.
- W2159332974 cites W2150676586 @default.
- W2159332974 cites W2155869384 @default.
- W2159332974 cites W2158049821 @default.
- W2159332974 cites W2161725792 @default.
- W2159332974 cites W2163059190 @default.
- W2159332974 cites W2164319686 @default.
- W2159332974 cites W2165222121 @default.
- W2159332974 cites W2167898414 @default.
- W2159332974 cites W2168759873 @default.
- W2159332974 cites W2170469173 @default.
- W2159332974 cites W2171860868 @default.
- W2159332974 cites W2532433771 @default.
- W2159332974 cites W39444623 @default.
- W2159332974 cites W630423399 @default.
- W2159332974 cites W3201153541 @default.
- W2159332974 doi "https://doi.org/10.3837/tiis.2009.01.001" @default.
- W2159332974 hasPublicationYear "2009" @default.
- W2159332974 type Work @default.
- W2159332974 sameAs 2159332974 @default.
- W2159332974 citedByCount "12" @default.
- W2159332974 countsByYear W21593329742012 @default.
- W2159332974 countsByYear W21593329742013 @default.
- W2159332974 countsByYear W21593329742014 @default.
- W2159332974 countsByYear W21593329742015 @default.
- W2159332974 countsByYear W21593329742016 @default.
- W2159332974 countsByYear W21593329742017 @default.
- W2159332974 crossrefType "journal-article" @default.
- W2159332974 hasAuthorship W2159332974A5034213143 @default.
- W2159332974 hasBestOaLocation W21593329741 @default.
- W2159332974 hasConcept C120314980 @default.
- W2159332974 hasConcept C25906391 @default.
- W2159332974 hasConcept C31258907 @default.
- W2159332974 hasConcept C41008148 @default.
- W2159332974 hasConcept C534932454 @default.
- W2159332974 hasConceptScore W2159332974C120314980 @default.
- W2159332974 hasConceptScore W2159332974C25906391 @default.
- W2159332974 hasConceptScore W2159332974C31258907 @default.
- W2159332974 hasConceptScore W2159332974C41008148 @default.
- W2159332974 hasConceptScore W2159332974C534932454 @default.
- W2159332974 hasIssue "1" @default.
- W2159332974 hasLocation W21593329741 @default.
- W2159332974 hasOpenAccess W2159332974 @default.
- W2159332974 hasPrimaryLocation W21593329741 @default.
- W2159332974 hasRelatedWork W1482156983 @default.
- W2159332974 hasRelatedWork W1504006543 @default.
- W2159332974 hasRelatedWork W1568263432 @default.
- W2159332974 hasRelatedWork W1582490518 @default.
- W2159332974 hasRelatedWork W1595983809 @default.
- W2159332974 hasRelatedWork W1598496208 @default.
- W2159332974 hasRelatedWork W2001888460 @default.
- W2159332974 hasRelatedWork W2098672555 @default.
- W2159332974 hasRelatedWork W2100136028 @default.
- W2159332974 hasRelatedWork W2124794258 @default.
- W2159332974 hasVolume "3" @default.
- W2159332974 isParatext "false" @default.
- W2159332974 isRetracted "false" @default.
- W2159332974 magId "2159332974" @default.
- W2159332974 workType "article" @default.