2020
DOI: 10.1109/jiot.2020.2996614
|View full text |Cite
|
Sign up to set email alerts
|

Queuing Without Patience: A Novel Transaction Selection Mechanism in Blockchain for IoT Enhancement

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 14 publications
0
4
0
Order By: Relevance
“…Basically, in a pool of transaction queues, the higher a transaction fee limit is set, the faster the transaction validation would be. The undesired resultant effect is that some transactions are stuck in the Mempool (a queue in the network where all transactions are kept until validation is confirmed) due to a lower transaction fee set [10]. Sometimes, they are rejected by the system after a long stay in the memory pool, and the funds are refunded to the owner, yet the initiated transactions are not invalid [11].…”
Section: A the Blockchain Transaction Latency And Uncertaintymentioning
confidence: 99%
See 1 more Smart Citation
“…Basically, in a pool of transaction queues, the higher a transaction fee limit is set, the faster the transaction validation would be. The undesired resultant effect is that some transactions are stuck in the Mempool (a queue in the network where all transactions are kept until validation is confirmed) due to a lower transaction fee set [10]. Sometimes, they are rejected by the system after a long stay in the memory pool, and the funds are refunded to the owner, yet the initiated transactions are not invalid [11].…”
Section: A the Blockchain Transaction Latency And Uncertaintymentioning
confidence: 99%
“…Therefore, the tolerable number of malicious nodes must not exceed 1. Similarly, (10) gives the maximum possible number of malicious nodes when the value of m+n is otherwise a positive multiple of 3 where m+n  6. For example, when m+n = 9, (9-1)/3 = 2.67.…”
Section: The P-pbft Algorithmmentioning
confidence: 99%
“…Blockchain In general, the blockchain [17][18][19][20][21][22][23][24][25][26][27] can be treated as a distributed data store that records all the transactions that have occurred in the peer-to-peer network. All participants in the network hold the same copy of the data record, and there is no central authority or single node can control the entire network.…”
Section: Blockchain and Kv Storementioning
confidence: 99%
“…B ITCOIN is immune to distrustful entities and can expedite confidence by a mining-based consensus mechanism without a third party, heralding a new era in digital cryptocurrency since introduced in 2008 [1][2][3]. As incentives for mining, each consensus participant, called miner, may receive two types of rewards, comprising subsidy, the systematically assigned currency, and transaction fees, attached to the transactions from users.…”
Section: Introductionmentioning
confidence: 99%