Gossip: A social interest based routing algorithm for pocket switched network

摘要

Nodes of a sparsely distributed and an erratically connected network like Mobile Ad hoc Network (MANET) and Delay Tolerant Network (DTN) has no prior knowledge of node connectivity and suffers greatly from the lack of stable infrastructures. Thus selecting an effective message forwarding algorithm is of prime concern for efficient message propagation and resource sharing. To overcome the boundaries due to these limitations, user device's mobility pattern can be exploited to avail faster message transmission, while contributing to energy conservation and establishing effective communication. When implemented using the wireless technologies, such algorithms can provide a wide application domain in scenarios such as communication in disasters or war affected zones, where common communication methods are not approachable. In this paper, a novel approach named “Gossip” has been proposed. It works through forming social profiles for each individual hand-held device carriers while depending on their social interests; and afterwards chooses an aptest hop node relying on that social profile for successful message delivery.