Download File - Computer Networks & Information Security

More documents

Recommendations

Info

B1 = 10 B2 = 5 data Distributed Fair Scheduling (DFS) wait B1 = 10 B2 = 5 wait data Collision resolution B1 = 5 B2 = 5 wait da data 288
Distributed Fair Scheduling DFS uses randomization to reduce collisions Alleviates negative impact of synchronization DFS also uses a shifted contention window for choosing initial backoff interval 802.11 DFS Reduces priority inversion (which leads to short-term unfairness) 0 31 0 31 289
Page 1 and 2:
Mobile Ad Hoc Networks: Routing, MA
Page 3 and 4:
Introduction Unicast routing Mult
Page 5 and 6:
Coverage Not intended to be exhaus
Page 7 and 8:
Mobile Ad Hoc Networks Formed by w
Page 9 and 10:
Mobile Ad Hoc Networks (MANET) Mob
Page 11 and 12:
Many Applications Personal area ne
Page 13 and 14:
Many Variations Traffic characteri
Page 15 and 16:
Challenges Limited wireless transm
Page 17 and 18:
Research on Mobile Ad Hoc Networks
Page 19 and 20:
Assumption Unless stated otherwise
Page 21 and 22:
Why is Routing in MANET different ?
Page 23 and 24:
Proactive protocols Routing Protoco
Page 25 and 26:
Overview of Unicast Routing Protoco
Page 27 and 28:
A Flooding for Data Delivery B H S
Page 29 and 30:
Page 31 and 32:
Page 33 and 34:
A Flooding for Data Delivery B H
Page 35 and 36:
Flooding for Data Delivery: Advanta
Page 37 and 38:
Flooding of Control Packets Many p
Page 39 and 40:
A B Route Discovery in DSR H S E C
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Route Discovery in DSR Destination
Page 47 and 48:
Route Reply in DSR Route Reply can
Page 49 and 50:
A B Data Delivery in DSR H DATA [S,
Page 51 and 52:
DSR Optimization: Route Caching Ea
Page 53 and 54:
A B Use of Route Caching [S,E,F,J,D
Page 55 and 56:
Use of Route Caching: Can Reduce Pr
Page 57 and 58:
Route Caching: Beware! Stale cache
Page 59 and 60:
Dynamic Source Routing: Disadvantag
Page 61 and 62:
Flooding of Control Packets How to
Page 63 and 64:
X = last known location of node D,
Page 65 and 66:
LAR Only nodes within the request
Page 67 and 68:
LAR Variations: Adaptive Request Zo
Page 69 and 70:
Location-Aided Routing The basic p
Page 71 and 72:
Detour Routing Using Location Infor
Page 73 and 74:
Distance Routing Effect Algorithm f
Page 75 and 76:
Relative Distance Micro-Discovery R
Page 77 and 78:
Geographic Distance Routing (GEDIR)
Page 79 and 80:
Grid Location Service (GLS) [Li00Mo
Page 81 and 82:
Query Localization [Castaneda99Mobi
Page 83 and 84:
G F E B A S C D Query Localization:
Page 85 and 86:
Broadcast Storm Problem [Ni99Mobico
Page 87 and 88:
Solutions for Broadcast Storm Prob
Page 89 and 90:
Solutions for Broadcast Storms Dis
Page 91 and 92:
Ad Hoc On-Demand Distance Vector Ro
Page 93 and 94:
A B Route Requests in AODV H S E C
Page 95 and 96:
A B Route Requests in AODV H S E C
Page 97 and 98:
A Reverse Path Setup in AODV B H S
Page 99 and 100:
A B Route Reply in AODV H S E C I G
Page 101 and 102:
A Forward Path Setup in AODV B H S
Page 103 and 104:
Timeouts A routing table entry mai
Page 105 and 106:
Route Error When node X is unable
Page 107 and 108:
Link Failure Detection Hello messa
Page 109 and 110:
Why Sequence Numbers in AODV A B C
Page 111 and 112:
Summary: AODV Routes need not be i
Page 113 and 114:
Link Reversal Algorithm [Gafni81] A
Page 115 and 116:
Link Reversal Algorithm A B F C E G
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Link Reversal Algorithm Attempts t
Page 123 and 124:
Partial Reversal Method A B F C E G
Page 125 and 126:
Page 127 and 128:
Page 129 and 130:
Link Reversal Methods: Advantages
Page 131 and 132:
Link Reversal in a Partitioned Netw
Page 133 and 134:
Full Reversal in a Partitioned Netw
Page 135 and 136:
Full Reversal in a Partitioned Netw
Page 137 and 138:
Temporally-Ordered Routing Algorith
Page 139 and 140:
E D Partition Detection in TORA A N
Page 141 and 142:
E D Partition Detection in TORA A N
Page 143 and 144:
E D Partition Detection in TORA A F
Page 145 and 146:
E D Partition Detection in TORA A F
Page 147 and 148:
TORA Design Decision TORA performs
Page 149 and 150:
So far ... All nodes had identical
Page 151 and 152:
Core-Extraction Distributed Ad Hoc
Page 153 and 154:
Link State Propagation in CEDAR Th
Page 155 and 156:
H G B CEDAR: Core Maintenance A C E
Page 157 and 158:
H G B CEDAR Route Discovery A C E S
Page 159 and 160:
Advantages CEDAR Route discovery/ma
Page 161 and 162:
Proactive Protocols Most of the sc
Page 163 and 164:
Optimized Link State Routing (OLSR)
Page 165 and 166:
Optimized Link State Routing (OLSR)
Page 167 and 168:
OLSR OLSR floods information throu
Page 169 and 170:
Destination-Sequenced Distance-Vect
Page 171 and 172:
Hybrid Protocols 171
Page 173 and 174:
ZRP All nodes within hop distance
Page 175 and 176:
B F ZRP: Example with Zone Radius =
Page 177 and 178:
B F ZRP: Example with d = 2 A S C D
Page 179 and 180:
LANMAR Routing to Nodes Within Scop
Page 181 and 182:
LANMAR Routing to Nodes Outside Sco
Page 183 and 184:
Geodesic Routing Without Anchors [B
Page 185 and 186:
Routing Protocols discussed so far
Page 187 and 188:
Other Routing Protocols Plenty of
Page 189 and 190:
Power-Aware Routing [Singh98Mobicom
Page 191 and 192:
Power-Aware Routing Possible modifi
Page 193 and 194:
Associativity-Based Routing (ABR) [
Page 195 and 196:
Preemptive Routing [Goff01MobiCom]
Page 197 and 198:
Quality-of-Service Several proposa
Page 199 and 200:
Multicasting in Mobile Ad Hoc Netwo
Page 201 and 202:
Multicasting in MANET Need to take
Page 203 and 204:
AODV Group Sequence Number In our
Page 205 and 206:
Joining the Multicast Tree: AODV H
Page 207 and 208:
Joining the Multicast Tree: AODV H
Page 209 and 210:
Sending Data on the Multicast Tree
Page 211 and 212:
Since J is not a leaf node, it must
Page 213 and 214:
Leaving a Multicast Tree: AODV H C
Page 215 and 216:
Handling a Link Failure: AODV Multi
Page 217 and 218:
Merging Partitions: AODV If the ne
Page 219 and 220:
Merging Partitions: AODV Assume th
Page 221 and 222:
Q Merging Partitions: AODV B RREQ (
Page 223 and 224:
Group Hello (update) Q Merging Part
Page 225 and 226:
On-Demand Multicast Routing Protoco
Page 227 and 228:
Page 229 and 230:
Page 231 and 232:
Page 233 and 234:
Page 235 and 236:
ODMRP No explicit join or leave pr
Page 237 and 238: Geocasting in Mobile Ad Hoc Network
Page 239 and 240: Geocasting [Navas97Mobicom] Navas
Page 241 and 242: Simple Flooding-Based Geocasting U
Page 243 and 244: Geocasting based on Location-Aided
Page 245 and 246: Geocast LAR If all routes between
Page 247 and 248: Anycasting with Modified TORA [Ko20
Page 249 and 250: DAG for Anycasting Since links bet
Page 251 and 252: Geocasting using Modified Anycastin
Page 253 and 254: Other Geocasting Schemes [Macwan01
Page 255 and 256: Some Related Work Content-based Mu
Page 257 and 258: Capacity of Fixed Ad Hoc Networks [
Page 259 and 260: Continues from last slide … Dela
Page 261 and 262: Measured Scaling Law [Gupta01] Mea
Page 263 and 264: Medium Access Control Protocols 263
Page 265 and 266: Hidden Terminal Problem Node B can
Page 267 and 268: Reliability Wireless links are pro
Page 269 and 270: IEEE 802.11 Wireless MAC Distribut
Page 271 and 272: Collision Avoidance With half-dupl
Page 273 and 274: B1 = 25 B2 = 20 cw = 31 DCF Example
Page 275 and 276: MAC Protocols: Issues Hidden Termi
Page 277 and 278: Binary Exponential Backoff in DCF
Page 279 and 280: IEEE 802.11 Distributed Coordinatio
Page 281 and 282: Fairness Issue Assume that initial
Page 283 and 284: MACAW Solution for Fairness When a
Page 285 and 286: Distributed Fair Scheduling (DFS) [
Page 287: Impact of Collisions After collisi
Page 291 and 292: Fairness in Multi-Hop Networks Not
Page 293 and 294: Balanced MAC degree of node j p_ij
Page 295 and 296: Balanced MAC Results show that it
Page 297 and 298: Estimation-Based Fair MAC Fair sha
Page 299 and 300: Proportional Fair Contention Resolu
Page 301 and 302: Sender-Initiated Protocols The pro
Page 303 and 304: Using Receiver’s Help in a Sender
Page 305 and 306: Receiver-Based Adaptive Rate Contro
Page 307 and 308: Capacity and MAC Protocols The MAC
Page 309 and 310: Energy Conserving MAC Since many m
Page 311 and 312: A Power Aware Multi-Access Protocol
Page 313 and 314: PAMAS PAMAS uses a control channel
Page 315 and 316: Another Proposal in PAMAS To avoid
Page 317 and 318: UDP on Mobile Ad Hoc Networks 317
Page 319 and 320: UDP Performance Several relevant s
Page 321 and 322: UDP Performance Difficult to ident
Page 323 and 324: Overview of Transmission Control Pr
Page 325 and 326: Transmission Control Protocol (TCP)
Page 327 and 328: Cumulative Acknowledgements A new
Page 329 and 330: Window Based Flow Control Sliding
Page 331 and 332: Window Based Flow Control Congesti
Page 333 and 334: How does TCP detect a packet loss?
Page 335 and 336: Retransmission Timeout (RTO) calcul
Page 337 and 338: Fast Retransmission Timeouts can t
Page 339 and 340:
Congestion Avoidance and Control S
Page 341 and 342:
Congestion Control On detecting a
Page 343 and 344:
Congestion window (segments) 25 20
Page 345 and 346:
ssthresh = Fast Recovery min(cwnd,
Page 347 and 348:
Slow-start Congestion avoidance F
Page 349 and 350:
Performance of TCP Several factors
Page 351 and 352:
Random Errors May Cause Fast Retran
Page 353 and 354:
Page 355 and 356:
Page 357 and 358:
Sometimes Congestion Response May b
Page 359 and 360:
Burst Errors May Cause Timeouts If
Page 361 and 362:
Impact of Transmission Errors TCP
Page 363 and 364:
This Tutorial This tutorial consid
Page 365 and 366:
Mobile Ad Hoc Networks Mobility ca
Page 367 and 368:
Impact of Multi-Hop Wireless Paths
Page 369 and 370:
Ideal Throughput f(i) = fraction o
Page 371 and 372:
Impact of Mobility 20 m/s 30 m/s Id
Page 373 and 374:
Actual throughput But not always
Page 375 and 376:
mobility causes link breakage, resu
Page 377 and 378:
B C A Why Does Throughput Improve?
Page 379 and 380:
Network feedback How to Improve Thr
Page 381 and 382:
Actual throughput Performance Impro
Page 383 and 384:
Issues Network Feedback Network kn
Page 385 and 386:
To Cache or Not to Cache Average sp
Page 387 and 388:
Issues To Cache or Not to Cache Ca
Page 389 and 390:
TCP Performance Two factors result
Page 391 and 392:
Issues RTO After Route Repair Same
Page 393 and 394:
Impact of Acknowledgements TCP Ack
Page 395 and 396:
Security Issues 395
Page 397 and 398:
Security Issues in Mobile Ad Hoc Ne
Page 399 and 400:
Resurrecting Duckling [Stajano99]
Page 401 and 402:
Secure Routing Establishing a Cert
Page 403 and 404:
Techniques for Intrusion-Resistant
Page 405 and 406:
Intrusion Detection [Zhang00Mobicom
Page 407 and 408:
Packet Purse Model [Byttayn00MobiHo
Page 409 and 410:
Existing Implementations Several i
Page 411 and 412:
CMU Implementation: Lessons Learned
Page 413 and 414:
BBN Implementation [Ramanathan00Wcn
Page 415 and 416:
Link layer Implementation Issues: W
Page 417 and 418:
Implementation Issues: Address Assi
Page 419 and 420:
Implementation Issues: Security Ho
Page 421 and 422:
Implementation Issues Only some is
Page 423 and 424:
Distributed Algorithms for Mobile A
Page 425 and 426:
Distributed Algorithms There is al
Page 427 and 428:
Related Standards Activities 427
Page 429 and 430:
Internet Engineering Task Force (IE
Page 431 and 432:
Bluetooth [Haartsen98,Bhagawat00Tut
Page 433 and 434:
Bluetooth: Piconet A channel is ch
Page 435 and 436:
Bluetooth: Scatternet Several pico
Page 437 and 438:
Open Issues in Mobile Ad Hoc Networ
Page 439 and 440:
Related Research Areas Algorithms
Page 441:
Thank you !! For more information,
show all

Download File - Computer Networks & Information Security

Create successful ePaper yourself

Delete template?

Save as template?