2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems
Enhanced Stability Routing Scheme against Radio Jamming
Based on NDL in Multi-hop Wireless Networks
Li Lou1, Jian-Hua Fan1, Yong-yang Hu1,LingYun Xu2
1
Nanjing Telecommunication Technology Institute, Nanjing, China
2
Nanjing University of Aeronautics and Astronautics, Nanjing,China
E-mail: louie1000@outlook.com,fjh710119@outlook.com, 18952072065@qq.com, xlyun@nuaa.edu.cn
Abstract—Most of the routing protocols for wireless networks
have focused on finding a feasible route from a source to a
destination. Routing Protocols in Multi-hop Wireless Networks
(MHWNs) face more serious security and reliability challenges.
Radio jamming attacks are especially harmful to the reliability of
links, as they can effectively disrupt communication between any
node pairs result in that links are continuously created and
broken. Selecting a long lasting and steady-going route in multi-
hop wireless network is a critical task. This paper studies the
impact of jamming on the common protocols of wireless
networks and presents an improved reliable AODV routing
protocol based on Neighbor Dependency Level(NDL)，which
named as RPBND protocol. The NDL of a node and its
neighbor is divided into three ranks, that is, fully-
dependent, half-dependent and independent level. Then,
route selection ways for different NDL are presented, and
different priorities of the neighbor nodes with different
NDL to be selected as the next hop node are assigned. The
performance of the stable routing protocol based on Neighbor
Dependency Level (NDL) is demonstrated in simulation, and
compared with the traditional Min-hop-based AODV routing
algorithm and the improved Cost-based AODV routing
algorithm. The simulation results show that the RPBND protocol
has better data transmission stability.
Keywords—wireless communication; routing stability; anti-
jamming; exponential smoothing estimation; MHWNs
I. INTRODUCTION
Multi-hop Wireless Network (MHWN) is a special kind
of wireless communication network with the characteristics of
frequently changing network topology[1], which can serve
autonomous collection of nodes that communicate over
wireless links through multi-hop fashion. It has been
envisioned for a variety of applications such as MANETs,
Mesh Networks , Cognitive Radio Networks and wireless
sensor networks etc. [2][3].
In MHWNs, routing protocols are often concerned with
connectivity, and path selection methods are often according to
hop-count or delay. Due to the broadcasting nature of the
wireless communication, the data transmission over a channel
is open to malicious radio interference. Such malicious radio
interference is often called radio jamming attack. In radio
jamming attack, the jammer first identifies the channel in use
and emits random signal over that channel, it could decrease
the probability of successful broadcasting in the wireless
communication. To promote stability and anti-jamming
performance of MHWNs, many measures have focused on
2155-6814/17 $31.00 © 2017 IEEE
DOI 10.1109/MASS.2017.115
advanced physical layer and MAC layer techniques, such as
frequency hopping, channel adaptation, error correcting codes,
etc. In order to support better anti-jamming requirements for
MHWNs, routing protocols in network layer need to have a
more complex model where the network is characterized with
multiple metrics. The goal of anti-jamming routing is to find a
path that satisfies multiple constraints and still meeting
reliability requirements for MHWNs.
This paper investigates routing restoration solutions via the
design of neighbor dependency measured by exponential
smoothing estimation of CSI between node pairs for multi-hop
links. Efficient routing schemes can relieve the interference
caused by the jamming nodes. Therefore we present a link
quality based Neighbor Dependency evaluation algorithm to
select best intermediate relaying nodes and a reliable routing
protocol based on Neighbor Dependency level in Multi-hop
Wireless Networks. According to the link quality evaluation by
Packet Dropped Rate (PDR) and RSSI, neighbor nodes can be
partitioned into different Neighbor Dependency level. First,
based on a realistic representative propagation model and
evaluation results, link model and test results, a Neighbor
Dependency Level (NDL) metric is indicated, where selecting
a neighboring node with low NDL as the next hop node will
greatly degrade the transmission reliability.
Based on this, the NDL of a node and its neighbor is
divided into three ranks, that is, fully-dependent, half-
dependent and independent level. Then, route selection ways
for different NDL are presented, and different priorities of the
neighbor nodes with different NDL to be selected as the next
hop node are assigned. Finally, the performance of the reliable
Routing Protocol based on Neighbor Dependency (RPBND) is
tested in our extensive simulation, and compared with some
common routing algorithms. The results show that the
RPBND has better data transmission reliability.
II. BACKGROUND AND RELATED WORKS
Built upon a shared wireless medium, multi-hop wireless
network is particularly vulnerable to jamming attacks. The
ability to recover routing from attacks is a crucial aspect in the
design of a multi-hop wireless network.
Recent studies in wireless networks have shown that the
fluctuation of transmission capability of wireless links may
have a significant effect on the stability and reliability of
routing protocols [3][4][5]. To promote stability and anti-
jamming performance of MHWNs, many measures have
focused on advanced physical layer and MAC layer techniques.
An autonomous cooperative communication scheme with
647
optimized physical layer is proposed to improve the
robustness of the upper routing protocol [7], but it relies on
advanced transceivers. SSA protocol uses the signal strength
to evaluate link quality, but cannot response to link
interruptions expeditiously [8]. In LSPMR routing protocol,
by calculating the variance of signal strength of each received
data packet, the stability of each link can be predicted [9].
According to the historical information to evaluate the link
stability, LSPMR routing protocol cannot dynamically reflect
the current topology variability in the complex
electromagnetic propagation environments. QRME routing
protocol relies on GPS or other auxiliary equipment to get
node location, speed and other information in order to
calculate the life time of wireless link and choose a stable path
consequently. The disadvantage of this protocol is that each
node needs to be equipped with locating beacon [10]. In PPC-
MAODV routing protocol, a reliability metric of relative
position change of adjacent nodes i and j was proposed [11].
But these protocols are based on node position judgment and
need external equipments for forecasting mobile trajectory,
which should be implemented in special application scenarios.
A jamming-resilient multipath routing algorithm based on
Availability History Vectors (AHV) to select fault-
independent paths is effective in overcoming jamming impact
and maximizing end-to-end availability of these selected paths
[12]. Interference avoidance mechanisms are well concerned
and a proactive multi-path routing mechanism based on new
jamming aware metric is proposed [13]. This mechanisms
need extra support in the form of routing Interference
Activity (IA) entries to build robust anti-jamming paths.
In this paper, we present a reliable anti-jamming routing
metric named Neighbor Dependency (ND) integrating local
node reliability and link quality in order to select best
intermediate relaying nodes and a stable routing protocol
based on Neighbor Dependency.
Due to the lack of comprehensive evaluation of the link
quality, routing algorithms in MHWNs may result in poor
network performance.
Since the behaviors of node relationships have great
impact on the performance of routing algorithms, we proposed
new link models based on empirical data. According to the
historical and recent information to evaluate the link
relationships, we present a reliable anti-jamming routing metric
named Neighbor Dependency Level(NDL) integrating local
node reliability and link quality in order to select best
intermediate relaying nodes and a stable routing protocol based
on Neighbor Dependency.
In this paper, we present a reliable anti-jamming routing
metric named Neighbor Dependency (ND) integrating local
node reliability and link quality in order to select best
intermediate relaying nodes and a reliable routing protocol. A
Neighbor Dependency Level (NDL) metric is indicated, where
selecting a neighboring node with low NDL as the next hop
node will greatly degrade the transmission reliability. Based
on neighbor dependency evaluated by channel state
information, the NDL of a node and its neighbor is divided
into different levels. Then, route selection ways for different
NDL are presented, and different priorities of the neighbor
648
nodes with different NDL to be selected as the next hop node
are assigned. Finally, the performance of the reliable Routing
Protocol based on Neighbor Dependency (RPBND) is tested
in our extensive simulation, and compared with the Min-hop-
based AODV routing algorithm, the Cost-based AODV
routing algorithm. The results show that the RPBND has
better data transmission reliability.
We examine that the Channel State Information (CSI)
refers to channel properties of a link; it describes how a signal
propagates from the transmitter to the receiver and represents
the combined effect of jamming, interference and other
implicit attributes of radio, such as scattering, fading, power
decay with distance. In this paper, we propose that link
stability can be evaluated by first exponential smoothing
estimation of CSI of links between nodes with their one-hop
neighbors. And a reliable routing protocol based on neighbor
dependency (RPBND) is proposed in order to get significantly
better data transmission reliability of end-to-end.
In summary, the contributions of this paper are as follows:
1. Indicating the existence of different rank of neighbor
dependency;
2. Presenting a routing selection criteria according to
neighbor dependency;
3. Validating the routing protocol based on neighbor
dependency by experiments in simulation.
III. ROUTING METRIC AND NEIGHBOR DEPENDENCY MODEL
Some researchers found that link quality is not isotropic,
the coverage of power in the field is irregular as shown in
Fig.1, and some revealed nodes that are geographically close
to each other may have high spatial correlation in PRRs
(packet receive rates) as shown in Fig2. Some studies in [12]
illustrate the irregular PDR level around sender under the
influence of jammer.
Fig.1 irregular coverage of Fig. 2 irregular PDR around
power in the field Sender under effect of a Jammer in a
real communication system
To focus our study on the stability of routing scheme
against jamming, we consider some primary communication
nodes in MHWNs with limited mobility. The performance of
routing protocols are greatly depended on the definition of
routing metric. Among them, reliability has to be guaranteed,
if links are unstable, retransmission or reroute will be typically
time-consuming. The selection of previous relaying node will
influence the same process of subsequent nodes, and there are
channel competitions between nodes besides jamming effect.
As a result, the dependency relationship between nodes, which
named Neighbor Dependency Level(NDL) in this paper, is
very complex. It has positive or negative effects on the
network. The node dependency is interrelated and coherence.
It is considered that the relationship between neighbors has
been established when there is a successful wireless
transmission link connected with each other. The neighbor
dependency is a description of link connectivity between
neighboring nodes. We divide the node relationships into three
levels: (i) fully-dependent, where the link between node and
certain neighbor is often of good quality, stable, and
symmetric. (ii) half-dependent, where links are of intermediate
quality (in long-term assessment); neighborhood congestion
and neighborhood density are moderate. (iii) independent,
where links have poor quality ,neighborhood congestion and
neighborhood density are very high. These links are
inadequate for communication.
The NDL evaluation algorithm is run in each node to
identify with which neighboring node may construct more
reliable data transmission link. NDL evaluation algorithm
consists of two phases, (i) Monitoring Phase and (ii) Steady
Phase.
In order to periodically check its neighbors’ stability to see
if they are still reliable neighbors, each node broadcasts
periodic beacon messages to its neighbors at every time epoch
T . NDL does not require beacon messages to include any
other information except link quality information. Let b j (t )
denote the beacon sent from node j at the t -th interval. Each
node i maintains a table denoted by N i , which records the
active counts of other nodes. The NDL value will be
propagated along the path and the destination node will
calculate the stability factors and choose the best path based
on NDL information.
We focus on studying the path selection problem under the
threat of jamming and give an illustration by the following
scenario. A mobile jammer will move in the network along the
predefined trajectory and emit signals continuously. It may
disrupt the normal communication between sender and
receivers. It has been illustrated that the bit errors per packet
and media access delay at receivers are correlated with the
movement of the mobile jammer. As a result, it is challenging
to predict the stability of links while mobile jammer is present.
We must give a metric can accurately reflect the dependency
relationship between nodes and a routing selection policy
based on this metric to evaluate individual link reliability and
availability. The access to the dependency relationship
between nodes is beneficial to improve the reliability of
routing. Since the characteristics of links have great impact on
the performance of routing selection, some studies proposed
new models to describe the connectivity between nodes based
on empirical data.
NDL routing
In monitoring phase, every node periodically scans its one
hop range and receives these replies from all its neighbors.
According to that information, each node sets up a table of its
neighbors’ stability. While doing routing, the NDL factor will
be propagated along the path and the destination node will
649
calculate the cumulative NDL factors and choose the best path
based on this information.
One-hop scan
The way that each node collects its neighbor information is
to scan within one hop range periodically. There are two
different scan types. Initially, when a mobile device is
powered on, it will perform the first scan. The first scan is
different from future scans in which it must build the neighbor
list and be ready quickly for participation in real network
activities. This should happen in a relatively short period. Here,
it is set to two seconds.
After the initial scan, the node enters a normal working
environment where it needs to keep on collecting its neighbor
information periodically. This time interval should be dynamic,
since it depends on how fast the nodes are moving. In an area
where most of the nodes are moving at relatively slow speeds
the routing will not change frequently and the scan interval
can be set longer to reduce the overhead. However, in an area
where most of the nodes are running fast, the scan interval
should be set to a shorter time in order to be more adaptive
and quickly respond to network changes. Considering the one
hop range and the possible moving speed of device, the default
scan interval in the working condition is set to 10 seconds. If
in the next scan the node compares the new neighbor list with
its old one and finds that less than 30% of its neighbors have
changed (this can be caused by either new neighbors coming
in or old neighbors going away), it will set the scan interval to
20 seconds; if more than 30% but less than 50% of its
neighbors change, it keeps the time interval as 10 seconds.
However if more than 50% of its neighbors change, it will set
the scan interval to 5 seconds in order to gather its neighbor
information more frequently. By this means, each node can
dynamically collect information from its neighbors thus
calculate the neighbor stability factors.
A simple method for calculating node dependency is
expressed as the Node Degree, which is to simply accumulate
the number of one-hop connected nodes observed by the node
i [13] . Degree Centrality ki is proposed and can be
n
formulated as ki  k ij , wherein kij  1 if there is an
j 1
available link between node i and j , else kij  0 .Although
these methods are convenient for calculation, they cannot
reflect the inner relationships between nodes and mainly
adapt to fixed topology. Therefore, a metric of link stability,
which named as neighbor dependency, is proposed and can be
evaluated by first exponential smoothing estimation of CSI of
wireless links between one-hop neighbors. A stable routing
protocol based on neighbor dependency is designed in order to
get significantly better data transmission reliability.
The Channel State Information will be estimated at the
receiver, then quantized and fed back to the transmitter.
Therefore, the transmitter and receiver may have different
Channel State Information. In this research, it is assumed that
the bidirectional equivalent of the short distance multi-hop
communication networks, they are all represented by CSI. The
common form of CSI, Received Signal Strength (RSS), used
to be considered as a poor predictor of link quality[14]. In [15],
the Channel State Information represented by instantaneous
channel gain matrix elements is obtained as
  j  N 0 B
hi, j   0    j   ，Pt  0
， (1)
Pt
wherein   j  denotes the instantaneous receiving SINR,
N 0 / 2 is the unilateral power spectral density of AWGN
(Additive White Gaussian Noise), B denotes the estimation of
available signal bandwidth and Pt denotes the transmitter
power. The transmitter power and data rate have been preset
when source transmits a set of short training sequences, so the
distribution of hi, j  is determined by the distribution of the
instantaneous receiving SINR.
In this paper, we use this kind of Channel State
Information (CSI) metric to represent the current link quality.
In order to measure it exactly, each node broadcasts a probe
packet continuously during every epoch with a fixed duration,
such as every 500 milliseconds. The Window Mean with
Exponentially Weighted Moving Average (WMEWMA) [16]
is a receiver-side LQE based on passive monitoring. It
smoothes PRR estimates using the EWMA filter, which
provides more stable but sufficiently agile estimation
compared to PRR.
The probe packet header includes the transmitter power
value of Pt . According to the received probe packet, each
neighboring node will response the detection process in a non
preemptive mode. And the response message includes the field
of instantaneous receiving SINR which can be calculated
according to the aforementioned Equation 1. We depict H i, j 
as the EWMA (Exponential Weighted Moving Average)
estimation of hi, j  in this paper. The value of H i, j  will be
quantized at every receiver and fed back to transmitter, and
then will be saved by transmitter. H i, j  can be used to
evaluate actual value of Channel State Information between
node i and j , H i, j  is used to be considered as a good
predictor of the quality of the link i  j . We divide time
into short epochs with a fixed duration Tepoch and define
H i, j  as
H (i, j )  hins (i, j , t )   h stat (i, j, t  1)
Where h stat (i, j , t  1) is the statistical mean in test window
period (t  1)  Tepoch , hins (i, j , t ) expresses instantaneous
value of channel state at the t th epoch, it is the basis for the
transmitter to adjust the transmit signal in time. It includes the
distribution of environmental fading and the average channel
gain etc.  is the weight of instantaneous value hins (i, j , t ) ,
and  is the weight of statistical mean h stat (i, j , t  1) ，
 and  are all constants between 0 and 1,     1 。
In fact, the channel state information is restricted by the
rate of variation of channel quality. In the fast fading system,
it is possible to change the channel during the transmission of
only one character, and the instantaneous value of CSI is more
reasonable to describe the channel state. In slow fading
systems, generally referred to multipath induced fading, or due
to shadowing from obstacles affecting the wave propagation,
the channel sate may be maintained for a period of time after
obtaining the real-time CSI, which can improve the
communication efficiency by using the statistical mean of CSI.
The actual value of Channel State Information (CSI) can
be calculated by channel gain which refers to channel
properties of a link and describes how a signal propagates
from the transmitter to the receiver and represents the
combined effect of scattering, fading and power decay with
distance, and makes it possible to adapt transmissions to
current channel conditions, which is crucial for achieving
stable communication links. The total channel gain is
determined by statistical mean in test window period which
saved during the routing maintenance process, and next part is
the instantaneous value of the current moment t .We can adjust
the weights of CSI and evaluate the weights according to the
fading feature of channel.
Although the common form of CSI is RSSI [13], used to
be considered a poor predictor of link quality, this kind of
metric is easy for acquisition, mostly because of few
limitations are needed. In this paper, we use this common
form Of CSI, RSSI, to estimate the weight  firstly, and then
we can calculate H i, j  , the EWMA (Exponential Weighted
Moving Average) estimation of hi, j  .
According to sampling sequence X  of RSSI every 500
milliseconds, we use A.B( ) to express the MSE (Mean
Squared Error) of ESV (Exponential Smoothing Value).
 ( ) is obtained as
 ( ) 
 X   S (1)
(3)

wherein S  X  -1  1   S 1 , S is the
(1) 1 1
forecast value of RSSI at the th epoch, S 1 is the recent
(1)
smoothing value of RSSI at the   1th epoch, and the
(2) superscript represents first exponential smoothing.  is the
coefficient of exponential smoothing. By comparing the error
1
of the predicted value S and the measured value X  under
different  , the optimal value  with minimal Mean
Squared Error can be obtained as
minimize  ( )

(4)
subject to 0    1
650
 IV. ROUTING MODEL relaying node s with its certain neighboring node x is defined
It is assumed that the existing condition of a stable link as follows.
i  j is that H（i, j)   during the test window period T w , TABLE 1. DEPENDENCY STATUS

where  is the channel gain threshold. Under the same Attribute Declaration
Neighbor_ID( x ) neighbor sequence number , incremental
available bandwidth and SINR, the larger the channel gain is, sequence number, identify the update
the smaller the signal power required for the receiver, which sequence of dependency with certain neighbor
means the link cost is getting smaller. So the weight of x
link i  j , wij can be expressed by H (i, j ) . In the research Neighbor_Address( x) address of neighbor x
, L _Total( x ) times of successful connection with certain
of the minimum cost routing, the weight of link is the neighbor x during test period
forwarding cost of relaying node, and the transmission process L_Break( x) times of disconnection with certain
changes constantly. Considering the aforementioned neighbor x during test period
L_Status( x ) status identification, used to indicate good
conditions, wij is subject to the following separated constraints link or poor one existing between node
s and its certain neighbor x
1/H i, j  H i, j   
wij   (5)
 , otherwise B. Function design of simulation model
Because of random movement of the nodes and jamming By the re-development of the communication node model
effect, the node relationship matrix and the link weight matrix and process model in OPNET simulation platform, some
are both time-variant. Let E denotes the set of links, let S information (such as SINR) can be passed from the physical
and Mac layer to the upper routing layer.
denotes the source and D be the destination. The minimum
Through the improvement design of the function of
cost routing algorithm can be defined as
wlan_physical_layer_data_arrival(), the available channel
min 
( i , j ) E
w ij x ij
bandwidth, signal power, and SINR can be obtained, and the
last one is calculated by the signal-to-interference-plus-noise
  1 i S
  (6) ratio model of pipeline stage. The estimation of received signal
  ij x   x ji   1 i  D power is given in Algorithm 1.
 ( i , j ) E ( j , i ) E  0 otherwise Algorithm 1.Estimation of Received Power
s .t . 

x ij  0 ， i , j   E or x ij  1， i , j   E Input:
Ptx: Transmitted Power
 1/ H i , j ， H i , j    Prx: Received Power
 w ij   B: Bandwidth
  , otherwise
Lpath_loss:Path Loss
For the routing selection algorithm of mobile multi- Dpath: Propagation Distance
hop networks, these links with best channel state C: Speed of Light
condition and optimal connectivity should be given a λ: Wavelength
higher priority, according to the node dependency. That is, Bband_max: Maximal Band
we do not only need to estimate the cost of link but also Bband_min: Minimal Band
Gtx: Antenna Gain of Transmitter
need to judge its quality, and these will improve the
Grx: Antenna Gain of Receiver
reliability and stability of the preferred subset of next-hop frx_base_freq: Base Frequency of Receiver
relaying nodes. ftx_base_freq: Base Frequency of Transmitter
Output: Estimation of Received Power
V. STABLE ROUTING PROTOCOL BASED ON NODE 1: IF frx_base_freq > ftx_base_freq THEN
DEPENDENCY 2: Bband_min ←frx_base_freq
3: ELSE
A. Basic Protocol Design 4: Bband_min ←ftx_base_freq
Referring to the most common routing protocol of 5: END IF
6: IF frx_base_freq+ frx_bandwidth> ftx_base_freq+ ftx_bandwidth THEN
MHWNs, AODV protocol, the design process includes routing
7: Bband_max ←ftx_base_freq+ ftx_bandwidth
setup process and maintenance process. Firstly, the sender 8: ELSE
transmits routing exploration packets. We propose a new 9: Bband_max ←frx_base_freq+ frx_bandwidth
routing protocol based on AODV, and according to the 10: END IF
feedback message from receivers, the instantaneous channel 11: IF Dpath>0 THEN
state information for routing optimization will be obtained. If 12:
2
Lpath_loss ←λ ／(4π·Dpath)
2

the receiver does not have data transmission demand, the 13: ELSE
maintenance package will be broadcast limited in the hop 14: Lpath_loss←1
range by the value of TTL in order to reduce communication 15: END IF
overhead. The basic data structure of Routing Request 16: Prx←Ptx((Bband_max- Bband_min)／ B) Gtx ·Lpath_loss·Grx
17: RETURN Prx
Message is presented. And the dependency status of current
In the MAC process, the corresponding attributes and
their values need to be registered for the calling of upper

651
protocol. The arguments to this procedure form a variable
length sequence of name-type-value triplet .This procedure
assigns an attribute of a given registered process a value. The
attribute is created for the process if it does not already exist. If
it does exist and the type does not match, its type and value are
changed. The process property values are reset in the process
registry for the calling of upper protocol. The important feature
of the OPNET process registration mechanism is that any
defined process can register itself in a module level global
process registry. Some custom additional attributes can be
added and the registration process returns a special handle ----
the process register handle which is used to access by other
processes.
VI. PERFORMANCE EVALUATION
In order to evaluate the performance of our approach,
we compare the RPBND(Reliable Routing Protocol Based on
Node Dependency) protocol presented in this paper with the
classical AODV protocol and CAODV(improved AODV
protocol based on Forwarding Cost) in the same network
environment. The experiments are done in the simulated
multi-hop network environment built by OPNET Modeler, 16
wireless nodes are randomly deployed over 5000 x 5000 m2
region. Each node has a transmission range of 1000m and uses
a DCF MAC protocol. The jamming nodes include the fixed
jammer and mobile one with the random movement
characteristics. The working mode of jammer is multi-
frequency, the interference interval is randomly from 1-2
seconds and the interference duration is randomly from 1-4
milliseconds.
Data Dropped Rate
The data dropped rate reflects the performance of the
routing protocol whether can adapt to the network state change.
The interference may cause the retransmission times to exceed
the maximum threshold and result in data dropped. The data
dropped rate Performance of the three routing protocols under
interference circumstances is show in Fig. 3.
Fig.3. Data Dropped Rate performance of the three routing protocols
this paper has the best performance of Data Dropped Rate for
the effect of interference on channel state information was
estimated by receiver as the link weight during routing
selection. This metric reflects the reliability of the routing
protocol. So the RPBND protocol can ensure more robust path
in interference environments.
Wireless Network.Load(bits/sec)
Load analysis is based on the number of control packets or
routing packets complete the connection establishment
procedure for data delivery in wireless network. If the receiver
is found by sender then in that case it also replies to sender for
sending data. This graph represents the routing load analysis in
case of AODV, CAODV and RPBND in Fig.4.
The greater quantities of routing load will degrade the
network performance and affect the data packets delivery. It
means the overhead in case of AODV are heavier than other
protocols for lack of link quality evaluation. Here we notice
that the performance of our proposed protocol RPBND is much
better than default AODV. Fig.4 shows the result that the
RPBND technique gives better performance and fulfill network
requirement for considering the link quality. But it needs more
control packets to maintain channel state information
acquisition during idle time, the routing load level is higher
than CAODV but much lower than default AODV.
Fig.4. Routing Load analysis
End-to-end Average Delay
The end-to-end average delay is an important element of
network performance in multi-hop wireless networks. In the
three protocols, the AODV protocol has the highest end-to-end
delay. Without any considering about the link state information,
it simply takes hop counts as the routing selection criterion
which will increase the retransmission delay. The RPBND
protocol greatly reduced the delay caused by the retransmission,
but increased the network coding delay. Although the
complexity of algorithm was heightened in order to obtain the
highly stability, the end-to-end average delay of RPBND was
not increased extremely, and still keep almost the same as the
AODV protocols as shown in Fig.5.

Due to the interference effect, the AODV protocol without

consideration of any channel information had the highest data
dropped rate for its retransmission exceeding the maximum
threshold frequently. The CAODV protocol took into account
of the forwarding cost based on link rate, so the data dropped
rate is lower than AODV. The RPBND protocol presented in

652

Fig.5. End-to-end average delay performance of the three protocols
The simulation results show that the end-to-end average
delay of PRBND algorithm has not been greatly improved
compared with the AODV algorithm .This is because in order
to get a higher reliability, we have to sacrifice the computing
performance. The PRBND algorithm has a higher
computational complexity than CAODV algorithm, resulting in
a higher encoding delay. This is the next step in our algorithm
needs to be improved. However, the performance of data
dropped rate and network load of RPBND protocol are all
better than AODV and CAODV algorithms.
VII. CONCLUSION
In this paper, we present an enhanced stability routing
scheme based on node dependency by analysis and utilization
of the estimation of channel state information in MHWNs,
which can predict the probability of successful forwarding
more objectively. Simulation results have provided detailed
insights into the differences between the RPBND protocol, the
classical AODV protocol and the improved CAODV protocol.
RPBND and CAODV protocol have better performance and
RPBND can fulfill network QoS requirement better. Finally we
validate the routing protocol based on neighbor dependency by
experiments in simulation. As the design of RPBND protocol
has improved the routing maintenance mechanism, it can adapt
to the tactical communication conditions quickly and reduce
the retransmission delay caused by frequently link interrupts of
jamming. The simulation results show that RPBND protocol
can ensure more stable and efficient performance in highly
dynamic electromagnetic propagation environments.
653
References 
[1] Mpitziopoulos, D. Gavalas, C. Konstantopoulos, and G. Pantziou. A
Survey on Jamming Attacks and Countermeasures in WSNs[J]. IEEE
Communications Surveys & Tutorials, vol. 11, no. 4, 2009,pp. 42–56.
[2] B.Q. Kan, J.H. Fan.A Novel Jamming-aware Metric for MHWN
Routing[J]. WSEAS Transactions on Computers. Issue 12, Volume 10,
pp.417-426. December 2011.
[3] Lou Li,Fan Jian-Hua,Xu Cheng. Research on Topologically optimized
anti-jamming technology for tactical MANETs. Acta
Armamentarii,37(9):1662-1669.2016.
[4] Sangita Pal, Srinivas Sethi. Selection of Reliable Channel by CRAODV-
RC Routing[J]. Emerging ICT for Bridging the Future −Volume 2,
Protocol in Cognitive Radio Ad Hoc Network. Advances in Intelligent
Systems and Computing. 251-259.
[5] Pavel Mach, Zdenek Becvar and Robert Bestak. Acquisition of Channel
State Information for Routing Purposes in Relay-based WiMAX
Networks[C]. 2009 Eighth International Conference on Networks.170-
175.
[6] Lei Lei, Dan Wang, Liang Zhou, Xiaoming Chen, Shengsuo Cai. Link
availability estimation based reliable routing for aeronautical ad hoc
networks[J]. Ad Hoc Networks 20 (2014) 53–63.
[7] Thomas R. Halford, Keith M. Chugg,”The Stability of Multihop
Transport with Autonomous Cooperation,” The 2011 Military
Communications Conference - Track 2 - Network Protocols and
Performance,pp.1023-1028,2011.
[8] Mohamed Amine Abid ,Abdelfettah Belghith. “Stability routing with
constrained path length for improved routability in dynamic
MANETs,” Personal and Ubiquitous Computing. Volume 15, Issue 8,
pp.799-810, December 2011.
[9] Xia Hui,Jia Zhi-ping,Zhang Zhi-Yong and Edwin H-M Sha. “A Link
Stability Prediction-Based multicast routing protocol in mobile ad hoc
networks,” Chinese Journal of Computers,Vol.36,No.5,pp. 927-
936May 2013.
[10] Deng Shuguang,Wang jianxin,Chen Jianer. “A QoS Routing Base on
the Steadiest Path in Mobile Ad Hoc Networks,” Computer
Engineering,Vol.28,No.9,pp.45-47,September 2002.
[11] Hu Jie,Chen Bing,Ma Xiang-nan,He XIAO-JING,"Novel improvement
based on stable path for MAODV protocol",Journal of Computer
Application,Vol.29,No.11,pp.93-96,Nov.2009.
[12] Hossen Mustafa,Xin Zhang,Zhenhua Liu,Wenyuan Xu,Adrian Perrig.
Jamming-Resilient Multipath Routing[J]. IEEE transactions on
dependable and secure computing. Vol.9,No.6,November/December
2012.
[13] S. H. YOOK，H. Jeong, A. L. Barabási and Y. Tu. Weighted
Evolving Networks[J].Physical Review Letters 86, 5835,pp.5835-
5858,June 2001.
[14] Daniele Puccinell, Martin Haenggi. DUCHY: Double Cost Field Hybrid
Link Estimation for Low-Power Wireless Sensor Networks[C].
HotEmNets 2008,June 2-3, Charlottesville, Virginia, USA, 2008.
[15] Andrea Goldsmith.Wireless Communications, 2nd Edition.Cambridge
University Press,pp.85-87,2012
[16] Yingying Chen,Wenyuan Xu,Wade Trappe,YanYong Zhang.Securing
Emerging Wireless Systems[M],Springer Science+Business Media,
LLC, 233 Spring Street, New York, USA, 217-219.