| Autor: |
Neamatollahi, Peyman, Abrishami, Saeid, Naghibzadeh, Mahmoud, Yaghmaee Moghaddam, Mohammad Hossein, Younis, Ossama |
| Zdroj: |
IEEE Transactions on Industrial Informatics; May2018, Vol. 14 Issue 5, p1876-1886, 11p |
| Abstrakt: |
Organizing sensor nodes into a clustered architecture is an effective method for load balancing and prolonging the network lifetime. However, a serious drawback of the clustering approach is the imposed energy overhead caused by the “global” clustering operations in every round of the global round-based policy (GRBP). To mitigate this problem, this paper proposes a hierarchical clustering-task scheduling policy (HCSP), which triggers node-driven clustering as opposed to GRBP's time-driven clustering. Based on HCSP, each cluster is reconfigured only once at each local super round. Therefore, the cluster reconfiguration frequency varies on-demand and may differ from one cluster to another throughout the network lifetime. However, in order to refresh the entire network structure, global clustering is performed at the end of every global hyper round. Accordingly, HCSP aims to achieve a more flexible, energy-efficient, and scalable clustering-task scheduling than that of GRBP. This policy mitigates the clustering overhead, which is the worst disadvantage of clustering approaches. Energy consumption calculations and extensive simulations show the effectiveness of HCSP in saving energy and in prolonging the network lifetime. [ABSTRACT FROM PUBLISHER] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
