首页--工业技术论文--无线电电子学、电信技术论文--无线通信论文

Multi-Objective Node Placement Problem in Wireless Network

ABSTRACT第6页
中文摘要第7-20页
CHAPTER 1: INTRODUCTION第20-30页
    1.1 Background第20页
    1.2 Wireless Communication Network第20-22页
    1.3 Node Placement in Wireless Communication Network第22-23页
    1.4 Requirements for Node Placement Problem第23-26页
        1.4.1 Coverage第23-24页
        1.4.2 Network Connectivity第24页
        1.4.3 Cost第24页
        1.4.4 Network Lifetime第24页
        1.4.5 Differentiated Detection Levels第24页
        1.4.6 Energy Efficiency第24-25页
            1.4.7 Overlap第25页
        1.4.8 Number of Nodes第25页
        1.4.9 Bandwidth第25页
        1.4.10 Handover第25-26页
    1.5 Evolutionary Multiobjective Optimization Algorithms第26-29页
    1.6 Thesis Structure第29-30页
CHAPTER 2: NOTATIONS AND PRELIMINARIES第30-45页
    2.1 Introduction第30页
    2.2 Optimization Problems Classification第30-31页
    2.3 What is Optimization?第31-32页
    2.4 Genetic Algorithms第32-35页
        2.4.1 What is Genetic Algorithms?第32-33页
        2.4.2 Why Genetic Algorithm?第33-34页
        2.4.3 Genetic Algorithms Overview第34页
        2.4.4 The Process of Genetic Optimization第34-35页
    2.5 Multi-objective Optimization第35-37页
        2.5.1 Multi-objective Optimization Problem (MOP)第35页
        2.5.2 Multi-objective Definitions第35-37页
    2.6 Multi-objective Evolutionary Algorithms第37-45页
        2.6.1 MOEA Background第37-38页
        2.6.2 MOEA Approaches第38-40页
        2.6.3 NSGAII第40页
        2.6.4 Hyper Volume第40-41页
        2.6.5 MOEA/D第41-42页
        2.6.6 Constraint Handling第42-45页
CHAPTER 3: LITERATURE REVIEW第45-56页
    3.1 Placement Problem in Wireless Network第45页
    3.2 Best Planning for Node Placement Problem第45-47页
    3.3 The Antenna Placement Problem in Wireless Network第47-48页
    3.4 Selection Access Point (AP) in Network Infrastructure第48-49页
    3.5 The Base Station Placement Problem in Wireless Network第49-50页
    3.6 Transmitters Placement Problem第50-51页
    3.7 The Best Planning for the Cellular Networks第51-54页
    3.8 Summary第54-56页
CHAPTER 4: PROBLEM FORMULATION MODE第56-64页
    4.1 Introduction第56-58页
    4.2 Problem Description第58-59页
        4.2.1 Nodes Associated with Communication Devices第58-59页
        4.2.2 Nodes Associated with Candidate Sites第59页
    4.3 Objectives第59-62页
        4.3.1 Maximizing the Communication Coverage第60页
        4.3.2 Minimizing Cost第60-61页
        4.3.3 Minimizing the Maximum Bandwidth第61页
        4.3.4 Overlap第61-62页
    4.4 Constraints第62-63页
        4.4.1 General Constraints第62-63页
    4.5 Summary第63-64页
CHAPTER 5: APPLYING CMOEA/D-DE-ATP ALGORITHM IN NODESPLACEMENT PROBLEM第64-73页
    5.1 Introduction第64页
    5.2 Representation第64-65页
    5.3 CMOEA/D-DE-ATP an Overview第65-67页
    5.4 Poulation Initialization第67-69页
    5.5 Selection Operator第69-70页
    5.6 Crossover第70-71页
    5.7 Mutation第71-72页
    5.8 Summary第72-73页
CHAPTER 6: COMPUTATIONAL RESULTS第73-82页
    6.1 Computational Results of Applied CMOEA/D-DE-ATP第73-80页
    6.2 Comparision between Applied CMOEA/D-DE-ATP and MOGA第80-82页
CONCLUSION第82-84页
ACKNOWLEDGEMENTS第84-86页
REFERENCES第86-93页
LIST OF PUBICATIONS第93页

论文共93页,点击 下载论文
上一篇:嵌入式系统WCET分析及缓存锁定技术研究
下一篇:水淹下荷花叶柄伸长的激素调控机制及荷花再生体系构建