Distributed cooperative caching strategies in wireless ad hoc networks
Research output: Contribution to journal › Journal article › Research › peer-review
Standard
Distributed cooperative caching strategies in wireless ad hoc networks. / Banoth, Rajkumar.
In: International Journal of Computer Applications, Vol. 57, No. 10, 2012, p. 20-25.Research output: Contribution to journal › Journal article › Research › peer-review
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - JOUR
T1 - Distributed cooperative caching strategies in wireless ad hoc networks
AU - Banoth, Rajkumar
PY - 2012
Y1 - 2012
N2 - Wireless devices have scarcity of resources such as storage capacity and processing power. For WANETs, cooperative caching strategies are proposed in this paper to improve efficiency in information exchange in peer-to-peer fashion. The caching strategies such as small sized caches and large sized caches depend on the estimation of density of information being flown in the network. In the former strategy content replacement takes place when new information is received while in the latter a decision is made as to whether the information is to be cached and for how long. In either case every node is capable of deciding as per the content in the caches of near by nodes. This is to ensure that each node has different content that is content diversity and share the content of other nodes thus managing memory efficiently. The simulations made using NS2 show that our caching strategies are capable of making expected content diversity and improve performance of information sharing in wireless ad hoc network.
AB - Wireless devices have scarcity of resources such as storage capacity and processing power. For WANETs, cooperative caching strategies are proposed in this paper to improve efficiency in information exchange in peer-to-peer fashion. The caching strategies such as small sized caches and large sized caches depend on the estimation of density of information being flown in the network. In the former strategy content replacement takes place when new information is received while in the latter a decision is made as to whether the information is to be cached and for how long. In either case every node is capable of deciding as per the content in the caches of near by nodes. This is to ensure that each node has different content that is content diversity and share the content of other nodes thus managing memory efficiently. The simulations made using NS2 show that our caching strategies are capable of making expected content diversity and improve performance of information sharing in wireless ad hoc network.
KW - Faculty of Science
KW - Computer Communication Networks
KW - mobile ad hoc network; MANET; light weight; routing; trust; authentication; multipath; packet success rate; security; reliability
KW - Banoth Rajkumar
KW - Cooperative caching, content diversity, wireless ad hoc networks
M3 - Journal article
VL - 57
SP - 20
EP - 25
JO - International Journal of Computer Applications
JF - International Journal of Computer Applications
SN - 0975-8887
IS - 10
ER -
ID: 154797711