Download File - Computer Networks & Information Security
Download File - Computer Networks & Information Security Download File - Computer Networks & Information Security
A S B Geocast LAR Network Space Request Zone r X Y Geocast region 244
Geocast LAR If all routes between a geocast member and the source may contain nodes that are outside the request zone, geocast will not be delivered to that member Trade-off between accuracy and overhead Larger request zone increases accuracy but may also increase overhead Advantage of LAR for geocasting: No need to keep track of network topology Good approach when geocasting is performed infrequently 245
- 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: On-Demand Multicast Routing Protoco
- Page 229 and 230: On-Demand Multicast Routing Protoco
- Page 231 and 232: On-Demand Multicast Routing Protoco
- Page 233 and 234: On-Demand Multicast Routing Protoco
- 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: Geocasting based on Location-Aided
- 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 and 288: Impact of Collisions After collisi
- Page 289 and 290: Distributed Fair Scheduling DFS us
- Page 291 and 292: Fairness in Multi-Hop Networks Not
- Page 293 and 294: Balanced MAC degree of node j p_ij
Geocast LAR<br />
If all routes between a geocast member and the<br />
source may contain nodes that are outside the<br />
request zone, geocast will not be delivered to that<br />
member<br />
Trade-off between accuracy and overhead<br />
Larger request zone increases accuracy but may also<br />
increase overhead<br />
Advantage of LAR for geocasting: No need to keep<br />
track of network topology<br />
Good approach when geocasting is performed infrequently<br />
245
Change language