Performance of Wireless Sensor Networks for Different Mobile Event Path Scenarios

Performance of Wireless Sensor Networks for Different Mobile Event Path Scenarios

Tao Yang, Gjergji Mino, Leonard Barolli, Makoto Ikeda, Fatos Xhafa, Arjan Durresi
Copyright: © 2013 |Pages: 14
DOI: 10.4018/978-1-4666-2647-8.ch004
OnDemand:
(Individual Chapters)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

In this paper, the authors investigate how the sensor network performs when the event moves with special movement path. Simulation results are compared with four scenarios: when the event is stationary, moving randomly, moving with simple 4 path, and boids path. The simulation results show that for the case when the event is moving randomly, the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of the boids model, the goodput is unstable when the is lower than 10 pps. The consumed energy characteristic increases with the increase of Simulation results show that the consumed energy of random movement is the worst among the four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in large scale WSNs.
Chapter Preview
Top

Proposed Network Simulation Model

In our WSN, every node detects the physical phenomenon and sends back to the sink node the data packets. We suppose that the sink node is more powerful than sensor nodes. In our previous work, the event node was stationary. In this work, we consider that the event moves with special movement path. We analyze the performance of the network in a fixed time interval. This is the available time for the detection of the phenomenon and its value is application dependent. A proposed network simulation model is shown in Figure 1.

Figure 1.

Proposed network simulation model

978-1-4666-2647-8.ch004.f01

A. Topology

For the physical layout of the WSN, two types of topologies have been studied so far: random and lattice topologies. In the former, nodes are supposed to be uniformly distributed, while in the latter one nodes are vertexes of particular geometric shape, e.g., a square grid. For lattice topology, in order to guarantee the connectedness of the network we should set the transmission range of every node to the step size, d, which is the minimum distance between two rows (or columns) of the grid (Allen et al., 2006; Cooper, 1993). In fact, by this way the number of links that every node can establish (the node degree D) is 4. Nodes at the borders have D = 2.

In the case of random networks, we suppose that the coordinates in the Euclidean plane of every sensor are random variables uniformly distributed in the interval [0,L]×[0,L]. Snapshots of lattice and random networks generated in simulations are shown in Figure 2 and Figure 3, respectively.

Figure 2.

An example of lattice network

978-1-4666-2647-8.ch004.f02
Figure 3.

An example of random network

978-1-4666-2647-8.ch004.f03

Complete Chapter List

Search this Book:
Reset