TABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS

vii TABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. ABSTRACT LIST OF TABLES xiv LIST OF FIGURES xv LIST OF SYMBOLS AND ABBREVIATIONS 1 2 iii ...
Author: Hester Dalton
6 downloads 1 Views 34KB Size
vii

TABLE OF CONTENTS

CHAPTER NO.

TITLE

PAGE NO.

ABSTRACT LIST OF TABLES

xiv

LIST OF FIGURES

xv

LIST OF SYMBOLS AND ABBREVIATIONS

1

2

iii

xviii

GSM EVOLUTION STRATEGY BEYOND 3G - LONG TERM EVOLUTION

1

1.1

INTRODUCTION

1

1.2

LONG TERM EVOLUTION (LTE)

2

1.2.1 LTE Requirements

3

1.2.2 LTE Network Architecture

3

1.3

LITERATURE SURVEY

6

1.4

OVERVIEW OF THE RESEARCH WORK

18

1.5

ORGANIZATION OF THE THESIS

22

A NOVEL ROUTING FRAMEWORK FOR SUPPORTING DISTRIBUTED SERVICES IN LTE SYSTEMS

26

2.1

INTRODUCTION

26

2.2

AODV (AD HOC ON-DEMAND DISTANCE

2.3

VECTOR)

28

2.2.1 ROUTE DISCOVERY PHASE

29

2.2.2 ROUTE MAINTENANCE PHASE

30

DRCF ROUTING ALGORITHM

30

2.3.1 GENERATE RREQ ALGORITHM

32

.

viii CHAPTER NO.

TITLE

2.4

NETWORK MODEL

37

2.4.1 Performance Metrics

39

3

PAGE NO.

2.4.1.1 Route Discovery Time

39

2.4.1.2 Delay

39

2.4.1.3 Total Route Errors Sent

39

2.4.1.4 Total Packets Dropped

39

2.5

RESULTS

40

2.6

CONCLUSION

43

CONGESTION AWARE ROUTING

44

3.1

INTRODUCTION

44

3.1.1 Area Monitoring

44

3.2

OVERVIEW OF THE PROBLEM

45

3.3

OBJECTIVE

45

3.4

AODV (AD-HOC ON DEMAND DISTANCE

3.5

3.6

VECTOR ROUTING)

46

3.4.1 Routing Tables

48

3.4.2 Control Messages

49

3.4.2.1 Routing Request

49

3.4.2.2 Routing Reply

49

3.4.2.3 Hello Messages

50

DYNAMIC SOURCE ROUTING

50

3.5.1 Description

50

3.5.2 Route Discovery

50

3.5.3 Route Maintenance

51

PERFORMANCE COMPARISON OF TWO ONDEMAND

3.7

DSR

ROUTING PROTOCOLS FOR AD HOC

NETWORKS

52

EXISTING DESIGN OF AODV

53

.

ix CHAPTER NO.

3.8

3.9

3.10

3.11

TITLE

PAGE NO.

3.7.1 AODV

53

3.7.2 AODV_Agent

54

3.7.3 Hdr_AODV

54

3.7.4 Request Buffer

54

3.7.5 AODV_RTable

54

3.7.6 AODVConstants

54

IMPORTANT ROUTINES

54

3.8.1 Sending RREQ

54

3.8.2 Receiving RREQ

55

3.8.3 Forwarding RREQ

56

3.8.4 Forwarding RREP

56

3.8.5 Receiving RREP

57

3.8.6 HELLO Handling

58

3.8.7 Forwarding Packets

58

3.8.8 Sending Triggered RREP

59

3.8.9 Receiving Triggered RREP

59

ARCHITECTURAL DESIGN

59

3.9.1 Car Protocol Design

60

3.9.2 Conzone Routing

61

IMPLEMENTATION

62

3.10.1 TCL File Topography

62

3.10.2 Start and Stop Time

63

3.10.3 Traffic Generation

63

3.10.4 Nam File and Trace File

64

CONZONE IMPLEMENTATION

64

3.11.1 Routing Table

64

3.11.1.1 Aodv_rtable.cc

65

3.11.1.2 Code Snippet

65

.

x CHAPTER NO.

TITLE

PAGE NO.

3.11.1.3 Aodv_rtable.h

66

3.11.1.4 Function prototype

66

3.11.1.5 Aodv.cc

66

3.11.1.6 TCL File

66

3.11.2 Adding Priority to Routing Table

67

3.11.3 Neighbor Table

67

3.11.4 Conzone Formation

68

3.11.5 Conzone Routing

71

3.11.5.1 Routine for Updating the Route

71

3.11.5.2 Routine for Checking the Category of A Node to Belong to Conzone 71 3.11.5.3 Routine for Updation of Node Entries

72

3.11.5.4 Routine for Initializing the AODV Table Structure 3.12

72

RESULTS AND ANALYSIS

73

3.12.1 Simulation Snapshots

73

TRACE FILE

80

3.13.1 Packet Delivery Ratio

80

3.13.2 Packet Delay

80

3.13.3 Routing Overhead

80

3.14

TABLES

81

3.15

ANALYSIS USING X-GRAPH

84

3.15.1 Packet Delivery Ratio

84

3.15.2 Delay

85

3.13

3.16

PERFORMANCE OF AODV AND CAR DURING CONGESTION

85

3.16.1 Eliminating Low Priority Traffic in Conzone 87

.

xi CHAPTER NO.

TITLE

PAGE NO.

3.16.2 Eliminating Low Priority Traffic Around the Critical Area

3.17

4

88

3.16.3 Dynamic CAR

88

CONCLUSION

89

REAL-TIME PERFORMANCE INVESTIGATION OF DISTRIBUTED ROUTING ALGORITHM WITH

5

CONTROLLED FLOODING IN AN LTE SWITCH

90

4.1

INTRODUCTION

90

4.2

SYSTEM ARCHITECTURE

94

4.2.1 Microengine 0:0

94

4.2.2 Microengine 0:1

95

4.2.3 Microengine 0:2

100

4.2.4 Microengine 0:3

102

4.3

RESULTS AND DISCUSSION

104

4.4

CONCLUSION

106

OPTIMAL PACKET SCHEDULING SCHEME BASED ON SCHEME UTILITY FUNCTION FOR

6

LTE SYSTEMS

107

5.1

INTRODUCTION

107

5.2

SCHEME UTILITY FUNCTION BASED SCHEDULING SCHEME

110

5.3

SIMULATION MODEL

116

5.4

RESULTS AND DISCUSSIONS

117

5.5

CONCLUSION

123

HETEROGENEOUS DELAY-POWER RESOURCE ALLOCATION IN UPLINK LTE

124

6.1

124

INTRODUCTION

.

xii CHAPTER NO. 6.2

TITLE

PAGE NO.

QUEUEING THEORY BASICS

125

6.2.1

126

SYSTEM MODEL

127

6.3.1 Power Criteria

129

6.3.2 Packet Delay Criteria

132

PROBLEM FORMULATION

133

6.4.1 Objective Functions and Variables

134

6.4.2 Constraints

135

6.5

RESOURCE ALLOCATION SOLUTION

136

6.6

NSGA II ADAPTED FOR THE PROBLEM

6.3

6.4

CONSIDERED 6.7

141

OVERVIEW OF ARTIFICIAL BEE COLONY ALGORITHM 6.7.1 Multi-Objective Artificial Bee Colony

149 150

6.7.1.1 External Archives Set Updating Strategy

150

6.7.1.2 Modifications Of ABC Algorithm Based On Multi-Objective Problem

151

6.7.1.2.1 Employed Bees Phase

151

6.7.1.2.2 Probability Calculation 152 6.7.1.2.3 Select Mechanism

152

6.7.1.3 Local Search Strategy Based On Progressive Optimality Algorithm 153 6.7.1.4 Framework of MOABC

6.8 7

154

6.7.2 Simulation and Numerical Results

154

CONCLUSION

160

CONCLUSION

161

7.1

161

INTRODUCTION

xiii CHAPTER NO.

TITLE

PAGE NO.

7.2

CONTRIBUTIONS

162

7.3

SCOPE FOR FUTURE WORK

164

REFERENCES

165

LIST OF PUBLICATIONS

173

.

xiv

LIST OF TABLES

TABLE NO.

TITLE

PAGE NO.

2.1

Base Station Parameters

38

2.2

Mobile Station Parameters

38

3.1

Routing Request (RREQ)

49

3.2

Routing Reply (RREP)

49

3.3

Comparison of AODV / CAR

87

4.1

Initialization

93

4.2

Parameters

98

6.1

Summary of Notations

129

6.2

Least

Square Approximate Model Parameters

for BLER = 10%

131

.

xv

LIST OF FIGURES

FIGURE NO.

TITLE

PAGE NO.

2.1

Route Discovery Time

40

2.2

Delay

41

2.3

Total Route Errors Sent

42

2.4

Total Packets Dropped

42

3.1

AODV Protocol Messaging

48

3.2

AODV Design

53

3.3

Architectural Design

60

3.4

Flow Diagram of the CONZONE Formation

61

3.5

Scenario

74

3.6

Beacons

74

3.7

Node 4 Sending Packets to Node 11

75

3.8

Node 11 Sending Packets to Node 18

75

3.9

Node 2 Sending Packets to Node 11

76

3.10

Node 18 Sending Packets to Node 27

76

3.11

Node 27 Sending Packets to Node 35

77

3.12

Node 3 Sending to Node 12 and Node 12 Sending to Node 19

77

3.13

Node 19 Sending Packets to Node 27

78

3.14

Node 27 Sending Packets to Sink 35

78

3.15

CONZONE - 1

79

3.16

CONZONE - 2

79

3.17

Trace File

81

3.18

Routing Table

81

3.19

Neighbour Table

82

.

xvi FIGURE NO.

TITLE

PAGE NO.

3.20

Comparison of Routing Table

83

3.21

Packet Delivery Ratio of CAR and AODV

84

3.22

Average End-to-End Delay of CAR and AODV

85

3.23

AODV During Congestion

86

3.24

CAR During Congestion

86

3.25

CAR+

88

4.1

Reception Of Packets In Network Processor

4.2

96

Reception of RREP Packet Using Processor

99

4.3

Proxy Setup

101

4.4

Proxy Continued

102

4.5

Transmission of Packets in Network Processor

4.6

Microengine Utilization in DRCF Algorithm

4.7

105

Microengine Utilization in TORA Algorithm

4.8

103

105

Microengine Utilization in DSR Algorithm

105

5.1

Levels of QoS Provisioning

108

5.2

Average Traffic Received

117

5.3

Packet End-to-End Delay

118

5.4

Voice Jitter In Seconds

119

5.5

MOS Value For Voice Environment

120

5.6

Average Video Traffic Received In

5.7

Bytes/Sec

121

Packet End-To-End Delay

121

.

xvii FIGURE NO.

TITLE

PAGE NO.

5.8

Overall LTE System Throughput

122

6.1

Queue Model

125

6.2

System Schematic

128

6.3

Flowchart Of Binary NSGA II Described As Adapted In This Study

6.4

The Procedure Of Local Search Based Progressive Optimally Algorithm

6.5

PDF Of Packet Delay

PDF Of Packet Delay

157 Two Users In The

Cell 6.7

158

Average Packet Delay For Different Values of MTBS

6.8

155

One User In The

Cell 6.6

144

158

Average Power Delay For Different Values Of MIBS

159

6.9

Measure Of Complexity Vs. MTBS

159

6.10

Average Power And Packet Delay Vs No Of Users

160

.

xviii

LIST OF SYMBOLS AND ABBREVIATIONS

DSR

-

Dynamic Source Routing

TORA

-

Temporally-Ordered Routing Algorithm

AODV

-

Ad Hoc On-Demand Vector Routing

DRCF

-

Distributed Routing Algorithm With Controlled Flooding

WSN

-

Wireless Sensor Network

CAR

-

Congestion Aware Routing

RREQ

-

Route Request

RREP

-

Route Reply

RERR

-

Route Error

NAM

-

Network Animator

PDUs

-

Protocol Data Units

MTU

-

Maximum Transmission Unit

MDRR

-

Modified Deficit Round Robin

ToS

-

Type Of Service

MTMR

-

Multiple Transmit Multiple Receive

VOIP

-

Voice Over IP

POA

-

Progressive Optimality Algorithm

.

xix

-

i-th Eigen value

-

n x n Covariance Matrix

-

Weights for the Linear Transformation

-

Poisson Distribution

-

Population

-

Random Real

Pc

-

Crossover Probability

rnki

-

Non-Domination Rank

ki

-

No of user, user index

H

-

No of heater bits for packets

SCU

-

Service data unit size

qi,j

-

Queue size (No of available bits in queue) of user i

i

ui

p0 n m

and flow j L

-

Buffer Length

Ti,j

-

Service Data Rate Of User i And Flow j

ai,j

-

Arrival Packet Rate Of User i Into Buffer Of Flow j

N

-

Sub-Frame Index

J

-

Traffic Type (Flow) Index

Mm

-

No Of RBS, RB Index

Nk

-

Number Of Users

-

CINR Assigned To Each Round Which Varies As A Function Of Distance X.

A

-

Maximum Transmission Unit

h

-

Number Of Packets

.

xx di

-

Deficit Counter Value

C

-

Normalized System Capacity

Rij

-

Maximum Throughput

Sij

-

Average Data Rate

r0

-

Transmission Range

Ploss

-

Probability Of Receiving Erroneous Packets

-

Expected Number Of Arrivals

Ti

-

Transport Block Size

i

-

Effective SNR

m i

-

Instantaneous SNR Of Resource Block

qi, j

-

Average Queue Size

ai , j

-

Average Arrival Rate

d i, j

-

Average Packet Delay

W

-

Sliding Window Length

sim

-

Binary Indicator