On Fair Coexistence of Wireless Networks via CSMA Based Transmission Algorithms episode artwork

EPISODE · Jun 24, 2009 · 1H 6M

On Fair Coexistence of Wireless Networks via CSMA Based Transmission Algorithms

from Hamilton Institute Seminars (iPod / small) · host Hamilton Institute

Speaker: Prof. M. Alanyali Abstract: This talk will touch on wireless coexistence issues that arise due to higher spatial density of spectrum usage. We consider a fairness perspective for autonomous scheduling of transmissions by distinct sessions, subject to constraints that are represented by a conflict graph. The emphasis is on randomized backoff-based CSMA algorithms. The resulting transmission dynamics is represented by a Markovian model whose analysis suggests practical challenges in fair sharing of spectrum by distinct sessions that subscribe to a common standard, as well as by those that do not possess a common signaling protocol.

Episode metadata supplied by the publisher feed · Published Jun 24, 2009

Embed this episode

NOW PLAYING

On Fair Coexistence of Wireless Networks via CSMA Based Transmission Algorithms

0:00 1:06:36

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

How long is this episode of Hamilton Institute Seminars (iPod / small)?

This episode is 1 hour and 6 minutes long.

When was this Hamilton Institute Seminars (iPod / small) episode published?

This episode was published on June 24, 2009.

Can I download this Hamilton Institute Seminars (iPod / small) episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!