Fair Routing in Delay Tolerant Networks

—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. The combination of these heuristics and the social network structure leads the routing to direct most of the traffic through a small subset of good users. For instance, in the SimBet algorithm, the top 10% of users carry out 54% of all the forwards and 85% of all the handovers. This unfair load distribution is not sustainable as it can quickly deplete constraint resources in heavily utilized mobile devices (e.g. storage, battery, budget, etc.). Moreover, because a small number of users carry a significant amount of the traffic, the system is not robust to random failures and attacks. To overcome these inefficiencies, this paper introduces FairRoute, a routing algorithm for delay tolerant networks inspired by the social processes of perceived interaction strength, where messages are preferably forwarded to ...

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodriguez
• Keywords: Communications, Delay Tolerant Networks, INFOCOM 2009, Routing Algorithm, State-of-the-art Routing Algorithms