119,652 research outputs found
Dynamic Network State Learning Model for Mobility Based WMSN Routing Protocol
The rising demand of wireless multimedia sensor networks (WMSNs) has motivated academia-industries to develop energy efficient, Quality of Service (QoS) and delay sensitive communication systems to meet major real-world demands like multimedia broadcast, security and surveillance systems, intelligent transport system, etc. Typically, energy efficiency, QoS and delay sensitive transmission are the inevitable requirements of WMSNs. Majority of the existing approaches either use physical layer or system level schemes that individually can’t assure optimal transmission decision to meet the demand. The cumulative efficiency of physical layer power control, adaptive modulation and coding and system level dynamic power management (DPM) are found significant to achieve these demands. With this motivation, in this paper a unified model is derived using enhanced reinforcement learning and stochastic optimization method. Exploiting physical as well as system level network state information, our proposed dynamic network state learning model (NSLM) applies stochastic optimization to learn network state-activity that derives an optimal DPM policy and PHY switching scheduling. NSLM applies known as well as unknown network state variables to derive transmission and PHY switching policy, where it considers DPM as constrained Markov decision process (MDP) problem. Here,the use of Hidden Markov Model and Lagrangian relaxation has made NSLM convergence swift that assures delay-sensitive, QoS enriched, and bandwidth and energy efficient transmission for WMSN under uncertain network conditions. Our proposed NSLM DPM model has outperformed traditional Q-Learning based DPM in terms of buffer cost, holding cost, overflow, energy consumption and bandwidth utilization
Fog-supported delay-constrained energy-saving live migration of VMs over multiPath TCP/IP 5G connections
The incoming era of the fifth-generation fog computing-supported radio access networks (shortly, 5G FOGRANs) aims at exploiting computing/networking resource virtualization, in order to augment the limited resources of wireless devices through the seamless live migration of virtual machines (VMs) toward nearby fog data centers. For this purpose, the bandwidths of the multiple wireless network interface cards of the wireless devices may be aggregated under the control of the emerging MultiPathTCP (MPTCP) protocol. However, due to the fading and mobility-induced phenomena, the energy consumptions of the current state-of-the-art VM migration techniques may still offset their expected benefits. Motivated by these considerations, in this paper, we analytically characterize and implement in software and numerically test the optimal minimum-energy settable-complexity bandwidth manager (SCBM) for the live migration of VMs over 5G FOGRAN MPTCP connections. The key features of the proposed SCBM are that: 1) its implementation complexity is settable on-line on the basis of the target energy consumption versus implementation complexity tradeoff; 2) it minimizes the network energy consumed by the wireless device for sustaining the migration process under hard constraints on the tolerated migration times and downtimes; and 3) by leveraging a suitably designed adaptive mechanism, it is capable to quickly react to (possibly, unpredicted) fading and/or mobility-induced abrupt changes of the wireless environment without requiring forecasting. The actual effectiveness of the proposed SCBM is supported by extensive energy versus delay performance comparisons that cover: 1) a number of heterogeneous 3G/4G/WiFi FOGRAN scenarios; 2) synthetic and real-world workloads; and, 3) MPTCP and wireless connections
Algorithmic Aspects of Energy-Delay Tradeoff in Multihop Cooperative Wireless Networks
We consider the problem of energy-efficient transmission in delay constrained
cooperative multihop wireless networks. The combinatorial nature of cooperative
multihop schemes makes it difficult to design efficient polynomial-time
algorithms for deciding which nodes should take part in cooperation, and when
and with what power they should transmit. In this work, we tackle this problem
in memoryless networks with or without delay constraints, i.e., quality of
service guarantee. We analyze a wide class of setups, including unicast,
multicast, and broadcast, and two main cooperative approaches, namely: energy
accumulation (EA) and mutual information accumulation (MIA). We provide a
generalized algorithmic formulation of the problem that encompasses all those
cases. We investigate the similarities and differences of EA and MIA in our
generalized formulation. We prove that the broadcast and multicast problems
are, in general, not only NP hard but also o(log(n)) inapproximable. We break
these problems into three parts: ordering, scheduling and power control, and
propose a novel algorithm that, given an ordering, can optimally solve the
joint power allocation and scheduling problems simultaneously in polynomial
time. We further show empirically that this algorithm used in conjunction with
an ordering derived heuristically using the Dijkstra's shortest path algorithm
yields near-optimal performance in typical settings. For the unicast case, we
prove that although the problem remains NP hard with MIA, it can be solved
optimally and in polynomial time when EA is used. We further use our algorithm
to study numerically the trade-off between delay and power-efficiency in
cooperative broadcast and compare the performance of EA vs MIA as well as the
performance of our cooperative algorithm with a smart noncooperative algorithm
in a broadcast setting.Comment: 12 pages, 9 figure
Self-Sustaining Caching Stations: Towards Cost-Effective 5G-Enabled Vehicular Networks
In this article, we investigate the cost-effective 5G-enabled vehicular
networks to support emerging vehicular applications, such as autonomous
driving, in-car infotainment and location-based road services. To this end,
self-sustaining caching stations (SCSs) are introduced to liberate on-road base
stations from the constraints of power lines and wired backhauls. Specifically,
the cache-enabled SCSs are powered by renewable energy and connected to core
networks through wireless backhauls, which can realize "drop-and-play"
deployment, green operation, and low-latency services. With SCSs integrated, a
5G-enabled heterogeneous vehicular networking architecture is further proposed,
where SCSs are deployed along roadside for traffic offloading while
conventional macro base stations (MBSs) provide ubiquitous coverage to
vehicles. In addition, a hierarchical network management framework is designed
to deal with high dynamics in vehicular traffic and renewable energy, where
content caching, energy management and traffic steering are jointly
investigated to optimize the service capability of SCSs with balanced power
demand and supply in different time scales. Case studies are provided to
illustrate SCS deployment and operation designs, and some open research issues
are also discussed.Comment: IEEE Communications Magazine, to appea
- …