An agent based approach to site selection for wireless networks

Authors:
Steve Hurley;Roger M. Whitaker
Affiliations:
Cardiff University, Queen's Buildings, The Parade, Cardiff, CF24 3XF, U.K.;Cardiff University, Queen's Buildings, The Parade, Cardiff, CF24 3XF, U.K.
Venue:
Proceedings of the 2002 ACM symposium on Applied computing
Year:
2002

Citing 5
Cited 7

Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Genetic algorithms as prototyping tools for multi-agent systems: application to the antenna parameter setting problem

IATA '98 Proceedings of the second international workshop on Intelligent agents for telecommunication applications
Mobile communications

Mobile communications
Optimum positioning of base stations for cellular radio networks

Wireless Networks
Self-Localisation in the ‘Senario’ Autonomous Wheelchair

Journal of Intelligent and Robotic Systems

A comparison of randomized and evolutionary approaches for optimizing base station site selection

Proceedings of the 2004 ACM symposium on Applied computing
The infrastructure efficiency of cellular wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Going the last mile: a spatial decision support system for wireless broadband communications

Decision Support Systems
Communicating neurons: A connectionist spiking neuron implementation of stochastic diffusion search

Neurocomputing
The infrastructure efficiency of cellular wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
An investigation into the merger of stochastic diffusion search and particle swarm optimisation

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Probabilistic stochastic diffusion search

ANTS'12 Proceedings of the 8th international conference on Swarm Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The location of transmission infrastructure for wireless communication networks is an important engineering problem involving competing objectives. A minimal selection of locations (or sites) are required subject to providing adequate area coverage for users. In this paper we present a general model for this problem, related to circle packing and set covering. We show that the pattern matching algorithm known as stochastic diffusion search can be applied to identify suitable solutions even for large problem instances.