Download File - Computer Networks & Information Security
Download File - Computer Networks & Information Security Download File - Computer Networks & Information Security
B1 = 15 B2 = 5 data Distributed Fair Scheduling (DFS) wait Weight of node 1 = 1 Weight of node 2 = 3 Assume equal packet size B1 = 10 B2 = 5 wait data B1 = 5 B2 = 5 Collision ! B1 = 15 (DFS actually picks a random value with mean 15) B2 = 5 (DFS picks a value with mean 5) 286
Impact of Collisions After collision resolution, either node 1 or node 2 may transmit a packet The two alternatives may have different fairness properties (since collision resolution can result in priority inversion) 287
- 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: Distributed Fair Scheduling (DFS) [
- 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
- 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
B1 = 15<br />
B2 = 5<br />
data<br />
Distributed Fair Scheduling (DFS)<br />
wait<br />
Weight of node 1 = 1<br />
Weight of node 2 = 3<br />
Assume equal<br />
packet size<br />
B1 = 10<br />
B2 = 5<br />
wait<br />
data<br />
B1 = 5<br />
B2 = 5<br />
Collision !<br />
B1 = 15 (DFS actually picks a random value<br />
with mean 15)<br />
B2 = 5 (DFS picks a value with mean 5)<br />
286