AN ADAPTIVE RANDOM WALK ALGORITHM FOR SELECTING TIPS IN THE TANGLE

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.

Sedighipour Chafjiri Fatemeh; Esnaashari Esfahani Mohamad Mehdi

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

Seminar Paper

Paper Information

Seminar: INTERNATIONAL CONFERENCE ON WEB RESEARCH
Year:2019 | Issue:5

Download Full-Text

View:

185

Download:

161

Information Seminar Paper

Title

AN ADAPTIVE RANDOM WALK ALGORITHM FOR SELECTING TIPS IN THE TANGLE

Author(s)

Sedighipour Chafjiri Fatemeh | Esnaashari Esfahani Mohamad Mehdi

Keywords

BLOCKCHAIN

TANGLE

INTERNET OF THINGS

WALKING ALGORITHM

Abstract

NUMBER OF DEVICES USING INTERNET IS INCREASING EVERY DAY AND THIS FACT MAKES THE NEED TO IMPROVE THE INTERNET OF THINGS PROTOCOL MORE THAN EVER. DATA PROTECTION AND PRIVACY IS ONE OF THE KEY CHALLENGES IN THE INTERNET OF THINGS TECHNOLOGY. DANGERS INVOLVED IN THE CENTRALIZED TECHNOLOGY OF BLOCKCHAIN SYSTEM HAVE LED TO THE IDEA OF USING TANGLE, WHICH IS A DECENTRALIZED SYSTEM. THE MAIN PURPOSE OF THIS NEW TECHNOLOGY IS TO IMPROVE THE PROBLEMS AND LIMITATIONS OF BLOCKCHAIN SUCH AS HIGH COST AND TIME TO CONFIRM A TRANSACTION. IN THIS NEW ARCHITECTURE, EVERY NODE IS INVOLVED IN MAINTAINING NETWORK SECURITY. THIS WAY, IF A TRANSACTION IS CREATED, THEN IT SHOULD SELECT AND CONFIRM TWO UNCONFIRMED TRANSACTIONS ISSUED BEFORE. A WALKING ALGORITHM IS NEEDED FOR THIS SELECTION. WALKING ALGORITHMS PRESENTED IN LITERATURE THUS FAR ARE EITHER WEIGHTED OR UNWEIGHTED. AN UNWEIGHTED RANDOM WALK ALGORITHM CAN APPROVE TRANSACTIONS NEARLY PROPORTIONAL TO THE TIME OF THEIR ARRIVALS WHILE A WEIGHTED ALGORITHM CAN BETTER DEFEND AGAINST LAZY AND MALICIOUS TRANSACTIONS. IN THIS PAPER, A NEW RANDOM WALK ALGORITHM IS PRESENTED THAT HAS THE BENEFITS OF BOTH ALGORITHMS AT THE SAME TIME. THE IDEA IS TO ADAPT THE WEIGHT VALUE TO THE CURRENT SITUATION OF TRANSACTIONS. NUMERICAL RESULTS HAVE SHOWN THE SUPERIORITY OF THE PROPOSED ALGORITHM IN COMPARISON TO THE EXISTING ALGORITHMS IN PROVIDING A BALANCE BETWEEN TIMELINESS OF APPROVING TRANSACTIONS AND PROTECTING AGAINST MALICIOUS ACTIVITIES.

Cites

No record.

References

No record.

Cite

APA: Copy

Sedighipour Chafjiri, Fatemeh, & Esnaashari Esfahani, Mohamad Mehdi. (2019). AN ADAPTIVE RANDOM WALK ALGORITHM FOR SELECTING TIPS IN THE TANGLE. INTERNATIONAL CONFERENCE ON WEB RESEARCH. SID. https://sid.ir/paper/949076/en

Vancouver: Copy

Sedighipour Chafjiri Fatemeh, Esnaashari Esfahani Mohamad Mehdi. AN ADAPTIVE RANDOM WALK ALGORITHM FOR SELECTING TIPS IN THE TANGLE. 2019. Available from: https://sid.ir/paper/949076/en

IEEE: Copy

Fatemeh Sedighipour Chafjiri, and Mohamad Mehdi Esnaashari Esfahani, “AN ADAPTIVE RANDOM WALK ALGORITHM FOR SELECTING TIPS IN THE TANGLE,” presented at the INTERNATIONAL CONFERENCE ON WEB RESEARCH. 2019, [Online]. Available: https://sid.ir/paper/949076/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops