2,662 research outputs found
Flexible TDMA/WDMA passive optical network: energy efficient next-generation optical access solution
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
Joint and Competitive Caching Designs in Large-Scale Multi-Tier Wireless Multicasting Networks
Caching and multicasting are two promising methods to support massive content
delivery in multi-tier wireless networks. In this paper, we consider a random
caching and multicasting scheme with caching distributions in the two tiers as
design parameters, to achieve efficient content dissemination in a two-tier
large-scale cache-enabled wireless multicasting network. First, we derive
tractable expressions for the successful transmission probabilities in the
general region as well as the high SNR and high user density region,
respectively, utilizing tools from stochastic geometry. Then, for the case of a
single operator for the two tiers, we formulate the optimal joint caching
design problem to maximize the successful transmission probability in the
asymptotic region, which is nonconvex in general. By using the block successive
approximate optimization technique, we develop an iterative algorithm, which is
shown to converge to a stationary point. Next, for the case of two different
operators, one for each tier, we formulate the competitive caching design game
where each tier maximizes its successful transmission probability in the
asymptotic region. We show that the game has a unique Nash equilibrium (NE) and
develop an iterative algorithm, which is shown to converge to the NE under a
mild condition. Finally, by numerical simulations, we show that the proposed
designs achieve significant gains over existing schemes.Comment: 30 pages, 6 pages, submitted to IEEE GLOBECOM 2017 and IEEE Trans.
Commo
- …