DC Field | Value | Language |
---|---|---|
dc.contributor.author | joonho cho | ko |
dc.contributor.author | seungtek oh | ko |
dc.contributor.author | jaemyung kim | ko |
dc.contributor.author | Lee, Joonwon | ko |
dc.date.accessioned | 2013-03-03T10:23:49Z | - |
dc.date.available | 2013-03-03T10:23:49Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2003-11 | - |
dc.identifier.citation | IEEE COMMUNICATIONS LETTERS, v.7, no.11, pp.525 - 528 | - |
dc.identifier.issn | 1089-7798 | - |
dc.identifier.uri | http://hdl.handle.net/10203/78361 | - |
dc.description.abstract | We propose a neighbor caching strategy to overcome the overhead of multi-hop wireless communications. Neighbor caching makes a node possible to expand its caching storage instantaneously by storing its data in the storage of idle neighbors. We also present the ranking based prediction that selects the most appropriate neighbor which data can be stored in. The ranking based prediction is an adaptive algorithm that adjusts frequency of neighbor caching and makes neighbor caching flexible according to the idleness of nodes. | - |
dc.publisher | IEEE-Inst Electrical Electronics Engineers Inc | - |
dc.title | Neighbor Caching in Multi-hop Wireless Ad Hoc Networks | - |
dc.type | Article | - |
dc.identifier.wosid | 000186619000004 | - |
dc.identifier.scopusid | 2-s2.0-0344444208 | - |
dc.type.rims | ART | - |
dc.citation.volume | 7 | - |
dc.citation.issue | 11 | - |
dc.citation.beginningpage | 525 | - |
dc.citation.endingpage | 528 | - |
dc.citation.publicationname | IEEE COMMUNICATIONS LETTERS | - |
dc.identifier.doi | 10.1109/LCOMM.2003.818880 | - |
dc.contributor.nonIdAuthor | joonho cho | - |
dc.contributor.nonIdAuthor | seungtek oh | - |
dc.contributor.nonIdAuthor | jaemyung kim | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | multi-hop ad hoc network | - |
dc.subject.keywordAuthor | neighbor caching | - |
dc.subject.keywordAuthor | ranking based prediction | - |
dc.subject.keywordAuthor | storage sharing | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.