A REPLICATION DILEMMA GAME FOR COOPERATIVE DATA REPLICATION IN AD HOC NETWORKS

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Tajalli Alireza; Sedigh Navid; Hosseini Seno Seyed Amin

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE)
Year:2016 | Issue:6

Download Full-Text

View:

132

Download:

Information Seminar Paper

Title

A REPLICATION DILEMMA GAME FOR COOPERATIVE DATA REPLICATION IN AD HOC NETWORKS

Author(s)

Tajalli Alireza | Sedigh Navid | Hosseini Seno Seyed Amin | Issue Writer Certificate

Keywords

MANETS

GAME THEORY

REPEATED GAMES

DATA REPLICATION

Abstract

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.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Tajalli, Alireza, Sedigh, Navid, & Hosseini Seno, Seyed Amin. (2016). A REPLICATION DILEMMA GAME FOR COOPERATIVE DATA REPLICATION IN AD HOC NETWORKS. INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE). SID. https://sid.ir/paper/944546/en

Vancouver: Copy

Tajalli Alireza, Sedigh Navid, Hosseini Seno Seyed Amin. A REPLICATION DILEMMA GAME FOR COOPERATIVE DATA REPLICATION IN AD HOC NETWORKS. 2016. Available from: https://sid.ir/paper/944546/en

IEEE: Copy

Alireza Tajalli, Navid Sedigh, and Seyed Amin Hosseini Seno, “A REPLICATION DILEMMA GAME FOR COOPERATIVE DATA REPLICATION IN AD HOC NETWORKS,” presented at the INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE). 2016, [Online]. Available: https://sid.ir/paper/944546/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops