Balancing the Trade offs between Query Delay and Data Availability in MANETs

In mobile ad hoc networks (MANETs), nodes move freely and link/node failures are common, which leads to frequent network partitions. When a network partition occurs, mobile nodes in one partition are not able to access data hosted by nodes in other partitions, and hence significantly degrade the performance of data access. To deal with this problem, we apply data replication techniques. Existing data replication solutions in both wired and wireless networks aim at either reducing the query delay or improving the data availability, but not both. As both metrics are important for mobile nodes, we propose schemes to balance the trade-offs between data availability and query delay under different system settings and requirements. Extensive simulation results show that the proposed schemes can achieve a balance between these two metrics and provide satisfying system performance.

Existing System:

Existing data replication solutions in either wired or wireless networks aim at either reducing the query delay or improving the data availability, but not both. However, most mobile nodes only have limited storage space, bandwidth and power, and hence it is impossible for one node to collect and hold all the data considering these constraints.

Proposed System:

In this paper, we propose new data replication techniques to address query delay and data availability issues. As both metrics are important for mobile nodes, we propose techniques to balance the tradeoffs between data availability and query delay under different system settings and requirements. Simulation results show that the proposed schemes can achieve a balance between these two metrics and provide satisfying system performance.

Modules:

  • Data Replication
  • The One-To-One Optimization (OTOO) Scheme
  • The Reliable Neighbor (RN) Scheme
  • Reliable Grouping (RG) Scheme

Tools Used:

Front End : .Net with C#