Quantile Context-Aware Social IoT Service Big Data Recommendation With D2D Communication

With the rapid development of the Internet-of-Things (IoT) networks, millions of IoT services provided through wireless networks are waiting for people's exploration. Such a large number of heterogeneous IoT services produce huge amounts of data in almost real time, known as big data, many of which cannot be measured or quantified. Hence, a recommended system that aims to deal with the unquantifiable big data is urgently needed. To solve the problem, we propose a novel quantile contextual tree-based multiarmed bandits algorithm to support the large-scale recommendation with both quantifiable and unquantifiable data. Furthermore, the high failure rate of communication has a serious influence on the recommendation accuracy of our system with the widely used D2D technology in today's IoT network. To improve recommendation accuracy under the D2D communication, we take into account the feedback of historical service receivers and the historical successful delivery rate (SDP) of data transmission at the same time for the service recommendation system. We give theoretical analysis to prove a sublinear bound of the regret. Numerical experiments with tremendously large data sets show that we can balance the regret with the system time cost and guarantee a high SDP.