Papers
Topics
Authors
Recent
Search
2000 character limit reached

An efficient genetic algorithm for large-scale transmit power control of dense industrial wireless networks

Published 12 Aug 2017 in cs.NE and cs.NI | (1709.04320v1)

Abstract: The industrial wireless local area network (IWLAN) is increasingly dense, not only due to the penetration of wireless applications into factories and warehouses, but also because of the rising need of redundancy for robust wireless coverage. Instead of powering on all the nodes with the maximal transmit power, it becomes an unavoidable challenge to control the transmit power of all wireless nodes on a large scale, in order to reduce interference and adapt coverage to the latest shadowing effects in the environment. Therefore, this paper proposes an efficient genetic algorithm (GA) to solve this transmit power control (TPC) problem for dense IWLANs, named GATPC. Effective population initialization, crossover and mutation, parallel computing as well as dedicated speedup measures are introduced to tailor GATPC for the large-scale optimization that is intrinsically involved in this problem. In contrast to most coverage-related optimization algorithms which cannot deal with the prevalent shadowing effects in harsh industrial indoor environments, an empirical one-slope path loss model considering three-dimensional obstacle shadowing effects is used in GATPC, in order to enable accurate yet simple coverage prediction. Experimental validation and numerical experiments in real industrial cases show the promising performance of GATPC in terms of scalability to a hyper-large scale, up to 37-times speedup in resolution runtime, and solution quality to achieve adaptive coverage and to minimize interference.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.