New algorithm for distributed frequency assignments in IEEE 802.11

The continuous growth of IEEE 802.11 wireless local area networks (WLAN) brings the benefit of a high speed wireless access to packet networks, such as Internet. But it also entails the successive appearance of new unresolved problems. One of these problems consists in the degradation of the performance observed by the users when there is a great number of radio networks coexisting in the same area. In densely populated zones it is not strange to find WLANs of different nature (private, public, etc.) sharing a scarce resource as it is the radio spectrum. This problem can be mitigated with an appropriate channel allocation. In this paper we present an algorithm for the frequency assignment problem (FAP) in IEEE 802.11, based on classical graph colouring but adding the objective of reducing interferences among overlapping cells, and thus improving the global throughput performance. An accurate evaluation of interferences is obtained not only measuring power levels, but also being aware of traffic load. Important performance improvements have been observed on a real scenario

Integrated channel assignment and power control in cellular networks using hill-climbing approach.

Recent year\u27s incredible success and exponential growth of wireless cellular network services have necessitated careful management of radio resources to improve system capacity. Mainly due to the insufficiency of radio spectrum, reuse or sharing of radio frequency must be considered. In practical, the sharing of radio frequency introduces interferences among users, which in turn limit the system capacity. On the other hand, control of transmitter power can suppress co-channel interference, adjacent channel interference and limits the consumption of power. Thus channel assignment and power control are two effective means in wireless cellular networks and they are highly correlated to each other. Most of the existing papers have focused on optimizing the assignment of channels assuming that the allocation of transmitter power is known and fixed or vice-versa. In this thesis, we study the integration of channel assignment and power control simultaneously to increase the network capacity and throughput. We have proposed a new channel assignment approach, called HCA-PC (Hybrid Channel Assignment + Power Control) using dynamic reuse distance concept to optimize the channel assignment. We develop a Hill-climbing approach with random restart strategy, using an efficient problem representation and a fitness function that optimizes channel assignment and power control in the cellular network. (Abstract shortened by UMI.) Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2003 .V52. Source: Masters Abstracts International, Volume: 44-03, page: 1392. Thesis (M.Sc.)--University of Windsor (Canada), 2005

Optimal association of mobile users to multi-access edge computing resources

Multi-access edge computing (MEC) plays a key role in fifth-generation (5G) networks in bringing cloud functionalities at the edge of the radio access network, in close proximity to mobile users. In this paper we focus on mobile-edge computation offloading, a way to transfer heavy demanding, and latency-critical applications from mobile handsets to close-located MEC servers, in order to reduce latency and/or energy consumption. Our goal is to provide an optimal strategy to associate mobile users to access points (AP) and MEC hosts, while contextually optimizing the allocation of radio and computational resources to each user, with the objective of minimizing the overall user transmit power under latency constraints incorporating both communication and computation times. The overall problem is a mixed-binary problem. To overcome its inherent computational complexity, we propose two alternative strategies: i) a method based on successive convex approximation (SCA) techniques, proven to converge to local optimal solutions; ii) an approach hinging on matching theory, based on formulating the assignment problem as a matching game