Resource Scheduling Based on Unequal Clustering in Internet of Things

Abstract

Resource scheduling in a fair and efficient manner is a significant challenge in the Internet of Things. Although unequal clustering is an effective technique for alleviating the “energy holes” problem in multihop communication, resource scheduling based on unequal clustering is scarcely conducted. In the present study, a new resource scheduling based on unequal clustering in the Internet of Things (RSUC) is proposed. In RSUC, unequal clustering and multihop routing are considered, and the “energy holes” problem is alleviated effectively. RSUC includes resource scheduling of intracluster communication and intercluster communication. In resource scheduling of intracluster communication, according to the threshold of the number of cluster members, the cluster heads (CHs) recycle resources of failed nodes. In resource scheduling of intercluster communication, CHs in the different layers based on transmission chain obtain different sending and receiving time slots. In RSUC, CHs that are near the base station (BS) have fewer intracluster communication time slots and more intercluster communication time slots. Clusters that are further away from the BS end intercluster communication earlier and enter into intracluster communication instead of waiting for all CHs to complete intercluster communication. The simulation results reveal that RSUC significantly increases the network throughput and reduces the energy consumption of the Internet of Things.