AccessNets. Third International Conference on Access Networks, AccessNets 2008, Las Vegas, NV, USA, October 15-17, 2008. Revised Papers

Research Article

Placement of Base Stations in Broadband Power Line Communications Access Networks by Means of Multi-criteria Optimization

Download
430 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-04648-3_13,
        author={Abdelfatteh Haidine and Ralf Lehnert},
        title={Placement of Base Stations in Broadband Power Line Communications Access Networks by Means of Multi-criteria Optimization},
        proceedings={AccessNets. Third International Conference on Access Networks, AccessNets 2008, Las Vegas, NV, USA, October 15-17, 2008. Revised Papers},
        proceedings_a={ACCESSNETS},
        year={2012},
        month={5},
        keywords={network costs uplink delay Broadband Power-Line Communications (B-PLC) access network planning generalized base station placement multi-criteria optimization},
        doi={10.1007/978-3-642-04648-3_13}
    }
    
  • Abdelfatteh Haidine
    Ralf Lehnert
    Year: 2012
    Placement of Base Stations in Broadband Power Line Communications Access Networks by Means of Multi-criteria Optimization
    ACCESSNETS
    Springer
    DOI: 10.1007/978-3-642-04648-3_13
Abdelfatteh Haidine1,*, Ralf Lehnert1
  • 1: Dresden University of Technology
*Contact email: haidine@ifn.et.tu-dresden.de

Abstract

Broadband Power Line Communications (B-PLC) technology is an alternative for broadband access networks, allowing bit rates up to currently 200Mbps. This technique uses the wiring of the low-voltage grid in order to offer to the users the telecommunications services, such as Internet, VoIP, VoD, etc. The B-PLC design process is sub-divided into two parts: the (GBSP) problem and the (P-CAP). This paper focuses on GBSP that is modeled as multi-criteria combinatorial optimization problem. Based on our published mathematical modeling, this paper supplies more numerical experiments for the evaluation of Multi-Objective Evolutionary Algorithms (MOEAs) in solving GBSP. Their performance is compared with the single-objective optimization.