| Type of Material: | Thesis |
| Title: | CACHING STRATEGIES BASED ON INFORMATION DENSITY ESTIMATION IN WIRELESS AD HOC NETWORKS |
| Researcher: | U.KARTHIKEYAN |
| Guide: | M.RAJANI |
| Department: | Department of Engineering and Technology(Computer Science and Engineering) |
| Publisher: | Bharath University, Chennai |
| Place: | Chennai |
| Year: | 2011 |
| Language: | English |
| Subject: | LINK LAYER TECHNIQUES | Automatic repeat request | Cross-Layer design | Computer Science and Information Technology | Engineering and Technology |
| Dissertation/Thesis Note: | PhD; Department of Engineering and Technology(Computer Science and Engineering), Bharath University, Chennai, Chennai; 2011; D08CS029 |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 454607 | |
| 003 | IN-AhILN | |
| 005 | 2024-09-18 10:06:01 | |
| 008 | __ | 240918t2011||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_454607 |
| 040 | __ | |aBHAU_600073|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aU.KARTHIKEYAN|eResearcher |
| 110 | __ | |aDepartment of Engineering and Technology(Computer Science and Engineering)|bBharath University, Chennai|dChennai|ein |
| 245 | __ | |aCACHING STRATEGIES BASED ON INFORMATION DENSITY ESTIMATION IN WIRELESS AD HOC NETWORKS |
| 260 | __ | |aChennai|bBharath University, Chennai|c2011 |
| 300 | __ | |dDVD |
| 502 | __ | |cDepartment of Engineering and Technology(Computer Science and Engineering), Bharath University, Chennai, Chennai|d2011|oD08CS029|bPhD |
| 518 | __ | |d2008-01-02|oDate of Registration |
| 520 | __ | |aData caching strategy for ad hoc networks whose nodes exchange information items in a peer-topeer fashion. Data caching is a fully distributed scheme where each node, upon receiving requested information, determines the cache drop time of the information or which content to replace to make room for the newly arrived information. These decisions are made depending on the perceived presence of the content in the nodes proximity, whose estimation does not cause any additional overhead to the information sharing system. We devise a strategy where nodes, independent of each other, decide whether to cache some content and for how long. In the case of small-sized caches, we aim to design a content replacement strategy that allows nodes to successfully store newly received information while maintaining the good performance of the content distribution system. Under both conditions, each node takes decisions according to its perception of what nearby users may store in their caches and with the aim of differentiating |
| 650 | __ | |aComputer Science and Information Technology|2UGC |
| 650 | __ | |aEngineering and Technology|2AIU |
| 653 | __ | |aLINK LAYER TECHNIQUES |
| 653 | __ | |aAutomatic repeat request |
| 653 | __ | |aCross-Layer design |
| 700 | __ | |aM.RAJANI|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/170940|yShodhganga |
| 905 | __ | |afromsg |
User Feedback Comes Under This section.