Data replication approaches for ad hoc wireless networks satisfying time constraints

Authors:
Xiao Chen
Affiliations:
Department of Computer Science, Texas State University, San Marcos, TX, USA
Venue:
International Journal of Parallel, Emergent and Distributed Systems
Year:
2007

Citing 3
Cited 2

Replica allocation methods in ad hoc networks with data update

Mobile Networks and Applications
Data Replication for Improving Data Accessibility in Ad Hoc Networks

IEEE Transactions on Mobile Computing
Improved schemes for power-efficient broadcast in ad hoc networks

International Journal of High Performance Computing and Networking

Fast track article: Generating random graphs for the simulation of wireless ad hoc, actuator, sensor, and internet networks

Pervasive and Mobile Computing
Analysis and performance study for coordinated hierarchical cache placement strategies

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent advances in technology have enabled the development of ad hoc wireless networks in which a collection of wireless mobile hosts (nodes) may move freely and self-organize into arbitrary and temporary network topologies in areas where communication infrastructures do not exist. In such networks, hosts frequently need data items to finish a certain task. The hosts chosen to store data items are called data servers. If the data items are stored too far away from the requiring host, multiple intermediate hosts are needed to relay the data. This creates a certain amount of delay which is not insignificant in time-critical applications. In this paper, we propose replica allocation schemes to let each host obtain data items in at most k(k ≥ 1) hops using minimal number of data servers in the network. Simulation results show that our schemes can generate a small number of data servers satisfying the k-hop time constraints.