3,388 research outputs found
A Review of the Energy Efficient and Secure Multicast Routing Protocols for Mobile Ad hoc Networks
This paper presents a thorough survey of recent work addressing energy
efficient multicast routing protocols and secure multicast routing protocols in
Mobile Ad hoc Networks (MANETs). There are so many issues and solutions which
witness the need of energy management and security in ad hoc wireless networks.
The objective of a multicast routing protocol for MANETs is to support the
propagation of data from a sender to all the receivers of a multicast group
while trying to use the available bandwidth efficiently in the presence of
frequent topology changes. Multicasting can improve the efficiency of the
wireless link when sending multiple copies of messages by exploiting the
inherent broadcast property of wireless transmission. Secure multicast routing
plays a significant role in MANETs. However, offering energy efficient and
secure multicast routing is a difficult and challenging task. In recent years,
various multicast routing protocols have been proposed for MANETs. These
protocols have distinguishing features and use different mechanismsComment: 15 page
Towards a Queueing-Based Framework for In-Network Function Computation
We seek to develop network algorithms for function computation in sensor
networks. Specifically, we want dynamic joint aggregation, routing, and
scheduling algorithms that have analytically provable performance benefits due
to in-network computation as compared to simple data forwarding. To this end,
we define a class of functions, the Fully-Multiplexible functions, which
includes several functions such as parity, MAX, and k th -order statistics. For
such functions we exactly characterize the maximum achievable refresh rate of
the network in terms of an underlying graph primitive, the min-mincut. In
acyclic wireline networks, we show that the maximum refresh rate is achievable
by a simple algorithm that is dynamic, distributed, and only dependent on local
information. In the case of wireless networks, we provide a MaxWeight-like
algorithm with dynamic flow splitting, which is shown to be throughput-optimal
Content Distribution by Multiple Multicast Trees and Intersession Cooperation: Optimal Algorithms and Approximations
In traditional massive content distribution with multiple sessions, the
sessions form separate overlay networks and operate independently, where some
sessions may suffer from insufficient resources even though other sessions have
excessive resources. To cope with this problem, we consider the universal
swarming approach, which allows multiple sessions to cooperate with each other.
We formulate the problem of finding the optimal resource allocation to maximize
the sum of the session utilities and present a subgradient algorithm which
converges to the optimal solution in the time-average sense. The solution
involves an NP-hard subproblem of finding a minimum-cost Steiner tree. We cope
with this difficulty by using a column generation method, which reduces the
number of Steiner-tree computations. Furthermore, we allow the use of
approximate solutions to the Steiner-tree subproblem. We show that the
approximation ratio to the overall problem turns out to be no less than the
reciprocal of the approximation ratio to the Steiner-tree subproblem.
Simulation results demonstrate that universal swarming improves the performance
of resource-poor sessions with negligible impact to resource-rich sessions. The
proposed approach and algorithm are expected to be useful for
infrastructure-based content distribution networks with long-lasting sessions
and relatively stable network environment
Networking - A Statistical Physics Perspective
Efficient networking has a substantial economic and societal impact in a
broad range of areas including transportation systems, wired and wireless
communications and a range of Internet applications. As transportation and
communication networks become increasingly more complex, the ever increasing
demand for congestion control, higher traffic capacity, quality of service,
robustness and reduced energy consumption require new tools and methods to meet
these conflicting requirements. The new methodology should serve for gaining
better understanding of the properties of networking systems at the macroscopic
level, as well as for the development of new principled optimization and
management algorithms at the microscopic level. Methods of statistical physics
seem best placed to provide new approaches as they have been developed
specifically to deal with non-linear large scale systems. This paper aims at
presenting an overview of tools and methods that have been developed within the
statistical physics community and that can be readily applied to address the
emerging problems in networking. These include diffusion processes, methods
from disordered systems and polymer physics, probabilistic inference, which
have direct relevance to network routing, file and frequency distribution, the
exploration of network structures and vulnerability, and various other
practical networking applications.Comment: (Review article) 71 pages, 14 figure
- …