Global arrival rate of messages high power

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: es λ. Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 20 / 21 Application and Conclusion Application: Rate Control over multiple ALOHA Channels Consider K Unslotted Aloha Channels Infinite population of mobile terminals. Global arrival rate of messages λ. High power Transmission, Low Power Transmission with fixed per unit cost C H and C L . Unit time interval required for transmission Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 20 / 21 Application and Conclusion Application: Rate Control over multiple ALOHA Channels Consider K Unslotted Aloha Channels Infinite population of mobile terminals. Global arrival rate of messages λ. High power Transmission, Low Power Transmission with fixed per unit cost C H and C L . Unit time interval required for transmission Capture phenomenon: H-H/L-L: Both Packets lost, H-L: Lower power packet lost. Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 20 / 21 Application and Conclusion Application: Rate Control over multiple ALOHA Channels Consider K Unslotted Aloha Channels Infinite population of mobile terminals. Global arrival rate of messages λ. High power Transmission, Low Power Transmission with fixed per unit cost C H and C L . Unit time interval required for transmission Capture phenomenon: H-H/L-L: Both Packets lost, H-L: Lower power packet lost. λH , λL . Probability of Success: PlH = e−λl and PlL = e−(λl l l H H +λ L ) l Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 20 / 21 Application and Conclusion Application: Rate Control over multiple ALOHA Channels Consider K Unslotted Aloha Channels Infinite population of mobile terminals. Global arrival rate of messages λ. High power Transmission, Low Power Transmission with fixed per unit cost C H and C L . Unit time interval required for transmission Capture phenomenon: H-H/L-L: Both Packets lost, H-L: Lower power packet lost. λH , λL . Probability of Success: PlH = e−λl and PlL = e−(λl l l H H +λ L ) l The Channel cost is a decreasing function of probability of success. If we choose (-)Log function, then the costs are rendered linear. We can model it as a Non-atomic Hierarchical Routing game. Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 20 / 21 Application and Conclusion Conclusions and Future work Established a framework for analysing Non-Atomic Hierarchical Routing Games over parallel links. Extensions to General Topologies (like almost parallel networks)? More general non-symmetric models? Atomic Hierarchical Routing games. (Initial results not discussed today) Vijay Kamble (IIT Kharagpur, INDIA) Hierarchical Routing Games MURI meeting, Sept 9 2010 21 / 21...
View Full Document

Ask a homework question - tutors are online