Research Article
Matching with Externalities for Device Assignment in IoT Sharding Blockchain
@INPROCEEDINGS{10.1007/978-3-031-04231-7_4, author={Jingrou Wu and Jin Zhang}, title={Matching with Externalities for Device Assignment in IoT Sharding Blockchain}, proceedings={Edge Computing and IoT: Systems, Management and Security. Second EAI International Conference, ICECI 2021, Virtual Event, December 22--23, 2021, Proceedings}, proceedings_a={ICECI}, year={2022}, month={5}, keywords={Internet of Things (IoT) Sharding blockchain Matching theory}, doi={10.1007/978-3-031-04231-7_4} }- Jingrou Wu
Jin Zhang
Year: 2022
Matching with Externalities for Device Assignment in IoT Sharding Blockchain
ICECI
Springer
DOI: 10.1007/978-3-031-04231-7_4
Abstract
Blockchain technology provides a powerful platform to record and manage Internet-of-Things (IoT) data. To support massive amounts of IoT data, sharding protocols are applied to enlarge the blockchain system scalability and increase efficiency. It divides the IoT devices into several committees (also called shards) so that data of different IoT devices can be processed at the same time in various shards. Random device assignment is the most popular way in IoT sharding blockchain system. Such assignment does not consider the features of different IoT devices and relationship among each IoT device. Hence, the random device assignment might lower the data processing speed. In this paper, we address this issue by modeling the IoT device assignment problem as a many-to-one matching model. Devices are assigned to only one shard while a shard can house many devices. Due to dynamic preference lists of devices, we consider the matching model with externalities. We propose an algorithm to find a stable matching and prove its convergence and stability. The simulation results indicate that the algorithm converges efficiently. Besides, the proposed algorithm has better performance than random assignment.
