期刊
IEEE ACCESS
卷 8, 期 -, 页码 24385-24396出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2020.2971082
关键词
Coalitional graph game; IoT; minimum transmission broadcast; connected dominating set; pairwise stability
资金
- Ministry of Science and Technology (MOST), Taiwan [MOST 108-2221-E-005-010, MOST 107-3017-F-009-001]
- Center for mmWave Smart Radar Systems and Technologies'' under the Featured Areas Research Center Program by the Ministry of Education (MOE) of Taiwan
In this work, we consider the broadcast mechanisms for both reliable links and unreliable links in the Internet of Things (IoT) networks. Focusing on the minimum transmission broadcast (MTB) problem, we propose an efficient algorithm, termed as the Connected Dominating Set Algorithm based on Coalitional Graph Game (CDSA-CGG), to find the minimum connected dominating set (MCDS). Distinct from related work in the literature which adopts a non-cooperative game approach and assumes the interaction among nodes is limited to neighboring nodes, we formulate the interaction and cooperation among nodes over reliable links and over unreliable links as a connected forwarding graph based on coalitional graph game. We prove that the forwarding graph constructed by CDSA-CGG is a Nash network. In addition, we also prove that the final resulting graph is pairwise stable. The simulation results show that the proposed coalition graph game-based algorithm performs well in terms of the number of transmissions, convergence rate, and lifetime of nodes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据