18-05-2010, 05:08 PM
Presented By:
Bin Tang, Himanshu Gupta, Samir Das
Computer Science Department
Abstract
|
Benefit-based Data Caching in Ad Hoc Networks full report
|
Presented By:
Bin Tang, Himanshu Gupta, Samir Das
Computer Science Department
Abstract
19-05-2010, 10:20 AM
How to prepare project.
Any class diagram available.
How to prepare in report on the Chapter System analysis?
Any class diagram available.
How to prepare in report on the Chapter System analysis?
01-10-2010, 02:32 PM
Can you please help me on this topic, in my project ??
I am helpless right now, hope that you will reply.
Please mail me at : divyanshu.supaul01[at]gmail.com
I am helpless right now, hope that you will reply.
Please mail me at : divyanshu.supaul01[at]gmail.com
10-03-2011, 07:03 PM
Benefit-based Data Caching in Ad Hoc Networks
The efficiency of the process of information access in a wireless ad hoc network can be imorives substantially by the use of ad-hoc networks. This is done by reducing
the access latency and bandwidth usage. The distributed caching algorithms is not trivial in the scenario where llimited memory is available with the networl nodes. the cache placement problem of minimizing total data access cost in ad hoc networks with multiple data items and nodes with limited memory capacity is discussed in this article. The variable benefit is defined to be the the reduction in total access cost. a solution whose benefit is at least one-fourth is presented in this article by a polynomial-time centralized approximation algorithm. For localized distributed implementation, the approximation algorithm can be amended. Even in the case of networks with mobile nodes, this algorithms can be extended. a network simulator (ns2) is used for simulating the algorithm. In scenarios such as higher access frequency and smaller memory, the algorithm is found to have higher benefits.
Get the report here:
http://ieee-icnp2006/papers/s6a2.pdf
The efficiency of the process of information access in a wireless ad hoc network can be imorives substantially by the use of ad-hoc networks. This is done by reducing
the access latency and bandwidth usage. The distributed caching algorithms is not trivial in the scenario where llimited memory is available with the networl nodes. the cache placement problem of minimizing total data access cost in ad hoc networks with multiple data items and nodes with limited memory capacity is discussed in this article. The variable benefit is defined to be the the reduction in total access cost. a solution whose benefit is at least one-fourth is presented in this article by a polynomial-time centralized approximation algorithm. For localized distributed implementation, the approximation algorithm can be amended. Even in the case of networks with mobile nodes, this algorithms can be extended. a network simulator (ns2) is used for simulating the algorithm. In scenarios such as higher access frequency and smaller memory, the algorithm is found to have higher benefits.
Get the report here:
http://ieee-icnp2006/papers/s6a2.pdf
21-03-2011, 05:46 PM
i need the full report pls mail me my id: itsme_sfn[at]yahoo.com
|
« Next Oldest | Next Newest »
|
