21.08.2013 Views

Protocols for Secure Communication in Wireless Sensor Networks

Protocols for Secure Communication in Wireless Sensor Networks

Protocols for Secure Communication in Wireless Sensor Networks

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

7.1. <strong>Secure</strong> <strong>Communication</strong> <strong>in</strong> <strong>Wireless</strong> <strong>Sensor</strong> <strong>Networks</strong> 219<br />

ensure the secure transmission of messages by authenticat<strong>in</strong>g routers, or ensur<strong>in</strong>g<br />

l<strong>in</strong>k security, <strong>for</strong> example.<br />

An alternative communication scheme that can potentially counter these<br />

problems is multi-path communication. Here, the same message is sent over<br />

multiple paths that only share the same end-po<strong>in</strong>ts, but use no common communication<br />

l<strong>in</strong>ks or routers (or neither of them). Here, a threshold scheme can<br />

ensure that an attacker cannot reconstruct or modify without detection a message.<br />

Generally, construct<strong>in</strong>g short disjo<strong>in</strong>t paths is a complex task with a high<br />

computational overhead.<br />

<strong>Protocols</strong> that work <strong>in</strong> conventional networks with high-powered nodes do<br />

not necessarily work well <strong>in</strong> highly resource-constra<strong>in</strong>ed environments like<br />

wireless sensor networks. There<strong>for</strong>e, alternative approaches have been devised.<br />

We have proposed a scheme <strong>for</strong> construct<strong>in</strong>g multiple disjo<strong>in</strong>t (node) disjo<strong>in</strong>t<br />

paths that is suited <strong>for</strong> wireless sensor networks. The basic concept are<br />

rout<strong>in</strong>g trees that can be set up very easily by select<strong>in</strong>g a root <strong>for</strong> each tree<br />

and a s<strong>in</strong>gle wave of broadcast messages <strong>for</strong> tree construction. A message is<br />

then routed along the l<strong>in</strong>ks that are conta<strong>in</strong>ed <strong>in</strong> a tree. This <strong>in</strong>creases the path<br />

length by a manageable amount, but also provides <strong>for</strong> a high degree of disjo<strong>in</strong>tness<br />

<strong>for</strong> pairs of tree paths. This scheme there<strong>for</strong>e provides a practical trade-off<br />

between additional complexity and security.<br />

7.1.3 Interleaved Authentication<br />

One of the ma<strong>in</strong> goals of a secure communication protocol is to provide a means<br />

<strong>for</strong> remote nodes to exchange messages that are protected aga<strong>in</strong>st manipulations<br />

that may happen while the messages are <strong>in</strong> transit. In a wireless sensor<br />

network, nodes act as routers, relay<strong>in</strong>g messages on behalf of other nodes. <strong>Secure</strong><br />

communication between two nodes thus depends on the collaboration of<br />

all <strong>in</strong>termediate nodes. Especially, <strong>in</strong>termediate nodes are expected to relay<br />

messages with their contents unaltered. An <strong>in</strong>tegrity-protect<strong>in</strong>g communication<br />

scheme ensures that manipulations would be detectable.<br />

In a conventional approach, an end-to-end message authentication protocol<br />

is be<strong>in</strong>g used, which is based on public key cryptography or pairwise shared<br />

keys. Public key cryptography <strong>in</strong>troduces a relatively large overhead regard<strong>in</strong>g<br />

computational ef<strong>for</strong>t <strong>for</strong> creat<strong>in</strong>g and verify<strong>in</strong>g signatures, and requires the<br />

transmission of authentication data of significant size. On these grounds, public<br />

key cryptography is often dismissed <strong>for</strong> use <strong>in</strong> resource-constra<strong>in</strong>ed environments.<br />

An alternative are fully pairwise shared keys, which allow the use<br />

of more efficient symmetric key cryptography. However, the storage require-

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

Saved successfully!

Ooh no, something went wrong!