Download File - Computer Networks & Information Security
Download File - Computer Networks & Information Security Download File - Computer Networks & Information Security
A Power Aware Multi-Access Protocol (PAMAS) What should node C do when it wakes up and finds that D is transmitting to someone else B C does not know how long the transfer will last C D E Node A sending to B C stays powered off Node D sending to E C wakes up and finds medium busy 312
PAMAS PAMAS uses a control channel separate from the data channel Node C on waking up performs a binary probe to determine the length of the longest remaining transfer C sends a probe packet with parameter L All nodes which will finish transfer in interval [L/2,L] respond Depending on whether node C see silence, collision, or a unique response it takes varying actions Node C (using procedure above) determines the duration of time to go back to sleep 313
- 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
- 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: A Power Aware Multi-Access Protocol
- 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: Random Errors May Cause Fast Retran
- Page 355 and 356: Random Errors May Cause Fast Retran
- 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
A<br />
Power Aware Multi-Access Protocol (PAMAS)<br />
What should node C do when it wakes up and finds<br />
that D is transmitting to someone else<br />
B<br />
C does not know how long the transfer will last<br />
C<br />
D<br />
E<br />
Node A sending to B<br />
C stays powered off<br />
Node D sending to E<br />
C wakes up and<br />
finds medium busy<br />
312