Download File - Computer Networks & Information Security
Download File - Computer Networks & Information Security Download File - Computer Networks & Information Security
Handling Partitions: AODV When failure of link (X,Y) results in a partition, the downstream node, say X, initiates Route Request If a Route Reply is not received in response, then node X assumes that it is partitioned from the group leader A new group leader is chosen in the partition containing node X If node X is a multicast group member, it becomes the group leader, else a group member downstream from X is chosen as the group leader 216
Merging Partitions: AODV If the network is partitioned, then each partition has its own group leader When two partitions merge, group leader from one of the two partitions is chosen as the leader for the merged network The leader with the larger identifier remains group leader 217
- 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: Handling a Link Failure: AODV Multi
- 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 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
Merging Partitions: AODV<br />
If the network is partitioned, then each partition has<br />
its own group leader<br />
When two partitions merge, group leader from one of<br />
the two partitions is chosen as the leader for the<br />
merged network<br />
The leader with the larger identifier remains group leader<br />
217