10.07.2015 Views

Deterministic protocols for real-time communication in multiple ...

Deterministic protocols for real-time communication in multiple ...

Deterministic protocols for real-time communication in multiple ...

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

S. Norden et al. / Computer Communications 22 (1999) 128–136 133Fig. 2. Effect of load on (a) SR,(b) ECU,(c) NTL.successfully. In the simulation plots, these <strong>protocols</strong> arelabelled as with an extension BE to <strong>in</strong>dicate ‘‘Best Ef<strong>for</strong>t’’.For the sake of completeness, we describe the PBCSMAprotocol as given below:The PBCSMA protocol• A message is characterized as critical, if its laxity is lessthan a predef<strong>in</strong>ed threshold, otherwise it is classified asnon-critical.• Transmission of a critical message beg<strong>in</strong>s with the broadcastof a notifier, similar to our protocol.• When a new message arrives and is classified as eithercritical or non-critical, and the channel is idle, themessage is sent. Otherwise (i.e., the channel is busy),if the message currently be<strong>in</strong>g transmitted is not critical,it is preempted to allow a critical message to besent.• Transmission of a non-critical message from a node isnot possible as long as the channel is busy. Also, themessage is not sent right after the channel becomesidle. The node waits <strong>for</strong> one slot, and if the channelrema<strong>in</strong>s idle, the message is sent.• Follow<strong>in</strong>g a collision, a non-critical message issuspended <strong>for</strong> the duration of a slot, and if that slot isnot occupied by a critical message, the non-criticalmessage is retransmitted with probability P i .• If a critical message collides, it is retransmitted immediatelywith probability P i .From the Figs. 2(a)–5(a), it can be observed that the SRoffered by LDCR is better than the other two <strong>protocols</strong> ofwhich the MDCR is better than PBCSMA. From Figs. 3(b)–5(b), the ECU obta<strong>in</strong>ed us<strong>in</strong>g LDCR is higher (better) thanthe other two because of its SR. Similarly, the NTL offeredby LDCR is closer to one as compared to the other <strong>protocols</strong>.The reasons <strong>for</strong> these observations are discussedbelow:• LDCR is better than PBCSMA: The reasons, why LDCRis an improvement over PBCSMA, are as follows. In thecase of the notifier of a critical message collid<strong>in</strong>g with thenotifier transmission of another critical message,PBCSMA will retransmit the <strong>in</strong>terrupted message withcerta<strong>in</strong> probability. When the threshold is large, onecould have several critical messages which require tobe transmitted. Repeated attempts at retransmission withoutproper arbitration <strong>in</strong> the CSMA fashion will lead toseveral collisions utiliz<strong>in</strong>g several slots which <strong>in</strong> turnleads to miss<strong>in</strong>g of message deadl<strong>in</strong>es. Whereas <strong>in</strong>LDCR-BE, by <strong>for</strong>c<strong>in</strong>g the threshold <strong>for</strong> critical messagesto be one, the protocol restricts the number of criticalmessages; <strong>in</strong> the event of collision, the arbitration isdone as per the pre order traversal of the CR treeFig. 3. Effect of a on (a) SR, (b) ECU, (c) NTL.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!