text

Data caching in ad hoc networks using game-theoretic analysis

SOAR Repository

Show simple item record

dc.contributor.advisor Tang, Bin
dc.contributor.author Dang, Hoang
dc.date.accessioned 2011-11-22T19:39:04Z
dc.date.available 2011-11-22T19:39:04Z
dc.date.copyright 2011 en
dc.date.issued 2011-05
dc.identifier.other t11010
dc.identifier.uri http://hdl.handle.net/10057/3948
dc.description Thesis (M.S.)--Wichita State University, College of Engineering, Dept. of Electrical Engineering and Computer Science. en_US
dc.description.abstract There have been researches that studied selfish data caching in ad hoc networks using game-theoretic analysis. However, due to the caching problem’s theoretical root in classic facility location problem and k-median problem, most of the researches assume: 1) The data is initially outside of the network; 2) The caching cost is either a constant or not considered at all. In reality, there are many applications, such as ad-hoc and sensor networks and peer to peer networks, in which data is initially collected or stored in the network and the caching cost depends on the network topology. This thesis addresses the problem of in-network data caching (referred to as in-caching problem) in multi-hop stationary ad hoc networks where the data is initially stored in the network and both caching and accessing costs are distance dependent. We first show that the problem is NP-hard. For selfish data caching game of the problem, we show that a pure Nash Equilibrium exists, in which a node will not deviate its caching strategy if others keep their own strategy. However, a Nash Equilibrium may not guarantee social optimal cost – due to the selfishness of each node, the price anarchy, which is the relative cost of the lack of cooperation among nodes, could be as large as O(n), where n is a number of nodes in the network. Using an external incentive mechanism based upon a payment model, we show a Nash Equilibrium and social optimal can both be achieved simultaneously via extensive simulations. en_US
dc.format.extent viii, 37 p. en
dc.language.iso en_US en_US
dc.publisher Wichita State University en_US
dc.rights @Copyright 2011 by Hoang Dang. All rights reserved en
dc.subject.lcsh Electronic dissertations en
dc.title Data caching in ad hoc networks using game-theoretic analysis en_US
dc.type Thesis en_US

Files in this item

Icon
Name: t11010_Dang.pdf
Size: 788.4Kb
Format: application/ pdf
Description: Thesis
View/Open
View in Browser

This item appears in the following Collection(s)

Show simple item record

Search SOAR


Advanced Search

Browse

My Account

Statistics