IN RECENT YEARS WIRELESS AD HOC NETWORKS HAVE SEEN A GREAT DEAL OF ATTENTION, ESPECIALLY IN CASES WHERE NO INFRASTRUCTURE IS AVAILABLE. THESE NETWORKS AIM TO PROVIDE GOOD DATA ACCESSIBILITY FOR PARTICIPANTS. BECAUSE OF THE WIRELESS NODES’ CONTINUOUS MOVEMENT, NETWORK PARTITIONING OCCURS VERY OFTEN. IN ORDER TO SUBSIDE THE NEGATIVE EFFECTS OF THIS PARTITIONING AND IMPROVE DATA ACCESSIBILITY AND RELIABILITY, DATA IS REPLICATED IN NODES OTHER THAN THE ORIGINAL OWNER OF DATA. THIS DUPLICATION IS COSTLYIN TERMS OF NODES’STORAGE SPACE AND ENERGY. HENCE, SELFISH NODES IN AN AUTONOMOUS ENVIRONMENT MAY ACT NON-COOPERATIVELY AND DO NOT REPLICATE DATA. IN GAME THEORY LITERATURE THIS SITUATION IS REFERRED TO AS A STRATEGIC SITUATION. IN ORDER TO ADDRESS THIS PROBLEM WE PROPOSE A GAME THEORY DATA REPLICATION SCHEME BY USING THE REPEATED GAME CONCEPT AND PROVE THAT IT IS IN THE NODES’ BEST INTEREST TO COOPERATE FULLY INTHE REPLICATION PROCESS IF OUR MECHANISM IS USED. OUR ANALYSIS SHOWS THAT OUR SCHEME OUTPERFORMS PREVIOUS METHODS IN TERMS OF DATA ACCESSIBILITY, COMMUNICATION COST AND QUERY DELAY.