Professional Documents
Culture Documents
Emad A. Felemban
I. INTRODUCTION
Advances in embedded design and wireless communication
have led to the development of miniature sized low power
multi functional sensor devices. These devices form the basis
of Wireless Sensor Networks (WSNs) that can monitor diverse
scenarios like battlefield, health and various infrastructures [1].
The sensor device or sensor node is capable of detecting
environment parameters within its sensing range and
transmitting the acquired data to nodes within its
communication range. The sensed data can then be sent in a
multi hop manner to a central sink. Nodes collaborate with
each other to monitor inaccessible areas and to communicate in
tough terrains. WSNs can be categorized in several ways when
considering coverage and connectivity requirements. Coverage
requirements can be the same throughout the monitoring area
mandating uniform node layout while it may be critical in
some other areas with a need for higher surveillance. For
regular infrastructures, a finite set of points can be used for
approximating the coverage requirements with a finite set of
points. Once nodes are deployed, network reliability would
depend upon the inter node connectivity and channel quality
statistics including packet error rates.
For multi-hop communication, it is essential for reliability
that the nodes can communicate with each other at all times.
Network is considered fully connected if every pair of nodes
can communicate with each other either directly or through a
relay node. Connectivity is related to the position of nodes that
is also affected by the channel statistics like SNR (Signal-toNoise Ratio) and RSSI (Received Signal Strength Indicator).
The layout of WSN nodes involves several parameters. Sensor
locations that satisfy the budget requirements and coverage
restrictions to counter sensor failures need to be determined.
763
2R
2R
where,
Average noisee power in bad state
R
Average noise power in good state
The parameter denotes the standard deviation of noise. For
accurate detection of bad statee, R should have a value greater
than 1, i.e. noise power measuured in bad state must be greater
than any noise power experiennced in the good state. From the
Markov channel state modell, the probability of having a
particular state at any time instaant (t) can be written as:
Symbol
A
Parameter
Symbol
Nominal energy
E
n
AWGN variable
Number of aggreegators
Channel bandwidth
Number of hops
Channel capacity
Number of sensoors
Channel constant
Number of transsmissions
n
n
Channel loss
Reception Power
Channel state
Data bits
Signal Strength
Data rate
Standard deviation
Inter-node distance
Transmission disstance
Link reliability
S
L
Time instant
Time period
Transmission poower
Coverage length
Noise at instant i
Pr S 1 T Pr s t 1 |s t
(4)
Pr
Ps t 1
i|s t
j
(5)
The node separation disttance and path loss derive the
transmit power required to maintain a quality link in
connection with the sensitivityy of used antenna. Free space
model must be adjusted with specifics of path loss exponent
W
environment. A log-normal
and channel conditions to fit WSN
path loss alteration in the basicc free space path loss model [18]
needs to be integrated in orderr to provide for the accuracy in
loss measures for WSN in near ground outdoor environment.
The path loss as a log-normal equation can be written as:
Pr S t
t
T
P
10ulog
(6)
764
10
15
20
-65
25
30
35
40
Power:
-8dBm
Power: -2dBm
Power: 2dBm
-45
10
15
20
-55
25
30
35
Power: -8dBm
Power: -2dBm
Power: 2dBm
40
-65
-75
-85
-95
Distance (meters)
-35
RSSI (dBm)
RSSI (dBm)
-55
Distance (meters)
-35
-45
RSSI (dBm)
Distance (meters)
-45
-55
10
15
20
25
30
35
40
Power: -8dBm
Power: -2dBm
Power: 2dBm
-65
-75
-75
-85
-85
(a)
(b)
(c)
Fig. 2. (a) RSSI of XBee (S2) with Libelium Wasmpotes in Indoor Environment (b) in Outdoor Environment (c) placed over Pipeline
. By
10
dbm
10
1000
log
10
B 2B
.u
A
A . T. E . u. n
. T. E . b A
. b. D . n
and
is the number of sensors deployed. For a typical
WSN, optimal distance placement achieves a reliable link
under the constraint of maximum lifetime as a function of
average and initial energy. But the nodes are placed at the
minimum tolerable SNR region boundary where any slight
displacement will lead to disconnectivity which we cater in this
work using a dynamic programming based node placement
algorithm. The optimal distance placement is done by
maximization of lifetime as a function of average and initial
energy as [7]:
E
E
11
T
1
E
aD R b R
n
(7)
. T. E
ER , E
and E
are the energy regeneration rate, signal
transmission and amplification energy respectively while
is the number of sensors connected to the aggregator in
n
is the aggregation rate and b is the number
a tree branch. A
of data bits transmitted. Aggregation rate refers to the data rate
that can be received from several branch nodes over a time
period T. Alternatively; it can be represented as a percentage
ratio in terms of maximum data rate (250kbs) that can be
received from a single node in one unit time. The maximum
tolerable SNR distance depends upon the discrete transmission
capability of the node; hence sensor i would select a discrete
value P where j, in the case of our experimental setup with
Libelium Waspmotes, increases in six steps to a maximum of
1mW. In the most simplistic linear case for equal distance
placement, the distance between adjacent nodes will be
L
D
where L is the network length
adjusted as D
Subject to,
D
L
By using Lagrangian multiplier method,
L
D
, 1 i n 12
1
R
R
Here, u is the path loss component that intrinsically relates to
reliability in terms of SNR. A heuristic based approach with
notion of reliability can also be used instead of the optimal
placement since nodes can undergo disconnection for being
u
10
log D
Maximum distance where SNR is minimum but signal can
still be decoded presents the transmission distance after which
the signal will drastically get altered by interference. This
maximum tolerable SNR region can be derived by setting the
energy regeneration rate greater than or equal to the energy
765
L
N
Coverage Algorithm
1.
(14)
where ,
7.
and
8. Check constraints
r
is maximum sensing range taken equal to the transmission
node
i.e.
range here. It follows that n node
_
the number of nodes should not exceed the node budget.
Fig. 3. (a) Dynamic programming for reliable connectivity Fig 3 (b) Optimal,
dynamic algorithm based and geometric placement of sensor nodes with
reference to transmission distance (r)
4
60
u=2
u=3
u=4
40
30
Spectral Efficiency
(bits/sec/hertz)
50
3.5
3
2.5
2
1.5
20
10
0.5
0
2
10 12 14 16 18 20
(a)
100
Number of Nodes
Subject to,
Distance (meter)
arg max T
arg max
Fig 3 (b)
80
60
Optimal Palcement
Dynamic Placement
(2/3)r Placement
(1/2)r Placement
40
20
0
8 10 12 14 16 18 20 22
Number of Nodes
(b)
500
1000
1500
2000
Distance
(meter)
2500
(c)
Fig. 4. (a) Node distance variations with channel index u (b) Spectral efficiency gain for number of branch nodes and average SNR (c) Node Resource
Comparison for dynamic algorithm approach against optimal and geometric placement
766
ACKNOWLEDGMENT
REFERENCES
[1] Franck L. Lewis, "Wireless sensor networks" Smart Environments:
Technologies, Protocols, and Applications, pp. 11-46, 2005.
[2] Z. Wang, X. Zhao, X. Qian, "The application and issues of linear
wireless sensor networks," International Conference on,
Engineering Design and Manufacturing Information, pp. 9-12, 2011.
[3] C. W. Chen, Y. Wang, Chain-Type Wireless Sensor Network for
Monitoring Long Range Infrastructures: Architecture and
Protocols, Hindawi IJDSN, vol. 4, issue 4, pp. 287-314 4, 2008.
[4] I. Jawhar., N. Mohamed, A hierarchical and topological
classification of linear sensor networks, Proceedings of the
Wireless Telecommunications Symposium, pp. 72-79, 2009.
[5] I. Jawhar, N. Mohamed, K. Shuaib, N. Kesserwan, An Efficient
Framework and Networking Protocol for Linear Wireless Sensor
Networks, Ad Hoc & Sensor Wireless Networks, pp. 119, 2009.
[6] J. B. Schmitt, U. Roedig, Worst case dimensioning of wireless
sensor networks under uncertain topologies, IEEE Proceedings of
Resource Allocation in Wireless Networks, 2005.
[7] M. Cao, L. T. Yang, X. Chen, N. Xiong, Node Placement of Linear
Wireless Multimedia Sensor Networks for Maximum Network
Lifetime, Advances in Grid and Pervasive Computing, vol. 5036,
pp. 373-383, 2008.
[8] M. Cao, T. Laurence, Yang; X. Chen, N. Xiong, Node Placement
of Linear Wireless Multimedia Sensor Networks for Maximum
Network Lifetime, Proceedings of the 3rd international conference
on Advances in grid and pervasive computing, pp. 373-383, 2008.
[9] Cheng. P.; Chuah, C. Nee, X. Liu, "Energy-aware node placement
in wireless sensor networks," IEEE Global Telecommunications
Conference, vol. 5, pp.3210-3214, 2004.
[10] M. Esseghir, G. Pujolle, Wireless Sensor Nodes Dimensioning
under Network Lifetime Constraint, IEEE 66th Vehicular
Technology Conference, pp. 76-80, 2007.
[11] H. Li, X. Shunjie, "Energy-Efficient Node Placement in Linear
Wireless Sensor Networks," International Conference on Measuring
Technology and Mechatronics, vol. 2, pp.104-107, 2010.
[12] X. Li, D. K. Hunter, S. Zuyev, Coverage Properties of the Target
Area in Wireless Sensor Networks, IEEE Transactions on
Information Theory, vol. 58, no.1, 2012.
[13] S. Bandyopadhyay, E. Coyle, An energy-efficient hierarchical
clustering algorithm for wireless sensor networks, IEEE ICC, vol.
3, pp. 1713-1723, 2003.
[14] G. Zhou, T. He, S. Krishnamurthy, J. A. Stankovic, Models and
solutions for radio irregularity in wireless sensor networks, ACM
Transactions on Sensor Networks, vol. 2, pp. 221-262, 2006.
[15] A. Martinez-Sala, J. M. Molina-Garcia-Pardo, E. Egea-Ldpez, J.
Vales-Alonso, L. Juan-Llacer, J. Garcia-Haro, "An accurate radio
channel model for wireless sensor networks simulation," Journal of
Communications and Networks, vol. 7, no.4, pp.401,407, 2005.
[16] M. Cheffena, Industrial wireless sensor networks: channel
modeling and performance evaluation, EURASIP Journal on
Wireless Communications and Networking, 2012.
[17] J. L. Williams, J.L, J. W. Fisher, A. S. Willsky, "Approximate
Dynamic Programming for Communication-Constrained Sensor
Network Management," IEEE Transactions on Signal Processing,
vol.55, no.8, pp.4300-4311, 2007.
[18] S. Kumar, D. K. Lobiyal, "Linear order sensor network deployment
for coverage analysis based on TBM theory," IEEE 3rd
International Advance Computing Conference, pp.404-407, 2013.
[19] M. Younis.; K. Akkaya, Strategies and techniques for node
placement in wireless sensor networks: A Survey, Elsevier Ad Hoc
Networks, vol. 6, issue. 4, pp. 621-655, 2008.
V. CONCLUSION
The paper presents a dynamic algorithm based framework
for sensor node resource estimation and placement in WSNs
for reliably monitoring in linear and hierarchical cases. An
analytical foundation based on path loss and distance profile is
used to calculate the required resources for full coverage. Test
bed deployment consisting of ZigBee based modules and
comparison for transmission range based geometrical
placement of nodes against proposed dynamic algorithm
assisted node placement strategy has been used to ensure
minimum resource consumption and maximum network
connectivity. Results illustrate that the algorithm prediction for
connected network setup are reasonably close to the actually
observed values in the simulations and testbed for a linear
topology in terms of path losses, signal strength and distance
between nodes. Most importantly for critical reliable
applications, the connectivity challenge is met for major
deployed topology cases. The real time test bed deployment
results together with theoretical networking foundations can be
used as a promising candidate for consistent deployment of
sensor nodes in random and massive quantity for applications
like structural health monitoring with multi hop and long
distance connectivity.
767