Cooperative‐routing mechanism based on node classification and task allocation for opportunistic social networks

Abstract

With the development of big data, the authors have witnessed the great success of the mobile internet that the number of intelligent mobile devices (MDs) has increased dramatically and the data that needs to be transmitted grows exponentially. The traditional end-to-end communication mechanism in social networks is difficult to satisfy enormous communication demands. Therefore, opportunistic social networks proposed that message applications should choose relay nodes to perform effective data transmission processes. Currently, some routing algorithms that utilise contextual information associated with nodes need to handle heavy computing tasks and manage large numbers of messages, which usually results in higher network overhead and network latency. Furthermore, the computing power of MDs is usually limited, message carriers may not be able to quickly find the suitable relay node because of their insufficient computing power, resulting in higher network latency and network overhead. In this study, they construct a cooperative-routing mechanism based on node classification and task allocation for opportunistic social networks. In their proposed strategy, the reliable relay nodes can be obtained by classifying nodes according to the social attributes of the nodes. The task of node classification will be uniformly assigned to other idle nodes according to their computing power.