Image   A Dominance Protocol for Wireless Medium Access

Publications

Modified: 2007/06/20 15:38 by npereira - Categorized as: Publications
Edit

WiDom: A Dominance Protocol for Wireless Medium Access

Nuno Pereira, Björn Andersson and Eduardo Tovar
IEEE Transactions on Industrial Informatics, Vol. 3(2)
May 2007 []


In this paper, we address the problem of sharing a wireless channel among a set of sporadic message streams where a message stream issues transmission requests with real-time deadlines. We propose a collision-free wireless medium access control (MAC) protocol which implements static-priority scheduling, supports a large number of priority levels and is fully distributed. 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. The evaluation of the protocol with real embedded computing platforms is presented to show that the proposed protocol is in fact collision-free and prioritized. We measure the response times of our implementation and show that the response-time analysis developed for the protocol offers an upper bound on the response times.





Edit

Implementation of a Dominance Protocol for Wireless Medium Access

Nuno Pereira, Björn Andersson and Eduardo Tovar
12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06)
2006 []


Consider a distributed computer system such that every computer node can perform a wireless broadcast and when it does so, all Consider the problem of scheduling sporadic message transmission requests with deadlines. For wired channels, this has been achieved successfully using the CAN bus. For wireless channels, researchers have recently proposed a similar solution; a collision-free medium access control (MAC) protocol that implements static-priority scheduling. Unfortunately no implementation has been reported, yet. We implement and evaluate it to find that the implementation indeed is collision-free and prioritized. This allows us to develop schedulability analysis for the implementation. We measure the response times of messages in our implementation and find that our new response-time analysis indeed offers an upper bound on the response times. This enables a new class of wireless real-time systems with timeliness guarantees for sporadic messages and it opens-up a new research area: schedulability analysis for wireless networks.



Edit

Using a Prioritized MAC Protocol to Efficiently Compute Aggregated Quantities

Björn Andersson, Nuno Pereira and Eduardo Tovar
5th Intl Workshop on Real Time Networks (RTN'06)
2006 []


Consider a distributed computer system such that every computer node can perform a wireless broadcast and when it does so, all other nodes receive this message. The computer nodes take sensor readings but individual sensor readings are not very important. It is important however to compute the aggregated quantities of these sensor readings. We show that a prioritized medium access control (MAC) protocol for wireless broadcast can compute simple aggregated quantities in a single transaction, and more complex quantities with many (but still a small number of) transactions. This leads to significant improvements in the time-complexity and as a consequence also similar reduction in energy "consumption".



Edit

Disseminating Data Using Broadcast when Topology is Unknown

Björn Andersson, Nuno Pereira and Eduardo Tovar
26th IEEE Real-Time Systems Symposium (RTSS'05), Work-in-Progress Session
2005 []


Consider the problem of disseminating data from an arbitrary source node to all other nodes in a distributed computer system, like Wireless Sensor Networks (WSNs). We assume that wireless broadcast is used and nodes do not know the topology. We propose new protocols which disseminate data faster and use fewer broadcasts than the simple broadcast protocol.



Edit

Static-Priority Scheduling of Sporadic Messages on a Wireless Channel

Björn Andersson and Eduardo Tovar
9th International Conference on Principles of Distributed Systems (OPODIS'05)
2005 []


Consider the problem of scheduling sporadic messages with deadlines on a wireless channel. We propose a collision-free medium access control (MAC) protocol which implements static-priority scheduling and present a schedulability analysis technique for the protocol. The MAC protocol allows multiple masters and is fully distributed; 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.

Create a new Page ¦ All Pages ¦ Categories ¦ Administration ¦ File Management ¦ Login/Logout



Powered By ScrewTurn Wiki.