Journal Pre-proof

ENHANCED ENERGY EFFICIENT SECURE ROUTING

PROTOCOL FOR MOBILE AD-HOC NETWORK

Rajendra Prasad P , Shivashankar

PII: S2666-285X(21)00100-X
DOI: https://doi.org/10.1016/j.gltp.2021.10.001
Reference: GLTP 96

To appear in: Global Transitions Proceedings

Received date: 29 July 2021

Revised date: 20 September 2021
Accepted date: 11 October 2021

Please cite this article as: Rajendra Prasad P , Shivashankar , ENHANCED ENERGY EFFICIENT
SECURE ROUTING PROTOCOL FOR MOBILE AD-HOC NETWORK, Global Transitions Proceedings
(2021), doi: https://doi.org/10.1016/j.gltp.2021.10.001

This is a PDF file of an article that has undergone enhancements after acceptance, such as the addition
of a cover page and metadata, and formatting for readability, but it is not yet the definitive version of
record. This version will undergo additional copyediting, typesetting and review before it is published
in its final form, but we are providing this version to give early visibility of the article. Please note that,
during the production process, errors may be discovered which could affect the content, and all legal
disclaimers that apply to the journal pertain.

© 2021 The Authors. Publishing Services by Elsevier B.V. on behalf of KeAi Communications Co.
Ltd.
This is an open access article under the CC BY-NC-ND license
(http://creativecommons.org/licenses/by-nc-nd/4.0/)
 ENHANCED ENERGY EFFICIENT
SECURE ROUTING PROTOCOL FOR
MOBILE AD-HOC NETWORK
Rajendra Prasad P1 and Shivashankar2
1
IEEE Senior Member, Associate Professor, Department of Electronics & Communication Engineering, Sri
Venkateshwara College of Engineering, Bengaluru and affiliated to Visvesvaraya Technological University,
Belagavi, Karnataka, India. Email: rajisvec@gmail.com
2
Professor and Head, Department of Electronics & Communication Engineering, Sri Venkateshwara
College of Engineering, Bengaluru and affiliated to Visvesvaraya Technological University, Belagavi,
Karnataka, India. Email: chenduss123@gmail.com

ABSTRACT- Wireless networks are considered the best utilized network and in particular Mobile Ad-hoc
NETworks (MANETs) have found many applications for its data transmission in real time applications.
The accompanying challenges restrict the current protocols for the routing being specifically used in
MANETs. The design issues in this network are to restrict the usage of energy while transmitting
information and provide security to the nodes. In the existing routing protocols, route comes from a
source where the source node seeks a way to the target node, by transmitting messages to its adjacent
nodes, and the nodes use energy to do this. Mobile Ad-hoc network faces challenges in improving the
energy efficiency and providing security for the routing protocol. This research work proposes the
Enhanced Energy Efficient-Secure Routing (EEE-SR) protocol as a novel security algorithm to access
secure data in hostile environment. In the proposed work, to secure data transmission in the network, the
nodes associates with security policy. Under this policy, both the nodes have a common enforcing policy,
and then they communicate with each other. The selection of the nodes for the transmission has to prove
its authentication and then selection of the routing path built on the available energy threshold at the
nodes in the set-up for forwarding packets in the network. The routing protocol implements the best
shortest path in network and also checks for the nodes trustworthiness by evaluating the trust policies
enforcement on it. The protocol enables a node to autonomously decide whether to select the neighboring
node or based on the available energy threshold and security policy enforced. The algorithm evaluates
increase network lifetime and low in the energy consumption, packet loss and end-to-end delay.

KEYWORDS- Energy Efficient, Mobile Ad-hoc Networks, Network Lifetime, Routing Protocols, Security,
Wireless Sensor Network.

1. INTRODUCTION

One of the most vital developments in current times is an adaptation of the wireless networks, due to
demand of enabling the mobility for connecting devices without usage of wired technology and reducing
the cost of networks tremendously by avoiding or reducing the usage of infrastructure. These networks are
capable of forming the network dynamically and build temporal network based on the application, with no
requirement of fixed sophisticate infrastructure for its communications in the network [1]. This made
increasing use of wireless network in the real time at a prolific fast rate which is expanding into many wide
areas and real time scenario applications predominantly. Wireless networks are an ideal entrant for the
applications that requires immediate operation instantaneously with services to the devices anytime and
1
anywhere respectively. This wireless networks are classified with two variants [2]. The first one being the
infrastructure network type i.e. this network uses the static gateways which are fixed and communication
from host are provided by using the Base Station (BS) coordinates communications between the devices
that are connected in wired structure for its data transmission. For instance, node positions outside of any
BS are handoff into the alternative base station range and the network continues to communicate data [3].
The typical infrastructure network applications are the Wireless Local Area Networks (WLANs). Another
one is infrastructure-less network types, generally recognized as a wireless ad-hoc networks or Mobile Ad-
hoc Networks (MANETs) [4], such networks are built without a fixed infrastructure and are entirely based
on mobile nodes. Then the nodes routes and forwards the data with the help of neighbour nodes, till it
ranges to its networks nodes endpoint. This forwarding of the data by nodes is not offered in traditional
wired or fixed networks, as the nodes in this type of network are static or stationary [5]. The typical
infrastructure-less network applications are the military application, emergency search and rescue operation,
data networks, device networks and conferencing. Where, people request to communicate rapidly the
information from anywhere and anytime as per their wish and finally the data acquisition processes for
hostile territory wherein to build the infrastructure is not possible easily in the real time and require to build
the network temporary. Wireless network classification based on the network formation and architecture is
of two types, one is infrastructure-based types and other is infrastructure-less types of networks.
Infrastructure based types of networks are fixed networks, has a base station that is connected to other base
stations through wires. The main problem with this form of network is when a mobile node travels out of
control of one station and into range of another. Infrastructure-free networks do not have fixed networks or
base stations. The nodes have the freedom to move in any direction in the network linkages. Mobile Ad-hoc
Networks are future modes of the communication systems. The MANETs are independent type of networks
i.e. without any infrastructure to communicate and these networks also utilizes the existing fixed
infrastructure network if available and exploit to communicate with other devices. Thus building the
MANET has increased due to its economical wireless networking hardware and enabling mobility anytime
and anywhere factors led to the development predominantly the mobile ad-hoc networks. A MANET has
the number of nodes which are connected wirelessly. The nodes in the set-up communicate with each other
if the nodes are within the coverage area. A mobile computing device has the freedom to move any
direction through radio links coverage area with no fixed infrastructure. With the increase short range of
this wireless technology of mobile computing devices, building applications over MANETs have become
feasible. MANET applications compute network operations wirelessly as it experienced a noticeable
increase in its usage due to its adaptability and self-configuring.

Wireless communication is the firmest emergent technologies. The difficulties for connecting the
devices have increased significantly in recent times. At first, the difference of wired and wireless
architecture comparison is given based on medium. In wired, the medium being wires to connect the hosts
for communication, whereas a wireless, the media is air, when the host communicates to others, they are
sharing the same medium behave like a multiple access. At a very limited bandwidth and two directional
antennas, the wireless networks are able to create a point-to-point communication. In a wired
communication, a host is always connected to its networks with fixed link layer address, also when host is
moved to another point then it is identified with the help of network layer address. In wireless, there is no
physical connection to the networks, host can move freely and can custom facilities delivered by the
networks. The mobility in both types of communication is very much a different scenario. A wired or a
2
wireless operates only at bottom two layers of Transmission Control Protocol (TCP) / Internet Protocol (IP)
suite. This means that if we have a wired in a building that is connected via a router or a modem to the
internet, all we need in order to move from the wired environment to a wireless environment is to change
the network interface cards designed for wired environments to the ones designed for wireless
environments. In this change, the link-layer addresses will change but the network-layer addresses (IP) will
remain the same.

The challenges in the MANETs are discussed as follows

 Ensuring nodes security in the network for secure transmission

MANETs are vulnerable to attacks as it lacks the network management functions due to its network
infrastructure-less and absence of centralized access point which distinguishing nodes as trusted and
nontrusted. The nodes in the network are prerequisite to join forces in supportive the network operation,
while no prior secure policies has been enforced on them. To enforce this security policy on the nodes of
the networks is a challenging issue in the MANETs.

 Enhancing routing algorithm by consuming minimum energy for their

transmission in MANETs

MANETs are aimed at so many research challenges because of node movement lacks centralized
infrastructure. Moreover, since network determines interference, connectivity, the devices mobility designs
will have an effect on network performance, which will eventually result in data having to be resent a lot of
times. Considering all the design aspects of MANETs, the main challenges can be categorized as follows:
the primary challenge are with respect to routing issues, i.e. find the best route paths in networks, the next
challenge is to conserve the energy while data communication from home to endpoint. Finally, the
challenge is to ensure protection for the nodes and the network from any attack in the network.

MANET’s usage in recent decades has found numerous applications, due to its ease of use and other
practical advantages. Considering the network efficiency parameters like network area, medium, routing
constraint, energy conservation and security of the network to prevent attacks in various protocols. But, the
existing protocols are not suitably implemented for all these issues.

Research contribution is the crucial in MANETs to implement the challenges enforced on existing
protocols in finding the best route with the enhanced routing algorithm, to conserve the energy as much as
possible so as to reach data to destination, and to secure overall network. This motivates and to introduce an
effective algorithm to solve the difficulties and promotes the use of an appropriate algorithm to resolve the
addressing problems in the fields of routing, energy limits and data protection of the MANET. In this
dissertation work, aims to achieve the best routing with the implementation of protocols to define network
multipath and select the best network optimal route and introduced the intrusion detection system to
MANET’s security for improved network reliability and performance by providing an efficient algorithm.

The major contributions to this research are refined energy-enhanced routing algorithm that offers
the solution to the limitation of existing protocols; the new routing protocols have been developed.

3
Enhanced Energy Efficient-Secure Routing (EEE-SR) protocol that provides overall minimize energy
depletion in the set-up, providing the best routing in the network.

The research work is organized as follows. Section 1 discussed the introduction of wireless network,
MANETs and its challenges and the research contribution. Section 2 described the related works related to
security issues and energy management in MANETs. Section 3 presents the proposed implementation of the
enhanced energy-efficient secured routing protocol for MANETs. It describes energy minimization routing
with the security policies enforcement onto nodes. Section 4 provided the experiment results and
discussion. The protocol minimizes energy, packet loss and end to end delay, and increases network life and
packet delivery to the greatest level as demonstrated in the simulation results. Finally, Section 5 concluded
the carried work with possible future enhancements.

2. RELATED WORKS

MANETs are dynamic in nature, this relates to concerns concerning resources, routing, and stability,
both of which are vulnerable to a variety of attacks. The existing literature survey presents the importance
of energy conservation as a vital parameter for network performance in the routing algorithm and proposing
an efficient energy algorithm on the basis of shortcomings of existing energy protocols. The protocols
describe the available routing algorithm schemes presented in MANET and highlight the significance of
routing in network. It also provides and introduces the security issues in networks, and discusses the
intrusion detection system for the network attacks and the propose an enhancement to the energy algorithm
adding with security algorithm. The MANET architecture is generally dynamic network and is of
distributed types which results in poor network performances. The key feature of this routing protocol is to
find the routes between source and destination efficiently to ensure that data are transmitted correctly within
the specified time frame. The route path establishments must satisfy with the least overhead. The existing
routing protocols [6] are defined best for the static environment and unable to update the frequent changes
of topology, which results in poor performances in terms of the convergence, throughput, route loops,
overhead and congestion. To improve this, sufficient research need to be carried out on the routing.

Security policy mechanisms have been defined for the infrastructure types of networks. While these
policy implementations in the MANETs applications is a challenging issue. A proportion of research has
been implemented by the authors on secure routing algorithms to discover secure path between source and
destination. In paper [7], authors have proposed an algorithm that works on reducing total energy
consumption, which intern enhances networking lifetime of the network by consideration of compressive
sensing methods along with the network coding in the sensor network. The authors in paper [8], have
implemented self-organizing energy protocol. In this protocol, the reduction of energy is done via media
access control, wherein the on-demand nodes are identified via virtual co-ordinations in finding the shortest
path for communication of data in the network. By identifying the virtual coordinates, it minimizes the
energy that robust the network lifetime. Additional, this procedure needs to support dynamic network
environment. The paper [9] reviewed the energy consumption parameters that impact the network lifetime.
The energy consumption parameters include the expectation of energy sources, energy positioning
destination and the frequency and latency of data aggregation energy network concentration. This process
results best at the single sink location rather than at multiple sink sites with limited network mobility. In
[10], the implementation of an algorithm presented, which reduced the data (information) circulation in the

4
network. This algorithm filters the noise information in the network, which reduces the traffic, by which the
energy consumption is reduced. This algorithm provides minimum energy but fails involving high data rate
communication cost, as it broadcast messages constantly in the network and have high overhead overall. In
[11] proposed protocol which limits the energy threshold to the nodes when forwarding messages. The
authors [12] proposed energy efficient routing, measuring the energy levels of each path, builds with
multiple route paths in the descending order and thereby introduces different paths and prolongs the
network lifetime. In [13] the traditional DSR routing protocols, it build the paths not taking energy into
account for choosing the paths. Both AODV and DSR use efficient resources, save energy, and support the
characteristics of mobile ad-hoc network architectures/organizations such as self-organization, self-
configuration and mobility. However, with limited capabilities, more flexible and efficient routing protocols
that are suitable for MANETs environments need to be further studied and evaluated. A proportion of
research has been implemented by the authors on secure routing algorithms to discover secure route paths in
the network. The author [14] presented the implementation of policy enforcement to nodes in network by
source response from a destination node where the source node checks are carried out. Nodes in the set-up
should satisfy the trust tier and routing tier for transmission of information. If the node is not ready to
acknowledge these tiers, then it cannot join the network. Each node of the network can agree one route
request from other nodes after posting queries in the network. These policy enforcing are primarily
designed to establish secure paths and the routing in the network, the policy fail to defend against the
malicious nodes and different types of attacks. The paper [15] discussed establishing the secure paths by
hop-by-hop broadcasting information for authentication of the nodes, the security protocol employed in the
network performs performance metric end-to-end validation through a symmetric key built device. Many
researchers have focused issues related to secure routing path that uses minimum energy for its transmission
and also discussed security concern for it, however, they aren't effective and struggle while dealing in real
time with various types of attacks. The attacks in MANET are mainly categorized as active and passive.
Passive attacks occur primarily in data link layers and the TCP / IP network layers. Such attacks do not
impact the operation of the network by importing the packet information from the available network nodes.
The attacks usually share the information under data transmission. The disturbances caused by these attacks
in the network are of less compared to the active attacks. The disturbances from these attacks are sniffing
the information, suddenly drop packets, giving false node information. Some of the passive attacks
examples available are jamming, selfish misbehavior, eavesdropping, traffic monitoring and analysis. In
active attacks, the nodes alter the route paths purposely and alter the traffic causing delay transmission and
congestion in the networks. The active attacks sometimes are referred as the routing attacks due to this
behaviour. Thus resulting in poor performance as the detection of these kinds of attacks and prevention of
these attacks are difficult. Some of the active attacks examples available are black-hole, flooding, spoofing,
worm-hole and gray-hole attacks. Such defense mechanisms can be developed only with the extensive
knowledge of these attacks.

In proposed research work, an algorithm has been designed and implemented i.e., the Enhanced
Energy Efficient Secure Routing (EEE-SR) protocol approach that finds the minimum shortest energy path
for data transmission to the nodes in the network with secured network data communication. This algorithm
provides better energy efficiency which increases the throughput and network lifetime of the network. This
algorithm makes better utilization of the energy avails in the nodes by having energy-efficient management
schemes in it.
5
3. DESIGN OF TRUSTED ROUTE ALGORITHM IN MOBILE AD-HOC
NETWORK

Wireless networks are considered the best utilized network and in particular Mobile Ad-hoc
Networks have found many applications for its data transmission. The design issues in this network are to
restrict the usage of energy while transmitting information and provide security to nodes. In the existing
routing protocols, route is originated by the source where source node finds a path to destination node by
broadcasting messages to its neighboring nodes with utilizes energy [16]. The proposed work implements
the forwarding packets through those nodes which has a higher level of energy at a given time. This allows
the network to have enough energy for the nodes for the mobile nodes while selecting the nodes to build the
routing path for transmission of information to reach destination node. In this approach, the utilization of
energy from nodes and overall set-up contributing the energy ingestion of the complete network can be
reduced. In the proposed work, to secure data transmission in the network, the nodes associates with
security policy. Under this policy, both the nodes have a common enforcing policy, and then they
communicate with each other. The selection of the nodes for transmission has to prove its authentication
and then selection of routing path built on available energy threshold at nodes in the set-up for forwarding
packets in network and energy consumption is reduced by reducing the number of broadcast messages. The
MANET faces challenges in improving energy efficiency and providing security for the routing protocol
[17]. These concerns are addressed in the proposed Enhanced Energy Efficient-Secure Routing (EEE-SR)
protocol.

 SPECIAL ISSUES OF TRUSTWORTHINESS IN MANETS

MANETs protocols have its policy and the nodes should support the enforcing policy forming a
trusted application-centric network. The network at the beginning builds trusted connection establishment
between the nodes by enforcing the policy on each of the nodes [18]. A node can interact with other nodes
depending on the trustworthy. If the nodes agree on trustworthy policy enforced on it, nodes can
communicate in the network. Considering two nodes and in the network, the node can calculate the
trust valve of node based on the successful and unsuccessful interaction defined by the Equation (1).

(1)
[ ]

Where, is the total number of trustworthy is exchanges, is the total number of successful
exchanges and is total number of unsuccessful exchanges the communication between node and node
at time interval .

Table 1: Node quantizes states [20].

Sl. No. State Condition Success Rate Transmission

1 Trustworthy Section { } Greater than70%
Nodes
2 Uncertainty Section { } Greater than 50% and less than 70%
Nodes
3 Untrustworthy Section Less than 50%
Nodes

6
 A node will quantize based on successful and unsuccessful exchanges by evaluating . The
quantization of trustiness valve of the node is categorized as shown in Table 1. Where, is the average
values of all trustworthy nodes (approximately one half) and is the average values of all untrustworthy
nodes (approximately one third). The network should be regularly updated the nodes at time by
measuring and valves and finding the trust valves continues until all the nodes evaluation of the
network.

3.1 POLICIES OF JOIN AND MERGE PROTOCOL

The policy enforcing mechanism adds new nodes entering the network, and links them associated
with protocols and merges them based on the trust value of nodes. The protocol implements the policy
enforcing mechanism for nodes in the network.

i. JOIN PROTOCOL

Protocol is first implemented on nodes when a node wants to be part of a network. The new node
connects to the network's corresponding node.

Node Node
TTL 1 1 3 3
• Request to join the
network for the
security of trusted • Apply to join the
execution of the tier network
policy • Evaluate policy
• Send the • Enforce the
Commitments commitments
• Evaluate
• Evaluate
Trustworthiness
Trustworthiness
• Grant Join request
and delivery
• Establish
• commitment
Communication

Figure 1: Policy of JOIN Protocol.

The associated node provides secure and routing policies that the nodes to connect to the network
should adhere to the policies. The network member node demands that the new node checks whether it is
sure that it can be connected to the network. Figure 1 illustrates the steps of JOIN protocol, wherein node 3
is previously a member node of the network and node 1 requests to JOIN the network.

ii. MERGE PROTOCOL

The MERGE protocol is used when a network has the same policy but holding the different trusted
key. To illustrate the merge protocol, consider trustworthy nodes 1, 2 and 3 in the network. Node 2 has been
updated with a new key and has the same policy as of node 1 and node 3 in the network. This information
has to be updated to all the nodes with a new key in the network. To merge node 1 and node 3 with a new
key, node 2 negotiates with neighboring node 1 and exchanges the key to satisfying the common policies as
shown in Figure 2. Node 3 is also updated with the new keys by merge invitation from node 1 in the
network.

7
 Node Node Node
TTL 2 2 1 1 3 3

New Key Negotiation Old Key Old Key

JOIN
MERGE Invitation
New Key,
Old Key
Authenticate old tier
membership
Deliver original newkey and
authenticate old tier membership
New Key,
Old Key

Figure 2: Policy of MERGE Protocol.

The network incorporates the following above JOIN/MERGE protocols for new nodes to join the
network and for intrusion secure policy for nodes for the transmission/ communication of the data in the
network. Under the above mechanism, each MANET will define its policy. All nodes supporting this policy
will be allowed to communicate with the neighboring nodes. If the nodes do not agree with the policy
enforced on them, nodes will be disconnected from the networks. The Joining of the network has been
implemented by the JOIN and MERGE protocols.

3.2 IMPLEMENTATION OF ENHANCED ENERGY EFFICIENT SECURE ROUTING

PROTOCOL IN MANETS

Implementation of the Enhanced Energy Efficient Secure Routing (EEE-SR) protocol in MANETs
involves two main parts. The network will initially consume minimal energy in the route and the other
determines the trust paths between nodes to communicate from source to destination. The path is build
based on the network establishment and RREQ. To understand the complete protocol scenario, consider the
model as shown Figure 3, this provides the flowchart of the implementation of EEE-SR protocol in
MANET.

The network model has been identified by the nine nodes overall with source node 1 transmitting
data to the destination node 9. The source node 1 accepts the policy of the network and becomes the first
member known as the Source node. The source node 1 broadcasts the invitation to its neighboring nodes 2
and 3 respectively, nodes 3 agrees with the trust policy and receives the key for Joining the network and
node 2 fails to agree with the routing policy and will be disconnected from the network. Next node 3
communicates to its neighboring nodes 4 and 5, similarly nodes 4, 6, 7, 8 and 9 Join the network with the
keys provided from the basis source till it reaches the node 9. The Joining procedure is implemented for all
the associate nodes in the network with the JOIN protocol.

The proposed routing approach method implementation is based on two parameters satisfying:

 Based on the trusted policy i.e. 〈 〉

Where, 〈 〉, 〈 〉, 〈 〉, and 〈 〉.
 Based on the energy level i.e. 〈 〉.
8
 Start

Initialize 𝑵
Nodes

No
𝑵𝑺 ?

Yes

Yes Yes
𝑫𝒊 𝒋 𝐼𝑛𝑟𝑎𝑛𝑔𝑒
To reach𝑵𝑫
𝑵𝑫 ?

No
No

Generat
Find Routing Table e RREP

No
Route Cannot Join the
Available Network
Yes
No Yes

Node is Join
Send RREQ, Update Trusted Network
Route Information
𝑁𝑆 , 𝑫𝒊 𝒋 ,and 𝑵𝑫

End
Join Protocol
Initialize𝒆𝒓 𝑻 𝒆𝒓 𝑻 Merge Protocol

Enforce Trust Policies

and evaluate
No
Trustworthiness
Measure
𝒆𝑵 𝑻 >?

Process
Yes RREQ

Energy Model Security Model

Figure 3: Design of EEE-SR Protocol.

The network threshold node energy level is represented in terms of percentages is observed in Figure
4. where, = application, = routing and = trust.

9
 A
A
R R
R
T T
A
4 T
R <1, 3, 4, 6>
A 6 8
T 3 5 3
R 7
8 8
5
T A
6
5 R 7
1 A
5
Source T
Node R
5
8
9
A 2
A Destination
4
5 R Node
T
T

Figure 4: EEE-SR protocol network model.

The network identifies the shortest path based on the minimum energy consumption is
〈 〉. The proposed network would meet the confidentiality policy and the minimum energy usage
policy of the mobile ad-hoc protection energy saving routing system. i.e., 〈 〉.

Path-1

4
6
3

1 7

Source
Destination 9

Figure 5: Available routing path (Path-1) of the network.

Path-2

4
6 8
3

Source

Destination

Figure 6: Available routing paths (Path-2) of the network.

10
 Path-3 & 4

4
6 8
3

1 7

Source
Destination 9

Figure 7: Available routing paths (Path-3&4) of the network.

The network after broadcasting all of the routing policies and trust policies among associate’s nodes
in the network have generated four probable route path lanes from source node 1 to destination node 9 are
shown in Figure 5, Figure 6 and Figure 7 which satisfies the trust policies enforced on each of the nodes
and they agree to be in the network. The protocols used the Join protocols and Merge protocols structure
among all the nodes in the network to build the multiple route paths from the source to destination. If the
nodes do not agree upon the network trust policies, then that nodes are not considered for forwarding the
data in the network. The summary of the routing paths is given in Table 2 and the trusted paths of the
network are given by the Equation (2).

〈 〉 (2)

The eligible network routing paths 〈 〉 of the network are tested for the route selection.

Table 2: Routing path details of the EEE-SR protocol.

Slots Paths Status Routing Path based Remarks

On Energy Priority
T1 1-3-4-6-7-9 Success 1st Routing Path -
T2 1-3-4-6-8-9 Success 2nd Routing Path -
T3 1-3-4-6-7-8-9 Success 3rd Routing Path -
T4 1-3-4-6-8-7-9 Success 4th Routing Path -
T5 1-3-5-9 Failure Not Applicable Node 5 is not satisfying the trust policy
T6 1-2-9 Failure Not Applicable Node 2 is not satisfying the routing policy

3.3 MODELING OF ENERGY EFFICIENT SECURE ROUTING FOR EEE-SR PROTOCOL

Energy restriction methods in practice play an important role in networks, where power transfer from
a source to destinations is decreased on the basis of the propagation paradigm, and where energy usage in
idle time nodes is minimised by putting the nodes into sleep mode as far as possible. The nodes in the
system absorb energy when sending packets to intermediate nodes, and when this intermediate node selects
this node as the router, its energy consumption grows more rapidly [19]. The nodes of exceptional energy
are therefore also critical for deciding the direction without disturbance. Therefore, the residual energy
routing protocol works better than the protocols. Route created on the threshold node energy level for
finding the best path from source to destination that consumes minimum energy intended for the
communication. The energy consumption of the node is calculated by the Equation (3).

11
 > (3)

Where, and are the number of packets transmitted and received after a time respectively
and 〈 〉 are energy consumed from the transmitter and receiver.

The residual energy is measured by the Equation (4).

(4)

Where, be the preliminary energy of the nodes. The average residual energy of the
network with n nodes is calculated by the Equation (5).

(5)
∑

The algorithm for the EEE-SR protocol for the MANET is as follows:

Algorithm: Enhanced Energy Efficient- Secure Routing Protocol

1 Initialize (create initial vectors for the nodes)
2 for (y=1 to N)
3 {
4 if (y is the Source Node)
5 Trust_Path [y] = Source Node
6 else if (y is a neighbor)
7 Trust_Path [y] = Source node + Neighbor node
8 Else
9 Trust_Path [y]= empty
10 }
11 Send vector {Trust_Path[1], Trust_Path[2], ....., Trust_Path[N]} to all neighbors
12 Update (improve the vector with the vector received from a neighbor)
13 Repeat (forever)
14 {
15 Wait (for a vector Trust_PathT from a neighbor node)
16 for (y=1 to N)
17 {
18 if (Trust_PathT includes Source Node)
19 Discard the path
20 Else
21 Trust_Path[y] = Trust {Trust_Path[y], (Source Node + Trust_Path T[y])}
22 if (there is a change in the path)
23 Send vector { Trust_Path[1], Trust_Path[2], ....., Trust_Path[N]} to all neighbors
24 }
25 }

12
4. PERFORMANCE PARAMETER ANALYSIS AND DISCUSSION

The implementation of the EEE-SR protocol for MANETs being covered in this section. The
proposed work's simulation is compared to other existing protocols such as the Ad-Hoc on Demand
Distance Vector (AODV) protocol, Dynamic Source Routing (DSR) protocol, and Zone Routing protocol
(ZRP).

Table 3: Parameters details for simulation.

Node deployment Random way point

Number of nodes 100 nodes
Node deployment area 100*100 meters
Simulation time 10,20,30,40,50s
Traffic type CBR
Queue Size 50 packet
Packet Size 64,128,256,512, 1024 bytes
The initial battery level of all nodes 100J
The energy required for packet transmission 0.02J
The energy required for packet reception 0.01J
Sleep energy 0.001J
Transmission range 250m
Routing Protocols AODV, DSR, ZRP and EEE-SR
Maximum Node Speed 5,10,15,20m/s
Communication system MAC/IEEE 802.11g

The performances metric are varied with respect to the nodes speed (m/s), packet size (bytes),
simulation time (seconds) and with the number of nodes present in the network. The simulation parameters
for the implementation of the proposed work are given in Table 3. The implementation of the proposed
work EEE-SR protocol and other routing protocols AODV, DSR and the ZRP protocols are evaluated. The
performance simulation parameters analysis study is illustrated in terms of its energy consumption, packet
delivery ratio, end-to-end delay and network lifetime. The observations are tabulated for the detailed
analysis and evaluation of the proposed protocols.

4.1 ENERGY CONSUMPTION

The energy usage describes the amount of energy used in routing data packets from the source node
to the destination node in the network. Figure 8 to Figure 10 shows the energy consumption with various
parameters.

i. ENERGY CONSUMPTION VERSUS NODE SPEED

The analysis gives the variation of energy consumption in EEE-SR, AODV, DSR and ZRP
protocols.

13
 Energy Consumption vs. Node Speed
100
90 AODV
DSR

Energy Consumption (J)

80
ZRP
70
EEE-SR
60
50
40
30
20
10
0
0 5 10 15 20
Node Speed (m/s)

Figure 8: Analysis of energy consumption vs. node speed.

The nodes have the high energy valves and which can be trusted and protocols distributes the traffic
load uniformly throughout path is implemented in the EEE-SR protocol to make use of the minimum
energy overall as the node speed increases in the network in Figure 8. The EEE-SR protocol identifies the
route path by selecting the high energy nodes when sending data packets in network. This reduces the
traffic load as this process avoids broadcasting to minimum compared to the other protocols. When the node
speed increases as 5, 10, 15 and 20m/s, there is increase linearly in the consumption of energy can be
observed. The observation shows EEE-SR protocol has reduced energy consumption overall in network as
compared to the existing protocols.

ii. ENERGY CONSUMPTION VERSUS PACKET SIZE

The energy consumption with respect to varying packet size is shown in Figure 9.

Energy Consumption vs. PacketSize

100
90
AODV
Energy Consumption (J)

80 DSR

70 ZRP

60 EEE-SR

50
40
30
20
10
0
0 64 128 256 512 1024
Packet Size (Bytes)

Figure 9: Analysis of the energy consumption vs. packet size.

14