72,248 research outputs found
The Quest for a Killer App for Opportunistic and Delay Tolerant Networks (Invited Paper)
Delay Tolerant Networking (DTN) has attracted a lot of attention from the research community in recent years. Much work have been done regarding network architectures and algorithms for routing and forwarding in such networks. At the same time as many show enthusiasm for this exciting new research area there are also many sceptics, who question the usefulness of research in this area. In the past, we have seen other research areas become over-hyped and later die out as there was no killer app for them that made them useful in real scenarios. Real deployments of DTN systems have so far mostly been limited to a few niche scenarios, where they have been done as proof-of-concept ļ¬eld tests in research projects. In this paper, we embark upon a quest to ļ¬nd out what characterizes a potential killer applications for DTNs.
Are there applications and situations where DTNs provide
services that could not be achieved otherwise, or have potential to do it in a better way than other techniques? Further, we highlight some of the main challenges that needs to be solved to realize these applications and make DTNs a part of the mainstream network landscape
Service Platform for Converged Interactive Broadband Broadcast and Cellular Wireless
A converged broadcast and telecommunication
service platform is presented that is able to create, deliver, and
manage interactive, multimedia content and services for consumption
on three different terminal types. The motivations of
service providers for designing converged interactive multimedia
services, which are crafted for their individual requirements, are
investigated. The overall design of the system is presented with
particular emphasis placed on the operational features of each
of the sub-systems, the flows of media and metadata through the
sub-systems and the formats and protocols required for inter-communication
between them. The key features of tools required for
creating converged interactive multimedia content for a range of
different end-user terminal types are examined. Finally possible
enhancements to this system are discussed. This study is of particular
interest to those organizations currently conducting trials
and commercial launches of DVB-H services because it provides
them with an insight of the various additional functions required
in the service provisioning platforms to provide fully interactive
services to a range of different mobile terminal types
Cellular Automata Applications in Shortest Path Problem
Cellular Automata (CAs) are computational models that can capture the
essential features of systems in which global behavior emerges from the
collective effect of simple components, which interact locally. During the last
decades, CAs have been extensively used for mimicking several natural processes
and systems to find fine solutions in many complex hard to solve computer
science and engineering problems. Among them, the shortest path problem is one
of the most pronounced and highly studied problems that scientists have been
trying to tackle by using a plethora of methodologies and even unconventional
approaches. The proposed solutions are mainly justified by their ability to
provide a correct solution in a better time complexity than the renowned
Dijkstra's algorithm. Although there is a wide variety regarding the
algorithmic complexity of the algorithms suggested, spanning from simplistic
graph traversal algorithms to complex nature inspired and bio-mimicking
algorithms, in this chapter we focus on the successful application of CAs to
shortest path problem as found in various diverse disciplines like computer
science, swarm robotics, computer networks, decision science and biomimicking
of biological organisms' behaviour. In particular, an introduction on the first
CA-based algorithm tackling the shortest path problem is provided in detail.
After the short presentation of shortest path algorithms arriving from the
relaxization of the CAs principles, the application of the CA-based shortest
path definition on the coordinated motion of swarm robotics is also introduced.
Moreover, the CA based application of shortest path finding in computer
networks is presented in brief. Finally, a CA that models exactly the behavior
of a biological organism, namely the Physarum's behavior, finding the
minimum-length path between two points in a labyrinth is given.Comment: To appear in the book: Adamatzky, A (Ed.) Shortest path solvers. From
software to wetware. Springer, 201
Positive Alexander Duality for Pursuit and Evasion
Considered is a class of pursuit-evasion games, in which an evader tries to
avoid detection. Such games can be formulated as the search for sections to the
complement of a coverage region in a Euclidean space over a timeline. Prior
results give homological criteria for evasion in the general case that are not
necessary and sufficient. This paper provides a necessary and sufficient
positive cohomological criterion for evasion in a general case. The principal
tools are (1) a refinement of the Cech cohomology of a coverage region with a
positive cone encoding spatial orientation, (2) a refinement of the Borel-Moore
homology of the coverage gaps with a positive cone encoding time orientation,
and (3) a positive variant of Alexander Duality. Positive cohomology decomposes
as the global sections of a sheaf of local positive cohomology over the time
axis; we show how this decomposition makes positive cohomology computable as a
linear program.Comment: 19 pages, 6 figures; improvements made throughout: e.g. positive
(co)homology generalized to arbitrary degrees; Positive Alexander Duality
generalized from homological degrees 0,1; Morse and smoothness conditions
generalized; illustrations of positive homology added. minor corrections in
proofs, notation, organization, and language made throughout. variant of
Borel-Moore homology now use
- ā¦