Fair content dissemination in participatory DTNs

Abstract

Thanks to advances in the computing capabilities and added functionalities of modern mobile devices, creating and consuming digital media on the move has never been so easy and popular. Most of the DTN routing protocols proposed in the literature to enable content sharing have been exploiting users' mobility patterns, in order to maximise the delivery probability, while minimising the overall network overhead (e.g., number of message replicas in the system, messages' path length). Common to all these protocols has been the assumption that devices are willing to participate in the content distribution network; however, because of battery constraints, participation cannot be taken for granted, especially if the very same subset of devices are continuously selected as content carriers, simply because of their mobility properties. Indeed, we demonstrate that state-of-the-art DTN routing protocols distribute load in a highly unfair manner, with detrimental effects on delivery once the assumption of unconditional participation is lifted. To overcome this limitation, we propose a load-balancing mechanism whereby nodes maintain local estimates of network workload, and use them to direct traffic towards the least loaded portion of the network. We implement the mechanism on top of a source-based DTN routing protocol, and demonstrate, by means of simulation using a variety of real mobility traces, that high delivery is now achieved without compromising fairness.

Priority scheduling for participatory Delay Tolerant Networks

“…In order to evaluate our priority scheduling approach, we implemented it on top of an existing human DTN routing protocol CoHabit [4]. Evaluation has been conducted by means of simulation, and the setting is described next.…”

“…For completeness, we evaluated our work across all combinations of these social networks and mobility traces. Finally, all the protocol-specific parameters are very same as CoHabit [4], and quota is set to be 50 messages 5 days . Figure 3 depicts the gain in overall network satisfaction, while varying the loaded zone boundary: a value of 100% means that such boundary is not used, and the bundle size is set to grow as per described formula.…”

Rescue Support System with DTN for Earthquake Disasters

“…Second, the article in [29] describes research for a loadbalancing mechanism in participatory DTNs that disseminates content evenly. Based on the difference of mobility patterns, each node changes data capacity and transmission frequency in participatory DTNs.…”

“…Second, we assume that each node (both home servers and mobile devices) wants to obtain the information from all other home servers in the network, in order to quickly make an accurate rescue request map in the area. We think that our proposed network does not need a load-balancing mechanism [29], because each home server keeps this map information, like the Infobox [28], and has enough battery life to operate for three days in our assumption (Sect. 3.1).…”

ADDSEN: Adaptive Data Processing and Dissemination for Drone Swarms in Urban Sensing

“…While ADDSEN processes and disseminates sensed data, knowledge items containing partially processed data are the containers which are sent and received by drones during data processing and dissemination. The framework provides a generic service to represent, manipulate, and share knowledge across aerial disruption-tolerant networking (DTN) [15] under minimal assumptions about connectivity. To overcome disconnection in DTN, knowledge items are stored for an extended time and grouped as DTN bundles for dissemination.…”