However, the SET K-Cover problem has not been widely researched in HWSNs. Hence, we introduce three kinds of simple pure distributed algorithms named greedy game algorithms (GGAs) based on game theory ...

Deterministic processing time are no longer applicable under realistic circumstances because of the uncertainties involved in manufacturing and production processes. The present study aims to address ...