Addressing the Transaction Validation Issue in IOTA Tangle: A Tip Selection Algorithm Based on Time Division
IOTA is a new public chain system specifically designed for the Internet of Things (IoT), which provides strong support for the high concurrency, scalability, and zero handling fees of the IoT. The distributed ledger of IOTA, called the tangle, adopts a Directed Acyclic Graph (DAG) structure. Howeve...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-09-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/11/19/4116 |
| _version_ | 1797575542195617792 |
|---|---|
| author | Yinfeng Chen Yaofei Wang Baojun Sun Junxin Liu |
| author_facet | Yinfeng Chen Yaofei Wang Baojun Sun Junxin Liu |
| author_sort | Yinfeng Chen |
| collection | DOAJ |
| description | IOTA is a new public chain system specifically designed for the Internet of Things (IoT), which provides strong support for the high concurrency, scalability, and zero handling fees of the IoT. The distributed ledger of IOTA, called the tangle, adopts a Directed Acyclic Graph (DAG) structure. However, compared to the single-chain architecture, the tangle is more complex and highly vulnerable to security threats. The existing transaction verification methods still cannot simultaneously meet the need for accelerating approval speed and improving security to resist illegal transactions, such as lazy tips and permanent tips. In this work, we propose TDTS, a tip-selection algorithm based on time division to improve the efficiency of transaction verification. The main idea of the algorithm is to quickly determine two tips of an incoming transaction that need to be confirmed by sorting tip values in a time slot. It shortens the transaction verification time and reduces the number of lazy tips and permanent tips. A comprehensive theoretical analysis confirmed the effectiveness of our proposed algorithm. Based on 1000 IOTA nodes, the evaluations showed that TDTS can select tips quickly like URTS and resist lazy tips like MCMC. |
| first_indexed | 2024-03-10T21:40:05Z |
| format | Article |
| id | doaj.art-b33477110efe4a1283881d89a7571aa9 |
| institution | Directory Open Access Journal |
| issn | 2227-7390 |
| language | English |
| last_indexed | 2024-03-10T21:40:05Z |
| publishDate | 2023-09-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Mathematics |
| spelling | doaj.art-b33477110efe4a1283881d89a7571aa92023-11-19T14:43:34ZengMDPI AGMathematics2227-73902023-09-011119411610.3390/math11194116Addressing the Transaction Validation Issue in IOTA Tangle: A Tip Selection Algorithm Based on Time DivisionYinfeng Chen0Yaofei Wang1Baojun Sun2Junxin Liu3School of Computer Information Management, Inner Mongolia University of Finance and Economics, Hohhot 010070, ChinaSchool of Computer Information Management, Inner Mongolia University of Finance and Economics, Hohhot 010070, ChinaSchool of Computer Information Management, Inner Mongolia University of Finance and Economics, Hohhot 010070, ChinaSchool of Artificial Intelligence, Beijing Normal University, Beijing 100875, ChinaIOTA is a new public chain system specifically designed for the Internet of Things (IoT), which provides strong support for the high concurrency, scalability, and zero handling fees of the IoT. The distributed ledger of IOTA, called the tangle, adopts a Directed Acyclic Graph (DAG) structure. However, compared to the single-chain architecture, the tangle is more complex and highly vulnerable to security threats. The existing transaction verification methods still cannot simultaneously meet the need for accelerating approval speed and improving security to resist illegal transactions, such as lazy tips and permanent tips. In this work, we propose TDTS, a tip-selection algorithm based on time division to improve the efficiency of transaction verification. The main idea of the algorithm is to quickly determine two tips of an incoming transaction that need to be confirmed by sorting tip values in a time slot. It shortens the transaction verification time and reduces the number of lazy tips and permanent tips. A comprehensive theoretical analysis confirmed the effectiveness of our proposed algorithm. Based on 1000 IOTA nodes, the evaluations showed that TDTS can select tips quickly like URTS and resist lazy tips like MCMC.https://www.mdpi.com/2227-7390/11/19/4116IOTAtangletip selectiontime division |
| spellingShingle | Yinfeng Chen Yaofei Wang Baojun Sun Junxin Liu Addressing the Transaction Validation Issue in IOTA Tangle: A Tip Selection Algorithm Based on Time Division Mathematics IOTA tangle tip selection time division |
| title | Addressing the Transaction Validation Issue in IOTA Tangle: A Tip Selection Algorithm Based on Time Division |
| title_full | Addressing the Transaction Validation Issue in IOTA Tangle: A Tip Selection Algorithm Based on Time Division |
| title_fullStr | Addressing the Transaction Validation Issue in IOTA Tangle: A Tip Selection Algorithm Based on Time Division |
| title_full_unstemmed | Addressing the Transaction Validation Issue in IOTA Tangle: A Tip Selection Algorithm Based on Time Division |
| title_short | Addressing the Transaction Validation Issue in IOTA Tangle: A Tip Selection Algorithm Based on Time Division |
| title_sort | addressing the transaction validation issue in iota tangle a tip selection algorithm based on time division |
| topic | IOTA tangle tip selection time division |
| url | https://www.mdpi.com/2227-7390/11/19/4116 |
| work_keys_str_mv | AT yinfengchen addressingthetransactionvalidationissueiniotatangleatipselectionalgorithmbasedontimedivision AT yaofeiwang addressingthetransactionvalidationissueiniotatangleatipselectionalgorithmbasedontimedivision AT baojunsun addressingthetransactionvalidationissueiniotatangleatipselectionalgorithmbasedontimedivision AT junxinliu addressingthetransactionvalidationissueiniotatangleatipselectionalgorithmbasedontimedivision |