A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Fair Routing in Delay Tolerant Networks
2009
IEEE INFOCOM 2009 - The 28th Conference on Computer Communications
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
doi:10.1109/infcom.2009.5061993
dblp:conf/infocom/PujolTR09
fatcat:t35jogwdeffyhmt2tgj7lfwrai