An Energy-Efficient Technique to

Cover Routing Holes Using

Directional Smart Antennas
Submitted by
Reem Essam Mohamed kamal
Faculty of Engineering, Electronics and Communication Department
Mansoura University, Egypt

Supervisors
Prof. Ahmed S. Samra Prof. Maher Abdelrazzak Assoc. prof. Ahmed I. Saleh
Electronics and Mohamed Computers and systems
communications Electronics and engineering
engineering communications engineering Mansoura University, Egypt
Mansoura University, Egypt Mansoura University,
Mansoura Egypt

Mansoura University- Egypt 1

2017
 Scientific Papers
Published
R. E. Mohemed, A. I. Saleh, M. Abdelrazzak, and A.
S. Samra, Energy-Efficient Routing Protocols for
Solving Energy Hole Problem In Wireless Sensor
Networks, Comput. Networks, Elsevier 2016.
Under review
R. E. Mohemed, A. I. Saleh, M. Abdelrazzak, and A.
S. Samra, Survey on Wireless Sensor Network
Applications and Energy Efficient Routing
Protocols, Comput. Networks, Elsevier, Jan 2017.
2
Presentation Outline
Thesis Aim and Objectives
WSN Definition, Applications And Challenges
Related Work
Problem Definition
Thesis Contribution
Conclusion And Future Work

3
 Aim
Solve Routing Hole
Problem in Wireless
Sensor Networks
4
 Thesis Objectives
Cover the most recent
applications of WSN
Study the most effective
design issues in WSN routing
protocols
Analyze energy-hole problem
and its consequences
5
Thesis Objectives
Introduce two adaptive
energy-efficient routing
protocols for WSNs, which
solves routing hole problem
maximizes network lifetime,
and preserves network
stability period
6
WSN Definition,
Applications and
Challenges

7
Overview on WSN

8
9
Applications of WSN

10
11
12
Routing Hole

13
Causes of Routing Hole

Causes of Routing Hole

Energy Black
Hole Hole
14
Related work

15
Year Protocol description weakness
No process to calculate the number of
It elongates the round to contain a set of
IBLEACH rounds/frame value which may result in
2014 frames, so that the setup operation is
[1] data loss if CHs deplete their energy
performed every set of frames.
within the round.
designed to fulfill confidentiality,
integrity, adaptive aggregation, and It concerns with data security more than
2014 SETA [2]
privacy issues while minimizing lifetime maximization
communication overhead.
CHs are selected based on weight. that is
determined according to the residual Incomplete data transmission may occur
REAC-IN energy of each sensor and the regional on isolated nodes. Periodic topology
2015
[3] average energy of all sensors in each reformation leading to high energy
cluster. It solves the problem of node overhead.
isolation.
Energy overhead in cluster head
Cluster is formed, then intra cluster and
2016 NEECP [4] selection, intra cluster and inter cluster
inter cluster chains are formed
chain formation
The optimal parameters for energy
combine the unequal clustering using
minimization are not covered.
vote -based measure and the connected
UCCGRA The periodic voting and connected graph
2016 graph theories. CHs are elected and non-
[5] formation introduce very high
CH uses a fitness function to select the
complexity and energy overhead during
most suitable CH to join.
the setup phase. 16
 Problem of Recent Energy
Efficient Routing Protocols
The need for continuous topology
reformation to achieve high network
lifetime made the researchers ignore the
impact of
High energy overhead due to continuous
network setup
on limiting network lifetime
Maximization
17
details
 The Proposed
Energy Efficient
Routing Protocols

18
 General Characteristics of The
Proposed Protocols
Designed for Static networks with determined
node placement
Trigger based
fully distributed
Designed for solving the premature end of
network lifetime.
Reconnects any multi-hop single path network
topology with single setup phase.
Operate in tree fashion

19
 On Hole Children
Reconnection (OHCR)
Protocol Overview
Has local nature
Independent on initial network
topology

20
 OHCR protocol flowchart

(). : The Breakdown . : :The distance between the parent node

energy of parent nodes s and its furthest child
21
 Operational Conditions for
OHCR
The breakdown packet BD pkt and join request
jReq packet sizes are limited to 10% of the
control packet size to limit
1 The delay till the reconnection is maintained
2 The energy consumed in this process

3 Collision occurrence

22
 OHCR Algorithm
Inputs: , , . , (). , _, . , t_lev
Outputs: reconnect the disconnected children
// for any parent node
1. While (). do
2. find (). and calculate .
// when the parent is dead
3. If . = .
4. Multicast BD pkt to (). nodes within ().
. is dead
5. CR( . , _)

23
 Children Reconnection
Algorithm
CR(s(i).C,_)

1. For each s() . do

// acknowledgment flag is reset for every orphan child
2. (). = 0
3. While (). = do
4. multicast a jReq to . = . 1 within
5. Wait _
6. If ack received
7. (). = 1
8. Join the parent that replies first
9. Else
10. Decrement ().
11. If (). =
12. . = 1
13. Join BS
24
 Characteristics of OHCR
1 It suits all multi-hop single path networks
where network management is performed in a
distributed fashion.

2 It doesnt need BS or GPS to manage network

operations or locate the lost nodes during the
network lifetime.

25
 On Hole Alert (OHA)
Protocol
Has global nature.

Primarily dependent on the initial network topology

Redistributes routing load among the remaining relay nodes

It doesnt add delay

26
OHA Protocol Flowchart

27
Inputs: , (). , , , (). , . , TF, t_lev
Outputs:,, network reconnection
// user input
1. Set TF
2. For each do
3. Calculate
// new dead node
4. If . do
5. is dead
6. =1
// Root hole
7. If (). = ( + 1 ) & . do
8. . =
9. Root-hole advertisement in BD pkt broadcast
10. If TF={0} do
11. Use topology formation algorithm for topology re-setup of the nodes
12. Else
Use the topology formation algorithm specified by the network administrator for topology re-setup of the nodes
// Parent hole
13. Else if (). ( +1) & . do
14. . =
15. Parent-hole advertisement in BD pkt broadcast
16. RC(S(i).C, t_lev)
// Pendent hole
17. Else if . = do
18. (). =
19. Pendent hole advertisement in BD pkt broadcast

28
Performance
analysis
Algorithm complexity
Breakdown energy
Network overhead
Estimation of stability period and network
lifetime
29
 Algorithm Complexity
1 OHCR complexity is upper bounded by
(1)
for each node in the network,
(2)
for each parent and
(3)
for the whole network
2 OHA complexity is upper bounded by the topology
formation algorithm used in re-setup operation.
3 Both protocols OHCR and OHA are lower bounded by
children reconnection (CR) algorithm (1).

30
 Breakdown Energy

lc Eelec + fs s i . Db 2 s i . Dm < do
(4)
s i . EbOHCR = otherwise
lc Eelec + mp s i . Db 4

While the breakdown energy of OHA is dependent on the

dimensions of the ROI; thus, it is constant for all nodes, as given in
equation (6)
+ 2 <
= 4
(5)
+ otherwise
In multi-hop networks, the distance between the parent and its child
hardly reach the diameter of the ROI; thus, max . <
31
 Network Overhead
Lemma 1 For homogeneous networks with
constant network flows and BS far from the ROI,
the probability of energy depletion of any non-
relay node in the ROI before any relay RN node is
exactly zero.
Lemma 2 OHA adds higher energy overhead
than OHCR to homogeneous networks in case of
constant network flows and far BS from the ROI

()
= (6)
()
=1 32
 Estimation of Network
Lifetime OHCR
| =

( + . 4 ) . ,
4
+ | + +
( + . 2 ) . <
4
+ | + + (7)
( + . 4 ) <
2
+ | + + .
( + . 2 ) else
2
+ | + +

33
Estimation of Stability Period
OHCR

| =
4
+
4 (8)
+ +
2
+
else
2
+ +

34
 Estimation of Network
Lifetime OHA
Eo |RN =

lc (Eelec +mp M 4 ) M, dtoBS

do
+r |min l Eelec + mp d4toBS + EDA
lc (Eelec +fs M 2 ) M < do (9)
+r |min l Eelec + mp d4toBS + EDA dtoBS
lc (Eelec +mp M 4 )
+r |min l Eelec + fs d2toBS + EDA dtoBS < do
lc (Eelec +fs M 2 ) M
+r |min l Eelec + fs d2toBS + EDA else

35
Estimation of Stability Period
OHA

Eo | =

lc 2Eelec + mp d4nn + mp M4 dnn , M do

+r l Eelec + mp d4nn
(10)
lc 2Eelec + mp d2nn + mp M 4
dnn < do M
+r l Eelec + mp d2nn
lc 2Eelec + fs d2nn + fs M 2 else
+r l Eelec + fs d2nn

36
Experimental
Results

37
 Radio Transmission Model
Using the energy model in [6]
Energy consumed in data transmission
+ 2 <
, =
+ 4 (11)

Energy consumed in data reception

, = = (12)

38
 Type Parameter symbol Value
The number of nodes in the ROI 100
Homogeneous Initial energy of sensor node 0.5
network Node distribution - random
BS location - (50, 200)
Minimum distance from ROI to BS 100
Length of maximum dimension of ROI M 100
Data packet size in bits 800
Application
Control packet size in bits 50
Transmitter/Receiver Electronics 50nJ/bit

Energy consumed in data aggregation 5nJ

/signal
bit

Multi-path propagation loss 0.0013 /4


Free space propagation loss 10 /2
Radio model
Threshold distance of wireless

propagation energy model
Antenna Model - Omni-directional
Tree formation TF 0
Protocol setup Waiting time for reconnection in OHCR _ 0.8
Number of children in DCT c 3 39
 Network Setup
Protocol Description Parameter
NEECP The data aggregation version was NEECPWA
used
UCCGRA the maximum competition =
radius. = 0.3
c is a constant coefficient between 0
and 1
LEACH The optimal probability of cluster =
head selection was used

OHCR and OHA are examined on both Degree

Constrained Tree (DCT) and Shortest Path Tree
(SPT) 40
 Performance Metrics

1 Energy overhead ()
= (6)
()
=1
2 Average network energy
=1
= (13)

3 Percentage of dead nodes

Network lifetime in terms of number of rounds r ;the

4 maximum lifetime of all the sensors in the network; it may
end due to energy depletion or inability to reach the BS; such
that,

41
Energy Overhead

42
Average Network Energy

43
The Percentage of Dead Nodes
Through Network Lifetime

44
Network Lifetime Vs. Number
of Nodes in The ROI

45
Using Directional Antennas
in SPT

46
 Directional Transmission
Parameters
Parameter Value
Antenna model for control packets Omni-directional
Antenna model for data transmission directional
Directional antenna model Switched beam
Beam width for data transmission 450
MAC layer for directional transmission D802.15.4 MAC
Main lobe gain 15 dBi
Antenna model for data reception omnidirectional

47
Energy Overhead

48
Average Network Energy

49
The Percentage of Dead Nodes
Through Network Lifetime

50
Network Lifetime Vs. Distance
Between the ROI and the BS

51
Conclusions
and
Future Work

52
 OHCR Adds significant delay due to the time
taken in each reconnection trial. However, this
time can be adjusted by network
administrator.
OHCR and OHA are characterized by high
adaptability to application requirements.
Applying OHCR or OHA to any network
topology doesnt affect its stability period.

53
 The simulation results proved that the
proposed protocols outperform the recent
ones in terms of network lifetime, node loss
rate, and network overhead.
OHCR and OHA are better applied on trees
with as limited constraints as possible to
provide the best results
Using OHCR or OHA, the network lifetime of
any single setup phase tree can be extended
about 5 to 3 times, respectively. 54
 Future Work
At the end of this work, we are looking forward
to do the following
Studying the scheduling problem of the
implemented routing protocols to find the
tradeoff between network lifetime and schedule
length.
Studying other disconnection reasons; e.g.
physical damage
Studying the behavior of the proposed algorithms
on heterogeneous networks.

55
 List of References
[1] A. Salim, W. Osamy, and A. M. Khedr, IBLEACH : intra-balanced
LEACH protocol for wireless sensor networks, Wirel. Networks, no.
20, pp. 15151525, 2014.

[2] S. Sicari, L. A. Grieco, A. Rizzardi, G. Boggia, and A. Coen-

porisini, SETA : A SEcure sharing of Tasks in clustered wireless
sensor networks, in 9th IEEE International Conference on Wireless
and Mobile Computing, Networking and Communications 2013,
WiMob 2013: 239-246, 2014, no. i.

[3] J. S. Leu, T. H. Chiang, M. C. Yu, and K. W. Su, Energy efficient

clustering scheme for prolonging the lifetime of wireless sensor
network with isolated nodes, IEEE Commun. Lett., vol. 19, no. 2, pp.
259262, 2015.

56
 List of References (cont)
[4] S. Singh, S. Chand, R. Kumar, A. Malik, and B. Kumar, NEECP :
Novel energy-efficient clustering protocol for prolonging lifetime of
WSNs, IET Wirel. Sens. Syst., pp. 17, 2016.

[5] H. Xia, R. Z. Jia, and Y. Z. Pan, Energy-Efficient Routing

Algorithm Based on Unequal Clustering and Connected Graph in
Wireless Sensor Networks, Int. J. Wirel. Inf. Networks, vol. 23, no. 2,
pp. 141150, 2016.

[6] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan,

Energy-efficient communication protocol for wireless microsensor
networks, Proc. 33rd Annu. Hawaii Int. Conf. Syst. Sci., vol. 0, no. c,
pp. 30053014, 2000.

57
58
 LEACH

=
4

+ + 4 + + 1 + + &

2

+ + 4 + + 1 + + & <

(9)
4 < &
+ + 2 + + 1 + +

2
& <
+ + 2 + + 1 + +

=
4 4
( + 2) + + ( + (10)
2 2
( + 2) + + ( + else

59
 =

,
() + () (19)

1 () + () < /,Worst case
() < /, Best case

60
Thus, the stability period is when the first node depletes all its initial energy
in data transmission and the number of nodes is the same as its initial value.
It depends on the worst condition which represents the case of highest
possible energy depletion of the node as in equation (20)

=

+ () +

(20)
( 1) () + ()

61
 PEGASIS

=
4 &
3 + 4 + 3 + + 3
2
3 + 4 + 3 + + 3 & < (27)
4
3 + 2 + 3 + + 3 < &
2
3 + 2 + 3 + + 3 & <

=
4 + 0.1
1 + 2 +
4 + 2
+ 2 +
(28)
2 + 0.1
1 + 2 + Else
2 + 2
+ 2 +

62
 During the network lifetime, each node becomes a leader every round, in the
worst case, the node is selected as a leader at least once, thus, the node energy

during its lifetime can be estimated from equation (21), such that +

=
/
() + () + () (29)

< , worst case

1 () + () + ()
() + ()
< , best case

Thus, the stability period is when the first node depletes all its initial energy in data
transmission and the number of nodes is the same as its initial value as shown

() + ()
= + (30)
1 () + () Else
63
 Stability period and network lifetime
estimation for NEECP
=
4
2 + 4 + 3 + + 3 &
2
2 + 4 + 3 + + 3 & <
(35)
4
2 + 2 + 3 + + 3 < &
2
2 + 2 + 3 + + 3 & <

=
+ 4 4
+ 2 + + 2

+ 2 + 2 +
2 + 2
(36)
else

=
4 4 + 2
3 + + 2 +

2
3 + 2 + 2
+ 2 + (37)
Else
64
 In the worst case, the node is selected as a leader every time
it becomes a CH, thus, the node energy during its lifetime can

be estimated from equation (35), such that +


, worst case
+

, best case
() = + () (38)

< , worst case
+ 1 ()

() < , best case

65
 Thus, the stability period is when the first node depletes all its
initial energy in data transmission and the number of nodes is
the same as its initial value as shown
rs rs rN
rs Enl (r) + El (r) N rk
Eo EBD = N N N + (39)
rs 1 Enl (r) + El (r) else N

66
 Competitors

NEECP [43] NEECPWA

UCCGRA [44], we choose = and = 0.3
LEACH [29][30] the probability of CH selection
, that minimizes the average energy
consumption of the network, as proven in [30], can
be calculated according to system parameters from
equations (15,16)
= 2
(15)
2

= (16)

67