IoT devices are widely used in the smart home, automobile, and aerospace areas. Note, however, that recent information on thefts and hacking have given rise to many problems. The aim of this study is to overcome the security weaknesses of existing Internet of Things (IoT) devices using Blockchain technology, which is a recent issue. This technology is used in Machine-to-Machine (M2M) access payment—KYD (Know Your Device)—based on the reliability of existing IoT devices. Thus, this paper proposes a BoT (Blockchain of Things) ecosystem to overcome problems related to the hacking risk of IoT devices to be introduced, such as logistics management and history management. There are also many security vulnerabilities in the sensor multi-platform from the IoT point of view. In this paper, we propose a model that solves the security vulnerability in the sensor multi-platform by using blockchain technology on an empirical model. The color spectrum chain mentioned in this paper suggests a blockchain technique completed by using the multiple-agreement algorithm to enhance Thin-Plate Spline (TPS) performance and measure various security strengths. In conclusion, we propose a radix of the blockchain’s core algorithm to overcome the weaknesses of sensor devices such as automobile, airplane, and close-circuit television (CCTV) using blockchain technology. Because all IoT devices use wireless technology, they have a fundamental weakness over wired networks. Sensors are exposed to hacking and sensor multi-platforms are vulnerable to security by multiple channels. In addition, since IoT devices have a lot of security weaknesses we intend to show the authentication strength of security through the color spectrum chain and apply it to sensor and multi-platform using Blockchain in the future.
Given a set of positive-weighted points and a query rectangler(specified by a client) of given extents, the goal of a maximizing range sum (MaxRS) query is to find the optimal location ofrsuch that the total weights of all the points covered byrare maximized. All existing methods for processing MaxRS queries assume the Euclidean distance metric. In many location-based applications, however, the motion of a client may be constrained by an underlying (spatial) road network; that is, the client cannot move freely in space. This paper addresses the problem of processing MaxRS queries in a road network. We propose the external-memory algorithm that is suited for a large road network database. In addition, in contrast to the existing methods, which retrieve only one optimal location, our proposed algorithm retrieves all the possible optimal locations. Through simulations, we evaluate the performance of the proposed algorithm.
A content-matched (CM) rangemonitoring query overmoving objects continually retrieves the moving objects (i) whose non-spatial attribute values are matched to given non-spatial query values; and (ii) that are currently located within a given spatial query range. In this paper, we propose a new query indexing structure, called the group-aware query region tree (GQR-tree) for efficient evaluation of CMrange monitoring queries. The primary role of the GQR-tree is to help the server leverage the computational capabilities of moving objects in order to improve the system performance in terms of the wireless communication cost and server workload. Through a series of comprehensive simulations, we verify the superiority of the GQR-tree method over the existing methods.
When a table containing personal information is published, sensitive information should not be revealed. Although k-anonymity and l-diversity models are popular approaches to protect privacy, they are limited to one time data publishing. After a dataset is updated with insertions and deletions, a data holder cannot safely release up-to-date information. Recently, m-invariance model has been proposed to support re-publication of dynamic datasets. However, m-invariance model has two drawbacks. First, the m-invariant generalization can cause high information loss. Second, if the adversary already obtained sensitive values of some individuals before accessing released information, m-invariance leads to severe privacy breaches. In this paper, we propose a new data sanitization technique for safely releasing dynamic datasets. The proposed technique prevents two drawbacks of m-invariance and provides a simple and effective method for handling inserted and deleted records.