A Distributed Optimal Community-Aware Opportunistic Routing (Caor) Algorithm

Mobile social networks (MSNs) are a special kind of delay tolerant network (DTN), in which mobile users move around and communicate with each other via their carried short-distance wireless communication devices. Typical MSNs include pocket switch networks, mobile vehicular networks, mobile sensor networks. As more users exploit portable short-distance wireless communication devices (such as smart phones, iPads, mobile PCs, and sensors in vehicles) to contact and share data between each other in a cheap way, MSNs attract more attention. Since MSNs experience intermittent connectivity incurred by the mobility of users, routing is a mainly concerning and challenging problem. The methodology and basic idea of CAOR. We assume that the source (and relays) knows which communities that the destination d belongs to. That is, the message consists of the source, the destination information, and the data to be delivered. This assumption is reasonable because the source generally knows some basic information about the destination in most message delivery tasks. In fact, the source has many ways to know the basic information of the destination. many traditional DTN routing algorithms have been proposed. These algorithms include flooding-based algorithms and probability-based algorithms . Among these algorithms, the MH algorithm adopts the optimal opportunistic routing strategy, based on global contact information. Compared with this algorithm, the CAOR algorithm adopts the home aware community model and turns the routing problem among mobile nodes into the routing problem among static communities, and therefore, achieves the optimal routing performance only based on community contact information. The maintenance cost of the contact information is far less than the MH algorithm. The routing problem among many mobile nodes into the problem among some static communities, and propose the CAOR algorithm to achieve optimal opportunistic routing.