3,563 research outputs found
VECTORS: Video communication through opportunistic relays and scalable video coding
Crowd-sourced video distribution is frequently of interest in the local
vicinity. In this paper, we propose a novel design to transfer such content
over opportunistic networks with adaptive quality encoding to achieve
reasonable delay bounds. The video segments are transmitted between source and
destination in a delay tolerant manner using the Nearby Connections Android
library. This implementation can be applied to multiple domains, including farm
monitoring, wildlife, and environmental tracking, disaster response scenarios,
etc. In this work, we present the design of an opportunistic contact based
system, and we discuss basic results for the trial runs within our institute.Comment: 13 pages, 6 figures, and under 3000 words for submission to the
SoftwareX journa
Predictable Disruption Tolerant Networks and Delivery Guarantees
This article studies disruption tolerant networks (DTNs) where each node
knows the probabilistic distribution of contacts with other nodes. It proposes
a framework that allows one to formalize the behaviour of such a network. It
generalizes extreme cases that have been studied before where (a) either nodes
only know their contact frequency with each other or (b) they have a perfect
knowledge of who meets who and when. This paper then gives an example of how
this framework can be used; it shows how one can find a packet forwarding
algorithm optimized to meet the 'delay/bandwidth consumption' trade-off:
packets are duplicated so as to (statistically) guarantee a given delay or
delivery probability, but not too much so as to reduce the bandwidth, energy,
and memory consumption.Comment: 9 page
Routing in a many-to-one communication scenario in a realistic VDTN
In this paper, we evaluate and compare the performance of different routing protocols in a many-to-one communication within a Vehicular Delay Tolerant Network (VDTN). Seven groups with three stationary sensor nodes sense the temperature, humidity and wind speed and send these data to a stationary destination node that collect them for statistical and data analysis purposes. Vehicles moving in Tirana city roads in Albania during the opportunistic contacts will exchange the sensed data to destination node. The simulations are conducted with the Opportunistic Network Environment (ONE) simulator. For the simulations we considered two different scenarios where the distance of the source nodes from the destination is short and long. For both scenarios the effect of node density, ttl and node movement model is evaluated. The performance is analyzed using delivery probability, overhead ratio, average latency, average number of hops and average buffer time metrics. The simulation results show that the increase of node density increases the delivery probability for all protocols and both scenarios, and better results are achieved when shortest-path map-based movement model is used. The increase of ttl slightly affects the performance of all protocols. By increasing the distance between source nodes and destination node, delivery probability is decreased almost 10% for all protocols, the overhead for sprayandwait protocol does not change, but for other protocols is slightly increased and the average number of hops and average latency is increased.Peer ReviewedPostprint (author's final draft
Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network
An interrelation between a topological design of network and efficient
algorithm on it is important for its applications to communication or
transportation systems. In this paper, we propose a design principle for a
reliable routing in a store-carry-forward manner based on autonomously moving
message-ferries on a special structure of fractal-like network, which consists
of a self-similar tiling of equilateral triangles. As a collective adaptive
mechanism, the routing is realized by a relay of cyclic message-ferries
corresponded to a concatenation of the triangle cycles and using some good
properties of the network structure. It is recoverable for local accidents in
the hierarchical network structure. Moreover, the design principle is
theoretically supported with a calculation method for the optimal service rates
of message-ferries derived from a tandem queue model for stochastic processes
on a chain of edges in the network. These results obtained from a combination
of complex network science and computer science will be useful for developing a
resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of
Collective Adaptive Systems) at The 9th IEEE International Conference on
SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201
- …