GSAR: GREEDY STAND-ALONE POSITION-BASED …etd.uum.edu.my/4482/7/s92833_abstract.pdf · Abstract...

GSAR GREEDY STAND-ALONE POSITION-BASED ROUTINGPROTOCOL TO AVOID HOLE PROBLEM OCCURRENCE IN

MOBILE AD HOC NETWORKS

MAHMOUD ALI AL-SHUGRAN

DOCTOR OF PHILOSOPHYUNIVERSITY UTARA MALAYSIA

2014

Permission to Use

In presenting this thesis in fulfilment of the requirements for a postgraduate degree

from Universiti Utara Malaysia I agree that the Universiti Library may make it freely

available for inspection I further agree that permission for the copying of this thesis

in any manner in whole or in part for scholarly purpose may be granted by my su-

pervisor(s) or in their absence by the Dean of Awang Had Salleh Graduate School of

Arts and Sciences It is understood that any copying or publication or use of this thesis

or parts thereof for financial gain shall not be allowed without my written permission

It is also understood that due recognition shall be given to me and to Universiti Utara

Malaysia for any scholarly use which may be made of any material from my thesis

Requests for permission to copy or to make other use of materials in this thesis in

whole or in part should be addressed to

Dean of Awang Had Salleh Graduate School of Arts and Sciences

UUM College of Arts and Sciences

Universiti Utara Malaysia

06010 UUM Sintok

i

Abstrak

Proses penentuan laluan di dalam Rangkaian Mudah Alih Ad Hoc (MANET) ada-lah sukar disebabkan kekerapan perubahan topologi serta keterbatasan sumber Olehitu mereka bentuk protokol laluan yang boleh dipercayai dinamik serta mampu me-menuhi kehendak MANET amatlah diperlukan Strategi Penghantaran Rakus (GFS)merupakan strategi yang paling banyak digunakan dalam protokol laluan berasaskanposisi Algoritma GFS direka bentuk sebagai protokol berprestasi tinggi yang meng-gunakan kiraan hop untuk mendapatkan laluan paling dekat Walau bagaimanapunGFS tidak mengambil kira kehendak MANET yang lain Oleh itu ianya tidak men-cukupi untuk membuat pengiraan laluan yang boleh dipercayai Kajian ini bertuju-an mempertingkatkan GFS sedia ada kepada protokol laluan yang dinamik kendiriboleh bertindak balas dengan pantas terhadap kehendak MANET serta berupaya me-nyediakan laluan yang boleh dipercayai dalam kalangan nod yang berhubung Un-tuk mencapai matlamat ini dua mekanisme telah diusulkan sebagai penambahbaikanterhadap GFS yang sedia ada iaitu Mekanisme Pengemaskinian Mata Arah Dinamik(DBUM) dan Mekanisme Keandalan Anggaran Dinamik dan Reaktif dengan MetrikTerpilih (DRESM) Fungsi utama algoritma DBUM adalah untuk menyediakan noddengan maklumat baru tentang status nod di sekitarnya Fungsi algoritma DRESMpula adalah untuk membuat keputusan penghantaran berdasarkan pelbagai metrik la-luan Kedua-dua mekanisme ini telah disepadukan di dalam GFS konvensional bagimembentuk protokol Laluan Kendiri Rakus (GSAR) Penilaian ke atas GSAR telahdilakukan menggunakan simulator rangkaian Ns2 berdasarkan set metrik prestasi se-nario dan topologi yang telah ditetapkan Hasil penilaian menunjukkan bahawa GSARdapat mengetepikan keperluan menggunakan mod pemulihan dan mencapai pening-katan menyeluruh pada prestasi rangkaian berbanding dalam GFS Dalam pelbagaikeadaan pergerakan nod yang diuji GSAR dapat mengurangkan masalah lubang per-angkap kira-kira 87 dan 79 berbanding Protokol Laluan Tanpa Keadaan PerimeterRakus dan Protokol Laluan Oportunistik Berasaskan Posisi Kesimpulannya proto-kol GSAR merupakan alternatif munasabah kepada protokol laluan berasaskan posisidalam MANET

Kata Kunci Rangkaian Mudah Alih Ad-hoc Strategi Penghantaran Rakus ProtokolLaluan Berasaskan Posisi Protokol Laluan Kendiri Rakus

ii

Abstract

The routing process in a Mobile Ad Hoc Network (MANET) poses critical challengesbecause of its features such as frequent topology changes and resource limitationsHence designing a reliable and dynamic routing protocol that satisfies MANET re-quirements is highly demanded The Greedy Forwarding Strategy (GFS) has beenthe most used strategy in position-based routing protocols The GFS algorithm wasdesigned as a high-performance protocol that adopts hop count in soliciting shortestpath However the GFS does not consider MANET needs and is therefore insuffi-cient in computing reliable routes Hence this study aims to improve the existing GFSby transforming it into a dynamic stand-alone routing protocol that responds swiftlyto MANET needs and provides reliable routes among the communicating nodes Toachieve the aim two mechanisms were proposed as extensions to the current GFSnamely the Dynamic Beaconing Updates Mechanism (DBUM) and the Dynamic andReactive Reliability Estimation with Selective Metrics Mechanism (DRESM) TheDBUM algorithm is mainly responsible for providing a node with up-to-date statusinformation about its neighbours The DRESM algorithm is responsible for makingforwarding decisions based on multiple routing metrics Both mechanisms were inte-grated into the conventional GFS to form Greedy Stand-Alone Routing (GSAR) pro-tocol Evaluations of GSAR were performed using network simulator Ns2 based upona defined set of performance metrics scenarios and topologies The results demon-strate that GSAR eliminates recovery mode mechanism in GFS and consequentlyimprove overall network performance Under various mobility conditions GSARavoids hole problem by about 87 and 79 over Greedy Perimeter Stateless Rout-ing and Position-based Opportunistic Routing Protocol respectively Therefore theGSAR protocol is a reasonable alternative to position-based unicast routing protocolin MANET

Keywords Mobile Ad hoc Networks Greedy Forwarding Strategy Position-basedRouting Protocols Greedy Stand-alone Routing Protocol

iii

Declaration

Some of the works presented in this thesis have been published or submitted as listed

below

[1] Mahmoud Al-Shugran Osman Ghazali Suhaidi Hassan Omar M Almomani and

Kashif Nisar Adaptive and Fuzzy Management for Greedy Routing in Mobile Ad-

hoc Networks in the Proceeding of 3ed International Conference on Network Appli-

cations Protocols and Services (NetApps2012) Sintok Malaysia 19-20 Sep 2012

pp 36-41


Kashif Nisar Comparative Performance Evalution of Unicast Routing Protocol in

Mobile Ad-hoc Networks in the Proceeding of 3ed International Conference on Net-

work Applications Protocols and Services (NetApps2012) Sintok Malaysia 19-20

Sep 2012 pp 42-47

[3] Mahmoud Al-Shugran Osman Ghazali and Suhaidi Hassan A General Frame-

work for Greedy Routing in Mobile Ad-hoc Networks in the Proceeding of Inter-

national Conference on Advanced Computer Science Applications and Technologies

(ACSAT2012) Kuala Lumpur Malaysia Indexed by the IEEE Xplore 26-28 Nov

2012

[4] Mahmoud Al-Shugran Osman Ghazali and Suhaidi Hassan Performance Com-

parison of Position-Based Routing Protocol in the Context of Enhancing Greedy Fail-

ure in the Proceeding of International Conference on Advanced Computer Science

Applications and Technologies (ACSAT2012) Kuala Lumpur Malaysia Indexed by

the IEEE Xplore 26-28 Nov 2012

[5] Mahmoud Al-shugran Osman Ghazali Suhaidi Hassan Kashif Nisar and A Suki

M Arif A Qualitative Comparison Evaluation of the Greedy Forwarding Strategies

in Mobile Ad Hoc Network Journal of Network and Computer Applications vol 36

issue 2 pp 887ndash897 Impact factor 1467 Publisher Elsevier Mar 2013

iv

Acknowledgements

Alhamdullilah and thanks Allah (swt) for His blessings to successfully complete this

PhD thesis I would like to express my deepest gratitude to my supervisors Assoc

Prof Dr Osman Ghazali and Prof Dr Suhaidi Hassan Their guidance support and

kindness made this work possible I feel honoured to have had the opportunity to work

with both of them Osman was always encouraging Although he was far away on a

post-doctorate programme whenever I had problems he was always ready to help me

resolve them I would also like to express my sincere gratitude to my examiners Prof

Dr Sabira Khatun and Prof Dr Rahmat Budiarto Thank you for your invaluable

comments and the time you took despite your hectic and busy schedule You not only

enabled me to go on the right path but also helped me to converge my scattered and

incoherent findings to structure them in harmony and consistency and bringing them

to a designated end I thank you for being so knowledgeable enthusiastic reassuring

committed and supportive

This thesis is the result of many years of effort and would not have been possible

without the contributions of my friends and my family which I would like to acknowl-

edge First I would like to thank Ns2 users for improving my understanding of the

tools I selected to use I would also like to express my sincere gratitude to Mr Tariq

Alshugran I am deeply indebted to him for his insight and suggestion to the thesis

topic He has helped me in many ways and has developed my programming skills to

modify the GPSR code to meet the specific alteration for GSAR I am grateful to Dr

Shengbo Yang for showing me the way to better simulations with his own work on

extending GPSR protocol Grateful acknowledgment should be mentioned here to Dr

Omar Almomani who guided me through a better way to run a series of simulation

experiments In the same vein I remain thankful to Dr Tracy Camp for helping in the

venue of selecting the proper mobility models for GSAR Also I thank the TEX-LATEX

users for improving my understanding of the LYX tool that I selected to text this thesis

I am thankful to Dr Lian Tze Lim for her help to write this thesis using LYX To many

v

others in the Networks Research Lab I will forever cherish the many useful conver-

sations and insights that helped to shape this study I would like to thank Dr A Suki

M Arif for his help in translating the thesis abstract to Bahasa Melayu My thanks go

to Omar Alshugran Salah Alshugran and Tariq Alshugran for their financial support

without which this PhD work would not have been possible

I would like to thank my mother Jameelah my father Ali and my only sister Basma

for their love and enthusiasm and for offering me the stability I needed to accomplish

my project My mother taught me in my formative years and gave me the most solid

foundation on which I could develop my skills I thank her for teaching me her moral

principles for all her loving and caring attention and her enormous effort to make

sure I would survive away from home My father has been the best example to guide

me through life he taught me the importance of hard work dedication persistence

and honesty My parents were the first persons that believed I was able to pursue this

project - I thank them for encouraging me to expand my horizons and for making me

a better person I thank my sister for being my eternal friend and ally for drowning

me with her kindness and for patiently helping me to focus on my work I hope I

can bring as much happiness to her life as she has brought to mine Also I would

like to express my gratitude to my brothers for their moral support and prayers Their

support kept me motivated and inspired me to strive and complete my PhD journey

Finally yet importantly the people who deserve the greatest acknowledgement are the

ones to whom this thesis is dedicated my loving and beautiful wife Wejdan my stun-

ning daughters and my sons Wejdan is an extraordinary person and her contribution

to this work is apparent in every word she pushed me forward at all times she gave

me constant support and stimulation she fostered my best ideas she listened patiently

to my constant divagations and she offered me more understanding than I could ever

imagine I love her dearly and I wish I could one day have the opportunity to help her

realise her most ambitious dreams in the way she helped me to realise mine During

my PhD I was extremely fortunate to experience one of the most rewarding and joyful

moments of my life the birth of my daughter Nor I only wish I can offer her the same

wisdom that her grandparents gave to me

vi

Table of Contents

Permission to Use i

Abstrak ii

Abstract iii

Declaration iv

Acknowledgements v

Table of Contents vii

List of Tables xiv

List of Figures xvi

List of Appendices xx

List of Abbreviations xxi

CHAPTER ONE INTRODUCTION 1

11 Overview 1

12 Background 1

13 Motivation and Research Problem 2

14 Research Goal and Objectives 5

15 Research Scope 6

16 Research Assumptions 7

17 Key Research Steps 8

18 Thesis Organization 9

CHAPTER TWO BACKGROUND AND RELATED WORK 10

21 Overview 10

22 Routing in Mobile Ad Hoc Networks 11

23 Position-based Routing Protocolsrsquo Structure and Operations 13

231 Position Information and Location Services Methods 13

232 Geographic Routing Process 15

24 Packet Forwarding Strategies (Primary Mode) 16

241 Greedy Forwarding Strategies 16

2411 Most Forward within Transmission Range 17

vii

2412 Random Progress Forwarding 17

2413 Compass Routing 17

2414 Nearest with Forward Progress 18

2415 Greedy Forwarding Strategy 18

242 Advantages and Disadvantages of GFS over Others Criteria 19

25 Reasons behind GFS Failure in MANET 20

251 The Effects of Participating Nodesrsquo Conditions 20

2511 Congestion Problem 21

2512 Battery Power Problem 21

2513 Next-Relay Node Positive Degree Problem 22

2514 Local Maximum Problem 22

252 The Effects of Mobility Attributes 24

2521 Movement Direction Problem 24

2522 Movement Speed Problem 25

2523 Link Lifetime Problem 27

2524 Beacon Packet Interval Time Problem 28

2525 Neighbourhood Entry Lifetime Problem 30

253 The Effects of Position Inaccuracy of Participating Nodes 31

2531 Inaccuracy of Next-relay Node Information (INNI) Problem 31

2532 Inaccuracy in Destination Position Information (IDPI)

Problem 33

254 Potential Problems Summary and Consequences 34

26 Current Literature Efforts to Solve GFS Failure 35

261 Recovery Strategies to Handle GFS Failure (RSGF) 35

2611 Greedy Perimeter Stateless Routing (GPSR) Protocol 36

2612 Position-based Opportunistic Routing (POR) Protocol 39

2613 Node Elevation Ad-hoc Routing (NEAR) Protocol 41

2614 Greedy Distributed Spanning Tree Routing (GDSTR)

Protocol 43

2615 Yet Another Greedy Routing (YAGR) Protocol 44

2616 Summary of Existing Recovery Strategies in Position-

based Routing Protocols 45

viii

262 Supportive Enhancement for GFS (SEGF) 46

2621 Extensions on GFS based on Prioritization and Selection

Process 47

2622 Summary of Prominent Works on Prioritization and Se-

lection Process 54

2623 Extensions on GFS based on Beaconing-Update Scheme 55

2624 Summary of Extensions Works on Beaconing-Update 62

27 Qualitative Discussion and Directions of the Research 64

28 Research Application Tools and Concepts 66

281 Network Evaluation Techniques 66

2811 Network Simulator 2 67

282 MATLAB 67

283 Fuzzy Logic Controller 68

284 Mobility Prediction Using Dead-reckoning Model 71

285 Mobility Model 72

29 Summary of Chapter 73

CHAPTER THREE DESIGN AND IMPLEMENTATION OF DBUM 75

31 Overview 75

32 Dynamic Beaconing-Update Mechanism Detailed Design and Objectives 75

33 Compulsory-update Technique Detailed Design 76

331 Urgent Beacon Message Structure 76

332 Urgent Beacon Message Design Goal 77

333 Scheduling Time to Emit Urgent Beacon Message 78

334 Check Time Identification by Using Fuzzy Logic 78

3341 Fuzzify Node Speed Input 79

3342 Fuzzify Check Time Output 81

3343 Fuzzy Rules and Fuzzy Inference 83

335 An Illustrative Example for DFLCH 84

336 Deviation Distance Identification 86

337 Tolerance Deviation Distance and Beaconing Decision Making 88

34 Neighbourhood Matrix Entries Management Detailed Design 89

ix

341 Residual Link Lifetime Identification 90

35 Dynamic Beaconing-Update Mechanism Functionality 92

351 Participating Nodes Procedures 92

3511 Sender nodes 92

3512 Receiver Nodes 93

352 Workflow of the Dynamic Beaconing-Update Mechanism 94

36 Implementation of Dynamic Beaconing-Update Mechanism 97

361 Simulation Environment 97

3611 Traffic Generation 97

3612 Movement Model 98

3613 Simulation Input Parameters 98

362 Implementation and Verification of GPSR and POR 102

363 Dynamic Beaconing-Update Mechanism Validation 102

3631 DBUM Validation in Static Environment 103

3632 DBUM Validation in Mobile Environment 104

37 Implementation of DBUM to Assign TOD and Fuzzy Delay in CUT 108

371 Optimal Tolerance Deviation Distance Calculation 109

3711 Deviation Distance and Nodesrsquo Speed 110

3712 Deviation Distance and Inconsistency of Neighbourhood

Matrix 111

3713 Deviation Distance and Control Overhead 112

372 Fuzzy Processing Delay 113


CHAPTER FOUR DESIGN AND IMPLEMENTATION OF DRESM 117

41 Overview 117

42 DRESM Detailed Design and Objectives 117

43 IDOTM Detailed Design and Objectives 119

431 The IEEE80211 DCF Address Filtering Modification 119

432 The Four Handshaking Packets Re-construction Modification 120

4321 Request To Forward Packet Design 121

4322 Clear To Forward Packet Design 122

x

4323 DATA Packet Design 122

4324 Acknowledgement Packets Design 123

433 The Network Allocation Vector (NAV) Modification 124

434 RTFCTFDATA Beacon Packet Like 125

435 Forwarding Candidate Number Restriction 126

436 Destination Prediction Scheme 127

44 FLDRE Detailed Design and Objectives 127

441 Detailed Design of the Proposed Prioritization Metrics 128

4411 Distance to Destination Identification 129

4412 Motion Speed and Direction 130

4413 Residual Links Lifetime 130

4414 Unoccupied Buffer Length 131

4415 Residual Battery Power 132

4416 Next Relay-node Positive Degree 133

442 Dynamic Reliability Estimation using Fuzzy Logic 134

4421 Fuzzify Selected Metrics Input 136

4422 Fuzzify Reliability Index Output 138


4424 Defuzzification 141

45 DRESM Functionality with An Illustrative Example 141


4511 Source Node 143

4512 Positive and Candidate Neighbour 148

4513 Optimal Neighbour 148

4514 Sub-optimal Neighbours 149

4515 Other Neighbours 150

452 Workflow of DRESM 150

4521 Procedures Performed by Source (Originator) Node 151

4522 Procedures Performed when A Node Receive CTF Packet 152

4523 Procedures Performed when A Node Receive an ACK

Packet 154

4524 Procedures Performed when A Node Receive RTF Packet 154

xi

4525 Procedures Performed when a Node Receive a DATA

Packet 155

46 Implementation of DRESM 161



463 DRESM Verification and Validation 161

4631 DRESM Validation in Static Environment 161

4632 DRESM Validation in Mobile Environment (Simple Case)163

47 Implementation of DRESM to Assign Fuzzy Delay in FLDRE 167


CHAPTER FIVE GREEDY STANDALONE POSITION-BASED ROUTING PROTOCOL IN MANET 172

51 Overview 172

52 Greedy Standalone Routing GSAR Protocol Design 172

53 Simulation Results and Evaluations 174

531 Simulation1 Impact of Varying Node Speed 176

5311 Packet Delivery Ratio Vs Node Speed 177

5312 Control Overhead Vs Node Speed 179

5313 End-to-End Delay Vs Node Speed 180

5314 Routing Path Stretch Vs Node Speed 182

5315 Inconsistency of Neighbourhood Matrix Vs Node Speed

183

5316 Number of Hole Problem Occurrence Vs Node Speed 184

5317 Summary Results of Varying Node Speed 186

532 Simulation 2 Impact of Varying Number of Nodes 188

5321 Packet Delivery Ratio Vs Number of Nodes 188

5322 Control Overhead Vs Number of Nodes 192

5323 End-to-End Delay Vs Number of Nodes 193

5324 Routing Path Stretch Vs Number of Nodes 195

5325 Inconsistency of Neighbourhood Matrix Vs Number of

Nodes 196

xii

5326 Number of Hole Problem Occurrence Vs Number of

Nodes 197

5327 Summary Results of Varying Number of Nodes 199

533 Simulation 3 Impact of Varying the Number of Traffic Sources 201

5331 Packet Delivery Ratio Vs Number of Data Traffic Sources

201

5332 Control Overhead Vs Number of Data Traffic Sources 204

5333 End-to-End Delay Vs Number of Data Traffic Sources 205

5334 Routing Path Stretch Vs Number of Data Traffic Sources

207


Data Traffic Sources 208



5337 Summary Results of Varying Number of Data Traffic

Sources 210

54 Greedy Standalone Routing GSAR Protocol Features 212

55 Advantages of Dynamic Beaconing-Update Mechanism 213

56 Advantages of the Dynamic and Reactive Reliability

Estimation with Selective Metrics Mechanism 214


CHAPTER SIX CONCLUSION AND FUTURE WORK 216

61 Overview 216

62 Summarization 216

63 Contributions 217

64 Significance of the Contributions 219

65 Future Work 220

REFERENCES 221

xiii

List of Tables

Table 21 Greedy Forwarding Strategy (GFS) Problems in MANET 34

Table 22 Prior Works Regarding Recovery Strategies in Position-based Rout-

ing Protocols 46

Table 23 Prior Works Regarding Prioritization and Selection Process improve-

ment for GFS 54

Table 24 Prior Works Regarding Beaconing-Update improvement for GFS 63

Table 25 Brief Comparison Between RSGF with SEGF Categories 65

Table 31 Urgent Beacon Message (UBM) Structure the Shaded Columns are

the New Proposal and the Rest as the Old Packet 77

Table 32 Linguistic variable Node Speed (NS) 80

Table 33 Linguistic variable Check Time (CHT) 82

Table 34 The Ns2 Simulation Model of GPSR 100

Table 35 The Ns2 Simulation Model of POR 100

Table 36 Proposed Simulated Topology Characteristics 101

Table 37 RLT and ELT Values of Neighbours Nodes in Node Srsquos NLM 106

Table 41 Request To Forward (RTF) Packet Structure the Shaded Columns

are the New Proposal and the Rest as the Old Packet 121

Table 42 Clear To Forward (CTF) Packet Structure the Shaded Columns are


Table 43 DATA Packet Header Fields the Shaded rows are the New Proposal

and the Rest as the Old Packetrsquos Header 123

Table 44 Acknowledgment (ACK) Packet Structure 123

Table 45 Linguistic variable ethSC imageS

C ϕC ϑC or κC 136

Table 46 Linguistic variable Reliability Index (RIN) 138

Table 47 A part of the DATA Packet Header 147

Table 48 The DALT Table of Node B for i-Received- DATA Packets 149

Table 49 The ethSC and imageS

C Calculation 165

xiv

Table 410 The Average Number of Active and Compared Neighbours in both

GPSR and GPSR-DRESM 170

Table 51 Varying Node Speed 177

Table 52 The Performance Comparison between GSAR POR and GPSR vs

Node Speed 187

Table 53 Varying Number of Nodes 188


Number of Nodes 200

Table 55 Varying Number of Traffic Sources 201


Number of Data Traffic Sources 211

Table C1 The Information Received in CTF Packets from the two Candidate

Nodes A and B 244

Table C2 The Calculation of ethCD and imageS

C of the two Candidate Nodes A and B

based on the CTFsrsquo Information Received from them 244

Table C3 Selected Metrics Values with Corresponding MF and Rating for

Candidate Node A 245


Candidate Node B 245

xv

List of Figures

Figure 11 An Example of Mobile Ad Hoc Wireless Network Topology 2

Figure 12 Research Scope and Key Contributions (Bounded Area) 7

Figure 21 Literature Review Framework 10

Figure 22 Main Greedy Forwarding Strategies 17

Figure 23 The GFS Criterion Functionality 18

Figure 24 A Hot-spot Problem over GFS Criterion in MANET 20

Figure 25 Local Maximum Problem 23

Figure 26 Mobility Metrics 24

Figure 27 Effect of Neighboursrsquo Movement Direction Problem 25

Figure 28 Effect of Neighbouring Nodes Speed 26

Figure 29 Unstable Link Life-time Problem 27

Figure 210 NBL and BPIT Problems Combination in GFS 29

Figure 211 The Backward Problem due to Position Inaccuracy 32

Figure 212 Inaccuracy in Destination Position Information (IDPI) Problem in

GFS 33

Figure 213 Current State-of-the-art on Solving Greedy Problems 35

Figure 214 Mixed of Primary and Recovery Mode 36

Figure 215 A Constructed Route by GPSR 38

Figure 216 Comparison between GPSR and GPSR-VDVH 40

Figure 217 A repositioning example (source [28]) 42

Figure 218 (a) A spanning tree and (b) a hull tree construction in GDSTR

(source [55]) 43

Figure 219 The architecture of the proposed DR2 (source [58]) 50

Figure 220 Distance and Relative direction calculation in SRR protocol 51

Figure 221 The Fuzzy Logic System Architecture 69

Figure 222 Dead-reckoning Position Estimation 71

Figure 31 DBUM Model Structure Details 76

Figure 32 Generalized Fuzzy System FLC for DFLCH 79

xvi

Figure 33 Membership Functions of NS Input Variable 80

Figure 34 Membership Functions for CHT Output Variable 82

Figure 35 Fuzzification of the NS=25 ms 84

Figure 36 Aggregation of the Rule Consequents 85

Figure 37 Defuzzification of CHT Output 86

Figure 38 The Actual Deviation Distance ω Estimation Process 87

Figure 39 Communication Relation and RLT of A Pair of Nodes 90

Figure 310 Flowchart of DBUM Executed by Sender Node the Shaded Blocks

are the Contribution of the Proposed Protocol 95

Figure 311 Flowchart of DBUM Executed by Receiver Node the Shaded Blocks


Figure 312 An Example Shows the cbr Traffic Generation Between Two Nodes 98

Figure 313 Average Packet Delivery Ratio via Number of Nodes 104

Figure 314 Network Model for Performance Validation of DBUM 105

Figure 315 Comparison of Number of Neighboursrsquo Entries 107

Figure 316 Neighbours Entries Lifetime Via Relative Velocity 108

Figure 317 Required Time A node Need to Reach TOD Via Node Speed 110

Figure 318 Inconsistency of Neighbourhood Matrix Via Tolerance Deviation

Distance 112

Figure 319 Control Overhead Via Tolerance Deviation Distance 113

Figure 320 The Fuzzy Processing Delay Compared to Traditional Beaconing

Processing Delay 115

Figure 41 DRESM Model Structure Details 118

Figure 42 Formation of Proposed Metrics 129

Figure 43 Generalized Fuzzy System FLC for FLDRE 135

Figure 44 Membership Functions of ethSC imageS

C ϕC ϑC and κC Input Variable 137

Figure 45 Membership Functions for RIN Output Variable 139

Figure 46 Network Topology to Show DRESM Functionality 142

Figure 47 Flowchart of DRESM Executed by A Node when it has DATA

Packet to be Forwarded the Shaded Blocks are the Contribution

of the Proposed Protocol 157

xvii

Figure 48 Flowchart of DRESM Executed by A Node After it Received CTF

Until Sending DATA Packet the Shaded Blocks are the Contribu-

tion of the Proposed Protocol 158

Figure 49 Flowchart of DRESM Executed by A Node after it Sent DATA

Packet and Waiting to Receive ACK Packet the Shaded Blocks


Figure 410 Flowchart of the DRESM Executed when A Node Receives RTF

Messages and Send Back CTF Packet the Shaded Blocks are the

Contribution of the Proposed Protocol 159

Figure 411 Flowchart of DRESM Executed when A Node Receives DATA

Packet and Send Back ACK Packet the Shaded Blocks are the



Figure 413 Network Model for Performance Validation of DRESM 164

Figure 414 Comparison of the Calculated and Experimental Results to Validate

DRESM 167

Figure 415 The FLDRE Fuzzy-Delay Compared to GPSR Processing Delay 170

Figure 51 Overall Flow Diagram of the proposed Greedy Standalone Routing

Protocol GSAR 173

Figure 52 Average Packet Delivery Ratio via Node Speed 178

Figure 53 Average Control Overhead via Node Speed 179

Figure 54 Average End-to-End Delay via Node Speed 181

Figure 55 Average Routing Path Stretch via Node Speed 183

Figure 56 Average Inconsistency of Neighbourhood Matrix Ratio via Node

Speed 184

Figure 57 Average Number of Hole Problem Occurrence via Node Speed 186


Figure 59 (a) Average Free Buffer Size via Number of Nodes (b) Average

Number of Collided RTF Packets via Number of Nodes 191

Figure 510 Average Control Overhead via Number of Nodes 192

Figure 511 Average End-to-End Delay via Number of Nodes 194

xviii

Figure 512 Average Routing Path Stretch via Number of Nodes 196

Figure 513 Average Inconsistency of Neighbourhood Matrix Ratio via Num-

ber of Nodes 197

Figure 514 Average Number of Hole Problem Occurrence via Number of Nodes 199

Figure 515 Average Packet Delivery Ratio via Number of Data Traffic Sources 202

Figure 516 (a) Average Occupied Buffer Size via Number of Data Traffic

Sources (b) Average Number of Collided RTF Packets via Num-

ber of Data Traffic Sources 204

Figure 517 Average Control Overhead via Number of Data Traffic Sources 205

Figure 518 Average End-to-End Delay via Number of Data Traffic Sources 206

Figure 519 Average Routing Path Stretch via Number of Data Traffic Sources 208



Figure 521 Average Number of Hole Problem Occurrence via Number of Data

Traffic Sources 210

Figure A1 Simulated Fraction Data pkts Delivered Vs Original Results 240

Figure A2 Simulated Routing Protocol Overhead Vs Original Results 241


Figure C1 Applying Fuzzy Inference Aggregation and Defuzzification of the

Output RIN for Node A 246


Output RIN for Node B 246

xix

List of Appendices

Appendix A GPSR Routing Protocol Validation 240

Appendix B FLDRE Fuzzy Rules 242

Appendix C DRESM Functionality with Example 244

Appendix D Evaluation Metrics and Results Credibility 247

xx

List of Abbreviations

ACK Acknowledgement Packet

AI Artificial Intelligence

APU Adaptive Position Update

BCF Beacon-based Cooperative Forwarding

BPIT Beacon Packet Interval Time

BP Beacon Packet

BPsize Beacon Packet Size

BTA Backtracking Based Approach

Bw Bandwidth

CHT Check Time

COH Control Overhead

CR Compass Routing

CSMACA Carrier Sense Multiple AccessCollision Avoidance protocol

CTF Clear To Forward message

CUT Compulsory Update Technique

DFLCH Dynamic Fuzzy Logic Controller Check-time

DARPA Defence Advanced Research Projects Agency

DATA Data Packet

DLI Destination Location Information

DBUM Dynamic Beaconing Updates Mechanism

DCF Distributed Coordination Function

DIFS Distributed Inter Frame Space

DPsize Data Packet Size

DPS Destination Prediction Scheme

DRESM Dynamic and Reactive Reliability Estimation with

Selective Metrics Mechanism

DREAM Distance Routing Effect Algorithm for Mobility

DRM Dynamic Route Maintenance algorithm

DSDV Destination-Sequenced Distance-Vector

DSR Dynamic Source Routing Protocol

xxi

Du Duration for MAC usage

EED Average End to End Delay

ELT Neighbourhood Entry Lifetime

FBPIT Fixed Beacon Packet Interval Time

FIFO First-In-First-Out policy

FLDRE Fuzzy Logic Dynamic Reliability Estimation technique

FLC Fuzzy Logic Controller

GEDIR Geographic Distance Routing

GAs Genatic Algorithms

GFS Greedy Forwarding Strategy

GG Gabriel Graph Algorithm

GLS Scalable Location Service for Geographic Ad Hoc Routing

GPS Global Positioning System

GPSR Greedy Perimeter Stateless Routing

ID Node Identity

IDOTM Information Distribution and Outgoing Traffic

Control Management technique

IDPI Inaccuracy in Destination Position Information

INM Inconsistency of Neighbourhood Matrix

LAR Location Aided Routing

LLT link lifetime

MAC Medium Access Control

MANET Mobile Ad Hoc Network

MFR Most Forward Within Transmission Range

MNs Wireless Mobile Nodes

MP Message Packet (used with the RTF CTF etc)

MPsize Message Packet size

MPDM Mobility Prediction Using Dead-reckoning Model

NAM Network Animator

NAV Network Allocation Vector

NBL Neighbour Break Link

NFP Nearest With Forward Progress

xxii

NLM Neighbourhoodrsquos Location-Matrix

NMEM Neighbourhood Matrix Entries Management

NPN Number of a nodersquos Positive Neighbours

Ns2 Network Simulator 2

NS Node Speed

OTcl Object-Oriented Tool Command Language

PDn Packet Distinction Number

PDR Packet Delivery Ratio

POR Position-based Opportunistic Routing protocol

QoS Quality of Service

RSGF Recovery Strategies with Greedy Failure

REEF REliable and Efficient Forwarding mechanism

RIN Reliability Index

RLT Residual Links Lifetime

RNG Relative Neighbourhood Graph algorithm

RPF Random Progress Forwarding

RSN Reliability Sequence Number of the candidate node

RTF Request To Forward message

RWP Random WayPoint mobility model

SEGF Supportive Enhancement for Greedy Forwarding

SIFS Short Interframe Space

SLPS Self Location Prediction Scheme

Tcl Tool Command Language

TOD TOlerance Deviation distance

TSF Local Timing Synchronization Function

TTL Time To Live

UBM Urgent Beacon Message

VDVH Virtual Destination-based Void Handling

WTSA Waiting Time to Send ACK packet

xxiii

CHAPTER ONE

INTRODUCTION

11 Overview

This thesis proposes a new extension to the current Greedy Forwarding Strategy (GFS)

in the Mobile Ad hoc Network (MANET) In this chapter Section 12 provides a gen-

eral background Section 13 presents the motivation and research problem Sections

14 and 15 present the research objectives and the research scope respectively Sec-

tions 16 and 17 present research assumptions and key research steps respectively

Finally Section 18 presents the organization of the thesis

12 Background

Interest in mobile computing has grown immensely over the last decade Mobile com-

puting aims to provide users access to information and communication from anywhere

and at any time [1] Mobile Ad Hoc Network (MANET) is a subset of mobile com-

puting [2] MANET is a spontaneous network because it does not need a pre-fixed

infrastructure such as a base station or access points to provide the capacity for com-

munication [3] MANET is a rapidly deployable self-organized multi-hop wireless

network that is set up for a limited period of time and for a particular purpose [4]

MANET consists of wireless mobile nodes such as laptops tablets and personal digi-

tal assistants [2] These mobile nodes may reside in vehicles instruments and mobile

machines thus making the network topology highly dynamic [5] Nodes in MANET

may move arbitrarily while communicating over wireless links [3] In MANET mo-

bile nodes capable of connecting and communicating with each other use limited-

bandwidth radio links They are incorporated with routing functionality and computa-

tional power so that they can perform the operations of host and router simultaneously

Mobile nodes have limited resources including CPU capacity buffer capacity and bat-

tery power [4] A schematic illustration of MANET is shown in Figure 11 below

1

The contents of

the thesis is for

internal user

only

REFERENCES

[1] S Ilarri E Mena and A Illarramendi ldquoLocation-dependent QueryProcessing Where we are and where we are Headingrdquo ACM ComputingSurveys vol 42 no 3 pp 121ndash1273 Mar 2010 [Online] Availablehttpdoiacmorg10114516706791670682[Accessdate10122013]

[2] J-Z Sun ldquoMobile Ad Hoc Networking An Essential Technology for PervasiveComputingrdquo in the Proceedings of International Conferences on Infotech ampInfonet Beijing China 29 Oct -01 Nov 2001 pp 316ndash321 [Online] Availablehttpdxdoiorg101109ICII2001983076[Accessdate10122013]

[3] F Magnus J Per and L Peter ldquoWireless Ad Hoc Networking-The Art ofNetworking without A Networkrdquo Ericsson Review vol 77 no 1 pp 248ndash2622000 ISSN 0014-0171 [Online] Available httpwwwciteulikeorgusersergiocabreroarticle1943206-AT[Accessdate10122013]

[4] D Bein ldquoSelf-Configuring Self-Organizing and Self-Healing Schemesin Mobile Ad Hoc Networksrdquo in Guide to Wireless Ad Hoc NetworksS Misra I Woungang and S C Misra Eds Springer-Verlag LondonLimited 2009 ch 2 pp 27ndash42 [Online] Available httpdxdoiorg101007978-1-84800-328-6_2

[5] S Sesay Z Yang and J He ldquoA Survey on Mobile Ad Hoc Wireless NetworkrdquoInformation Technology Journal vol 3 no 2 pp 168ndash175 17-19 Mar 2004[Online] Available maneteurecomfrSesaypdf[Accessdate10122013]

[6] P Mohapatra and S Krishnamurthy ldquoAd Hoc Networks EmergingApplications Design Challenges and Future Opportunitiesrdquo in Ad HocNetworks Technologies and Protocols Springer Oct 2010 pp 1ndash22[Online] Available httpbooksgooglecommybooksid=JhQIkgAACAAJ

[7] A Boukerche D Camara A Loureiro and C Figueiredo ldquoAlgorithmsfor Mobile Ad Hoc Networksrdquo in Algorithms and Protocols for Wirelessand Mobile Ad Hoc Networks A Boukerche Ed John Wiley amp SonsInc 2009 ch 1 pp 1ndash20 ISBN 978-0-470-38358-2 [Online] Availablehttpdxdoiorg1010029780470396384ch1

[8] I Chlamtac M Conti and J J Liu ldquoMobile Ad Hoc NetworkingImperatives and Challengesrdquo Ad Hoc Networks vol 1 no 1 pp 13ndash64 Jul2003 [Online] Available httpdxdoiorg101016S1570-8705(03)00013-1[Accessdate10122013]

[9] J Hoebeke I Moerman B Dhoedt and P Demeester ldquoAn Overviewof Mobile Ad Hoc Networks Applications and Challengesrdquo JournalCommunications Network vol 3 no 3 pp 60ndash66 Sep 2004 [Online]Available cwiuniknoimagesManet_Overviewpdf[Accessdate10122013]

221

[10] J Jain M Fatima R Gupta and K Bandhopadhyay ldquoOverview andChallenges of Routing Protocol and MAC Layer in Mobile Ad-Hoc NetworkrdquoJournal of Theoretical and Applied Information Technology vol 8 no 1 pp6ndash12 Oct 2009 [Online] Available wwwjatitorgvolumesresearch-papersVol8No12Vol8No1pdf[Accessdate10122013]

[11] M K Marina and S R Das ldquoRouting in Mobile Ad Hoc Networksrdquoin Ad Hoc Networks Technologies and Protocols P Mohapatra andS V Krishnamurthy Eds Springer Science + Business Media IncNew York NY USA 2005 ch 3 pp 63ndash90 [Online] Availablehttpdxdoiorg1010070-387-22690-7_3

[12] V Narsimha B Sujatha and T SampathKumar ldquoA Survey of Wireless MobileAd-Hoc Networks (MANET)rdquo International Journal of Science and AdvancedTechnology vol 1 no 5 pp 189ndash192 Jul 2011 [Online] Availablehttpwwwijsatcompdfphppdf_id=98pdf

[13] Z Ren and W Guo ldquoUnicast Routing in Mobile Ad Hoc Networks Present andFuture Directionsrdquo in the Proceedings of the Fourth International ConferenceIn Parallel and Distributed Computing Applications and TechnologiesChengdu Sichuan China IEEE 27-29 Aug 2003 pp 240ndash243 [Online]Available httpdxdoiorg101109PDCAT20031236318

[14] L K Qabajeh L M Kiah and M M Qabajeh ldquoA Qualitative Comparisonof Position-Based Routing Protocols for Ad-Hoc Networksrdquo InternationalJournal of Computer Science and Network Security vol 9 no 2 pp131ndash140 Feb 2009 [Online] Available httpeprintsumedumyideprint4945[Accessdate10122013]

[15] D Chen and V Pramod K ldquoGeographic Routing in Wireless Ad HocNetworksrdquo in Guide to Wireless Ad Hoc Networks Springer 2009 ch 7 pp157ndash181 [Online] Available httpdxdoiorg101007978-1-84800-328-6_7[Accessdate10122013]

[16] M L M Kiah L K Qabajeh and M M Qabajeh ldquoUnicast Position-basedRouting Protocols for Ad-Hoc Networksrdquo Acta Polytechnica Hungaricavol 7 no 5 pp 16ndash46 Oct-Dec 2010 [Online] Available httpwwwuni-obudahujournalIssue26htm[Accessdate10122013]

[17] C Lemmon S Lui and I Lee ldquoGeographic Forwarding and Routingfor Ad-Hoc Wireless Network A Surveyrdquo in the Proceeding of the 5thInternational Joint Conference on INC IMS and IDC (NCMrsquo09) MyongjiUniv Yongin South Korea 25-27 Aug 2009 pp 188ndash195 [Online]Available httpdxdoiorg101109NCM200980

[18] A Maghsoudlou M St-Hilaire and T Kunz ldquoA Survey on GeographicRouting Protocols for Mobile Ad hoc Networksrdquo Department of Systemsand Computer Engineering Carleton University Ottawa ON Canada TechRep 3 Oct 2011 [Online] Available wwwcsitcarletonca~msthilaireTech_Report2011-GRPreportpdf[Accessdate10122013]

222

[19] S-H Cha M-W Ryu and K-H Cho ldquoA Survey of Greedy RoutingProtocols for Vehicular Ad Hoc Networksrdquo Smart Computing Reviewvol 2 no 2 pp 125ndash137 Apr 2012 [Online] Available httpdxdoiorg106029smartcr201202003[Accessdate10122013]

[20] A M Popescu G Tudorache B Peng and A H Kemp ldquoSurveyingPosition Based Routing Protocols for Wireless Sensor and Ad-hoc NetworksrdquoInternational Journal of Communication Networks and Information Security(IJCNIS) vol 4 no 1 pp 41ndash67 Apr 2012 [Online] Availablewwwijcnisorgindexphpijcnisarticledownload8590

[21] C Lemmon S M Lui and I Lee ldquoReview of Location-AwareRouting Protocolsrdquo Advances in Information Sciences and Service Sciences(AISS) vol 2 no 2 pp 132ndash143 Mar 2010 [Online] Availablehttpdxdoiorg104156aissvol2issue215

[22] F Araujo L Rodrigues F Araujo and L Rodrigues ldquoSurvey on Position-Based Routing1rdquo University of Lisbon Tech Rep Jan 2006 [Online]Available httpedendeiucpt~filipiuspublicationshtml

[23] G G Finn ldquoRouting and Addressing Problems in Large Metropolitan-Scale Internetworksrdquo University of Southern California Marina del ReyInformation Sciences Inst Tech Rep Mar 1987 [Online] Availablehttpwwwdticmildtictrfulltextu2a180187pdf[Accessdate10122013]

[24] S Ruhrup ldquoPosition-Based Routing Strategiesrdquo PhD Dissertation Facultyof Electrical Engineering Computer Science and Mathematics Universityof Paderborn Jul 2006 [Online] Available www2csuni-paderborndecsag-madhWWWsrthesispdf[Accessdate10122013]

[25] G Xing C Lu R Pless and Q Huang ldquoOn Greedy Geographic RoutingAlgorithms in Sensing Covered Networksrdquo in the Proceedings of the 5thACM International Symposium on Mobile Ad Hoc Networking and ComputingRoppongi Hills Tokyo Japan ACM 24-26 May 2004 pp 31ndash42 [Online]Available httpdoiacmorg101145989459989465[Accessdate10122013]

[26] S Ruhrup ldquoTheory and Practice of Geographic Routingrdquo Department ofComputer Science University of Freiburg Germany Tech Rep Feb 2009[Online] Available httphondoinformatikuni-freiburgdepeopleruehrupgeorouting-chapter-draftpdf[Accessdate10122013]

[27] J Li and S M Shatz ldquoToward Using Node Mobility to Enhance Greedy-Forwarding in Geographic Routing for Mobile Ad Hoc Networksrdquo in theProceeding of the International Workshop on Mobile Device and Urban Sensing(MODUS 08) St Louis MO USA 21 Apr 2008 pp 1ndash8 [Online] Availablewwwcsuicedu~shatzpapersmodus08pdf[Accessdate10122013]

[28] N Arad and Y Shavitt ldquoMinimizing Recovery State in Geographic Ad HocRoutingrdquo IEEE Transactions on Mobile Computing vol 8 no 2 pp 203ndash217Feb 2009 [Online] Available httpdoiieeecomputersocietyorg101109TMC200886[Accessdate10122013]

223

[29] P J Wan C W Yi L Wang and X Yao Fand Jia ldquoAsymptoticCritical Transmission Radii for Greedy Forward Routing in Wireless AdHoc Networksrdquo IEEE Transactions on Communications vol 57 no 5pp 1433ndash1443 May 2009 [Online] Available httpdxdoiorg101109TCOMM200905070307

[30] F Cadger K Curran J Santos and S Moffett ldquoA Survey of GeographicalRouting in Wireless Ad-Hoc Networksrdquo IEEE Communications Surveys ampTutorials vol 15 no 2 pp 621ndash653 Jul 2012 [Online] Availablehttpdxdoiorg101109SURV201206261200109

[31] M Lukic B Pavkovic N Mitton and I Stojmenovic ldquoGreedy GeographicRouting Algorithms in Real Environmentrdquo in the Proceeding of the 5thInternational Conference on Mobile Ad-hoc and Sensor Networks Wu YiMountain China IEEE 14-16 Dec 2009 pp 86ndash93 [Online] Availablehttpdxdoiorg101109MSN200911[Accessdate10122013]

[32] S Giordano I Stojmenovic and L Blazevic ldquoPosition Based RoutingAlgorithms for Ad Hoc Networks A Taxonomyrdquo Ad Hoc Wireless Networkingvol 8 no 64 pp 1ndash20 2001 [Online] Available httpciteseerxistpsueduviewdocsummarydoi=1011153076[Accessdate10122013]

[33] A K Haboush M A Nabhan M Al-Tarazi and M Al-RawajbehldquoLoad Balancing Using Multiple Node Disjoint Pathsrdquo Computer andInformation Science vol 5 no 3 pp 83ndash89 May 2012 [Online] Availablehttpdxdoiorg105539cisv5n3p83[Accessdate10122013]

[34] D S J D Couto D Aguayo B A Chambers and R Morrist ldquoPerformanceof Multihop Wireless Networks Shortest Path is not Enoughrdquo ACMSIGCOMM Computer Communication Review vol 33 no 1 pp 83ndash88Jan 2003 [Online] Available httpdoiacmorg101145774763774776[Accessdate10122013]

[35] G I Ivascu S Pierre and A Quintero ldquoQoS Routing With TrafficDistribution in Mobile Ad Hoc Networksrdquo Computer communicationvol 32 no 2 pp 305ndash316 Feb 2009 [Online] Available httpdxdoiorg101016jcomcom200810012

[36] S Venkatasubramanian and N Gopala ldquoA Quality of Service Architecturefor Resource Provisioning and Rate Control in Mobile Ad Hoc NetworksrdquoInternational Journal of Ad hoc Sensor amp Ubiquitous Computing (IJASUC)vol 1 no 3 pp 106ndash120 Sep 2010 [Online] Available httpdxdoiorg105121ijasuc20101309[Accessdate10122013]

[37] F De Rango and M Tropea ldquoEnergy Saving and Load Balancing in WirelessAd Hoc Networks Through Ant-based Routingrdquo in the Proceeding of the Inter-national Symposium on Performance Evaluation of Computer amp Telecommuni-cation Systems Istanbul Turkey IEEE 13-16 Jul 2009 pp 117ndash124 [On-line] Available httpieeexploreieeeorgwwwezplibukmmyielx55204040522409805224137pdftp=amparnumber=5224137ampisnumber=5224098

224

[38] S-B Lee and A Campbell ldquoHMP Hotspot Mitigation Protocol forMobile Ad hoc Networksrdquo in the Proceeding of the Eleventh InternationalWorkshop on Quality of Service ser Lecture Notes in Computer ScienceK Jeffay I Stoica and K Wehrle Eds vol 2707 CA USASpringer Berlin Heidelberg 2ndash4 Jun 2003 pp 266ndash283 [Online] Availablehttpdxdoiorg1010073-540-44884-5_15

[39] V Thilagavathe and Dr K Duraiswamy ldquoCross Layer Based CongestionControl Technique for Reliable and Energy Aware Routing in MANETrdquoInternational Journal of Computer Applications vol 36 no 12 pp 1ndash6Dec 2011 [Online] Available httpwwwijcaonlineorgarchivesvolume36number124549-6288[Accessdate10122013]

[40] S Sheeja and R V Pujeri ldquoEffective Congestion Avoidance Scheme forMobile Ad Hoc Networksrdquo International Journal of Computer Networkand Information Security (IJCNIS) vol 5 no 1 pp 33ndash40 2013 [On-line] Available wwwmecs-pressorgijcnisijcnis-v5-n1IJCNIS-V5-N1-4pdf[Accessdate10122013]

[41] G Wang Gand Wang ldquoAn Energy-Aware Geographic Routing Protocolfor Mobile Ad Hoc Networksrdquo International Journal of Software andInformatics vol 4 no 2 pp 183ndash196 Jun 2010 [Online] Avail-able GWangGWang-InternationalJournalofSoftwareandInformatics2010-stewitudelftnl[Accessdate10122013]

[42] Y Wang ldquoStudy on Energy Conservation in MANETrdquo Journal ofNetworks vol 5 no 6 pp 708ndash715 Jun 2010 [Online] Availablehttpdxdoiorg104304jnw56708-715[Accessdate10122013]

[43] D G Anand H G Chandrakanth and M N Giriprasad ldquoEnergy EfficientCoverage Problems in Wireless Ad Hoc Sensor Networksrdquo InternationalJournal of Advanced Networking and Applications vol 3 no 1 pp 999ndash1005JulAug 2011 [Online] Available httpdxdoiorg105121acij20112204[Accessdate10122013]

[44] B Karp and H T Kung ldquoGPSR Greedy Perimeter Stateless Routing forWireless Networksrdquo in the Proceedings of the 6th Annual InternationalConference on Mobile Computing and Networking (MobiCom) BostonMassachusetts US ACM 6-11 Aug 2000 pp 243ndash254 [Online] Availablehttpdoiacmorg101145345910345953[Accessdate10122013]

[45] S Yang C K Yeo and B-S Lee ldquoToward Reliable Data Delivery forHighly Dynamic Mobile Ad Hoc Networksrdquo IEEE Transactions on MobileComputing vol 11 no 1 pp 111ndash124 Jan 2012 [Online] Availablehttpdxdoiorg101109TMC201155

[46] R Alsaqour M Shanudin M Ismail and M Abdelhaq ldquoAnalysis of MobilityParameters Effect on Position Information Inaccuracy of GPSR Position-Based MANET Routing Protocolrdquo Journal of Theoretical and AppliedInformation Technology vol 28 no 2 pp 114ndash120 Jun 2011 [Online]

225

Available wwwjatitorgvolumesresearch-papersVol28No28Vol28No2pdf[Accessdate10122013]

[47] D Son A Helmy and B Krishnamachari ldquoThe Effect of Mobility-InducedLocation Errors on Geographic Routing In Mobile Ad Hoc Sensor NetworksAnalysis and Improvement Using Mobility Predictionrdquo IEEE Transactions onMobile Computing vol 3 no 3 pp 233ndash245 Jul 2004 [Online] Availablehttpdxdoiorg101109TMC200428[Accessdate10122013]

[48] J Tsumochi K Masayama H Uehara and M Yokoyama ldquoImpact ofMobility Metric on Routing Protocols for Mobile Ad Hoc Networksrdquo inthe Proceeding of the IEEE Pacific Rim Conference on CommunicationsComputers and signal Processing (PACRIM) University of VictoriaVictoria BC Canada 28-30 Aug 2003 pp 322ndash325 [Online] Availablehttpdxdoiorg101109PACRIM20031235782

[49] V C Giruka and M Singhal ldquoHello Protocols for Ad-Hoc NetworksOverhead and Accuracy Tradeoffsrdquo in the 6th IEEE International Symposiumon a World of Wireless Mobile Multimedia Networks (WoWMoM) Taormina-Giardini Naxos 13-16 Jun 2005 pp 354ndash361 [Online] Availablehttpdxdoiorg101109WOWMOM200550

[50] F Ingelrest N Mitton and D Simplot-Ryl ldquoA Turnover based AdaptiveHELLO Protocol for Mobile Ad Hoc and Sensor Networksrdquo in theProceedings of the 15th International Symposium on Modeling Analysisand Simulation of Computer and Telecommunication Systems IstanbulTurkey IEEE 24-26 Oct 2007 pp 9ndash14 [Online] Available httpdxdoiorg101109MASCOTS20075

[51] C Li L Zhu C Zhao and H Lin ldquoHello Scheme for Vehicular Ad HocNetworks Analysis and Designrdquo Journal on Wireless Communications andNetworking (EURASIP) vol 2013 no 1 p 28 Feb 2013 [Online] Availablehttpjwcneurasipjournalscomcontent2013128

[52] M Heissenbuumlttel T Braun M Waumllchli and T Bernoulli ldquoEvaluatingthe Limitations of and Alternatives in Beaconingrdquo Ad Hoc Networksvol 5 no 5 pp 558ndash578 Jul 2007 [Online] Available httpdxdoiorg101016jadhoc200603002[Accessdate10122013]

[53] Q Chen S S Kanhere and M Hassan ldquoAdaptive Position Update forGeographic Routing in Mobile Ad-hoc Networksrdquo IEEE Transactions onMobile Computing vol 12 no 3 pp 4046ndash4051 Mar 2013 [Online]Available httpdxdoiorg101109TMC201220[Accessdate10122013]

[54] S Kwon and N B Shroff ldquoGeographic Routing in the Presence ofLocation Errorsrdquo International Journal of Computer and TelecommunicationsNetworking vol 50 no 15 pp 2902ndash2917 Oct 2006 [Online] Availablehttpdxdoiorg101016jcomnet200511008[Accessdate10122013]

[55] B Leong B Liskov and R Morris ldquoGeographic Routing withoutPlanarizationrdquo in the Proceeding of the 3rd conference on Networked Systems

226

Design and Implementation San Jose CA ACM 8-10 May 2006 pp 1ndash14 [Online] Available httpdlacmorgcitationcfmid=12676801267705[Accessdate10122013]

[56] J Na D Soroker and C-K Kim ldquoGreedy Geographic Routing using DynamicPotential Field for Wireless Ad Hoc Networksrdquo IEEE CommunicationsLetters vol 1 no 3 pp 243ndash245 Mar 2007 [Online] Availablehttpdxdoiorg101109LCOMM2007061612[Accessdate10122013]

[57] R H Khokhar M A Ngadi M S Latiff K Z Ghafoor S Ali ldquoMulti-criteriaReceiver Self-Election Scheme for Optimal Packet Forwarding in VehicularAd hoc Networksrdquo International Journal of Computers Communicationand Control vol 7 no 5 pp 865ndash878 Dec 2012 [Online] Availablejournalunivagorarodownloadpdf639pdf[Accessdate10122013]

[58] Z G Kayhan A B Kamalrulnizam and H N A ldquoA Novel Delay-andReliability-Aware Inter-Vehicle Routing Protocolrdquo Network Protocols andAlgorithms vol 2 no 2 pp 66ndash88 Jul 2010 [Online] Availablehttpdxdoiorg105296npav2i2427[Accessdate10122013]

[59] J Gong C Z Xu and J Holle ldquoPredictive Directional GreedyRouting in Vehicular Ad hoc Networksrdquo in the Proceeding of the 27thInternational Conference on Distributed Computing Systems WorkshopsToronto Ont IEEE 22-29 Jun 2007 pp 2ndash10 [Online] Availablehttpdxdoiorg101109ICDCSW200765[Accessdate10122013]

[60] Z G Kayhan A B Kamalrulnizam S Shaharuddin C L Kevin M MMohd K Maznah and M A Marina ldquoFuzzy Logic-assisted GeographicalRouting over Vehicular Ad Hoc Networksrdquo International Journal of InnovativeComputing Information and Control vol 8 no 7 pp 1ndash15 Jul 2012[Online] Available wwwijicicorg11-05101-1pdf[Accessdate10122013]

[61] D Liarokapis and A Shahrabi ldquoFuzzy-based Probabilistic Broadcasting inMobile Ad Hoc Networksrdquo in Wireless Days (WD) Glasgow CaledonianUniversity Glasgow UK IEEE 10-12 Oct 2011 pp 1ndash6 [Online] Availablehttpdxdoiorg101109WD20116098185

[62] R Saqour M Shanudin and M Ismail ldquoDynamic Beaconing for AdHoc Position-based Routing Protocol Using Fuzzy Logic Controllerrdquo in theProceedings of the International Conference on Electrical Engineering andInformatics (ICEEI) Bandung Indonesia 17-19 Jun 2007 pp 966ndash969[Online] Available httpresearchmercubuanaacidproceedingH-14pdf[Accessdate10122013]

[63] D Liarokapis and A Shahrabi ldquoA Probability-Based Adaptive Scheme forBroadcasting in MANETsrdquo in the Proceedings of the 6th InternationalConference on Mobile Technology Application and Systems NiceFrance ACM 10-13 Sep 2009 pp 235ndash239 [Online] Availablehttpdxdoiorg10114517100351710081

227

[64] A K Ahmad and N Mitton ldquoAdapting Dynamically Neighbourhood TableEntry Lifetime in Wireless Sensor Networksrdquo in the Preceding of the 10thInternational Conference on Wireless Communications and Signal ProcessingUniv Lille 1 Lille France 21-23 Oct 2010 pp 1ndash6 [Online] Availablehttpdxdoiorg101109WCSP20105633707

[65] D Chen and P K Varshney ldquoA Survey of Void Handling Techniques forGeographic Routing in Wirless Networksrdquo IEEE Communications Surveysamp Tutorials vol 9 no 1 pp 50ndash67 Jan 2007 [Online] Availablehttpdxdoiorg101109COMST2007358971

[66] J Na Y-J Kim and R Govindan ldquoMinimizing Recovery Overhead inGeographic Ad Hoc Routingrdquo Computer Communications vol 33 no 11pp 1343ndash1353 Jul 2010 [Online] Available httpdxdoiorg101016jcomcom201003021

[67] B Leong S Mitra and B Liskov ldquoPath Vector Face Routing GeographicRouting with Local Face Informationrdquo in the Proceeding of the 13thIEEE International Conference on Network Protocols (ICNP rsquo05) BostonMA USA 6-9 Nov 2005 pp 147ndash158 [Online] Available httpdxdoiorg101109ICNP200532

[68] C Jayapal and S Vembu ldquoPerformance Evaluation of Hole AvoidanceTechniques in Geographic Forwarding for Mobile Ad Hoc NetworksrdquoInternational Journal of Information Technology Convergence and Services(IJITCS) vol 1 no 4 pp 21ndash32 Aug 2011 [Online] AvailablehttpwwwdocshutcomhohohohohohohohoiIjitcshtml

[69] W Kieb H Fubler J Widmer and M Mauve ldquoHierarchical Location Servicefor Mobile Ad-Hoc Networksrdquo ACM SIGMOBILE Mobile Computing andCommunications Review vol 8 no 4 pp 47ndash58 Oct 2004 [Online] Avail-able httpdoiacmorg10114510528711052875[Accessdate10122013]

[70] M Ayaida H Fouchal L Afilal and Y Ghamri-Doudane ldquoA Comparisonof Reactive Grid and Hierarchical Location-Based Services for VANETsrdquoin the Proceeding of the IEEE Vehicular Technology Conference (VTC Fall)Queacutebec City Canada IEEE 3-6 Sept 2012 pp 1ndash5 [Online] Availablehttpdxdoiorg101109VTCFall20126398920

[71] C Liu and J Kaiser ldquoA Survey of Mobile Ad Hoc network Routing ProtocolsrdquoUniversity of Magdeburg Tech Rep 8 Oct 2005 [Online] Availablehttpvtsuni-ulmdedocs20055346vts_5346pdf[Accessdate10122013]

[72] N Gupta and R Gupta ldquoRouting Protocols in Mobile Ad-Hoc Networksan Overviewrdquo in in the Proceedings of the International Conference onEmerging Trends in Robotics and Communication Technologies (INTERACT)Chennai IEEE 3-5 Dec 2010 pp 173ndash177 [Online] Availablehttpdxdoiorg101109INTERACT20105706220

[73] A Boukerche M Z Ahmad D Turgut and B Turgut ldquoA Taxonomy ofRouting Protocols for Mobile Ad Hoc Networksrdquo in Algorithms and Protocols

228

for Wireless and Mobile Ad Hoc Networks New Jersey Wiley 2009 ch 5 pp129ndash164 [Online] Available httpdxdoiorg1010029780470396384ch5

[74] M G Rubinstein I M Moraes M E M Campista L H M K Costaand O C M B Duarte ldquoA Survey on Wireless Ad Hoc Networksrdquoin Mobile and Wireless Communication Networks (from InternationalFederation for Information Processing (IFIP)) ser IFIP Advances inInformation and Communication Technology G Pujolle Ed SpringerUS Aug 2006 vol 211 ch 1 pp 1ndash33 [Online] Available httpdxdoiorg101007978-0-387-34736-3[Accessdate10122013]

[75] N N Qadri and A Liotta ldquoAnalysis of Pervasive Mobile Ad HocRouting Protocolsrdquo in Computer Communications and Networks PervasiveComputing Springer 2010 ch 19 pp 433ndash453 [Online] Availablehttpdxdoiorg101007978-1-84882-599-419[Accessdate10122013]

[76] C Perkins and P Bhagwat ldquoHighly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computersrdquo in the Proceedings of theConference on Communications Architectures Protocols and Applications(SIGCOMM rsquo94) London England UK ACM 31 Aug-2 Sep Aug 31 -Sep 02 1994 pp 234ndash244 [Online] Available httpdxdoiorg101145190809190336

[77] D B Johnson and D A Maltz ldquoDynamic Source Routing in Ad HocWireless Networksrdquo in Mobile Computing ser The Kluwer InternationalSeries in Engineering and Computer Science T Imielinski and H KorthEds Springer US 1996 vol 353 ch 5 pp 153ndash181 [Online] Availablehttpdxdoiorg101007978-0-585-29603-6_5[Accessdate10122013]

[78] G Kumar Y Reddyr and MNagendra ldquoCurrent Research Work onRouting Protocols for MANET A Literature Surveyrdquo International Journalon Computer Science and Engineering (IJCSE) vol 2 no 3 pp 706ndash713 May 2010 [Online] Available wwwenggjournalscomijcsedocIJCSE10-02-03-82pdf

[79] S A K Al-Omari and P Sumari ldquoAn Overview of Mobile Ad HocNetworks for the Existing Protocols and Applicationsrdquo International Journalon Application of Graph Theory in Wireless Ad Hoc Networks and SensorNetworks (Graph-Hoc) vol 2 no 1 pp 87ndash110 Mar 2010 [Online]Available arxivorgpdf10033565[Accessdate10122013]

[80] S Parul K Arvind and T Jawahar ldquoPerformance Analysis of AODV DSRand DSDV Routing Protocols in Mobile Ad-hoc Network (MANET)rdquo Journalof Information Systems and Communication vol 3 no 1 pp 322ndash326 2012[Online] Available httpwwwbioinfoincontentsphpid=45[Accessdate10122013]

[81] T Camp J Boleng B Williams L Wilcox and W Navidi ldquoPerformanceComparison of Two Location Based Routing Protocols for Ad HocNetworksrdquo in the Proceeding of the 21st Annual Joint Conference of

229

the IEEE Computer and Communications Societies INFOCOMrsquo02 NewYork USA IEEE 23-27 Jun 2002 pp 1678ndash1687 [Online] Availablehttpdxdoiorg101109INFCOM20021019421[Accessdate10122013]

[82] H Fubler M Mauve H Hartenstein M Kasemann and D VollmerldquoA Comparison of Routing Strategies for Vehicular Ad-Hoc NetworksrdquoDepartment of Computer Science University of Mannheim AtlantaGeorgia USA Tech Rep TR-02-003 Jul 2002 [Online] Avail-able httpwwwcnuni-duesseldorfdepublicationsdetailsFuessler2002bhtml[Accessdate10122013]

[83] S Jain and S Sahu ldquoTopology vs Position based Routing Protocolsin Mobile Ad hoc Networks A Surveyrdquo International Journal ofEngineering Research amp Technology (IJERT) vol 1 no 3 pp 1ndash11 May2012 [Online] Available httpwwwijertorgbrowsemay-2012-editiondownload=34[Accessdate10122013]

[84] P H Dana ldquoGlobal Positioning System (GPS) Time Dissemination forReal-Time Applicationsrdquo Real-Time Systems vol 12 no 1 pp 9ndash40 Jan1997 [Online] Available httpwwwpdanacomPHDWWW_filesRtgpspdf[Accessdate10122013]

[85] N Bulusu J Heidemann and J Estrin ldquoGPS-less Low-Cost OutdoorLocalization for Very Small Devicesrdquo IEEE Personal CommunicationsJournal vol 7 no 5 pp 28ndash35 Oct 2000 [Online] Availablehttpdxdoiorg10110998878533[Accessdate10122013]

[86] K Abrougui P Richard Werner Nelem and A Boukerche ldquoPerformanceEvaluation of Location-Based Service Discovery Protocols for VehicularNetworksrdquo in the Proceeding of the IEEE International Conference onCommunications (ICC) Cape Town IEEE 23-27 May 2010 pp 1ndash5[Online] Available httpdxdoiorg101109ICC20105502662

[87] S M Das H Pucha and Y C Hu ldquoPerformance Comparison of ScalableLocation Services for Geographic Ad Hoc Routingrdquo in the Proceeding of the24th Annual Joint Conference of the IEEE Computer and CommunicationsSocieties (INFOCOM) Miami FL USA IEEE 13-17 Mar 2005 pp1228ndash1239 [Online] Available httpdxdoiorg101109INFCOM20051498349[Accessdate10122013]

[88] S Basagni I Chlamtac V R Syrotiuk and B A Woodward ldquoA DistanceRouting Effect Algorithm for Mobility (DREAM)rdquo in the Proceeding of the4th Annual ACMIEEE International Conference on Mobile Computing andNetworking Dallas Texas United States 25-30 Oct 1998 pp 76ndash84 [Online]Available httpdoiacmorg101145288235288254[Accessdate10122013]

[89] M Kasemann H Hartenstein and M M ldquoA Reactive Location Ser-vice for Mobile Ad Hoc Networksrdquo Department of Computer ScienceUniversity of Mannheim Tech Rep TR-14-2002 2002 [Online] Avail-able httpwwwcnuni-duesseldorfdepublicationsdetailsKaesemann2002chtml[Accessdate10122013]

230

[90] Z J Haas and B Liang ldquoAd Hoc Mobility Management with UniformQuorum Systemsrdquo IEEEACM Transactions on Networking vol 7 no 2 pp228ndash240 Apr 1999 [Online] Available httpdxdoiorg10110990769770[Accessdate10122013]

[91] L Jinyang J John S J D C Douglas R K David and M RobertldquoA Scalable Location Service for Geographic Ad Hoc Routingrdquo in theProceeding of the 6th Annual International Conference on Mobile Computingand Networking ser MobiCom rsquo00 New York NY USA ACM 6-11 Aug2000 pp 120ndash130 [Online] Available httpdoiacmorg101145345910345931[Accessdate10122013]

[92] C-C Hsu and I F I Chin-Laung Lei ldquoA Geographic Scheme withLocation Update for Ad Hoc Routingrdquo in the Proceeding of the 4thIEEE International Conference on Systems and Networks CommunicationsPorto IEEE 20-25 Sept 2009 pp 43ndash48 [Online] Available httpdxdoiorg101109ICSNC200983

[93] M Ayaida M Barhoumi H Fouchal Y Ghamri-Doudane and L AfilalldquoHHLS A hybrid Routing Technique for VANETsrdquo in the Proceeding of theIEEE Global Communications Conference (GLOBECOM) Anaheim CAIEEE 3-7 Dec 2012 pp 44ndash48 [Online] Available httpdxdoiorg101109GLOCOM20126503088

[94] Y-B Ko and N H Vaidya ldquoLocation-Aided Routing (LAR) in MobileAd Hoc Networksrdquo Wireless Networks vol 6 no 4 pp 307ndash321Jul 2000 [Online] Available httpdxdoiorg101023A1019106118419[Accessdate10122013]

[95] L Blazevic L Buttyan S Capkun S Giordano J-P Hubaux and J-Y LBoudec ldquoSelf Organization in Mobile Ad Hoc Networks the Approachof TERMINODESrdquo IEEE Communications Magazine vol 39 no 6 pp166ndash174 Jun 2001 [Online] Available httpdxdoiorg10110935925685[Accessdate10122013]

[96] H Takagi and L Kleinrock ldquoOptimal Transmission Ranges for RandomlyDistributed Packet Radio Terminalsrdquo IEEE Transactions on Communicationsvol 32 no 3 pp 246ndash257 Mar 1984 [Online] Available httpdxdoiorg101109TCOM19841096061

[97] R Nelson and L Kleinrock ldquoThe Spatial Capacity of A slotted ALOHAMultihop Packet Radio Network with Capturerdquo IEEE Transactions onCommunications vol 32 no 6 pp 684ndash694 Jun 1984 [Online] Availablehttpdxdoiorg101109TCOM19841096124

[98] E Kranakis H Singh and J Urrutia ldquoCompass Routing on GeometricNetworksrdquo in the Proceeding of the 11th Canadian Conference onComputational Geometry Vancouver Canada 15-18 Aug 1999 pp 51ndash54[Online] Available wwwcccgcaproceedings1999c46pdf[Accessdate10122013]

231

[99] T-C Hou and V Li ldquoTransmission Range Control in Multihop PacketRadio Networksrdquo IEEE Transactions in Communications vol 34 no 1 pp38ndash44 Jan 1986 [Online] Available httpdxdoiorg101109TCOM19861096436[Accessdate10122013]

[100] B N Karp ldquoGeographic Routing for Wireless Networksrdquo PhDDissertation Harvard University Cambridge Massachusetts 2000[Online] Available httpswww-newcompnusedusg~bleonggeographicrelatedkarp00geographicpdf[Accessdate10122013]

[101] J Gao and L Zhang ldquoLoad Balanced Short Path Routing in WirelessNetworksrdquo IEEE Transactions on Parallel and Distributed Systems vol 17no 4 pp 377ndash388 Apr 2006 [Online] Available httpdxdoiorg101109TPDS200649[Accessdate10122013]

[102] D Tran and H Raghavendra ldquoRouting with Congestion Awareness andAdaptivity in Mobile Ad Hoc Networksrdquo in the Proceeding of theIEEE Wireless Communications and Networking Conference (WCNC) NewOrleans USA 13-17 Mar 2005 pp 1988ndash1994 [Online] Availablehttpdxdoiorg101109WCNC20051424824

[103] N Tantubay D R Gautam and M K Dhariwal ldquoA Review of PowerConservation in Wireless Mobile Adhoc Network (MANET)rdquo InternationalJournal of Computer Science Issues (IJCSI) vol 8 no 4 pp 378ndash383 Jul2011 [Online] Available httpwwwijcsiorgpapersIJCSI-8-4-1-378-383pdf[Accessdate10122013]

[104] F Xue and P R Kumar ldquoThe Number of Neighbors Needed forConnectivity of Wireless Networksrdquo Wireless Networks Journal vol 10 no 2pp 169ndash181 Mar 2004 [Online] Available httpdxdoiorg101023BWINE000001308109837c0[Accessdate10122013]

[105] E M Royer P M Melliar-Smith and L E Moser ldquoAn Analysisof the Optimum Node Density for Ad hoc Mobile Networksrdquo in theProceedings of the IEEE International Conference In Communications(ICCrsquo01) Helsinki IEEE 11-14 Jun 2001 pp 857ndash861 [Online] Availablehttpdxdoiorg101109ICC2001937360[Accessdate10122013]

[106] N Ali R Ahmad and S Aljunid ldquoLink Availability Estimation for RoutingMetrics in MANETs An Overviewrdquo in International Conference on ElectronicDesign (ICED) Penang Malaysia IEEE 1-3 Dec 2008 pp 1ndash3 [Online]Available httpdxdoiorg101109ICED20084786686

[107] Z Cheng and W B Heinzelman ldquoDiscovering Long Lifetime Routes inMobile Ad Hoc Networksrdquo Ad Hoc Networks vol 5 no 6 pp 661ndash674 Jul2008 [Online] Available httpdxdoiorg101016jadhoc200706001

[108] E Y Hua and Z Z Haas ldquoAn Algorithm for Prediction of Link Lifetimein MANET Based on Unscented Kalman Filterrdquo IEEE CommunicationsLetters vol 13 no 10 pp 782ndash784 Oct 2009 [Online] Availablehttpdxdoiorg101109LCOMM2009090974[Accessdate10122013]

232

[109] M Shanudin M Ismail and R Saqour ldquoImpact of Mobility Metrics on GreedyAd Hoc Network Routing Protocol and Improvement Using Angular PredictionModelrdquo in the Proceeding of the 13th IEEE International Conference onNetworks Jointly held with the 7th Malaysia International Conference onCommunication Kuala Lumpur Malaysia 16-18 Nov 2005 pp 262ndash267[Online] Available httpdxdoiorg101109ICON20051635481

[110] Y Kim J-J Lee and A Helmy ldquoModeling and Analyzing the Impactof Location Inconsistencies on Geographic Routing in Wireless rdquo MobileComputing and Communications Review vol 8 no 1 pp 48ndash60Jan 2004 [Online] Available httpdoiacmorg101145980159980168[Accessdate10122013]

[111] R-H Cheng and C Huang ldquoEfficient Prediction-Based Location Updatingand Destination Searching Mechanisms for Geographic Routing in Mobile AdHoc Networksrdquo Journal Of Information Science And Engineering vol 28no 1 pp 115ndash129 Aug 2012 [Online] Available httpwwwiissinicaedutwpagejise2012201201_08html[Accessdate10122013]

[112] G T Toussaint ldquoThe Relative Neighbourhood Graph of a Finite Planar SetrdquoPattern Recognition vol 12 no 4 pp 261ndash268 1980 [Online] Availablehttpdxdoiorg1010160031-3203(80)90066-7[Accessdate10122013]

[113] R K Gabriel and R R Sokal ldquoA New Statistical Approach to GeographicVariation Analysisrdquo Systematic Biology vol 18 no 3 pp 259ndash278 Sep1969 [Online] Available httpdxdoiorg1023072412323

[114] K Jaffres-Runser C Comaniciu and J-M Gorce ldquoA MultiobjectiveOptimization Framework for Routing in Wireless Ad Hoc Networksrdquo Deptof Electrical and Computer Engineering Stevens Institute of TechnologyHoboken New-Jersey USA Research Report RR-7180 Jan 2010 [Online]Available httphalinriafrinria-00449010PDFRR-7180pdf[Accessdate10122013]

[115] M Heissenbuttel and T B ldquoOptimizing Neighbor Table Accuracy of Position-Based Routing Algorithmsrdquo in the Proceedings of the 24th Annual JointConference of the IEEE Computer and Communications Societies INFOCOMMiami FL USA 13-17 Mar 2005 pp 143ndash152 [Online] Available citeseerxistpsueduviewdocsummarydoi=101111625[Accessdate10122013]

[116] S Corson and J Macker ldquoMobile Ad Hoc Networking (MANET)Routing Protocol Performance Issues and Evaluation ConsiderationsrdquoNetwork Working Group RFC 2501 Jan 1999 [Online] Availablehttpwwwietforgrfcrfc2501txt

[117] K M Reineck ldquoEvaluation and Comparison of Network Simula-tion Toolsrdquo Master Thesis University of Applied Sciences Bonn-Rhein-Sieg Department of Computer Science Aug 2008 [Online]Available httpwwwprojektivnet63netdocReineck_-_Evaluation_and_Comparison_of_Network_Simulation_Toolspdf[Accessdate10122013]

233

[118] S R Das R Castantildeeda and J Yan ldquoSimulation-Based PerformanceEvaluation of Routing Protocols for Mobile Ad Hoc Networksrdquo MobileNetworks and Applications (MONET) Journal vol 5 no 3 pp 179ndash189Sep 2000 [Online] Available httpdxdoiorg101023A1019108612308[Accessdate10122013]

[119] R E Shannon ldquoDesign and Analysis of Simulation Experimentsrdquo in thePreceding of the 10th conference on Winter simulation WSC ser WSCrsquo78 vol 1 Piscataway NJ USA IEEE Press 1978 pp 55ndash61 [Online]Available httpdlacmorgcitationcfmid=800288811210

[120] O Al-Momani ldquoDynamic Redundancy Forward Error Correction Mechanismfor the Enhancement of Internet-based Video Streamingrdquo PhD ThesisUniversiti Utara Malaysia 2010 [Online] Available httpetduumedumy2523[Accessdate10122013]

[121] O Ghazali ldquoScaleable and Smooth TCP-friendly Receiver-based LayeredMulticast Protocolrdquo PhD Thesis Universiti Utara Malaysia 2008 [Online]Available httpetduumedumy1291[Accessdate10122013]

[122] R G Sargent ldquoValidation and Verification of Simulation Modelsrdquoin the Preceding of the 2011 Winter Simulation Conference (WSC)Phoenix Ariz USA 11-14 Dec 2011 pp 183ndash198 [Online] Availablehttpdxdoiorg101109WSC20116147750[Accessdate10122013]

[123] O Balci ldquoPrinciples of Simulation Model Validation Verification andTestingrdquo Transactions of the Society for Computer Simulation InternationalJournal vol 14 no 1 pp 3ndash12 Mar 1997 [Online] Availablehttpdlacmorgcitationcfmid=264096264099

[124] U Atta K Rehman M Sardar and O Mazliza ldquoA PerformanceComparison of Network Simulators for Wireless Networksrdquo arXiv preprintarXiv13074129 pp 1ndash6 Jul 2013 [Online] Available httparxivorgftparxivpapers130713074129pdf

[125] The Network Simulator - ns-2 [Online] Available httpwwwisiedunsnamns[Accessdate10122013]

[126] T Issariyakul and E Hossain Introduction to Network Simulator NS2 2nd edJuly 2008 [Online] Available httpdxdoiorg101007978-0-387-71760-9[Accessdate10122013]

[127] MATLAB Primer R2012b [Online] Available wwwmathworkscomhelppdf_docmatlabgetstartpdf[Accessdate10122013]

[128] The Network Simulator MatLap Documentation [Online] Availablehttpwireless-matlabsourceforgenet[Accessdate10122013]

[129] E Natsheh A B Jantan S Khatun and S Shamala ldquoA Survey onFuzzy Reasoning Applications for Routing Protocols in Wireless Ad HocNetworksrdquo International Journal of Business Data Communications and

234

Networking (IJBDCN) vol 4 no 2 pp 22ndash37 2008 [Online] Availablehttpdxdoiorg104018jbdcn2008040102

[130] L Zadeh ldquoFuzzy Setsrdquo Information and Control vol 8 no 3 pp 338ndash353Jun 1965 [Online] Available httpdxdoiorg101016S0019-9958(65)90241-X[Accessdate10122013]

[131] E Cox ldquoFuzzy Fundamentalsrdquo IEEE Spectrum Magazine vol 29 no 10 pp58ndash61 Oct 1992 [Online] Available httpdxdoiorg1011096158640

[132] V B Robinson ldquoA perspective on the fundamentals of fuzzy sets and their usein geographic information systemsrdquo Transactions in GIS vol 7 no 1 pp 3ndash30 Jan 2003 [Online] Available httpdxdoiorg1011111467-967100127

[133] E Mamdani and S Assilian ldquoAn Experiment in Linguistic Synthesiswith A Fuzzy Logic Controllerrdquo International Journal of Man-MachineStudies vol 7 no 1 pp 1ndash13 Jan 1975 [Online] Available httpdxdoiorg101016S0020-7373(75)80002-2

[134] J M Mendel ldquoFuzzy Logic Systems for Engineering A Tutorialrdquo Proceedingsof the IEEE vol 83 no 3 pp 345ndash377 Mar 1995 [Online] Availablehttpdxdoiorg1011095364485[Accessdate10122013]

[135] J Bas and A Neira ldquoA Fuzzy Logic System for Interference Rejection in CodeDivision Multiple Accessrdquo in the Preceding of the 12th IEEE internationalconference on fuzzy system (FUZZ) MO USA 25 - 28 May 2003 p 996ndash1001[Online] Available httpdxdoiorg101109FUZZ20031206567

[136] E Natsheh A B Jantan S Khatun and S Shamala ldquoAdaptive Optimizingof Hello Messages in Wireless Ad-Hoc Networksrdquo International Arab JournalInformation Technology vol 4 no 1 pp 191ndash200 Jan 2007 [Online]Available httpdblpuni-trierdedbjournalsiajitiajit4htmlNatshehJKS07a[Accessdate10122013]

[137] A Agarwal and S Das ldquoDead Reckoning in Mobile Ad Hoc Networksrdquoin the Proceeding of the IEEE Wireless Communications and Networking(WCNCrsquo03) New Orleans LA USA IEEE 20-20 Mar 2003 pp 1838ndash1843[Online] Available httpdxdoiorg101109WCNC20031200666

[138] C Bettstetter ldquoMobility Modeling in Wireless Networks CategorizationSmooth Movement and Boder Effectsrdquo ACM Mobile Computing andCommunications Review (SIGMOBILE) vol 5 no 3 pp 55ndash67 Jul 2001[Online] Available httpdoiacmorg101145584051584056

[139] T Camp J Boleng and V Davies ldquoA Survey of Mobility Models forAd Hoc Network Researchrdquo Wireless Communications amp Mobile Computing(WCMC) Special Issue On Mobile Ad Hoc Networking Research TrendsAnd Applications vol 2 no 5 pp 483ndash502 Aug 2002 [Online] Availablehttpdxdoiorg101002wcm72[Accessdate10122013]

235

[140] M Grossglauser and D Tse ldquoMobility Increases the Capacity of Ad HocWireless Networksrdquo IEEEACM Transactions on Networking vol 10 no 4pp 477ndash486 Aug 2002 [Online] Available httpdxdoiorg101109TNET2002801403[Accessdate10122013]

[141] F Bai N Sadagopan and A Helmy ldquoThe IMPORTANT Framework forAnalyzing the Impact of Mobility on Performance of Routing for Ad HocNetworksrdquo AdHoc Networks Journal vol 1 no 1 pp 383ndash403 Nov2003 [Online] Available httpdxdoiorg101016S1570-8705(03)00040-4[Accessdate10122013]

[142] J Yoon M Liu and B Noble ldquoRandom Waypoint Considered Harmfulrdquoin the Preceding of the 22ed Annual Joint Conference of the IEEEComputer and Communications (INFOCOM) San Fransisco CaliforniaUSA 30 Mar-3 Apr 2003 pp 1312ndash1321 [Online] Available httpdxdoiorg101109INFCOM20031208967[Accessdate10122013]

[143] W Navidi and T Camp ldquoStationary Distributions for the RandomWaypoint Mobility Modelrdquo IEEE Transactions on Mobile Computingvol 3 no 3 pp 99ndash108 Jan-Mar 2004 [Online] Available httpdxdoiorg101109TMC20041261820[Accessdate10122013]

[144] J-Y Le Boudec and M Vojnovic ldquoPerfect Simulation and Stationarity ofA Class of Mobility Modelsrdquo in the Preceding of the IEEE 24th AnnualJoint Conference of the IEEE Computer and Communications SocietiesMiami FL USA 13-17 Mar 2005 pp 2743 ndash 2754 [Online] Availablehttpdxdoiorg101109INFCOM20051498557[Accessdate10122013]

[145] G Mohimani F Ashtiani A Javanmard and M Hamdi ldquoMobility ModelingSpatial Traffic Distribution and Probability of Connectivity for Sparseand Dense Vehicular Ad Hoc Networksrdquo IEEE Transactions on VehicularTechnology vol 58 no 4 pp 1998 ndash 2007 May 2009 [Online] Availablehttpdxdoiorg101109TVT20082004266[Accessdate10122013]

[146] L Zhuoqun S Lingfen and E Ifeachor ldquoRange-based Mobility Estimationsin MANETs with Application to Link Availability Predictionrdquo in theProceedings of the IEEE International Conference on CommunicationsGlasgow IEEE 24-28 Jun 2007 pp 3376ndash3382 [Online] Availablehttpdxdoiorg101109ICC2007559

[147] D Veljan ldquoThe 2500-year-old Pythagorean Theoremrdquo Mathematics Magazinevol 73 no 4 pp 259ndash272 Oct 2000 [Online] Available wwwjstororgpss2690973[Accessdate10122013]

[148] S Bai Z Huang and J Jung ldquoBeacon-based Cooperative ForwardingScheme for Safety-related Inter-vehicle Communicationsrdquo in the Proceedingsof the 2010 International Conference on Computational Science and ItsApplications - Volume Part IV ser ICCSArsquo10 Berlin Heidelberg Springer-Verlag 2010 pp 520ndash534 [Online] Available httpdxdoiorg101007978-3-642-12189-0_45

236

[149] D Triantafyllidou and K Al Agha ldquoEvaluation of TCP Performancein MANETs using an Optimized Scalable Simulation Modelrdquo in theProceedings of the 15th International Symposium on Modeling Analysisand Simulation of Computer and Telecommunication Systems (MASCOTSrsquo07) Istanbul 24-26 Oct 2007 pp 31 ndash 37 [Online] Availablehttpdxdoiorg101109MASCOTS200725

[150] D Perkins H Hughes and C Owen ldquoFactors Affecting the Performanceof Ad Hoc Networksrdquo in the proceeding of the IEEE InternationalConference on Communication (ICCrsquo02) New York NY USA IEEE28 Apr - 2 May 2002 pp 2048ndash2052 [Online] Available httpdxdoiorg101109ICC2002997208[Accessdate10122013]

[151] S H Kurkowski ldquoCredible Mobile Ad Hoc Network Simulation-basedStudiesrdquo PhD Dissertation Faculty and the Board of Trustees ofthe Colorado School of Mines Golden CO USA 2006 [Online]Available httpwwwdticmilget-tr-docpdfLocation=U2ampdoc=GetTRDocpdfampAD=ADA462915[Accessdate10122013]

[152] K Stuart N William and C Tracy ldquoDiscovering Variables thatAffect MANET Protocol Performancerdquo in the Proceeding of the IEEEGlobal Telecommunications Conference (GLOBECOMrsquo07) WashingtonDC IEEE 26-30 Nov 2007 pp 1237ndash1242 [Online] Available httpdxdoiorg101109GLOCOM2007238

[153] M Hyland B Mullins R Baldwin and M Temple ldquoSimulation-basedPerformance Evaluation of Mobile Ad Hoc Routing Protocols in A Swarmof Unmanned Aerial Vehiclesrdquo in the Preceding of the 21st InternationalConference on Advanced Information Networking and Applications Workshops(AINAWrsquo07) IEEE 21-23 May 2007 pp 249ndash256 [Online] Availablehttpdxdoiorg101109AINAW2007336

[154] K Stuart N William and C Tracy ldquoConstructing MANET SimulationScenarios that Meet Standardsrdquo in the Preceding of the IEEE InternatonalConference on Mobile Adhoc and Sensor Systems Pisa IEEE 8-11 Oct2007 pp 1ndash9 [Online] Available httpdxdoiorg101109MOBHOC20074428640

[155] R G Sargent ldquoValidation and Verification of Simulation Modelsrdquoin the Proceedings of the 2008 Winter Simulation Conference no bdquoFlorida USA 7-10 Dec 2008 pp 157ndash169 [Online] Available httpdlacmorgcitationcfmid=15167441516780[Accessdate10122013]

[156] T C M GROUP Wireless and Mobility Extensions to ns-2 THE CMUMONARCH GROUP Oct 1999 [Online] Available httpwwwmonarchcscmueducmu-nshtmlAccessdate10122013

[157] R Santos O Alvarez and A Edwards ldquoPerformance Evaluation of twoLocation-based Routing Protocols in Vehicular Ad-Hoc Networksrdquo in theproceeding of the IEEE 62nd Vehicular Technology Conference (VTCrsquo05)

237

vol 4 Dallas Texas USA 25-28 Sept 2005 pp 2287 ndash 2291 [Online]Available httpdxdoiorg101109VETECF20051558956

[158] J Broch D A Maltz D B Johnson Y C Hu and J JetchevaldquoA Performance Comparison of Multi-hop Wireless Ad Hoc NetworkRouting Protocolsrdquo in the Proceedings of the 4th annual ACMIEEEinternational conference on Mobile computing and networking DallasTexas USA ACM Oct 1998 pp 85ndash97 [Online] Available httpdoiacmorg101145288235288256[Accessdate10122013]

[159] G Almes S Kalidindi A Morton and M Zekauskas ldquoA One-Way DelayMetric for IPPM (draft-morton-ippm-2679-bis-00)rdquo Network Working GroupRFC 4656 2012 [Online] Available httpwwwhjpatdocrfcrfc4656html

[160] S Charcranoon ldquoMeasurement Architecture to Obtain Per-hop One-way PacketLoss and Delay in Multi-class Service Networksrdquo USA Patent 7292537 Nov2007 [Online] Available httpworldwideespacenetcompublicationDetailsbiblioCC=USampNR=7292537B2ampKC=B2ampFT=D[Accessdate10122013]

[161] IEEE Computer Society LAN MAN Standards Committee Wireless LANMedium Access Protocol (MAC) and Physical Layer (PHY) SpecificationIEEE Std 80211-1997 The Institute of Electrical and Electronics EngineersNew York NY 1997 [Online] Available wwwcsuiuceduhomeshaiyuncs598hlpapers80211-1999pdf[Accessdate10122013]

[162] H Chen and Y Li ldquoPerformance Model of IEEE 80211 DCF with VariablePacket Lengthrdquo IEEE Communications Letters vol 8 no 3 pp 186ndash188 Mar2004 [Online] Available httpdxdoiorg101109LCOMM2004823429

[163] J Simo Reigadas A Martinez-Fernandez J Ramos-Lopez and J Seoane-Pascual ldquoModeling and Optimizing IEEE 80211 DCF for Long-distanceLinksrdquo IEEE Transactions on Mobile Computing vol 9 no 6 pp 881ndash896Jun 2010 [Online] Available httpdxdoiorg101109TMC201027

[164] D Kim C-K Toh J-C Cano and P Manzoni ldquoA Bounding Algorithmfor the Broadcast Storm Problem in Mobile Ad Hoc Networksrdquo in thePreceding of the IEEE Wireless Communications and Networking (WCNC)vol 2 IEEE 16-20 Mar 2003 pp 1131ndash1136 [Online] Availablehttpdxdoiorg101109WCNC20031200530

[165] E M Royer S-J Lee and C E Perkins ldquoThe Effects of MAC Protocols onAd Hoc Network Communicationrdquo in the Proceedings of the IEEE WirelessCommunications and Networking Confernce (WCNC) vol 2 Santa BarbaraCA USA IEEE 23-28 Sep 2000 pp 543ndash548 [Online] Available httpdoiacmorg101109WCNC200090391120130314[Accessdate10122013]

[166] R Baumann S Heimlicher M Strasser and A Weibel ldquoA Survey on RoutingMetricsrdquo Computer Engineering and Networks Laboratory ETH-ZentrumSwitzerland Technical Report TIK262 Feb 2007 [Online] Availablehttpwwwbaumanninfopublictik262pdf[Accessdate10122013]

238

[167] Normalization Rank Tutoriall Kardi Teknomorsquos Personal Home Page[Online] Available httppeoplerevoleducomkardipersonalcvBriefCVhtm[Accessdate10122013]

[168] Y Wang X-Y Li W-Z Song M Huang and T Dahlberg ldquoEnergy-Efficient Localized Routing in Random Multihop Wireless Networksrdquo IEEETransactions on Parallel and Distributed Systems vol 22 no 8 pp1249ndash1257 Aug 2011 [Online] Available httpdxdoiorg101109TPDS2010198[Accessdate10122013]

[169] N Luttenberger and H Peters ldquoNode Degree-based Improved Hop CountWeighted Centroid Localization Algorithmrdquo in the Proceeding of the 17thConference on Communication in Distributed Systems (GIITG) vol 17 KielGermany Dagstuhl-Leibniz Center for computer science 8-11 Mar 2011 pp194ndash199 [Online] Available dropsdagstuhldeopusvolltexte20112972

[170] K Xu M Gerla and S Bae ldquoEffectiveness of RTSCTS Handshakein IEEE 80211 Based Ad Hoc Networksrdquo Ad Hoc Networks vol 1no 1 pp 107ndash123 Jul 2003 [Online] Available httpdxdoiorg101016S1570-8705(03)00015-5

[171] A Mohammad X H M Islam and K Zunnurhain ldquoDelay Analysisof Wireless Ad Hoc Networks Single vs Multiple Radiordquo in theProceedings of the IEEE 35th Conference on Local Computer Networks (LCN)Denver CO IEEE 10-14 Oct 2010 pp 814ndash820 [Online] Availablehttpdxdoiorg101109LCN20105735817

[172] J Li Z Li and P Mohapatra ldquoAdaptive Per Hop Differentiation forEnd-to-end Delay Assurance in Multihop Wireless Networksrdquo Ad HocNetw vol 7 no 6 pp 1169ndash1182 Aug 2009 [Online] Availablehttpdxdoiorg101016jadhoc200810005[Accessdate10122013]

239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background

13 Motivation and Research Problem

14 Research Goal and Objectives

15 Research Scope

16 Research Assumptions

17 Key Research Steps

18 Thesis Organization

2 BACKGROUND AND RELATED WORK

21 Overview

22 Routing in Mobile Ad Hoc Networks

23 Position-based Routing Protocolsrsquo Structure and Operations

231 Position Information and Location Services Methods

232 Geographic Routing Process

24 Packet Forwarding Strategies (Primary Mode)

241 Greedy Forwarding Strategies

2411 Most Forward within Transmission Range

2412 Random Progress Forwarding

2413 Compass Routing

2414 Nearest with Forward Progress

2415 Greedy Forwarding Strategy

242 Advantages and Disadvantages of GFS over Others Criteria

25 Reasons behind GFS Failure in MANET

251 The Effects of Participating Nodesrsquo Conditions

2511 Congestion Problem

2512 Battery Power Problem

2513 Next-Relay Node Positive Degree Problem

2514 Local Maximum Problem

252 The Effects of Mobility Attributes

2521 Movement Direction Problem

2522 Movement Speed Problem

2523 Link Lifetime Problem

2524 Beacon Packet Interval Time Problem

2525 Neighbourhood Entry Lifetime Problem

253 The Effects of Position Inaccuracy of Participating Nodes

2531 Inaccuracy of Next-relay Node Information (INNI) Problem

2532 Inaccuracy in Destination Position Information (IDPI) Problem

254 Potential Problems Summary and Consequences

26 Current Literature Efforts to Solve GFS Failure

261 Recovery Strategies to Handle GFS Failure (RSGF)

2611 Greedy Perimeter Stateless Routing (GPSR) Protocol

2612 Position-based Opportunistic Routing (POR) Protocol

2613 Node Elevation Ad-hoc Routing (NEAR) Protocol

2614 Greedy Distributed Spanning Tree Routing (GDSTR) Protocol

2615 Yet Another Greedy Routing (YAGR) Protocol

2616 Summary of Existing Recovery Strategies in Position-based Routing Protocols

262 Supportive Enhancement for GFS (SEGF)

2621 Extensions on GFS based on Prioritization and Selection Process

2622 Summary of Prominent Works on Prioritization and Selection Process

2623 Extensions on GFS based on Beaconing-Update Scheme

2624 Summary of Extensions Works on Beaconing-Update

27 Qualitative Discussion and Directions of the Research

28 Research Application Tools and Concepts

281 Network Evaluation Techniques

2811 Network Simulator 2

282 MATLAB

283 Fuzzy Logic Controller

284 Mobility Prediction Using Dead-reckoning Model

285 Mobility Model

29 Summary of Chapter

3 DESIGN AND IMPLEMENTATION OF DBUM

31 Overview

32 Dynamic Beaconing-Update Mechanism Detailed Design and Objectives

33 Compulsory-update Technique Detailed Design

331 Urgent Beacon Message Structure

332 Urgent Beacon Message Design Goal

333 Scheduling Time to Emit Urgent Beacon Message

334 Check Time Identification by Using Fuzzy Logic

3341 Fuzzify Node Speed Input

3342 Fuzzify Check Time Output

3343 Fuzzy Rules and Fuzzy Inference

335 An Illustrative Example for DFLCH

336 Deviation Distance Identification

337 Tolerance Deviation Distance and Beaconing Decision Making

34 Neighbourhood Matrix Entries Management Detailed Design

341 Residual Link Lifetime Identification

35 Dynamic Beaconing-Update Mechanism Functionality

351 Participating Nodes Procedures

3511 Sender nodes

3512 Receiver Nodes

352 Workflow of the Dynamic Beaconing-Update Mechanism

36 Implementation of Dynamic Beaconing-Update Mechanism

361 Simulation Environment

3611 Traffic Generation

3612 Movement Model

3613 Simulation Input Parameters

362 Implementation and Verification of GPSR and POR

363 Dynamic Beaconing-Update Mechanism Validation

3631 DBUM Validation in Static Environment

3632 DBUM Validation in Mobile Environment

37 Implementation of DBUM to Assign TOD and Fuzzy Delay in CUT

371 Optimal Tolerance Deviation Distance Calculation

3711 Deviation Distance and Nodes Speed

3712 Deviation Distance and Inconsistency of Neighbourhood Matrix

3713 Deviation Distance and Control Overhead

372 Fuzzy Processing Delay


4 DESIGN AND IMPLEMENTATION OF DRESM

41 Overview

42 DRESM Detailed Design and Objectives

43 IDOTM Detailed Design and Objectives

431 The IEEE80211 DCF Address Filtering Modification

432 The Four Handshaking Packets Re-construction Modification

4321 Request To Forward Packet Design

4322 Clear To Forward Packet Design

4323 DATA Packet Design

4324 Acknowledgement Packets Design

433 The Network Allocation Vector (NAV) Modification

434 RTFCTFDATA Beacon Packet Like

435 Forwarding Candidate Number Restriction

436 Destination Prediction Scheme

44 FLDRE Detailed Design and Objectives

441 Detailed Design of the Proposed Prioritization Metrics

4411 Distance to Destination Identification

4412 Motion Speed and Direction

4413 Residual Links Lifetime

4414 Unoccupied Buffer Length

4415 Residual Battery Power

4416 Next Relay-node Positive Degree

442 Dynamic Reliability Estimation using Fuzzy Logic

4421 Fuzzify Selected Metrics Input

4422 Fuzzify Reliability Index Output


4424 Defuzzification

45 DRESM Functionality with An Illustrative Example


4511 Source Node

4512 Positive and Candidate Neighbour

4513 Optimal Neighbour

4514 Sub-optimal Neighbours

4515 Other Neighbours

452 Workflow of DRESM

4521 Procedures Performed by Source (Originator) Node

4522 Procedures Performed when A Node Receive CTF Packet

4523 Procedures Performed when A Node Receive an ACK Packet

4524 Procedures Performed when A Node Receive RTF Packet

4525 Procedures Performed when a Node Receive a DATA Packet

46 Implementation of DRESM



463 DRESM Verification and Validation

4631 DRESM Validation in Static Environment

4632 DRESM Validation in Mobile Environment (Simple Case)

47 Implementation of DRESM to Assign Fuzzy Delay in FLDRE


5 GREEDY STANDALONE POSITION-BASED ROUT-02cm ING PROTOCOL IN MANET

51 Overview

52 Greedy Standalone Routing GSAR Protocol Design

53 Simulation Results and Evaluations

531 Simulation1 Impact of Varying Node Speed

5311 Packet Delivery Ratio Vs Node Speed

5312 Control Overhead Vs Node Speed

5313 End-to-End Delay Vs Node Speed

5314 Routing Path Stretch Vs Node Speed


5316 Number of Hole Problem Occurrence Vs Node Speed

5317 Summary Results of Varying Node Speed

532 Simulation 2 Impact of Varying Number of Nodes

5321 Packet Delivery Ratio Vs Number of Nodes

5322 Control Overhead Vs Number of Nodes

5323 End-to-End Delay Vs Number of Nodes

5324 Routing Path Stretch Vs Number of Nodes

5325 Inconsistency of Neighbourhood Matrix Vs Number of Nodes

5326 Number of Hole Problem Occurrence Vs Number of Nodes

5327 Summary Results of Varying Number of Nodes

533 Simulation 3 Impact of Varying the Number of Traffic Sources


5332 Control Overhead Vs Number of Data Traffic Sources

5333 End-to-End Delay Vs Number of Data Traffic Sources


5335 Inconsistency of Neighbourhood Matrix Vs Number of Data Traffic Sources

5336 Number of Hole Problem Occurrence Vs Number of Data Traffic Sources

5337 Summary Results of Varying Number of Data Traffic Sources

54 Greedy Standalone Routing GSAR Protocol Features

55 Advantages of Dynamic Beaconing-Update Mechanism

56 Advantages of the Dynamic and Reactive Reliability Estimation with Selective Metrics Mechanism


6 CONCLUSION AND FUTURE WORK

61 Overview

62 Summarization

63 Contributions

64 Significance of the Contributions

65 Future Work

REFERENCES

Appendices

A 05cm GPSR Routing Protocol Validation

A1 GPSR Simulation Results

B 05cm FLDRE Fuzzy Rules

B1 Proposed Rules Table

C 05cm DRESM Functionality with Example

C1 RLT Estimation

C2 Reliability Estimation for Node A and B

D 05cm Evaluation Metrics and Results Credibility

D1 Evaluation of the Proposed Algorithms and Results Analysis

D11 The Rationale of the Compared Protocols Formulation

D12 Performance Evaluation Metrics

D121 Packet Delivery Ratio

D122 Control Overhead

D123 End-to-End Delay

D124 Routing Path Stretch

D125 Inconsistency of Neighbourhood Matrix

D126 Number of Hole Problem Occurrence

D13 Results Credibility

Permission to Use

In presenting this thesis in fulfilment of the requirements for a postgraduate degree

from Universiti Utara Malaysia I agree that the Universiti Library may make it freely

available for inspection I further agree that permission for the copying of this thesis

in any manner in whole or in part for scholarly purpose may be granted by my su-

pervisor(s) or in their absence by the Dean of Awang Had Salleh Graduate School of

Arts and Sciences It is understood that any copying or publication or use of this thesis

or parts thereof for financial gain shall not be allowed without my written permission

It is also understood that due recognition shall be given to me and to Universiti Utara

Malaysia for any scholarly use which may be made of any material from my thesis

Requests for permission to copy or to make other use of materials in this thesis in

whole or in part should be addressed to

Dean of Awang Had Salleh Graduate School of Arts and Sciences

UUM College of Arts and Sciences

Universiti Utara Malaysia

06010 UUM Sintok

i

Abstrak



ii

Abstract



iii

Declaration


below





pp 36-41





Sep 2012 pp 42-47





2012










iv

Acknowledgements




























v































vi

Table of Contents

Permission to Use i

Abstrak ii

Abstract iii

Declaration iv

Acknowledgements v


List of Tables xiv

List of Figures xvi




11 Overview 1

12 Background 1



15 Research Scope 6





21 Overview 10








vii





















Problem 33








Protocol 43




viii



Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













Abstrak



ii

Abstract



iii

Declaration


below





pp 36-41





Sep 2012 pp 42-47





2012










iv

Acknowledgements




























v































vi

Table of Contents

Permission to Use i

Abstrak ii

Abstract iii

Declaration iv

Acknowledgements v


List of Tables xiv

List of Figures xvi




11 Overview 1

12 Background 1



15 Research Scope 6





21 Overview 10








vii





















Problem 33








Protocol 43




viii



Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













Abstract



iii

Declaration


below





pp 36-41





Sep 2012 pp 42-47





2012










iv

Acknowledgements




























v































vi

Table of Contents

Permission to Use i

Abstrak ii

Abstract iii

Declaration iv

Acknowledgements v


List of Tables xiv

List of Figures xvi




11 Overview 1

12 Background 1



15 Research Scope 6





21 Overview 10








vii





















Problem 33








Protocol 43




viii



Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













Declaration


below





pp 36-41





Sep 2012 pp 42-47





2012










iv

Acknowledgements




























v































vi

Table of Contents

Permission to Use i

Abstrak ii

Abstract iii

Declaration iv

Acknowledgements v


List of Tables xiv

List of Figures xvi




11 Overview 1

12 Background 1



15 Research Scope 6





21 Overview 10








vii





















Problem 33








Protocol 43




viii



Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













Acknowledgements




























v































vi

Table of Contents

Permission to Use i

Abstrak ii

Abstract iii

Declaration iv

Acknowledgements v


List of Tables xiv

List of Figures xvi




11 Overview 1

12 Background 1



15 Research Scope 6





21 Overview 10








vii





















Problem 33








Protocol 43




viii



Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation











































vi

Table of Contents

Permission to Use i

Abstrak ii

Abstract iii

Declaration iv

Acknowledgements v


List of Tables xiv

List of Figures xvi




11 Overview 1

12 Background 1



15 Research Scope 6





21 Overview 10








vii





















Problem 33








Protocol 43




viii



Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













Table of Contents

Permission to Use i

Abstrak ii

Abstract iii

Declaration iv

Acknowledgements v


List of Tables xiv

List of Figures xvi




11 Overview 1

12 Background 1



15 Research Scope 6





21 Overview 10








vii





















Problem 33








Protocol 43




viii



Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation

































Problem 33








Protocol 43




viii



Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation















Process 47


lection Process 54







282 MATLAB 67






31 Overview 75














ix




















Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation
































Matrix 111





41 Overview 117







x































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation











































Packet 154


xi


Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation














Packet 155










51 Overview 172









183









Nodes 196

xii


Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation














Nodes 197




201




207






Sources 210







61 Overview 216




65 Future Work 220

REFERENCES 221

xiii

List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













List of Tables



ing Protocols 46


ment for GFS 54
























C Calculation 165

xiv





Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation

















Node Speed 187



Number of Nodes 200





Nodes A and B 244








xv

List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













List of Figures















GFS 33







(source [55]) 43







xvi



















Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation































Distance 112














xvii
















DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation




























DRESM 167



Protocol GSAR 173






Speed 184







xviii



ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation















ber of Nodes 197












Traffic Sources 210








xix

List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













List of Appendices





xx







BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation



















BP Beacon Packet



Bw Bandwidth

CHT Check Time


CR Compass Routing






DATA Data Packet













xxi















ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation



























ID Node Identity






LLT link lifetime












xxii





NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation

















NS Node Speed





















TTL Time To Live




xxiii

CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













CHAPTER ONE

INTRODUCTION

11 Overview







12 Background

















1

The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













The contents of

the thesis is for

internal user

only

REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













REFERENCES










221










222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















222











223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation























223










224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















224










225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















225











226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation























226










227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















227











228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation























228










229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















229










230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















230










231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















231











232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation























232










233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















233













234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation

























234












235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation
























235










236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















236










237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation






















237











238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation























238







239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation



















239

Front Matter

Permission to Use

Abstrak

Abstract

Declaration

Acknowledgements

Table of Contents

List of Tables

List of Figures

List of Appendices


Main Chapters

1 INTRODUCTION

11 Overview

12 Background



15 Research Scope





21 Overview














































282 MATLAB



285 Mobility Model



31 Overview

















3511 Sender nodes

3512 Receiver Nodes





3612 Movement Model














41 Overview




























4511 Source Node




















51 Overview
































61 Overview

62 Summarization

63 Contributions


65 Future Work

REFERENCES

Appendices






C1 RLT Estimation













GSAR: GREEDY STAND-ALONE POSITION-BASED …etd.uum.edu.my/4482/7/s92833_abstract.pdf · Abstract...

Documents

Transcript of GSAR: GREEDY STAND-ALONE POSITION-BASED …etd.uum.edu.my/4482/7/s92833_abstract.pdf · Abstract...