We study in this paper fluid approximations for a class of monotone relay policies in delay tolerant ad-hoc networks. This class includes the epidemic routing and the two-hops routing protocols. We enhance the relay policies with a probabilistic forwarding feature where a message is forwarded to a relay with some probability p. We formulate an optimal control problem where a tradeoff between de...

This thesis introduces the concept of compact forwarding in the field of content-oriented net-works. The main idea behind this concept is taking a probabilistic approach to the problem of packetforwarding in networks centered on content identifiers rather than traditional host addresses. Thefundamental question explored is where to place the packet forwarding state, in network nodes...

Intermittently connected mobile networks don’t have a complete path from a source to a destination at most of the time. Such an environment can be found in very sparse mobile networks where nodes meet only occasionally or in wireless sensor networks where nodes always sleep to conserve energy. Current transmission approaches in such networks are primarily based on: multi-copy flooding scheme an...

Delay Tolerant Network (DTN) is a kind of network in which the source may not be able to establish the stable and uninterrupted path to destination due to network partitioning, dynamic topology change and frequent disconnections. In order to dealt disruption and disconnections a store, carry and forward paradigm is used in which node stores the incoming messages in its buffer, carries it while ...

Delay tolerant network (DTN) is a kind of computer network that suffer from the frequent disconnections, network partitioned and unstable network connectivity, therefore maintaining an uninterrupted route from source to destination is not possible. Therefore, the transmission of message is achieved via intermediate nodes by adopting a novel transmission mechanism called store-carry and forward ...

Epidemic forwarding has been proposed as a forwarding technique to achieve opportunistic communication in Delay Tolerant Networks (DTNs). Even if this technique is well known and widely referred, one has to address several practical problems before using it. Unfortunately, while the literature on DTNs is full of new techniques, very little has been done in comparing them. In particular, while B...

In an opportunistic network, one of the most challenging issues is the equilibrium of the network traffic and transmission delay for forwarding messages. To resolve this problem, we propose a new forwarding scheme, called the direction entropy-based forwarding scheme (DEFS), using the main direction and direction entropy based on the information collected about the directions of the nodes in th...

In an opportunistic network (OPPNET), the forwarding schemes for adhoc networks are not applicable since there is no complete path between the source and the destination node and relay nodes should store messages when no forwarding opportunity exists. Recently several proper schemes have been proposed in an OPPNET. Among them, floodingbased schemes result in very high network traffic and low tr...

Emerging pervasive wireless networks, pocket switched networks, Internet of things, vehicular networks and even sensor networks present very challenging communication circumstances. They might involve up to several hundreds of wireless devices with mobility and intermittent connectivity. Centralized coordination in such networks is practically unfeasible. We deal with these challenge using two ...