23.03.2017 Views

wilamowski-b-m-irwin-j-d-industrial-communication-systems-2011

Create successful ePaper yourself

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

WirelessHART, ISA100.11a, and OCARI 53-7<br />

packet’s final destination is called a hop. WirelessHART networks can be implemented in a wide variety<br />

of topologies. In a high-performance scenario, a star topology is probably preferable (i.e., all devices are<br />

one hop to the gateway), while a multi-hop mesh topology is useful for a less demanding (e.g., monitoring)<br />

application. Obviously, any topology in between can also be realized.<br />

There can be also devices that lack the connection with the process but have only <strong>communication</strong><br />

facilities; they are routers, handheld devices (used for commissioning and/or maintenance purposes),<br />

and adapters (used to connect legacy hardware with the wireless network).<br />

Routing of data packets is based on graph routing rather than on the (optional) source address routing.<br />

Each pair of nodes is interconnected by several graphs, i.e., a directed list of paths that connect<br />

them. Both upstream (toward the gateway) and downstream graphs are used. Only the network manager,<br />

who is responsible for correctly configuring each graph, knows the entire route; the graph information<br />

within a node only indicates the next hop destinations. Consequently, devices in a graph route<br />

must be configured prior to its use; i.e., it must contain a list of all the links that can be used to forward<br />

a packet along the graph. Graph routing is redundant, highly reliable, and should be used for normal<br />

<strong>communication</strong>s.<br />

On the contrary, a source route is a single, directed route between a source and a destination device.<br />

The source route is statically specified in the packet itself; for this reason, it is vulnerable and it is used<br />

only during the commissioning phase.<br />

53.2.4.1 the Network Layer Datagram<br />

The network layer datagram consists of the following fields (see Figure 53.7):<br />

• A 1 byte control field<br />

• The 1 byte time-to-live (TTL) hop counter<br />

• The least-significant 2 byte of the absolute slot number (latency count)<br />

• A 2 byte graph ID<br />

• The (final) destination and (original) source addresses<br />

• Optional routing fields<br />

• A security layer is encapsulated within this datagram together with the enciphered payload<br />

• Enciphered network protocol data unit (NPDU) payload<br />

Communication between a pair of network addresses is organized in sessions for security purposes.<br />

Four sessions are generally set up as soon as any device joins the network, even if additional sessions<br />

may be added:<br />

• Unicast session between the device and the network manager—it is used by the network manager<br />

to manage the device.<br />

• Broadcast session between the device and the network manager—it is used to globally manage<br />

devices. For example, this can be used to roll a new network key out to all network devices. All<br />

devices in the network have the same key for this session.<br />

Enciphered payload<br />

Control TTL<br />

Network layer<br />

ASN<br />

snippet<br />

Graph<br />

ID<br />

Destination<br />

address<br />

Security layer<br />

Source<br />

address<br />

Security<br />

control<br />

Counter<br />

(Expanded routing<br />

information)<br />

MIC<br />

FIGURE 53.7<br />

The network layer datagram.<br />

© <strong>2011</strong> by Taylor and Francis Group, LLC

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

Saved successfully!

Ooh no, something went wrong!