—This paper is concerned with congestion aware forwarding algorithms within opportunistic networks. We remove the reoccurring assumption of unlimited storage, and make it evident that congestion is a prominent problem that needs to be addressed. We propose a distributed congestion control algorithm that adaptively chooses the next hop based on contact… (More)
This paper describes the design, development and evaluation an interest driven overlay on the top of our congestion aware forwarding protocol (CAFe) for social opportunistic networks. We show that P2P filecasting on top of Cafe achieves high success ratio of answered queries and high availability of intermediary nodes while maintaining fast downloads.
— Detecting and dealing with congestion in delay tolerant opportunistic networks is an important and challenging problem. In this paper we describe CAFREP, a unified congestion control framework for routing in such networks that adapts both data sending rates and data forwarding policies through a novel reactive fully distributed approach. CAFREP enables… (More)
Detecting and dealing with congestion in delay tolerant networks is an important and challenging problem. Current DTN forwarding algorithms typically direct traffic towards particular nodes in order to maximise delivery ratios and minimise delays, but as traffic demands increase these nodes may become unusable. This thesis proposes Café, an adaptive… (More)