A Novel Way of Determining the Optimal Location of a Fragment in a DDBS: BGBR

Bayati, A.; Ghodsnia, Pedram; Rahgozar, Maseud; Basseda, Reza

doi:10.1109/icsnc.2006.12

Cited by 4 publications

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If updates of the contents are also under focus, then the locations of the replicas have to be: (a) in close proximity to the mobile hosts, and (b) in close proximity to the primary (assuming a "master" replication environment [17]) copy. Therefore, efficient and effective replication schemes strongly depend on how many replicas to be placed in the system, and more importantly where [5].…”

Section: Introductionmentioning

confidence: 99%

Mosaic-Net: a game theoretical method for selection and allocation of replicas in ad hoc networks

Khan

2009

J Supercomput

View full text Add to dashboard Cite

Due to the continuous mobility of hosts, an ad hoc network suffers from frequent disconnections. This phenomenon is undesirable when mobile hosts are accessing data from each other, and thus, data accessibility is lower than that in conventional fixed networks. Because one cannot control network disconnections, an alternative solution to this problem is to replicate data objects onto mobile hosts so that when disconnections occur, mobile hosts can still access data. In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. We prove that this problem in general is NP-complete and propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative environment to improve data accessibility by replicating data objects. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity, and communication costs. In the proposed scheme, players (mobile hosts) compete through bids in a non-cooperative environment to replicate data objects that are beneficial to themselves and the system as a whole. To cater for the possibility of cartel type behavior of the players, the scheme uses the Vickrey payment protocol that leaves the players with no option than to bid in such a fashion that is beneficial to the system as a whole. The paper also identifies some useful properties of the proposed scheme and the necessary conditions of optimality. The proposed technique is extensively evaluated against some well-known ad hoc network replica allocation methods, such as: (a) randomized, (b) extended static access frequency, (c) extended dynamic access frequency and neighborhood, and (d) extended dynamic connectivity grouping. The experimental results reveal that the proposed approach outperforms the four techniques in solution quality and projects a competitive execution time.

show abstract

Section: Introductionmentioning

confidence: 99%