声明
ABSTRACT
摘要
TABLE OF CONTENTS
LIST OF FIGURES
LIST OF TABLES
CHAPTER 1 INTRODUCTION
1.1 Motivation
1.2 Objectives
1.3 Outlines of the Thesis
CHAPTER 2 BACKGROUND AND RELATED WORK
2.1 Little Background
2.1.1 Data Round
2.1.2 Data Aggregation
2.1.3 Data Gathering Problem
2.1.4 Data Gathering Tree
2.1.5 Data Gathering Schedule
2.1.6 Network Lifetime
2.2 Brief Introduction on Related work
2.3 Related work
2.4 Summary
CHAPTER 3 INTER-CLUSTERING SQUARE UNIT MULTI-HOP BASED ON ROUTING ALGORITHM
3.1 General overview of Inter-Clustering Square Unit Multi-hop based on Routing Algorithm “ICSUMRA”
3.2 What is the Objective of ICSUMRA Algorithm?
3.3 Overview of the System
3.4 Data Transmission process in ICSUMRA
3.5 Network Model analysis
3.6 Computing the optimum number of Clusters
3.7 Computing the value of communication Cost Function between Relay nodes
3.8 ICSUMRA algorithm Description
3.9 Summary
CHAPTER 4 EXPERIMENT RESULTS
4.1 Overview of the Experimental Results
4.2 Simulation Results of ICSUMRA AND LEACH algorithms with reference to Energy Consumption Value and the number of Rounds
4.3 Simulation Results of ICSUMRA and LEACH algorithm based on Lifetime aspect and the number of Rounds
4.4 Discussion
4.4.1 Discussion of our research work based on the number of Round with the lifetime
4.4.2 Discussion of our research work based on the number of rounds with the energy consumption
4.5 Summary
CONCLUSION AND FUTURE WORK
CONCLUSION
FURTURE WORK
REFERENCES
ACKNOWLEDGEMENTS
COORDINATES OF NODES
CODES
湖南大学;