Key Features:

- No of Pages: 55

- No of Chapters: 05

Buy Now

Introduction:

Abstract

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that addresses simultaneously three aspects: security, scalability and adaptability to changing network conditions. Our communication protocol, Castor, occupies a unique point in the design space: It does not use any control messages except simple packet acknowledgements, and each node makes routing decisions locally and independently without exchanging any routing state with other nodes. Its novel design makes Castor resilient to a wide range of attacks and allows the protocol to scale to large network sizes and to remain efficient under high mobility. We compare Castor against four representative protocols from the literature. Our protocol achieves up to two times higher packet delivery rates, particularly in large and highly volatile networks, while incurring no or only limited additional overhead. At the same time, Castor is able to survive more severe attacks and recovers from them faster.

Table of Content

TITLE PAGE

CERTIFICATION

DEDICATION

ACKNOWLEDGEMENT

ABSTRACT

TABLE OF CONTENTS



CHAPTER ONE

INTRODUCTION

1.1 BACKGROUND OF THE STUDY

1.2 STATE OF THE PROBLEM

1.3 PURPOSE OF THE STUDY

1.4 AIMS AND OBJECTIVES

1.5 SCOPE OF STUDY

1.6 LIMITATIONS OF STUDY

1.7 ASSUMPTIONS

1.8 DEFINITION OF TERMS



CHAPTER TWO

LITERATURE REVIEW

CHAPTER THREE

3.1 DESCRIPTION AND ANALYSIS OF EXISTING SYSTEM

3.2 FACT FINDING METHOD USED

3.3 ORGANIZATION STRUCTURE

3.4 OBJECTIVES OF EXISTING SYSTEM

3.5 INPUT, PROCESS AND OUTPUT ANALYSIS

3.6 INFORMATION FLOW DIAGRAMS

3.7 PROBLEMS OF THE EXISTING SYSTEM

3.8 JUSTIFICATION OF THE NEW SYSTEM



CHAPTER FOUR

4.1 DESIGN OF THE NEW SYSTEM

4.2 INPUT SPECIFICATION AND DESIGN

4.3 OUTPUT SPECIFICATION AND DESIGN

4.4 FILE DESIGN

4.5 PROCEDURE CHART

4.6 SYSTEM FLOW CHART

4.6.1 SYSTEM REQUIREMENTS

4.7 IMPLEMENTATION

4.7.1 PROGRAM DESIGN

4.7.2 PROGRAM FLOWCHART

4.7.3 PSEUDO CODE

4.7.4 SOURCE PROGRAM: TEST RUN



CHAPTER FIVE

5.0 DOCUMENTATION

5.1 RECOMMENDATION

5.2 CONCLUSION

BIBLIOGRAPHY

Introduction

The introduction of this research is only available in the paid version.