IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v3y2012i2p22-38.html
   My bibliography  Save this article

Cache Replacement in Mobile Adhoc Networks

Author

Listed:
  • Naveen Chauhan

    (National Institute of Technology, Hamirpur (H.P.), India)

  • Lalit K. Awasthi

    (National Institute of Technology, Hamirpur (H.P.), India)

  • Narottam Chand

    (National Institute of Technology, Hamirpur (H.P.), India)

Abstract

Caching of frequently accessed data in Mobile Adhoc NETwork (MANET) is a technique that can improve data access performance and availability. In the situation of sufficient cache space one may think of keeping all the data items in the cache. However, this has overhead in terms of multiple copies of same data distributed all over the network and there are chances of inconsistency of data among different nodes. The main objective of cooperative caching is the optimum utilization of cache by storing different data items in the cache of each Mobile Node (MN). By doing this, different sets of items are kept in the neighboring MNs. As and when some MN requires a data item which is not available with itself it may ask the neighboring nodes for the same. In this manner cooperative caching environment is created in MANETs. Cache replacement is required when certain items are to be stored in the cache, but MN does not have the sufficient space to store the incoming item. This paper proposes a Profit Based Replacement (PBR) where profit value is calculated for every item in the cache. Simulation experiments demonstrate that the PBR improves the cooperative caching performance in comparison to other conventional techniques.

Suggested Citation

  • Naveen Chauhan & Lalit K. Awasthi & Narottam Chand, 2012. "Cache Replacement in Mobile Adhoc Networks," International Journal of Distributed Systems and Technologies (IJDST), IGI Global, vol. 3(2), pages 22-38, April.
  • Handle: RePEc:igg:jdst00:v:3:y:2012:i:2:p:22-38
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2012040102
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdst00:v:3:y:2012:i:2:p:22-38. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.