Name: | Description: | Size: | Format: | |
---|---|---|---|---|
3.43 MB | Adobe PDF |
Advisor(s)
Abstract(s)
Consider the problem of sharing a wireless channel
between a set of computer nodes. Hidden nodes exist
and there is no base station. Each computer node hosts
a set of sporadic message streams where a message
stream releases messages with real-time deadlines. We
propose a collision-free wireless medium access
control (MAC) protocol which implements staticpriority
scheduling. The MAC protocol allows multiple
masters and is fully distributed. It neither relies on
synchronized clocks nor out-of-band signaling; it is an
adaptation to a wireless channel of the dominance
protocol used in the CAN bus. But unlike that protocol,
our protocol does not require a node having the ability
to receive an incoming bit from the channel while
transmitting to the channel. Our protocol has the key
feature of not only being prioritized and collision-free
but also dealing successfully with hidden nodes. This
key feature enables schedulability analysis of sporadic
message streams in multihop networks.