scholarly journals Maximization of time-to-first-failure for multicasting in wireless networks: optimal solution

Author(s):  
A.K. Das ◽  
M. El-Sharkawi ◽  
R.J. Marks ◽  
P. Arabshahi ◽  
A. Gray
Energies ◽  
2019 ◽  
Vol 12 (22) ◽  
pp. 4300 ◽  
Author(s):  
Hoon Lee ◽  
Han Seung Jang ◽  
Bang Chul Jung

Achieving energy efficiency (EE) fairness among heterogeneous mobile devices will become a crucial issue in future wireless networks. This paper investigates a deep learning (DL) approach for improving EE fairness performance in interference channels (IFCs) where multiple transmitters simultaneously convey data to their corresponding receivers. To improve the EE fairness, we aim to maximize the minimum EE among multiple transmitter–receiver pairs by optimizing the transmit power levels. Due to fractional and max-min formulation, the problem is shown to be non-convex, and, thus, it is difficult to identify the optimal power control policy. Although the EE fairness maximization problem has been recently addressed by the successive convex approximation framework, it requires intensive computations for iterative optimizations and suffers from the sub-optimality incurred by the non-convexity. To tackle these issues, we propose a deep neural network (DNN) where the procedure of optimal solution calculation, which is unknown in general, is accurately approximated by well-designed DNNs. The target of the DNN is to yield an efficient power control solution for the EE fairness maximization problem by accepting the channel state information as an input feature. An unsupervised training algorithm is presented where the DNN learns an effective mapping from the channel to the EE maximizing power control strategy by itself. Numerical results demonstrate that the proposed DNN-based power control method performs better than a conventional optimization approach with much-reduced execution time. This work opens a new possibility of using DL as an alternative optimization tool for the EE maximizing design of the next-generation wireless networks.


2018 ◽  
Vol 28 (04) ◽  
pp. 341-363
Author(s):  
Rom Aschner ◽  
Paz Carmi ◽  
Yael Stein

We study unique coverage problems with rectangle and half-strip regions, motivated by wireless networks in the context of coverage using directional antennae without interference. Given a set [Formula: see text] of points (clients) and a set [Formula: see text] of directional antennae in the plane, the goal is to assign a direction to each directional antenna in [Formula: see text], such that the number of clients in [Formula: see text] that are uniquely covered by the directional antennae is maximized. A client is covered uniquely if it is covered by exactly one antenna. We consider two types of rectangular regions representing half-strip directional antennae: unbounded half-strips and half-strips bounded by a range [Formula: see text] (i.e., [Formula: see text]-sided rectangular regions and rectangular regions). The directional antennae can be directed up or down. We present two polynomial time algorithms: an optimal solution for the problem with the [Formula: see text]-sided rectangular regions, and a constant factor approximation for the rectangular regions.


2010 ◽  
Vol 6 (1) ◽  
pp. 65-83
Author(s):  
Feilong Tang ◽  
Ilsun You ◽  
Minyi Guo ◽  
Song Guo ◽  
Long Zheng

Mobile and wireless networks are the integrant infrastructure of mobile and pervasive computing that aims at providing transparent and preferred information and services for people anytime anywhere. In such environments, end-to-end network bandwidth is crucial to improve user's transparent experience when providing on-demand services such as mobile video playing. As a result, powerful computing power is required for networked nodes, especially for routers. General-purpose processors cannot meet such requirements due to their limited processing ability, and poor programmability and scalability. Intel's network processor IXP is specially designed for fast packet processing to achieve a broad bandwidth. IXP provides a large number of registers to reduce the number of memory accesses. Registers in an IXP are physically partitioned as two banks so that two source operands in an instruction have to come from the two banks respectively, which makes the IXP register allocation tricky and different from conventional ones. In this paper, we investigate an approach for efficiently generating balanced bipartite graph and register allocation algorithms for the dual-bank register allocation in IXPs. The paper presents a graph uniform 2-way partition algorithm (FPT), which provides an optimal solution to the graph partition, and a heuristic algorithm for generating balanced bipartite graph. Finally, we design a framework for IXP register allocation. Experimental results demonstrate the framework and the algorithms are efficient in register allocation for IXP network processors.


Sign in / Sign up

Export Citation Format

Share Document