IoT data dissemination scheme for reducing delay in multi-broker environments
- Authors
- Cho Anna; Kim Taeyoung; Kim Chang Kyung; Choi Sieun; Lee Sukyoung
- Issue Date
- Apr-2024
- Publisher
- ELSEVIER
- Citation
- INTERNET OF THINGS, v.25
- Journal Title
- INTERNET OF THINGS
- Volume
- 25
- URI
- https://yscholarhub.yonsei.ac.kr/handle/2021.sw.yonsei/23220
- DOI
- 10.1016/j.iot.2023.101025
- ISSN
- 2543-1536
- Abstract
- With the rapid increase of Internet of Things (IoT) devices, an efficient communication protocol is needed to effectively manage the exchange and generation of data from these devices. Message Queuing Telemetry Transport (MQTT) is widely adopted in IoT systems due to its lightweight design and the support for topic-based publish-subscribe architectures. In MQTT, multiple IoT devices are connected to a server, referred to as a broker, to facilitate efficient data transmission and reduce network overhead. However, the traditional single-broker system is unable to efficiently support the massive number of IoT devices. Although a multi-broker system is proposed as a solution, the use of the flooding method for updating topics has generated a significant amount of inter-broker traffic, causing severe congestion in the brokers. As a result, this will lead to long topic update delay. To resolve this issue, in this paper, we propose a topic update dissemination scheme by considering the congestion in brokers. We formulate the topic update dissemination problem using the Lyapunov function, to minimize the topic update delay in the multi-broker system. To solve the problem, we propose a heuristic algorithm for the update dissemination forwarding decision. The simulation results show that the proposed algorithm can effectively reduce the topic update delay compared to other existing algorithms.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Computing > 인공지능융합대학 첨단컴퓨팅학부 > 인공지능융합대학 컴퓨터과학과 > 1. Journal Articles

Items in Scholar Hub are protected by copyright, with all rights reserved, unless otherwise indicated.