2,734 research outputs found
Energy-Efficient Multi-View Video Transmission with View Synthesis-Enabled Multicast
Multi-view videos (MVVs) provide immersive viewing experience, at the cost of
heavy load to wireless networks. Except for further improving viewing
experience, view synthesis can create multicast opportunities for efficient
transmission of MVVs in multiuser wireless networks, which has not been
recognized in existing literature. In this paper, we would like to exploit view
synthesis-enabled multicast opportunities for energy-efficient MVV transmission
in a multiuser wireless network. Specifically, we first establish a
mathematical model to characterize the impact of view synthesis on multicast
opportunities and energy consumption. Then, we consider the optimization of
view selection, transmission time and power allocation to minimize the weighted
sum energy consumption for view transmission and synthesis, which is a
challenging mixed discrete-continuous optimization problem. We propose an
algorithm to obtain an optimal solution with reduced computational complexity
by exploiting optimality properties. To further reduce computational
complexity, we also propose two low-complexity algorithms to obtain two
suboptimal solutions, based on continuous relaxation and Difference of Convex
(DC) programming, respectively. Finally, numerical results demonstrate the
advantage of the proposed solutions.Comment: 22 pages, 6 figures, to be published in GLOBECOM 201
Multi-View Video Packet Scheduling
In multiview applications, multiple cameras acquire the same scene from
different viewpoints and generally produce correlated video streams. This
results in large amounts of highly redundant data. In order to save resources,
it is critical to handle properly this correlation during encoding and
transmission of the multiview data. In this work, we propose a
correlation-aware packet scheduling algorithm for multi-camera networks, where
information from all cameras are transmitted over a bottleneck channel to
clients that reconstruct the multiview images. The scheduling algorithm relies
on a new rate-distortion model that captures the importance of each view in the
scene reconstruction. We propose a problem formulation for the optimization of
the packet scheduling policies, which adapt to variations in the scene content.
Then, we design a low complexity scheduling algorithm based on a trellis search
that selects the subset of candidate packets to be transmitted towards
effective multiview reconstruction at clients. Extensive simulation results
confirm the gain of our scheduling algorithm when inter-source correlation
information is used in the scheduler, compared to scheduling policies with no
information about the correlation or non-adaptive scheduling policies. We
finally show that increasing the optimization horizon in the packet scheduling
algorithm improves the transmission performance, especially in scenarios where
the level of correlation rapidly varies with time
A Distributed Routing Algorithm for Internet-wide Geocast
Geocast is the concept of sending data packets to nodes in a specified
geographical area instead of nodes with a specific address. To route geocast
messages to their destination we need a geographic routing algorithm that can
route packets efficiently to the devices inside the destination area. Our goal
is to design an algorithm that can deliver shortest path tree like forwarding
while relying purely on distributed data without central knowledge. In this
paper, we present two algorithms for geographic routing. One based purely on
distance vector data, and one more complicated algorithm based on path data. In
our evaluation, we show that our purely distance vector based algorithm can
come close to shortest path tree performance when a small number of routers are
present in the destination area. We also show that our path based algorithm can
come close to the performance of a shortest path tree in almost all geocast
situations
- …