In this paper we study a transmission power tune problem with densely deployed 802.11 Wireless Local Area Networks (WLANs). While previous papers emphasize on tuning transmission power with either PHY or MAC layer separately, optimally setting each Access Point's (AP's) transmission power of a densely deployed 802.11 network considering its dual effects on both layers remains an open problem. In this work, we design a measure by evaluating impacts of transmission power on network performance on both PHY and MAC layers. We show that such an optimization problem is intractable and then we investigate and develop an analytical framework to allow simple yet efficient solutions. Through simulations and numerical results, we observe clear benefits of the dual-effect model compared to solutions optimizing solely on a single layer; therefore, we conclude that tuning transmission power from a dual layer (PHY-MAC) point of view is essential and necessary for dense WLANs. We further form a game theoretical framework and investigate above power-tune problem in a strategic network. We show that with decentralized and strategic users, the Nash Equilibrium (N.E.) of the corresponding game is in-efficient and thereafter we propose a punishment based mechanism to enforce users to adopt the social optimal strategy profile under both perfect and imperfect sensing environments.
In terms of computation, for standard integer optimization (or combinatorial optimization) problems researchers typically seek relaxation to convert the problem into a continuous problem in the hope it can be solved by standard LP or convex algorithms; in @cite_8 @cite_7 @cite_11 , efficient search algorithms have been proposed to tackle finite space optimization problems.
@cite_11 @cite_7 @cite_8
2021033250 1806207712 2952853970 2192675411
This paper addresses the problem of finding the minimum number of vehicles required to visit a set of nodes subject to time window and capacity constraints. The fleet is homogeneous and is located at a common depot. Each node requires the same type of service. An exact method is introduced based on branch and cut. In the computations, ever increasing lower bounds on the optimal solution are obtained by solving a series of relaxed problems that incorporate newly found valid inequalities. Feasible solutions or upper bounds are obtained with the help of greedy randomized adaptive search procedure (GRASP). A wide variety of cuts is introduced to tighten the linear programming (LP) relaxation of the original mixed-integer program. To find violated cuts, it is necessary to solve a separation problem. A substantial portion of the paper is aimed at describing the heuristics developed for this purpose. A new approach for obtaining feasible solutions from the LP relaxation is also discussed. Numerical results for standard 50- and 100-node benchmark problems are reported. Recent work has shown that the classical framework of solving optimization problems by obtaining a fractional solution to a linear program (LP) and rounding it to an integer solution can be extended to the online setting using primal-dual techniques. The success of this new framework for online optimization can be gauged from the fact that it has led to progress in several longstanding open questions. However, to the best of our knowledge, this framework has previously been applied to LPs containing only packing or only covering constraints, or minor variants of these. We extend this framework in a fundamental way by demonstrating that it can be used to solve mixed packing and covering LPs online, where packing constraints are given offline and covering constraints are received online. The objective is to minimize the maximum multiplicative factor by which any packing constraint is violated, while satisfying the covering constraints. Our results represent the first algorithm that obtains a polylogarithmic competitive ratio for solving mixed LPs online. We then consider two canonical examples of mixed LPs: unrelated machine scheduling with startup costs, and capacity constrained facility location. We use ideas generated from our result for mixed packing and covering to obtain polylogarithmic-competitive algorithms for these problems. We also give lower bounds to show that the competitive ratios of our algorithms are nearly tight. We consider the task of obtaining the maximum a posteriori estimate of discrete pairwise random fields with arbitrary unary potentials and semimetric pairwise potentials. For this problem, we propose an accurate hierarchical move making strategy where each move is computed efficiently by solving an st-MINCUT problem. Unlike previous move making approaches, e.g. the widely used a-expansion algorithm, our method obtains the guarantees of the standard linear programming (LP) relaxation for the important special case of metric labeling. Unlike the existing LP relaxation solvers, e.g. interior-point algorithms or tree-reweighted message passing, our method is significantly faster as it uses only the efficient st-MINCUT algorithm in its design. Using both synthetic and real data experiments, we show that our technique outperforms several commonly used algorithms. Maximum a-posteriori (MAP) inference is an important task for many applications. Although the standard formulation gives rise to a hard combinatorial optimization problem, several effective approximations have been proposed and studied in recent years. We focus on linear programming (LP) relaxations, which have achieved state-of-the-art performance in many applications. However, optimization of the resulting program is in general challenging due to non-smoothness and complex non-separable constraints. Therefore, in this work we study the benefits of augmenting the objective function of the relaxation with strong convexity. Specifically, we introduce strong convexity by adding a quadratic term to the LP relaxation objective. We provide theoretical guarantees for the resulting programs, bounding the difference between their optimal value and the original optimum. Further, we propose suitable optimization algorithms and analyze their convergence.