An efficient HOT-B protocol for caching in Mobile Adhoc Networks

Data Accessibility in mobile ad hoc network is an important issue of concern since the ultimate goal of using MANETs is to provide information access to mobile hosts. To improve data availability, with reduced access latency and reduced network traffic towards the Data Centre, cache sharing techniques are proposed. Caching in general improves network performance by caching frequently accessed items. However, caching comes along with many associated issues like data consistency and looping problems. In this paper we propose an efficient Heap Oriented Time Based (HOT-B) protocol to mitigate these issues. In this we propose four policies namely Data Discovery, Data Admission, Data Update and Data Replacement. These policies enhance data availability in an efficient manner even in resource constrained environments. When a new item is inserted or deleted from the cache all the data items within the cache is reordered in a prescribed manner, thereby reducing the traversal time within the cache.