Please use this identifier to cite or link to this item:
|Title:||quotCACHING STRATEGIES BASED ON INFORMATION DENSITY ESTIMATION IN WIRELESS AD HOC NETWORKSquot|
|Abstract:||quotData caching strategy for ad hoc networks whose nodes exchange information items in a peer-topeer newlinefashion. Data caching is a fully distributed scheme where each node, upon receiving newlinerequested information, determines the cache drop time of the information or which content to newlinereplace to make room for the newly arrived information. These decisions are made depending on newlinethe perceived presence of the content in the nodes proximity, whose estimation does not cause newlineany additional overhead to the information sharing system. newlineWe devise a strategy where nodes, independent of each other, decide whether to cache some newlinecontent and for how long. In the case of small-sized caches, we aim to design a content newlinereplacement strategy that allows nodes to successfully store newly received information while newlinemaintaining the good performance of the content distribution system. Under both conditions, newlineeach node takes decisions according to its perception of what nearby users may store in their newlinecaches and with the aim of differentiating its own cache content from the other nodes . newlineThe result is the creation of content diversity within the nodes neighborhood so that a requesting newlineuser likely finds the desired information nearby. We simulate our caching algorithms in different newlinead hoc network scenarios and compare them with other caching schemes, showing that our newlinesolution succeeds in creating the desired content diversity, thus leading to a resource-efficient newlineinformation access. newlineWe present a mobility design that incorporates the hybridquot newline newline|
|Appears in Departments:||Department of Computer Science and Engineering|
Files in This Item:
|thesis final.pdf||Attached File||2.21 MB||Adobe PDF||View/Open|
Items in Shodhganga are protected by copyright, with all rights reserved, unless otherwise indicated.