This paper presents novel blockchain based resource tokenization method to crowdfund wireless network deployment. Crowdfunding is a method of financing certain projects with the funds collected from individuals. The m...
详细信息
ISBN:
(纸本)9781665443999;9781665444002
This paper presents novel blockchain based resource tokenization method to crowdfund wireless network deployment. Crowdfunding is a method of financing certain projects with the funds collected from individuals. The method presented in this paper finances the wireless network deployment projects by tokenizing proposed novel wireless resource units, and selling these units to investors. A new Data Tonnage Unit Per User (DTUPU) resource unit is introduced with a new pricing scheme depending on a load of a base station. A novel Proof of Load (PoLO) consensus algorithm is proposed which is used to verify load of a base station. Traffic Diversity Factor (TDF) and User Difference Factor (UDF) are proposed to determine the value of a base station and a cluster of base stations.
In recent years, the blockchain that is the basis of Bitcoin has received much attention. However, the blockchain also faces many challenges, such as security and scalability, which have been the subject of recent res...
详细信息
In recent years, the blockchain that is the basis of Bitcoin has received much attention. However, the blockchain also faces many challenges, such as security and scalability, which have been the subject of recent researches. Much work has been done to solve the scalability problem in blockchain; one of these methods is sharding. This method is based on dividing the network into different groups and validating transactions in parallel. These methods use traditional consensus algorithms. One of the problems in this regard is the incentive that should be provided for nodes to participate in these consensus algorithms. In this paper, Repchain, one of the existing methods in this field, is examined, and the problems that this method has is analyzed. Next, it is proved that the proposed method causes the network nodes not to follow the protocol and also causes collusion between network nodes.
We present a simple (1 + Ε)∆-edge-coloring algorithm for graphs of maximum degree ∆ = Ω(log n/Ε) with running time O (m log3 n/Ε3). Our algorithm improves upon that of [Duan, He, and Zhang;SODA19], which was the fi...
详细信息
Sensitivity measures how much the output of an algorithm changes, in terms of Hamming distance, when part of the input is modified. While approximation algorithms with low sensitivity have been developed for many prob...
详细信息
Previous papers give accounts of quests for satisfactory formalizations of the classical informal notion of an algorithm and the contemporary informal notion of an interactive algoritm. In this paper, an attempt is ma...
详细信息
This article introduces a quick and simple combinatorial approximation algorithm for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of verti...
详细信息
Over the last few decades, machine learning (ML) applications have grown exponentially, yielding several benefits to society. However, these benefits are tempered with concerns of discriminatory behaviours exhibited b...
详细信息
MSC Codes 90C25, 90C30, 90C60, 90C46The proximal bundle algorithm (PBA) is a fundamental and computationally effective algorithm for solving optimization problems with nonsmooth components. We investigate its converge...
详细信息
The balanced incomplete block design (BIBD) problem is a difficult combinatorial problem with a large number of symmetries, which add complexity to its resolution. In this paper, we propose a dual (integer) problem re...
详细信息
We show that a simple greedy algorithm is 4.75-competitive for the Laminar Matroid Secretary Problem, improving the 3√3 ≈ 5.196-competitive algorithm based on the forbidden sets technique (Soto, Turkieltaub, and Ver...
详细信息
暂无评论