<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>The Wi-STARK Architecture For Resilient Real-Time Wireless Communications</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Jeferson L. R. Souza jsouza@lasige.di.fc.ul.pt</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Departamento de Informática, Faculdade de Ciências, Universidade de Lisboa, Portugal Laboratório de Sistemas Informáticos de Grande-Escala (LaSIGE) Navigators Research Team</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2014</year>
      </pub-date>
      <abstract>
        <p>Networking communications play an important role to secure a dependable and timely operation of distributed and real-time embedded system applications; however, an e ective real-time support is not yet properly addressed in the wireless realm. This paper presents Wi-STARK, a novel architecture for resilient and real-time wireless communications within an one-hop communication domain. Low level reliable (frame) communications, node failure detection, membership management, and networking partition control are provided; since these low level services extend and build upon the exposed interface o ered by networking technologies, Wi-STARK is in strict compliance with wireless communication standards, such as IEEE 802.15.4 and IEEE 802.11p. The Wi-STARK service interface is then o ered as operating system primitives, helpful for building distributed control applications. The one-hop dependability and timeliness guarantees o ered by Wi-STARK are a fundamental step towards an e ective design of real-time wireless networks with multiple hops, including end-to-end schedulability analysis of networking operations.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;wireless communications</kwd>
        <kwd>real-time</kwd>
        <kwd>dependability</kwd>
        <kwd>timeliness</kwd>
        <kwd>resilience</kwd>
        <kwd>fault tolerance</kwd>
        <kwd>Wi-STARK</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>This work was partially supported by the EC, through project
IST-FP7-STREP-288195 (KARYON); by FCT/DAAD, through
the transnational cooperation project PROPHECY; and by FCT,
through project PTDC/EEI-SCR/3200/2012 (READAPT) and
through LaSIGE Strategic Project PEst-OE/EEI/UI0408/2014.</p>
    </sec>
    <sec id="sec-2">
      <title>1. INTRODUCTION AND MOTIVATION</title>
      <p>Advances in microelectronics enable the development and
integration of networking computing systems in environments
with di erent levels of criticality, monitoring and controlling
physical entities such as nuclear reactors, physical structure
of buildings and bridges, and power grids. In these kind
of environments, usually known as Cyber Physical Systems
(CPS), communications may have safety-critical constrains,
implying a mandatory provision of real-time communication
guarantees to secure the dependable and timely operation of
the entire system.</p>
      <p>The literature addressing real-time support on the wireless
realm can be classi ed into two distinct domains: (a)
communication protocols and architectures, and (b)
schedulability analysis.</p>
      <p>
        The contributions to real-time communication protocols and
architectures, such as [
        <xref ref-type="bibr" rid="ref16 ref17 ref18">16, 17, 18</xref>
        ], are concerned with the
provision of end-to-end guarantees within multiple hop
networks. However, some of them require strong assumptions
with respect a global notion of time (synchronised clocks
among all nodes of a multiple hop network), which is a
problem by itself without an easy solution. Furthermore, the
used error model only assumes the loss of data frames,
neglecting the e ects that control frame errors may have on the
operation of the Medium Access Control (MAC) sublayer,
which may generate network partitions during long periods
of time. These partitions may imply an unpredictable
temporal behaviour and thus those protocols and architectures
may, at the best, only provide probabilistic real-time
guarantees.
      </p>
      <p>
        The schedulability analysis of wireless networking
communications [
        <xref ref-type="bibr" rid="ref11 ref12 ref3">3, 11, 12</xref>
        ] aims to verify if all transmissions can
meet their deadlines for a given tra c workload,
considering the end-to-end temporal guarantees wanted for a target
network. Such end-to-end guarantees depend on the
realtime guarantees secured within each single hop. Single hop
guarantees can, on its turn, be derived from the temporal
behaviour provided by the networking technology
(communication protocols included), which must take into account
the expected error conditions.
      </p>
      <p>Conjugating dependability and real-time message delivery
guarantees with wireless communications is a di cult
problem. Instead of following the classic approach described in
the wireless communication literature, and trying to
establish those guarantees end-to-end |using a traditional
pointto-point communication model |we take a divide to conquer
approach, which is motivated by the following statement:
If no real-time guarantees can be o ered within
communications at one-hop of distance, no real-time
guarantees can be o ered within multiple hop communications
at all.</p>
      <p>That means, any dependable real-time message delivery
guarantee has to be secured rst within the one-hop of distance
wireless space, prior to be extended end-to-end, across
multiple hops. Thus, this paper presents a design overview
of a novel wireless communications architecture dubbed
Wi-STARK, which has three main goals: (1) taking
advantage of the intrinsic broadcast properties of the shared
wireless communication medium within one-hop space, (2)
providing dependability and real-time guarantees within such
one-hop space, and (3) ensuring the feasibility of end-to-end
schedulability analysis given the bounded transmission delay
guarantees within each single hop. The Wi-STARK design
is compliant with wireless communications standards,
being able to o er at the lowest level of communications a set
of useful and semantically rich services such as reliable and
timely communications, node failure detection, membership
management, and networking partition control. Since these
services are built upon the exposed interface o ered by
current networking technologies, the Wi-STARK architecture
can be easily implemented using Commercial O -The-Shelf
(COTS) components. The Wi-STARK service interface can
easily be made available at the operating system Application
Programming Interface (API).</p>
      <p>To present the details concerning the design of the
Wi-STARK architecture, this paper is organised as follows:
section 2 presents a brief description of the system model,
which is the foundation for the design of the Wi-STARK
architecture; section 3 presents the main components and
characteristics of the Wi-STARK architecture; section 4
presents the primitives and semantics of the Wi-STARK
service interface; and nally, section 5 presents the conclusion
and future directions of the design and applicability of the
Wi-STARK architecture.</p>
    </sec>
    <sec id="sec-3">
      <title>2. SYSTEM MODEL</title>
      <p>All networking communications described in this paper are
performed within the scope of a physical and data link layer
abstract networking model dubbed Wireless network
Segment (WnS), which establishes a broadcast domain where
all wireless nodes are one-hop of distance from one another.
This simple approach empowers the achievement of a rst
and fundamental result: the capability of exploiting the
broadcast nature of the shared one-hop communication space.
The formalisation of the WnS is expressed by a 4-Tuple,
def
W nS = hX; xm; C; W i, where X is the set of wireless nodes
members of the WnS; xm is the WnS coordinator, xm 2 X;
C represents a set of radio frequency (RF) communication
channels; and W represents the set of networking access
protocols utilised in the support of frame transmissions. As
illustrated in the graphical representation of Fig. 1, the
intersection of the communication range of all nodes within
the WnS constitutes its broadcast domain, where each node
xj 2 X is able to sense any transmission from any other
node xq 2 X.</p>
    </sec>
    <sec id="sec-4">
      <title>2.1 Fault Model</title>
      <p>The failure of a networking component (a channel c 2 C or
a node x 2 X) is identi ed using an omission fault model,
where frame errors are transformed into omissions. The
occurrence of frame errors may be originated by disturbances
caused by the presence of electromagnetic interferences on
the communication channel, or malfunction within the node
machinery, being accounted as omissions for the purpose of
monitoring networking components.</p>
      <p>For each received frame, each node x 2 X locally accounts
observed omissions. When the number of observed
omissions exceeds the component's omission degree bound, fo,
the failure of such component can be locally signed. Errors
occurred at the wireless communication medium may a ect
only some nodes, which implies omissions may be accounted
inconsistently at the di erent nodes of the WnS.
Both omissions with origin in the channel and at the channel
end-points (i.e., the nodes) are accounted for. When
successive frames are received with errors from a given channel
input | i.e. a node x 2 X | exceeding a given omission
degree bound, a node persistent failure is detected and
signalled; when no tra c is received from node x 2 X within
a bounded monitoring time interval, a node crash failure is
detected and signalled.</p>
      <p>
        Each node x 2 X may also inconsistently experience a
temporary loss of connectivity with the WnS, caused by a
phenomenon dubbed network inaccessibility [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. A period of
network inaccessibility may be induced by glitches in the
MAC sublayer operation, such as those that may result
from the omission of a MAC control frame (e.g., beacon).
The network cannot be considered failed; it only enters into
a temporary state where the communication service is not
WnS1 - Broadcast: correct nodes, receiving an uncorrupted
frame transmission, receive the same frame;
WnS2 - Frame Order : any two frames received at any two
correct nodes are received in the same order at both nodes;
WnS3 - Error Detection: correct nodes detect and signal
any corruption done during frame transmissions in a locally
received frame;
WnS4 - Bounded Omission Degree: in a known time
interval Trd, omission failures may occur in at most k transmissions;
WnS5 - Bounded Inaccessibility : in a known time interval
Trd, a wireless network segment may be inaccessible at most i
times, with a total duration of at most Tina;
WnS6 - Bounded Transmission Delay : any frame
transmission request is transmitted on the WnS, within a bounded
delay Ttd + Tina.
provided to some or all of the nodes. The loss of
connectivity due to transient node mobility is also treated under the
inaccessibility model.
      </p>
      <p>Mobility may drive nodes to outside of the WnS, as
illustrated in Fig. 1, where node x2 using channel c moves from
the geographic position P (x2) to the geographic position
P 0(x2). In despite of x2 transmissions at the new position
may reach all nodes of the WnS, the transmissions from the
WnS coordinator, xm 2 X, do not reach node x2 at
position P 0(x2). The permanent mobility of a node to outside of
the WnS broadcast domain is then transformed into a node
crash failure in our fault model.</p>
    </sec>
    <sec id="sec-5">
      <title>2.2 WnS abstract channel properties</title>
      <p>Communications at the lowest levels of the networking
protocol stack can be abstracted by a set of correctness,
dependability, and timeliness properties, which are not dependent
on any particular networking technology. In the context of
the WnS model such properties are seen as being provided
by a single abstract communication channel dubbed WnS
abstract channel, as illustrated in Fig. 2.</p>
      <p>
        Property WnS1 (Broadcast ) formalises that it is physically
impossible for a node x 2 X to send con icting
information (in the same broadcast) to di erent nodes, within the
broadcast domain of the WnS [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], BX (c), for a given channel
c 2 C (see Fig. 1).
      </p>
      <p>
        Property WnS2 (Frame Order ) is common in network
technologies (wireless technologies included), being imposed by
the wireless communication medium of each channel c 2 C,
and resulting directly from the serialisation of frame
transmissions on the shared wireless communication medium.
Property WnS3 (Error Detection) has both detection and
signalling facets; the detection facet, traditionally provided
by classical MAC sublayers, derives directly from frame
protection through a frame check sequence (FCS) mechanism,
which most utilised algorithm is the cyclic redundancy check
(CRC); the signalling facet is provided by the FCS
extension introduced in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], which is able to signal omissions
detected in frames received with errors. No fundamental
modi cations are needed to the wireless MAC standards,
such as IEEE 802.15.4 [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The use of such unconventional
extension is enabled by emerging controller technology, such
as reprogrammable technology and/or open core MAC
sublayer solutions, which are present, for example, in the
development kits from ATMEL [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. With the CRC polynomials
used in wireless MAC sublayers, the residual probability of
undetected frame errors is negligible [
        <xref ref-type="bibr" rid="ref4 ref5">4, 5</xref>
        ].
      </p>
      <p>
        Property WnS4 (Bounded Omission Degree) formalises for
a channel, c 2 C, the failure semantics introduced earlier in
the fault model de nition, being the abstract channel
omission degree bound, k fo. The omission degree of a WnS
abstract channel can be bounded, given the error
characteristics of its wireless transmission medium [
        <xref ref-type="bibr" rid="ref13 ref4 ref9">4, 9, 13</xref>
        ].
The Bounded Omission Degree property is one of the most
complex properties to secure in wireless communications.
Securing this property with optimal values and with a high
degree of dependability coverage may require the use of
multiple RF channels. In [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] we have advanced on how
this can be achieved by monitoring channel omission errors,
and switch between RF channels upon detecting the channel
omission degree bound has been exceeded.
      </p>
      <p>
        The time domain behaviour of a WnS is described by the
remaining properties. Property WnS6 (Bounded Transmission
Delay) speci es a maximum frame transmission delay, which
is Ttd in the absence of faults. The value of Ttd includes the
medium access and transmission delays and it depends on
message latency class and overall o ered load bounds [
        <xref ref-type="bibr" rid="ref10 ref6">6,
10</xref>
        ]. The value of Ttd does not include the e ects of
omission errors. In particular, Ttd does not account for possible
frame retransmissions. However, Ttd may include extra
delays resulting from longer WnS access delays derived from
subtle side-e ects caused by the occurrence of periods of
network inaccessibility [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Therefore, the bounded
transmission delay includes Tina, a corrective term that accounts
for the worst case duration of inaccessibility glitches, given
the bounds speci ed by property WnS5 (Bounded
Inaccessibility). The inaccessibility bounds depend on, and can
be predicted by the analysis of MAC sublayer
characteristics [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
      </p>
    </sec>
    <sec id="sec-6">
      <title>3. THE Wi-STARK ARCHITECTURE</title>
      <p>The Wi-STARK is a new low level architecture that takes
advantage of the intrinsic broadcast property of the shared
wireless communication medium, and of the set of
correctness, ordering, dependability, and timeliness properties
offered by the WnS abstraction (Section 2.2) to establish a
robust, resilient and real-time one-hop communication
domain for wireless networks.</p>
      <p>The Wi-STARK architecture design is open and exible,
being composed by two layers dubbed Channel Layer and
Mediator Layer. As shown in Fig. 3, these layers are by
design wrapping the standard MAC sublayer to improve:
the control and use of RF communication channels; and,
the services o ered to high level protocol layers.</p>
    </sec>
    <sec id="sec-7">
      <title>3.1 Channel Layer</title>
      <p>The Channel Layer (Fig. 4) is a thin layer that provides
a common interface to transparently control the use of a
given RF communication channel c 2 C for purposes of
frame transmission and reception, incorporating useful
extensions to enhance the dependability of communications. A
RF communication channel c 2 C is an abstract
representation of the wireless transmission medium plus a piece of
hardware dubbed RF transceiver, which conjugates a
residual part of the MAC sublayer, herein called, basicMAC and
the physical (PHY) layer itself.</p>
      <p>
        The Channel Layer extends the basicMAC to exploit the
exposed RF transceiver interface, and the parametrisation
features thereof. In particular, the Channel Layer
implements: the FCS extension (speci ed in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ]), which secures
the WnS3 property of the WnS; the accounting of channel
omissions and the detection of a RF communication
channel failure, upon exceeding the omission degree bound, k
(accordingly with WnS4); the RF communication channel
switch strategy speci ed in [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ].
      </p>
    </sec>
    <sec id="sec-8">
      <title>3.2 MAC Sublayer: serviceMAC</title>
      <p>
        The MAC sublayer illustrated in Fig. 3 is the standard MAC
sublayer present in the traditional wireless networking
protocol stack, such as those speci ed within the IEEE 802.15.4 [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
and IEEE 802.11p [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] wireless standards. In the context of
the Wi-STARK architecture such standard MAC sublayer
is dubbed serviceMAC, o ering only conventional unreliable
data frame and management service interfaces. No
modi cations are needed for its integration in the Wi-STARK
architecture. In this sense, the Wi-STARK architecture is
highly exible supporting the integration of any MAC
sublayer, including the real-time variants proposed in [
        <xref ref-type="bibr" rid="ref16 ref17">16, 17</xref>
        ].
      </p>
    </sec>
    <sec id="sec-9">
      <title>3.3 Mediator Layer</title>
      <p>The Mediator Layer is an extensible sublayer, specially
designed to mediate the communication ow from (and to) the
high level protocol layers, as illustrated in Fig. 3. The
Mediator Layer is responsible for the semantically rich service
interface o ered by Wi-STARK, e ectively augmenting the
services o ered by the standard MAC sublayer. Three main
components compose the Mediator Layer : the Real-Time
Communication Suite, the Timeliness &amp; Partition Control,
and the Networking &amp; Management Control.</p>
      <sec id="sec-9-1">
        <title>3.3.1 Real-time Communication Suite</title>
        <p>The Real-Time Communication Suite (RTCS) is the
component responsible for the data communication services o ered
by the Wi-STARK architecture, as illustrated in Fig. 5. The
RTCS includes a Message Request Dispatcher that forwards
any high level message transmit request to the adequate
instance of the RTCS protocol bundle. Messages submitted
at the Wi-STARK service interface have a maximum length
for allowing the encapsulation of their content in exactly one
frame, without necessity of fragmentation.</p>
        <p>The table of Fig. 5 speci es the fundamental properties
(recipients, ordering, and reliability) characterising the di
erent variants of the protocols to be included in the RTCS
protocol bundle. For example: a totally ordered reliable
message delivery targeting all correct nodes features the well
known atomic broadcast primitive. This speci cation is open
and extensible: other attributes (e.g., temporal order ) and
other properties (e.g., urgency) can be included.
The Wi-STARK architecture design provides two
fundamental guarantees to the high level protocol layers and
applications:
Temporal-bounded communications: every transmitted
message1 is successfully received by all relevant correct nodes
of the WnS within a known temporal bound, TT x Data.
The value of TT x Data is directly derived from the
combination of four important properties of the WnS: WnS3
(Error Detection), WnS4 (Bounded Omission Degree), WnS5
(Bounded Inaccessibility ), and WnS6 (Bounded
Transmission Delay). In the absence of errors, the Wi-STARK
protocols execute in a single round and the upper bound for
all correct nodes of the WnS receiving a message
successfully is: TTwxc Dnaeta = 2:Ttd; being Ttd the maximum frame
transmission delay in the absence of errors.
1A message is a high level protocol layer data service unit.</p>
        <p>Real-Time Communication Suite
Recipients</p>
        <p>Multiple nodes (Multicast);
Property
Ordering
Reliability</p>
        <p>Attributes
Single node (Unicast);</p>
        <p>All nodes (Broadcast)
Unordered; Totally ordered</p>
        <p>
          Unreliable; Reliable
In the presence of errors, frames2 may have to be
retransmitted and the protocols within the Wi-STARK architecture
may require more than one round to be executed, up to a
limit given by k + i + 1 (as speci ed by properties WnS4 and
WnS5); all relevant correct nodes can successfully receive
any message transmitted with any reliable
communication protocol provided by the Wi-STARK architecture
in, at most, TTwxc Data = (k + i + 1) (2:Ttd) + Tina. The
timer utilised by reliable protocols to control protocol
execution is con gured with its optimal value (i.e., Ttd), and
extended (if needed) by the real value of the network
inaccessibility, tina, adding up to at most Tina [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].
        </p>
        <p>A failure of the RF communication channel in use is detected
by the violation of k, the channel omission degree bound
(WnS4), being the Wi-STARK architecture able to switch
to another channel to keep the networking communications
operational; the duration of the \communication blackout"
resultant from that channel failure is then incorporated in
the network inaccessibility model through Tina.</p>
        <p>Message delivery : every transmitted message is delivered
to all relevant correct nodes of the WnS.</p>
        <p>Message delivery guarantees emerge from reliable
communication protocols of the Wi-STARK architecture, which
exploit the nature of the shared wireless communication
medium (properties WnS1 and WnS2) to o er totally
ordered delivery guarantees.
2A frame is the MAC sublayer protocol data unit.</p>
      </sec>
      <sec id="sec-9-2">
        <title>3.3.2 Timeliness &amp; Partition Control</title>
        <p>The Timeliness &amp; Partition Control (TPC) presents the
transversal components that deals with the temporal aspects
of the service o ered by the Wi-STARK architecture. As
shown in Fig. 6, the TPC component incorporates Time
Services that include the management of protocol timers and
other services used in the temporal control of Wi-STARK
components.</p>
        <p>
          The Partition Handler is focused to detect the occurrence,
and to be aware of any partitioning incidents caused by the
presence of periods of network inaccessibility. Controlling
networking inaccessibility allows the use of optimal timeout
values, which are automatically extended [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] when a
period of inaccessibility occurs, preventing the propagation of
premature timeout errors to other components and to high
protocol layers.
        </p>
      </sec>
      <sec id="sec-9-3">
        <title>3.3.3 Networking &amp; Management Control</title>
        <p>The Networking &amp; Management Control component
(illustrated in Fig. 7) incorporates all the functionalities of the
Mediator Layer responsible for managing the dependable
operation of each node x 2 X. The management
responsibilities assigned to the Mediator Layer include controlling
all internal con guration of the Wi-STARK architecture,
the parameters of the MAC sublayer (basicMAC and
serviceMAC included), and the provision of management
services to support the WnS formation.</p>
        <p>All con gurations can be performed statically or
dynamically. The static con guration is target for hard real-time
environments where all analyses of the tra c pattern,
error conditions, and mobility models are performed o ine,
being stored in the Wi-STARK Information Base (Fig. 7).
The Mediator Layer (self-)adaptation and dynamic con
guration capabilities are related with mixed-critical and soft
real-time requirements, which are outside the scope of this
paper.</p>
        <p>The membership and node failure detection o ered by the
Mediator Layer were designed to control and establish a
consistent view of all members of the WnS, which is represented
by the abstract set, X.</p>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>4. Wi-STARK DATA SERVICE INTERFACE</title>
      <p>In the perspective of networking protocol developers, the
dependability and timeliness guarantees o ered by the
Wi-STARK architecture are represented by a set of
fundamental primitives for transmission and reception of messages
to/from the network, which are speci ed in Table 1.
All of the primitives present in the Wi-STARK data service</p>
      <p>Wi-STARK data service interface</p>
      <p>Primitives
MLA.Data.request
MLA.Data.con rm</p>
      <p>Description
Requests a message transmission
using one of the Wi-STARK
communication protocols.</p>
      <p>For reliable services, it con rms
message delivery at recipients. Otherwise,
it con rms only message transmission.</p>
      <p>MLA.Data.indication Noti es the arrival of a message.
interface are easily integrated into embedded and real-time
operating systems, being available as system calls associated
to the wireless networking protocol stack.</p>
    </sec>
    <sec id="sec-11">
      <title>5. CONCLUSION</title>
      <p>This paper presented the architectural design of Wi-STARK,
a novel low level architecture for resilient and real-time
onehop wireless communications. The de nition of Wi-STARK
is based on the establishment of an abstract communication
model dubbed Wireless network Segment (WnS), which o er
a set of correctness, dependability, and timeliness properties
to support the design of resilient communication services for
wireless networks.</p>
      <p>Wi-STARK is compliant with wireless standards such as
IEEE 802.15.4 and IEEE 802.11p, being capable to o er
support for low level reliable message communication, node
failure detection and membership, and networking partition
control. Future directions involves the incorporation of the
Wi-STARK service interface in the API of embedded
realtime operating systems, and the extension of one-hop
guarantees for multi-hop networking scenarios.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>ATMEL</given-names>
            <surname>Coorporation</surname>
          </string-name>
          .
          <source>IEEE 802.15</source>
          .4
          <string-name>
            <given-names>MAC</given-names>
            <surname>Software</surname>
          </string-name>
          <article-title>Package - User guide</article-title>
          , May
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>O.</given-names>
            <surname>Babao</surname>
          </string-name>
          <article-title>~glu and</article-title>
          <string-name>
            <given-names>R.</given-names>
            <surname>Drummond</surname>
          </string-name>
          .
          <article-title>Streets of Byzantium: Network Architectures for Fast Reliable Broadcasts</article-title>
          .
          <source>IEEE Trans. on Soft. Engineering</source>
          , SE-
          <volume>11</volume>
          (
          <issue>6</issue>
          ),
          <year>June 1985</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>O.</given-names>
            <surname>Chipara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.-C.</given-names>
            <surname>Roman</surname>
          </string-name>
          .
          <article-title>Real-Time Query Scheduling for Wireless Sensor Networks</article-title>
          .
          <source>IEEE Trans. on Computers</source>
          ,
          <volume>62</volume>
          (
          <issue>9</issue>
          ),
          <year>September 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Eckhardt</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Steenkiste</surname>
          </string-name>
          .
          <article-title>Measurement and Analysis of The Error Characteristics of An In-Building Wireless Network</article-title>
          .
          <source>In 2nd SIGCOMM Conference</source>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>T.</given-names>
            <surname>Fujiwara</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Kasami</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kitai</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Lin</surname>
          </string-name>
          .
          <article-title>On The Undetected Error Probability for Shortened Hamming Codes</article-title>
          .
          <source>IEEE Trans. on Comm.</source>
          ,
          <volume>33</volume>
          (
          <issue>6</issue>
          ),
          <year>June 1985</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hameed</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Trsek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Graeser</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J.</given-names>
            <surname>Jasperneite</surname>
          </string-name>
          .
          <source>Performance Investigation And Optimization of IEEE 802.15</source>
          .
          <article-title>4 For Industrial Wireless Sensor Networks</article-title>
          .
          <source>In IEEE 13th ETFA Conference</source>
          ,
          <year>September 2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <source>[7] IEEE 802.11p. Wireless Access in Vehicular Environments - IEEE Standard 802.11p</source>
          ,
          <year>2010</year>
          . Amendment to IEEE Standard
          <volume>802</volume>
          .
          <fpage>11</fpage>
          -
          <lpage>2007</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <source>[8] IEEE 802.15.4. Part 15</source>
          .4:
          <string-name>
            <given-names>Wireless</given-names>
            <surname>Medium Access</surname>
          </string-name>
          <article-title>Control (MAC) And Physical Layer (PHY) Speci cations For Low-Rate Wireless Personal Area Networks (WPANs) -</article-title>
          <source>IEEE standard 802.15.4</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Petrova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Riihijarvi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Mahonen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Labella</surname>
          </string-name>
          .
          <source>Performance Study of IEEE 802.15</source>
          .
          <article-title>4 Using Measurements And Simulations</article-title>
          . In WCNC Conference, Las Vegas,
          <string-name>
            <surname>NV</surname>
          </string-name>
          , USA,
          <year>April 2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>I.</given-names>
            <surname>Ramachandran</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. K. Das</surname>
            , and
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Roy</surname>
          </string-name>
          .
          <source>Analysis of The Contention Access Period of IEEE 802.15.4 MAC. ACM Trans. on Sensor Networks</source>
          ,
          <volume>3</volume>
          ,
          <string-name>
            <surname>March</surname>
          </string-name>
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Saifullah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Lu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Priority Assignment For Real-Time Flows in WirelessHART Networks</article-title>
          .
          <source>In 23rd ECRTS Conference</source>
          ,
          <year>July 2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>W.</given-names>
            <surname>Shen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gidlund</surname>
          </string-name>
          , and
          <string-name>
            <given-names>F.</given-names>
            <surname>Dobslaw</surname>
          </string-name>
          .
          <article-title>SAS-TDMA: A Source Aware Scheduling Algorithm For Real-Time Communication In Industrial Wireless Sensor Networks</article-title>
          .
          <source>Springer Wireless Networks Journal</source>
          ,
          <volume>19</volume>
          (
          <issue>6</issue>
          ),
          <year>August 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J. L. R.</given-names>
            <surname>Souza</surname>
          </string-name>
          and
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Ru no. Characterization of inaccessibility in wireless networks -</article-title>
          <source>A Case Study on IEEE 802.15.4 Standard. In IFIP 3th IESS Conference</source>
          ,
          <year>September 2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J. L. R.</given-names>
            <surname>Souza</surname>
          </string-name>
          and
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Ru no. An Approach to Enhance The Timeliness of Wireless Communications</article-title>
          .
          <source>In 5th UBICOMM Conference</source>
          , Lisbon, Portugal,
          <year>November 2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>J. L. R.</given-names>
            <surname>Souza</surname>
          </string-name>
          and J. Ru no.
          <source>Analysing And Reducing Network Inaccessibility in IEEE 802.15</source>
          .
          <article-title>4 Wireless Communications</article-title>
          .
          <source>In IEEE 38th LCN Conference</source>
          , Sydney, Australia,
          <year>October 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Y.-H.</given-names>
            <surname>Wei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Q.</given-names>
            <surname>Leng</surname>
          </string-name>
          , S. Han,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Mok,
          <string-name>
            <given-names>W.</given-names>
            <surname>Zhang</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Tomizuka.</surname>
          </string-name>
          RT-WiFi:
          <article-title>Real-Time High-Speed Communication Protocol For Wireless Cyber-Physical Control Applications</article-title>
          . In IEEE34th RTSS Conference,
          <year>December 2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Xue</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Ramamurthy</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M. C.</given-names>
            <surname>Vuran</surname>
          </string-name>
          .
          <article-title>SDRCS: A Service-Di erentiated Real-Time Communication Scheme For Event Sensing in Wireless Sensor Networks</article-title>
          .
          <source>Computer Networks</source>
          ,
          <volume>55</volume>
          (
          <issue>15</issue>
          ),
          <year>June 2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhu</surname>
          </string-name>
          , S. Han,
          <string-name>
            <surname>P.-C. Huang</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Mok</surname>
            , and
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>MBStar: A Real-Time Communication Protocol For Wireless Body Area Networks</article-title>
          .
          <source>In 23rd ECRTS Conference</source>
          ,
          <year>July 2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>