05.01.2015 Views

Wireless Sensor Networks : Technology, Protocols, and Applications

Wireless Sensor Networks : Technology, Protocols, and Applications

Wireless Sensor Networks : Technology, Protocols, and Applications

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

WSN DESIGN ISSUES 287<br />

WSNs Routing <strong>Protocols</strong><br />

Network structure<br />

Protocol operation<br />

Locationbased<br />

routing<br />

Hierarchical<br />

network<br />

routing<br />

Flat<br />

network<br />

routing<br />

Coherentbasebased<br />

QoS-<br />

routing routing<br />

Querybased<br />

routing<br />

Multipathbased<br />

routing<br />

Negotiationbased<br />

routing<br />

Figure 11.2<br />

[11.15].)<br />

Classification of routing protocols for wireless sensor networks. (From<br />

protocol, open shortest path first, border gateway protocol) do not meet the<br />

requirements of WSNs. Data-centric routing is more suitable for WSNs because<br />

it can be deployed easily, <strong>and</strong> due to data aggregation, it saves energy. Traffic<br />

models <strong>and</strong> system characteristics can be utilized to design efficient routing protocols.<br />

To conserve energy, most routing protocols for WSNs employ certain technique<br />

to minimize energy consumption (e.g., data aggregation <strong>and</strong> in-network<br />

processing, clustering, node role assignment). Al-karaki <strong>and</strong> Kamal [11.15] classify<br />

routing protocols in several categories shown in Figure 11.2. For example,<br />

directed diffusion [11.16] is a data-centric routing scheme with three phases in<br />

its operation:<br />

1. A sink broadcasts its interest across the network in query messages with a<br />

special query semantic at a low rate.<br />

2. All the nodes cache the interest. When a node senses that an event matches<br />

the interest, it sends the data relevant to the event to all the interested nodes.<br />

Sink will also get the initial data <strong>and</strong> ‘‘reinforce’’ one of source nodes by<br />

resending the interest at a higher rate.<br />

3. After the reinforcement propagation, the source nodes send data directly on<br />

the reinforced path. The performance of a routing protocol can be expressed<br />

through such measures as computational overhead, communications<br />

overhead, path reliability, path length, convergence rate, <strong>and</strong> stability.<br />

11.3.3 Transport <strong>Protocols</strong><br />

The following factors should be considered carefully in the design of transport protocols:<br />

a congestion control mechanism <strong>and</strong> especially, a reliability guarantee. As<br />

discussed in Chapter 7, since most data streams are convergent toward the sink,<br />

congestion is likely to occur at nodes around the sink. Although a MAC protocol<br />

can recover packet loss as a result of bit error, it has no way to h<strong>and</strong>le packet loss as<br />

a result of buffer overflow. Therefore, transport protocols should have mechanisms<br />

for loss recovery; to guarantee reliability, mechanisms such as ACK <strong>and</strong> selective<br />

ACK [11.4] used in the TCP would be helpful. At the same time, reliability

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

Saved successfully!

Ooh no, something went wrong!