文摘
英文文摘
论文说明：Acronyms
声明
Chapter 1 Introduction
1.1 Why do we need a new PLC
1.2 Perimeter of our study and its context: REMPLI
1.3 Research problems
1.4 Our Approaches, contributions and the organization of the thesis
Chapter 2 Electric Power Distribution and Consumption
2.1 Power electric distribution system
2.2 Main applications for the control and handling of electric power distribution
2.3 System requirements
2.3.1 Functions
2.3.2 Timing constraints
2.4 Communication networks
2.5 Conclusion
Chapter 3 Power Line Communications - Technologies and Problems: Requirements for their Control and Open Issues
3.1 Historical development of data communication over power line
3.2 Regulatory of PLC communication
3.3 Present PLC technologies and applications
3.3.1 Physical layer
3.3.2 MAC layer
3.3.3 Current PLC applications
3.4 Standards
3.5 Identification of problems in PLC technology for utility applications
3.6 REMPLI project and architecture
3.7 Conclusions
Chapter4 Routing Algorithms
4.1 Routing protocols
4.1.1 DLC 1000
4.1.2 SFN
4.2 Performance metrics
4.3 Theoretical analysis
4.3.1 Average polling cycle duration of DLC 1000
4.3.2 Theoretical analysis of SFN
4.4 Numerical comparison between SFN and DLC 1000
4.4.1 Five channel models
4.4.2 Average duration of a polling cycle
4.4.3 Bandwidth consumed for routing signaling
4.4.4 Routing overhead
4.4.5 Conclusion
4.5 Simulation and performance evaluation
4.5.1 Physical Layer Emulator
4.5.2 Simulation parameters for routing protocols
4.5.3 Simulation results of DLC 1000
4.6 Improvement of SFN protocol
4.6.1 Methods to decide the number of repeater levels
4.6.2 Simulation results
4.6.3 Conclusion
Chapter5 REMPLI Performance Evaluation
5.1 Logical channel
5.2 Network layer services
5.3 Performance Evaluation
5.3.1 Performance in an autonomous PLC network
5.3.2 End to end performance in REMPLI PLC network
5.4 Conclusion
Chapter6Dispatcher
6.1 Traffic classes and priority levels in network layer
6.2 System constraints
6.3 Aperiodic traffic
6.4 Periodic traffic
6.4.1 Execution time Ci
6.4.2 Static Periodic Polling
6.4.3 Dynamic polling approach
6.5 Simulation results
6.5.1 Static schedule vs dynamic schedule
6.5.2 DP vs DP with deadline relaxation
6.6 Towards dispatcher implementation
6.7 Conclusion
Chapter7 Random Access Protocol Based on SFN
7.1 Characteristic of random access protocol based on SFN
7.2 Random access protocols design
7.2.1 Time slot partition in random access logical channel
7.2.2 ARQ mechanism
7.2.3 Repeating in SFN protocol
7.2.4 Protocol description
7.3 Simulation results
7.3.1 Repeater level
7.3.2 Two protocols comparison
7.4 Conclusion
Chapter8 Conclusions and Future Works
Bibliography
Acknowledgments
Appendix
攻读学位期间发表的论文
