文摘
英文文摘
论文说明:LIST OF FIGURES、LIST OF TABLES
CHAPTER 1 INTRODUCTION
1.1 Wireless Sensor Networks
1.2 Topology Control
1.3 Contributions and prior publications
1.4 Outline
CHAPTER 2 BACKGROUND ON GRAPHS AND NETWORK MODEL
2.1 Background on Graphs
2.1.1 k-vertex connectivity
2.1.2 k-edge connectivity
2.2 Network model
CHAPTER 3 RELATED WORKS ON TOPOLOGY CONTROL IN WIRELESS SENSOR NETWORKS
3.1 Yaop,k algorithm
3.2 CBTC (α)algorithm
3.3 LMST algorithm
3.4 K-UPVCS algorithm
3.5 TRT algorithm
3.6 FLSSk algorithm
3.7 LTRT algorithm
CHAPTER 4 SFL:simple Fault-tolerant Local Topology Control Algorithm
4.1 LTRT:Local Tree-Based Reliable
4.1.1 LTRT algorithm
4.2 SFL:Simple Fault-Tolerant Local Topology Control Algorithm
4.2.1 SFL algorithm
4.3 Complexity analysis
4.4 k-edge connectivity
4.5 Maintenance phase
4.6 Performance evaluation
4.6.1 Simulation environment
4.6.2 Simulation results and analysis
4.7 Conclusion and future work
CHAPTER 5 Comparison of Max-flow algorithm for k-vertex problem
5.1 Related Works and Backgrounds for Max-flow algorithms
5.1.1 For the k-vertex connectivity algorithms
5.1.2 The max-flow/rain-cut algorithms
5.2 Description of Max-flow/Min-cut algorithms
5.2.1 Dinic algorithm
5.2.2 Goldbereg-style algorithm
5.2.3 Pseudo-flow algorithm
5.3 Applications of Max-Flow/Min-cut
5.3.1 Edge-Disjoint Paths
5.3.2 Vertex Capacities and Vertex-Disjoint Paths
5.3.3 Maximum Matching in Bipartite Graphs
5.3.4 Binary Assignment Problems
5.3.5 Other applications
5.4 Adaptation of max-flow algorithms to solve k-vertex connectivity problem
5.4.1 Adaptation of max-flow algorithms
5.5 Experimental Tests on k-vertex connectivity
5.5.1 Implementation
5.5.2 Computing Environment
5.5.3 Problem Classes
5.5.4 Testing Methodology
5.5.5 Results and Analysis
5.6 Conclusion and future work
Conclusions
Contributions
Open Questions and future work
REFERENCES
ACKNOWLEDGEMENTS