CONTENTS

Page No.
ABSTRACT

LIST OF FIGURES

ii

CHAPTER 1 INTRODUCTION

1.1.

DESCRIPTION

1.2.

ORGANIZATION OF THESIS

1.3

RESOURCES REQUIRED

CHAPTER 2 MOBILE AD-HOC NETWORKS

2.1.

INTRODUCTION

2.2.

CHARACTERISTICS

2.3.

APPLICATIONS OF MANETs

2.3.1. Application areas

ADVANTAGES

2.4.

CHAPTER 3 ROUTE REQUEST

10

3.1.

EXISTING SYSTEM

10

3.2

AODV PROTOCOL

10

3.3

Route Discovery in AODV

13

3.4

Dynamic Probabilistic Route Discovery

16

3.5.

Disadvantages

16

CHAPTER 4 REBROADCAST PROTOCOL

17

4.1

INTRODUCTION

17

4.2

ADVANTAGE

17

4.3

IMPLEMENTATION OF THE PROTOCOL

17

4.3.1

Route discovery by RREQ

18

4.3.2

Failure detection by Error

18

4.3.3

Calculating rebroadcasting delay

18

4.3.4

Route recovery by RREQ and RREP

18

4.4

ALGORITHM

19

4.5

FLOW CHART

21

4.6

UML DIAGRAMS

22

4.6.1

23

4.7

Use case

PROBABILISTIC REBROADCAST PROTOCOL IMPLEMENTATION 25

4.7.1

Calculation of Uncovered Neighbors Set and Rebroadcast Delay

4.7.2

Calculation of Neighbor Knowledge and Rebroadcast Probability 26

CHAPTER 5 EXPERIMENTS AND RESULTS

25

27

5.1

SIMULATION ENVIRONMENT

27

5.2

NETWORK SIMULATOR(NS-2)

27

5.3

NS PROGRAMMING STRUCTURE

27

5.3.1

Event scheduler

28

5.3.2

packets

28

5.3.3

turn on tracing

29

5.3.4

Create network topology (physical layer)

29

5.3.5

transport connection (transport layer)

30

5.3.6

generate traffic(application layer)

30

5.4

TCL PROGRAMMING

30

5.4.1

Initialization

31

5.4.2

Defining nodes, links, queues and topology

32

5.4.3

Agents and applications

34

5.4.3.1

FTP over TCP

35

5.4.3.2

UDP

36

5.4.3.3

Constant Bit Rate(CBR)

37

5.4.3.4

Scheduling Events

5.4.4

Network Animator(NAM)

38
38

5.4.5

5.5

5.6

5.7

Tracing Objects

40

5.4.5.1

40

Structure of Trace files

CODE IMPLEMENTATION

41

5.5.1

Assigning Configuration

41

5.5.2

Giving Movable feature to the nodes

42

5.5.3

Finishing the task

42

5.5.4

Declaration of variables

43

5.5.5

Conditions for getting efficiency in X-graph

43

RESULTS AND COMPARISIONS

44

5.6.1

Performance with Varied Number of Nodes

44

5.6.2

Performance with Varied Random Packet Rate

45

STIMULATION RESULTS

46

CHAPTER 6 CONCLUSION

47

6.1. CONCLUSION

47

6.2. FUTURE SCOPE

47

REFERENCES
PUBLICATION DETAILS
APPENDIX
PERSONAL DETAILS

48