Delay-tolerant Network Routing Algorithm Based On Social Selfishness

Internet is a great success. On which the TCP/IP protocol running on the Internethas been the actual standard for network interconnecting. With the development ofscience and technology, new type of networks began to emerge, such as sensornetworks, deep space communication networks, which are characterized with high linkdelays, high link error, frequent disconnection, limited nodes resources, etc. Some ofthe basic Internet architecture key assumptions can hardly be fulfilled. Therefore,interconnecting these new networks with TCP/IP encountered great difficulties. Wecalled the internetworks of these new networks Delay-Tolerant Network (DTN).Existing routing algorithms for Delay Tolerant Networks (DTNs) assume thatnodes are willing to forward packets for others. In the real world, however, mostpeople are socially selfish; i.e., they are willing to forward packets for nodes withwhich they have social ties but not others, and such willingness varies with the strengthof the social tie. Following the philosophy of design for user, this paper proposes aSocial Selfishness Aware Routing (SSAR) algorithm to cope with user selfishness andprovide good routing performance in an efficient way. To select an effectiveforwarding node, SSAR considers both users’ willingness to forward and their contactopportunity, and derives a metric with mathematical modeling and machine learningtechniques to measure the forwarding capability of the mobile nodes. Simulation resultindicates that this algorithm can afford excellent performances.