DESIGN AND IMPLEMENTATION OF XTC: A PRACTICAL TOPOLOGY CONTROL ALGORITHM FOR AD-HOC NETWORKS (CASE STUDY OF MTN NIGERIA)

ABSTRACT
The XTC ad-hoc network topology control algorithm shows three main advantages over previously proposed algorithms. First, it is extremely simple. Second, it does not assume the network graph to be a Unit Disk Graph; XTC proves correct also on general weighted network graphs. Third, the algorithm does not require availability of node position information. Instead, XTC operates with a general notion of order over the neighbors’ link qualities. In the special case of the network graph being a Unit Disk Graph, the resulting topology proves to have bounded degree, to be a planar graph, and—on average-case graphs—to be a good spanner. Employed on Euclidean and Unit Disk Graphs.
TABLE OF CONTENTS TITLE PAGE DEDICATION  ACKNOWLEDGEMENT  ABSTRACT TABLE OF CONTENT
CHAPTER ONE  INTRODUCTION  STATEMENT OF THE PROBLEM  PURPOSE OF THE STUDY AIM AND OBJECTIVES  SCOPE DELIMITATION
CHAPTER TWO LITERATURE REVIEW
CHAPTER THREE DESCRIPTION AND ANALYSIS OF THE EXISTING SYSTEM  FACT FINDING METHOD USED  OBJECTIVE OF THE EXISTING SYSTEM  INPUT, PROCESS, OUTPUT ANALYSIS PROBLEM OF THE EXISTING SYSTEM  JUSTIFICATION OF THE NEW EXISTING SYSTEM
CHAPTER FOUR  DESIGN OF THE NEW SYSTEM  OUTPUT SPECIFICATION AND DESIGN INPUT SPECIFICATION  AND DESIGN FILE DESIGN PROCEDURE CHART EXPECTED BENEFITS OF THE NEW SYSTEM  IMPLEMENTATION 
CHAPTER FIVE DOCUMENTATION CONSTRAINT (LIMITATION)
CHAPTER SIX RECOMMENDATION AND CONCLUSION REFERENCE APPENDIX PROGRAM CODING