CHAPTER 1

INTRODUCTION
1.1 OVERVIEW OF MANET
In recent years, emerging innovations in wireless network standards and
technologies have come to connect wide range of computing and
telecommunication devices without the need of cables. It provides various
challenges and opportunities for ad hoc connections and the option of self-
connectivity between devices. Wired Local Area Networks (WLANs) have been
very booming network in recent years, where it is more influential and flexible
solutions to the wired LANs. In initial scenario, the speed of WLAN was two
mbps and it is increased to 11 mbps with the development and implementation
of new technologies. The second generation (2G) technologies have achieved
high bit rate that enables mobile connectivity. All mobile users use cell phones
to check email through internet. In the presence of increased WLAN hot spots,
it allows travellers with handheld devices to browse internet from hotels,
railways, airports and other public places. The wireless LAN solutions are
driven by internet access in home or industry for sharing information with high
speed between computers. After the development of 3G, data rate is improved
and fast data transmission is also achieved. But these networks are fixed
infrastructure that consumes lot of investment and time for set-up and
maintenance. Moreover, an increasing number of devices such as smart phones,
digital cameras, pocket PCs, MP3 players, digital cameras etc. are with smaller
in size, cheap in prices, user friendly and more powerful.
Many technologies and standards have come in the world i.e., Bluetooth,
HomeRF, Institute of Electrical and Electronic Engineers (IEEE) standards and
infrared data association etc. These standards are formed with radio technology
to enable data transmission which provides support for network formation with
high level software. Ad hoc network is a collection of nodes or routers
dynamically forming a temporary network without infrastructure or access

1
point. Nodes are organized in a random manner and these nodes are moved
inside or outside the network region. This network may be operated in stand-
alone fashion which also is being worked with internet. A major challenge in
designing adequate routing protocols is network size, battery power constraint,
high mobility and bandwidth etc. Mobile users can communicate with access
point or base station in infrastructure based networks where ad hoc network
does not require any infrastructure or access point. It is an autonomous network
that allows users to communicate through wireless links. If nodes are located
within sender’s communication range, routes can be automatically discovered.
If nodes are not located within sender’s communication range, there is need of
intermediate nodes to forward relay packets to establish reliable and fast data
transmission. A big challenge in choosing a node is battery and capacity. The
devices are free to enter or leave the network region in the presence of
topological changes. In order to provide and achieve network functionality,
nodes are randomly moving in dynamic and multi-hop environment in the
presence of infrastructure less network.
Additionally, networks are installed and are facing with many issues in
wireless communications such as low reliability, interferences, limited physical
security and time varying channels etc. In spite of many design constraints,
Mobile Ad hoc Networks (MANETs) offers many advantages. It is more
suitable for use in many situations where centralized administration is not
available. Ad hoc network can be rapidly deployed due to self-creation, self-
organization and self-administration. It can be integrated without the
requirement of base station or wiring. In continuation to this, mobile ad hoc
networks are expected to become one of the part of 4G architecture that
provides pervasive computer environments that support users in completing
their tasks, accessing communication and information anywhere, anytime and
from any device.

2
 A new alternative route is driven by the evolution for wireless
communication where mobile devices are developed with self-creating and
autonomous network which is called as ad hoc network. MANET group has
been formed with Internet Engineering Task Force (IETF). The main focus is to
develop and implement MANET specifications to internet standard level. The
main goal is to support MANET with hundreds of routers. The major challenges
are limited transmission range, packet losses, hidden terminal issues, link
failures, transmission errors and batter constraints etc. The service zones are
integrated with MANET to provide wireless connectivity with no coverage. The
multiple gateways are provided with different capabilities and utilization.
Mobile hosts are having ability to support variation in performance that
provides high performance switch gateways. Network layer metric is focused to
improve the network performance. Ad hoc networking provides various
advantages like easy connection, dynamic network structures, and direct peer to
peer network communication. Figure 1.1.shows the illustration of MANET. It is
established without need of infrastructure. Nodes are communicating without
any access point,

Figure 1.1. MANET Representation

3
 In MANET, each node can act as source or sink with limited transmission
range to transmit data packets in hop by hop manner with less delay. In routing
protocols, packets are transmitted by discovering paths from source to
destination. Initially routes are discovered through unicast communication
where nodes are communicating in single path. Once broadcast communication
comes in routing, nodes transfer data packets in bidirectional way. Currently
proposed MANET multicast applications range from personal network apps,
unprepared small scale gatherings and business meetings, to academic,
conference and sports complex presentations involving large crowds. This range
of applications reflects the wide range of conditions that an ad hoc multicast, or
“group” communication protocol must be able to handle. Other proposed
applications such as search and rescue team communications, covert military
operations, disaster recovery and emergency response operations reflect the
“mission critical” nature of many ad hoc group applications.
1.2 CHALLENGES AND ISSUES IN AD HOC NETWORKS
Mobile ad hoc network is in the form of mobile phones, sensor modules,
desktop computers and pagers with different capacities in terms of mobility
patterns, transmission power and availability of energy. MANETs are
heterogeneous architecture which is provided with terminals and services. In
heterogeneity type of nodes, it is desired to focus both energy and
communication ranges. New issues in Ad hoc networks are security and
privacy. The traditional problems of wireless communication and networks have
come to affect the ad hoc network performance. Network frames are received in
wireless medium due to limited boundaries. A lot of problems come from weak
channel, unreliable and unstable links. The wireless channel contains time
varying properties which causes hidden and exposed terminal issues.

4
1.2.1 Research Issues In Mac Protocol
Multiple access can be divided into two cases i.e. controlled access and
random access. Carrier Sense Multiple Access with collision detection and
collision avoidance is in random access. Time division multiple access with
token is available in controlled access. Ad hoc network can be adopted by
random access due to lack of infrastructure. Bluetooth technology is the best
example for ad hoc network which is designed to support data traffic and delay
sensitive applications. In multi-hop environment, Bluetooth and IEEE 802.11
i.e. wireless LAN is not optimized and it is most suitable for wireless personal
area networks
1.2.2 Networking Issues
In general, network protocols use single hop transmission to support end
to end delay service to locate destination inside the network. Nodes are mapped
according to location services. The mobile terminals are managed in
infrastructure based networks but are inadequate. To obtain exact location of the
node, location query is to be flooded through the network. But it is most suitable
for limited size networks. The flooding area is controlled to refine the existing
schemes and protocols. In flooding propagation, number of hops is involved.
A reactive location service is constituted by flooding approach. The
service cost for discovering location information is negligible based on query
operations. The complexity is divided by proactive services. The location
information of each mobile node is constructed and maintained by proactive
services. The query operations are simplified by using data structures.
1.2.3 Routing And Packet Forwarding
The difficulty and complexity are added to ad hoc routing due to
unpredictable network topology and frequent link failures. The critical
importance of routing protocol faces challenges and complexities bringing
effective communication among the mobile nodes. Existing routing protocols

5
are analyzed and the performance analysis of the protocols is compared and
problems are identified. Based on routing, the protocol is divided into unicast,
broadcast and multicast routing.
1.2.4 Unicast Routing
The routes are established from node to node effectively to deliver
message in reliable manner in this routing. Due to the characteristics of ad hoc
networks, the unicast routing protocol becomes infeasible. The routing
algorithms used in this protocols are deployed in highly dynamic topologies
based on resource constrained devices. The routing protocols are divided into
two categories. I.e. Proactive routing and reactive routing protocols. Distance
vector and link state routing protocols are used to derive the proactive routing.
Routing updates are used to maintain and update the routing information of
every pair of mobile nodes. Routing information is usually updated in tables
and it is referred to as table driven protocols. Proactive routing is used to
maintain and update route of network nodes. The periodic and event driven
messages are used to perform route creation and maintenance. The examples of
proactive protocols are Destination- Sequenced Distance-Vector (DSDV),
Optimized Link State Routing (OLSR), and Topology Dissemination Based on
Reverse Path Forwarding (TBRPF). DSDV is a distance vector protocol where
every node maintains routing table with one route created or recorded. The
sequence number is used in DSDV to avoid routing loops. Whenever a change
occurs in intermediate node, sequence number is incremented by node. In
Optimized Link State Routing (OLSR), multi point relay is used for optimum
packet forwarding. The packets are transmitted with more integrity and
authenticated by mobile node. In trust based route, overhead is reduced by
computing shortest path towards the destination. The link state information is
propagated using Fisheye State Routing (FSR).
1.2.5 Reactive Routing

6
 In these protocols, route between mobile nodes are discovered when it is
required to reduce overhead. There are different categories of reactive routing
protocols such as Ad hoc On-Demand Distance Vector (AODV), Dynamic
Source Routing (DSR), Signal Stability Routing (SSR), Temporally Ordered
Routing Algorithm (TORA), and Associativity-Based Routing (ABR). In
AODV, the number of route broadcasts is reduced based on demand which is
just opposite to DSDV and it is just similar to the operation of DSR. In DSR
protocol, route cached is maintained by each node which contains the source
route. It is a source-based protocol. If a source node does not have a valid route
to the destination, then only route discovery process will be initiated. Whenever
a new route is discovered, the route cache will be continuously updated. DSR is
mainly used for successful packet forwarding. In SSR, routes are chosen based
on link signal strength. In TORA, it is built with the concept of Directed
Acyclic Graph (DAG). If link failure occurs, this protocol immediately supplies
many routes for packet transmission from source to destination pair with high
bandwidth. In ABR protocol, only stable routes are found and used for packet
forwarding. The energy consumption of nodes is high in ABR due to the
addition of more stability metrics.
1.2.6 Hybrid Protocols
The combination of unicast, proactive and reactive routing protocols is
called as Hybrid routing protocols. The best example for hybrid routing is Zone
based Routing protocol which defines each node acting as a zone that consists
of intermediate nodes within the allocated hop count. The packets are routed
within and outside the respective zone.
1.2.7 Multicast Routing
To support and adopt multipoint applications, there is a need for best
communication service i.e. Multicasting. There are two schemes used for
multicast routing i.e. Source specific tree and shared tree. In Source specific, a
tree is established for all destinations and single source. In shared tree, a single

7
tree is maintained for entire group. In general, multicast protocols are divided
into two types. i.e. MAODV (Multicast Ad hoc On-Demand Distance Vector)
and AMRIS (Ad Hoc Multicast Routing Protocol Utilizing Increasing ID-
Numbers). Both the protocols produce more overhead due to maintenance of a
tree. It is because of more control packets arrived at the destination that exceeds
the limitation of link capacity. To reduce overhead, mesh based multicast
routing is proposed that supports connectivity than tree. The multicast packets
are disseminated within groups. E.g. On-Demand Multicast Routing Protocol
(ODMRP) and Core-Assisted Mesh Protocol (CAMP).
1.2.8 Location-Aware Routing
In this routing, nodes forward the packets based on location of its nearby
neighbor node and sink node based on Global Positioning System (GPS). There
is no requirement of route discovery, route maintenance and route storage in
this routing. The control packets and data packets are transmitted towards the
geographical coordinates of destination node using geolocation information.
1.3 OBJECTIVE OF THESIS
In MANET, nodes are mobile which are moving in a random manner and
communicate each other without the need of any administrator. Due to high
mobility, the selection of paths may fail and leads to more energy consumption.
For providing reliability, multi-hop routing is established to provide network
connectivity, load balancing and high bandwidth. The transmission capacity of
MANET may be influenced by throughput which may affect the reliability.
Stability is also to be taken care while predicting network reliability. Link
stability and node mobility are the key factors of reliability estimation and it is
difficult to set all mobile nodes with constant reliability value. In order to
identify and improve network reliability in most cases, it is proposed to consider
Fuzzy based reliable network model based on the requirements and challenges
of ad hoc networks. The main objective of this research is to design and develop
reliable energy based multipath routing protocol.

8
The objectives of this research are as follows:
1. Reliable path selection
2. Packet forwarding through reliable path
3. Energy efficient routing for high packet delivery
4. Estimation of reliability through network parameters
5. Fuzzy decision system for network reliability selection
6. Residual energy estimation
1.4 FRAMEWORK OF THESIS
The present thesis is organized as four chapters. Some of these chapters
are based on developments from existing chapters, but in general, all of them
can be read independently as self-contained groups.
 Chapter 1 gives the introduction of thesis.
 Chapter 2 presents a literature of challenges, risks and approaches used in
MANET.
 Chapter 3 Introduces the Fuzzy based Reliable Scheme (FRS) in
MANET. Nodes as well as links must be table to keep network more
stable. High mobile nodes may affect the network performance and may
decrease the reliability. Energy rate for transmission and reception is
calculated during route maintenance period. Link existence and energy
rate are the key factors for determining network reliability. Reliability
model is formed and installed in multipath routing to follow the optimal
route discovery scheme through reliable nodes.
 Chapter 4 concludes the proposed works and presents the planning for
future implementations.

9
 CHAPTER 2
1 LITERATURE SURVEY
2.1 INTRODUCTION
In this survey, analysis has been done on multipath routing with
energy efficient schemes in ad hoc networks. Due to multi-hop routing, load
balancing is easily achieved and delivery ratio can be increased. This literature
review mainly focuses on previous challenges, goals and existing
methodologies to overcome certain issues. The drawbacks are identified and
analysed in this survey.
2.2 FAULT TOLERANT BASED ENERGY EFFICIENT ROUTING
PROTOCOLS
Ajay Shah et.al (2012) proposed an energy efficient routing protocol
without redundant rebroadcasting of RREQ packets. To reduce the redundant
rebroadcasting, the energy of all mobile nodes is saved. The route request
packets decides the relaying status through neighbor nodes. The overhead is
reduced during route discovery process.
Jayad Vazifehdan et.al (2014) introduced two energy aware routing
algorithms i.e. reliable minimum energy cost routing (RMECR) and reliable
minimum energy routing (RMER). Both routing schemes address the major
issues in ad hoc networks i.e. network lifetime, energy efficiency, reliability and
path stability. It was also considered that energy consumption, residual battery
energy and link quality in order to find energy-efficient and reliable routes that
increase the operational lifetime of the network. The total energy required for
end to end data packets traversal is reduced with the help of reliable minimum
energy routing.
Santhosh et.al (2012) proposed a reliable protocol based on energy
consumption to improve the Quality of Service (QoS) based on network
stability, and network lifetime. The reliable backbone nodes are formed and it

10
was incorporated in existing routing protocol i.e. Ad hoc On Demand Distance
Vector (AODV) protocol. Stable routes are established where battery power and
signal strength are measured perfectly to achieve QoS.
Sudhir Goswami et.al (2015) developed reliable energy efficient protocol
based on AODV. The routing capability of AODV is improved with the help of
energy dependent nodes. In the network, mobile nodes are not aware of energy
status and more packet flooding leads to high energy consumption. In
connection establishment phase, energy may be wasted which leads to network
degradation. By maintaining accurate position of mobile nodes, the possibility
of finding the destination will be greatly reduced.
Vadivel and Murali Bhaskaran (2012) have proposed a energy efficient
secured reliable routing protocol for mobile ad hoc networks. To provide
reliability and energy efficiency, a residual energy metric is estimated. An
efficient intruder detection and correction was introduced to protect nodes from
malicious attackers. The residual energy estimation and traffic inspection was
obtained to achieve more reliability. This traffic inspection was carried out
based on packet loss rate through neighbor nodes. Packet loss rate was
accurately measured.
Rajesh kanna et.al (2013) introduced the modification of AODV protocol
with more energy efficiency. The network survivability increases battery life to
balance energy consumption with minimum overhead. It was concluded that
there is not a single protocol which can give the best performance in ad hoc
network. According to the variation in the network parameters, the protocol
performance may be varied.
Saravanan Nallusamy et.al (2016) proposed Mobile Agent based Energy
Efficient Reliable routing protocol for ad hoc networks. The reliability of
network is measured based on cost metric, node burthen degree and bandwidth
usable degree, Minimum Drain Rate (MDR) and Link availability. All the
mobile agents are organized and transferred in a hop by hop manner until the

11
destination is reached. The information about the transferred is based on link
cost metric.
Kirandeep Kaur and Sheetal Kalra (2016) developed energy efficient
routing algorithm based on node energy levels and location of sink nodes.
Energy is spent for route establishment and route maintenance. Location of
destination nodes and energy levels are estimated to achieve packet forwarding.
Based on broadcasting, the location of intermediate nodes is estimated. If any
intermediate node is located in quadrant phase of sink node, then that node is
chosen for packet forwarding.
Markand and Chaudhari (2016) developed a new energy efficient scheme
for MANET that utilized the battery power of nodes to improve network
lifetime. The protocol used in this scheme was on demand routing that uses
shortest path without the use of intermediate energy. It contains energy routing
algorithm that considers both energy of the node and packets buffered in the
node.
Ramanna Havinal et.al (2015) explored a topological based scheme based
on energy aware routing. The transmission zones differed from region to region
based on information capacity. The available zone was formed and information
was exchanged between the nodes. Source node sends the query message to
establish optimal routing. Energy conservation is based on sink node
availability with effective route establishment.
Mahfuzur Rahman Bosunia et.al (2015) focused on energy aware routing
and developed an Energy-Aware and Error Resilient (EAER) routing protocol.
Here the routes are created and maintained through intermediate nodes with
least packet forwarding capability. Routing metric is calculated based on
residual energy and packet transmission capacity. For all nodes, the threshold
energy level is maintained. If any node falls below threshold, network lifetime
is found to be reduced.

12
 Rango et.al (2012) introduced energy aware routing with link stability to
achieve high network lifetime. In some scenarios, nodes may waste their energy
due to high packet flooding. So, stability is major concern to avoid packet
dropping. In this scheme, stable route metric to prolong the network lifetime is
not focused.
Khaitiyakun (2014) developed and implemented data distribution scheme
in Content Delivery Network (CDN). Similar to other packet forwarding
schemes, neighbor nodes are located near to destination nodes for efficient
packet forwarding. Optimal link state routing is also considered to cover third
party nodes using the multipoint relay concept.
Vadivel and Murali Baskaran (2016) introduced the concept of adaptive
reliable routing with congestion control to reduce transmission errors and packet
delay. Congestion is controlled by means of limiting path failures and reducing
packet losses. According to utilization of links as well as nodes, the congestion
is dramatically reduced in this routing.
Jayalakshmi and Ramesh kumar (2012) proposed the Multipath Fault
Tolerant Routing Protocol to increase the data reliability. Fault tolerant routes
were created between the nodes to achieve network reliability. According to the
requirements of network changes and application layer, multi objective routing
is established and maintained.
Istikmal et.al (2017) introduced Signal to Noise Ratio (SNR) based Cross
layer scheme which focuses on cooperation between physical and network layer
to improve routing performance. Mechanisms like SNR and cross layer design
is also deployed to focus on protocol performance. Link selection on reverse
route is established from destination to source based on SNR. Due to this
selection, the additional overhead is also reduced. The route selection with SNR
was done in this work for choosing better routes with more stability.
Chinnasamy and Vadivel (2017) presented energy efficient spectrum
aware channel sensing routing protocol to minimize energy cost and prolong

13
network lifetime. For cooperative channel sensing, the network clustering
scheme is introduced based on learning method. This algorithm was proposed to
attain maximum network lifetime. Apart from QoS metrics, the new metrics
success rate and broadcast delay are added for the proposed routing protocol
performance. The network is organized in terms of cognitive radio nodes
instead of mobile nodes and moves inside the network within network area. The
access to data communication and empty channels was also done in this
network.
Niranjankumar ray and Ashok kumartaruk (2016) introduced a hybrid
energy efficient protocol based on the concept of sleep scheduling with location
identification scheme. This protocol is implemented based on the consideration
of topology control and battery management scheme. Only energy efficient
links are chosen and nodes which are not participating in packet transmission
are kept in sleep mode. Compared to existing schemes, this protocol produced
high delivery rate and more energy efficiency. The advantage of this protocol
was high transmission power but more delay due to consumption of many hops
to be taken towards the destination.
Mandhare and Thool (2016) developed the new cache update mechanism
based on route cache replacement process. The stale routes are identified and
removed to carry out the link failures. The existing Dynamic Source Routing
Protocol (DSR) is modified by adding link breakage in Route Error (RERR)
packets. The packet size is limited for RERR to all intermediate nodes. Hence
all neighbor nodes remove all stale routes in route cache and add the new
authenticated routes. Once the topology is identified and broken link
information is obtained then that information will be immediately forwarded to
all nodes in the network. Based on the simulation results, this protocol provided
more packet delivery ratio and less end to end delay than existing schemes.
NagulaMeera et.al (2016) reviewed energy efficient routing models to
enhance network lifetime. The pros and cons were identified and solved. The

14
context of multicast routing protocols is in literature survey in order to improve
transmission rate. Some of the topologies like mesh, tree and hybrid topology
with minimum energy consumption and more network lifetime were identified.
Based on the review, high mobility nodes and noisy transmission are not
considered in dense networks.
Sultanuddin and Ali Hussain (2016) introduced a novel Short and
Efficient Multipath Routing (SEMR) routing protocol for energy efficient in ad
hoc networks. In this system, security and capacity are the key factors. The
cross layer is interfaced with this protocol to choose best routing paths among
other paths to improve network lifespan based on application category.
Multipath framework with cross layer interface is analyzed for network
performance. The network performance is compared with different metrics
based on authentication, data integrity and confidentiality. The packet delivery
ratio is found increased and delay was successfully reduced by applying cross
layer framework based on application type.
Nahari and Mohamad (2016) presented a receiver based ad hoc on
demand multipath routing protocol to improve network performance by
reducing delay. The time delay during reestablishment of route discovery phase
is reduced during network prediction and congestion. Once all packets are
received at the sink node, it checks packet loss ratio and packet delivery rate. If
any data is not received, sink node begins route discovery process by sending
route request packets to all intermediate nodes. After the number of trails, if the
data packets are not received, the route discovery process will be stopped.
Bheemalingaiah and Naidu (2016) introduced energy aware on demand
multipath routing protocol by alternative existing AOMDV protocol. The
energy aware multipath routes are chosen based on two performance metrics
cost per packet and node cost. If these two metrics are focused, the network
lifetime of MANET is improved. The performance of this protocol is analyzed
and simulated with existing protocols to improve the network performance.

15
 Junwei Jin and SanghyunAhn et.al (2016) introduced multipath routing
protocol using bloom filter. A salvage based node-disjoint multipath routing
(SNMR) protocol is proposed for effective data transmission and packet
salvaging with low overhead. A primary path with backup alternative path is
constructed for effective data transmission. Based on route towards the
destination node and compressed path information using bloom filter, the data
rate can be effectively improved. Establishment of multiple routes and low
overhead are focused in this scheme.
Omar Smail et.al (2016) developed a new novel protocol i.e. Energy
aware stable cluster based multipath routing protocol to minimize delay from
source to destination node. By adopting this multipath protocol, the utilization
of energy is equally distributed. The clustering scheme used in this protocol
reduced control overhead. This protocol is implemented with energy limited
mobile nodes. It leads to frequent path breaks and link failures. In a clustered ad
hoc network, multiple routes are discovered from source to destination to
choose links with least energy consumption with stability. The objective
function is derived to combine energy efficiency and stability of links.
Yujun Zhang et.al (2014) designed a Topology- Hiding multipath routing
Protocol (TOHIP) based on the threats arising from topology exposure and
topology hiding. Link connectivity information is added in route messages. The
topology information is not deduced by any nodes and it will be totally hidden
to all intermediate nodes. Only node disjoint routes are obtained which excludes
unreliable paths from source to destination. This protocol was totally a loop-free
and topology hiding protocol. Based on simulation analysis, this protocol had
better capability of finding routes and no downgrade performance in the
absence of malicious nodes. If malicious nodes are present, the packet delivery
ratio was successfully improved in this protocol at low overhead and minimum
convergence time.

16
2.3 FUZZY BASED RELIABLE ENERGY EFFICIENT SCHEMES FOR
MANET
Kharbash and Wang (2007) introduced fuzzy based multi affected to
increase information rate from source to destination with minimum delay. The
route was established with minimum hop count. The lifetime of network is
improved based on better transmission from end to end network connection. But
stability was not considered to improve network lifetime.
Gupta and Kumar (2000) established the intelligent agent routing with
fuzzy decision scheme to reduce packet loss with fuzzy membership function.
The path failures are corrected using membership function. The reliability of
network is considered based on link and node stability. Properties of link and
node are balanced during route maintenance.
Santhi and Alamelu Nachiappan (2012) developed fuzzy agglomeration
based on location of mobile nodes for multicast communication using kalman
filter mechanism. The strength of cluster head has been estimated using
agglomeration technique. The cluster head’s stability was not determined during
route discovery phase.
Alireza Shams Shafigh et.al (2014) explored the fuzzy logic rate control
scheme using on demand multipath routing protocol in MANET. The traffic
flow is controlled and balanced without affecting the data packets from source
to destination. Delivery rate is increased during high traffic flow. But it is not
appropriate for real time network scenarios.
Pushpender and Prof. SohanGarg (2013) developed a new routing scheme
using fuzzy logic multi-hop technology. The information measure and output is
balanced using this routing. The stability metric is determined during route
maintenance scheme. No effort is taken for stability improvement in this work.

17
 Table 2.1 Comparative Analysis of Energy based Reliable
routing Schemes
S.No Author & year Methodology Metrics Laggings Found

1. Rango et.al, 2012 Novel Routing Link duration, High energy

Strategy nodes lifetime, consumption,
Control overhead less packet
delivery ratio
2. Khaitiyakun, 2014 Content Delivery Network lifetime, High packet loss,
Network Delivery rate, More link failures
technique Residual energy
3. Chinju P Varghese Geographical Packet collision, More delay on
et.al, 2013 routing delay, load discovering routes
balancing
4. Jerrin Joe et.al, Loose virtual Power High packet loss
clustering based conservation,
routing protocol Packet loss ratio
5. RagevendraGowda Macintosh Queue size, power Transmission loss,
et.al, 2013 competition transmission Delay
window
6. GiddaluruMadhavi Queuing Traffic blockage, High traffic delay
and M.K. Kaushik, methodology routing overhead,
2013 delay
7. Sungwook Kim, Multipath Congestion rate More congestion
2014 routing leads to high
power
consumption

Singh et.al (2012) introduced reliable multicast routing using fuzzy model
to make network reliable. Many source and destination nodes participate in this

18
network to satisfy the quality of service and ad hoc network challenges. The
reliability is not determined and integrated in MANET in real time traffic
scenarios.
Deshpande (2012) developed an agent approach QoS routing using Fuzzy
priority scheduler to increase packet delivery ratio. The fuzzy computer
hardware was developed to find priority index of packets during transmission.
The input parameters like ending time, delay and queue length of packets are
determined for better network reliability. The measure of packets was estimated
in First in First out (FIFO) manner to improve packet quality. In each stage,
fuzzy priority is estimated using network agents.
Rathnamma and Chenna Reddy (2016) implemented security level
routing based on mathematical logic to find and establish secured multicast
routing in MANET. Only secured routes are established from source to
destination using trust based routing scheme. Reliable multicast routing was not
focused in this routing.
Gomathi and Rajendran (2012) proposed Fuzzy value enhanced cluster
based routing to provide load balancing and also to improve link quality. In
such cases, the metrics were not improved but achieved required QoS.
Mallapur et.al (2009) computed multicast tree which supports the
spanning tree concept using fuzzy controller. Three inputs were used like link
capacity, information measure with delay and responsibility of links. The output
of the tree is to produce better network performance with high reliability.
Lu Jin et.al (2007) developed an Adaptive Fuzzy logic based Security
level routing protocol with mathematical logic. Reliable and secure multicast
routes were found based on network density rate and estimation of network
integrity.
Table 2.1 illustrates the comparative analysis of energy based multicast
routing schemes and categorized different methods for energy efficiency. Some

19
of the laggings are found in this survey. Different routing techniques are found
with low data rates, more energy consumption and random updates of node
locations etc.

2.4 RELIABLE MULTIPATH ROUTING SCHEMES FOR MANET

Kulwinder Kaurand Kamaljit Kaur (2015) analyzed and tabulated
various fault routing algorithms and schemes for ad hoc wireless networks. The
major issues like network failure and energy wastages were analyzed and
solutions were given to the issues. The performance analysis was made on
reliability, network throughput and network lifetime and it was recorded in
network routing table.
Zeeshan Iqbal et.al (2016) introduced an adaptive cross layer multi-hop
routing protocol in the presence of dynamic mobility scenarios. This protocol
was developed from on demand protocol during path maintenance from source
to destination satisfying QoS parameters. This protocol contains fault tolerant
routes with high data rates and less packet loss ratio. The routes are established
and adopted with high data rate and more integrity.
Senthil et.al (2015) proposed energy efficient QoS routing to estimate
physical parameters particularly link reliability with fuzzy logic technique.
After implementing this approach, routing layer was more robust. The link layer
and physical layer is found to perform better in Open System Interconnection
(OSI) architecture. Using physical layer, the signal to interference noise ratio is
improved and neighbor status time was calculated in link layer. The packet
transmission status was determined to obtain data rate and data count
information.
Nisha Chaudhary et.al (2015) analyzed fault tolerant routing schemes to
route the packets through optimized paths. The energy efficiency was increased
by adopting threshold signal strength maintained in all paths. The packet loss

20
rate is reduced successfully while monitoring both route discovery and route
maintenance process in the presence of dynamic links.
Fatemeh Tavakoli et.al (2016) introduced fault tolerant routing scheme
while adopting proper routing procedure. Fault tolerability and redundancy was
improved using fault tolerant routing algorithm. Based on the prediction of
reputation parameters, backup routes and nodes were identified. Once the
backup nodes were located, fault tolerant routing are initiated, meanwhile
primary path between source and destination node was estimated.
Monisha rani and Amitchhabra (2016) implemented a new link
optimization procedure to increase bandwidth efficiency using window channel.
The existing threats and challenges were found and solutions obtained to
improve the energy efficiency. The link cost metrics and node reputation
parameters were the key to obtain the optimal path.
Suhailand Nidhi (2016) developed the fault tolerant multipath routing
protocol while integrating interference noise ratio in the presence of dynamic
mobile nodes. The performance metrics like mobility, bandwidth and
transmission power may affect the routing protocols. The network traffic load
was distributed to increase the packet delivery ratio. The interference was
reduced between node disjoint routes.
RakeshMeena et.al (2016) developed the topology based transparent
routing to improve network performance. The gain was improved based on
network scenarios. In this routing, network was kept as both static and dynamic.
Energy was estimated and routing steps were modified according to energy
status. The paths were discovered and applied with minimum hop count to
increase energy efficiency.
Soon gyo Jung et.al (2016) proposed an energy efficient protocol based
on the behavior of ants. The issue of additional traffic was determined and
solved with the help of ant node behaviors. The routing trail and behavior of
forwarding nodes are identified and adopted in network model. Using the

21
concept of ant colony optimization, the traffic and overhead was successfully
reduced.
Baolin Sun et.al (2016) presented energy entropy based power cost
routing algorithm to provide reliable transmission and to achieve load balancing
among all mobile nodes. The total transmission power was reduced to increase
the network lifetime. The energy consumption of nodes and links was reduced
based on network parameters.
Bander and Almogren (2016) introduced and estimated the trust
parameter based on energy model to increase the remaining energy of mobile
nodes. The reliable parameter were focused and estimated to keep network
lifetime high. The network lifetime was not increased in the presence of mobile
environment.
Nandhini and Sharmila (2016) proposed an effective and secure
broadcasting model to provide integrity and authentication with high energy
efficiency. The security challenges are identified and particularly focused on
confidentiality and authentication. The network overhead was successfully
reduced by estimating confidence correlation from source to destination.
Sugandh and Panday (2016) proposed an energy efficient routing
protocol for increasing the network lifetime. Packet loss rate and energy
efficiency are the key factors for selecting cluster head that maintains cluster
members and routing tables. This table contains previous history, energy
consumption level and network load. The major issue in this work is excess of
overhead. The excessive control packets were not reduced.
Kokilamani and Karthikeyan (2016) proposed Location and Mobility
optimized on demand geographical multipath routing protocol to choose
optimal paths with minimum hop distance. The relationship between path
distance and MANET parameters was estimated based on transmission range,
energy consumption and transmission bandwidth. Multipath routes are
established to reduce delay, congestion rate and more queue packets.

22
 Narayanan et.al (2013) discovered cluster head election based on fault
tolerant routing establishment. The concept of local repair scheme was
integrated with fault tolerant routes to reduce link failures. The link breakages
were avoided as it was not able to reduce overhead and delay.
Periyasamy and Karthikeyan (2015) developed link reliable multipath
routing protocol to overcome the issues from link failures and path failures in
highly dynamic ad hoc networks. The reliable path was identified based on path
length and path link quality checker to prolong the network lifetime. Whenever
the routes are discovered from source to destination, only reliable links are
chosen based on minimum hop count which does not face any failures due to
dynamic nature. The random way point model was focused in this protocol to
achieve QoS.
In general, multipath routing protocols flood route request packets to
destination node via more intermediate nodes. It is not mandatory to find
optimum path for packet forwarding. If the power source of mobile nodes is
controlled, the power consumption by the nodes will be also controlled to
prolong the network lifetime. In multipath routing, finding an optimal path is a
major issue. It becomes more complicated when huge number of nodes is
participating in packet transmission. During the identification of shortest routes,
more energy will be consumed during data transfer. Mueenuddin et.al (2017)
proposed an energy efficient fitness based ad hoc on demand multipath routing
protocol. In order to select optimal path, fitness function was estimated and
used based on route distance and energy status of the routes. By minimizing
energy consumption for packet transmission, the network lifetime was
prolonged using this protocol.
Table 2.2 Comparative Analysis of Existing Fuzzy based Multi-
hop Routing Schemes
S.N Author & year Methodology Metrics Laggings

23
 o Found
1. Sultanuddin and Cross layer Delay, The routing
Ali Hussain, based efficient overhead and efficiency was
2016 multipath packet delivery not improved.
routing ratio
2. Niranjankumar Location based Data rate, More delay
ray and Ashok sleep scheduling transmission due to number
kumartaruk, scheme power, delivery of hops
2016 ratio and end to towards the
end delay sink node.
3. Mandhare and Cache update Network High overhead
Thool, 2016 mechanism lifetime and
delay
4. NagulaMeera Multicast Energy Less
et.al, 2016 routing efficiency and performance in
network the presence of
lifetime high mobility
5. Nahari and Receiver based Delay Route
Mohamad, 2016 AOMDV discovery
process was
stopped due to
more delay.
6. Omar Smail Energy aware Control Objective
et.al, 2016 stable cluster overhead, function
based multipath stability and produces more
routing protocol energy delay
efficiency

24
25
 Table 2.3 Comparative Analysis of Existing Reliable energy
schemes
S.N Author & year Methodology Metrics Laggings
o Found
1. BanderAlqaml etl.al, Power Energy Less residual
2016 efficient efficiency, energy
routing Fault
tolerance
2. Nandhini and Secured Data integrity, More
Sharmila, 2016 message Energy intruders
distribution efficiency will present
and reduce
energy
consumption
3. Baolin Sun, et.al, Minimum Energy Less energy
2016 power cost efficiency efficiency
multipath
routing
4. FatemehTavakoli, Fault Fault tolerant Less fault
et.al, 2016 tolerance rate, energy tolerance
routing consumption
5. ZeeshanIqbal et.al, Cross layer Load More jitter,
2016 balancing, High
energy network
efficiency density
6. Rathnamma&Chenna Trust based Reliability and More power
Reddy, et.al, 2016 secure routing confidentiality consumption

7. Bander H. AlQarnl Energy Link capacity Load

26
 and Ahmed efficient and network balancing is
S.Almogren, 2016 routing lifetime not possible
AODV (Ad-hoc On-demand Distance Vector) routing protocol is a
widely used protocol. In this protocol, single route reply packets along the first
reverse path was established from source to destination to provide network
connectivity. During high mobility scenario, the reverse path is disconnected in
prior and route reply packets from destination may be lost. If the route
discovery procedure is reinitiated, the power consumption and delay will be
increased and packet delivery ratio will be decreased.
Santhiya et.al (2014) established dynamic reliable multipath routing
protocol using reverse route discovery process. In this process, the sending of
control message is a major role with minimum energy consumption. Once the
route request packets are received, destination node broadcasts reverse route
request message to all available paths towards destination nodes. Source node
receives messages from all paths, and selects best path to provide continuous
data transmission.
Table 2.2 represents the existing fuzzy based multicast routing schemes
for optimal path selection and reliability. Some of the laggings are found in the
existing schemes i.e. more congestion, packet loss and absence of stable links.
Table 2.3 represents the comparison of previous reliable energy efficient
schemes in MANET. Some of the methodologies are analysed in terms of
routing, topology, protocols and performance metrics. In some cases, trust
routing is a major issue which may influence the network performance. The
abnormal nodes are not forwarding packets and tunnelling the packets without
informing to source node.

2.5 SUMMARY

27
 This chapter analyses some of laggings and advantages of existing
schemes in MANET. Based on the literature survey, it can be easily concluded
that many researchers have developed their own energy efficient protocols
based on the consideration of routing, topology and metrics. To prolong the
network lifetime, research has been made on power aware multi-hop routing
schemes. From the existing simulation results, the energy was greatly increased
but consumption of energy was not balanced but wasted. Reliable energy based
routing is a major concern to enhance network lifetime. Reliability of network
may be degraded by not balancing stability and mobility of nodes. In the
presence of dynamic links and mobile nodes, network reliability may be
improved by focusing on multi-hop reputation based routing. Fuzzy decision
system is a major goal which brings maximum energy efficiency in a network
while considering reliable multi-hop routing.
This survey helped to propose new reliable energy efficient protocol with
fuzzy interference system to enhance network lifetime in MANET. Fuzzy
decision making system is used to provide reliable routing. This routing is
adopted in the proposed schemes to increase energy efficiency. The concept of
multi-hop routing protocols have been considered and proposed a new protocol
while focusing reputation, reliability and stability of a network.

28
 CHAPTER 3
FUZZY BASED RELIABLE SCHEME FOR ENERGY EFFICIENCY
FOR MANET
In this chapter, Fuzzy based reliable multipath routing is introduced to
overcome link breakage and high energy consumption in the network. Link
existence is a major key to increase the network lifetime. If links are tolerable
and nodes are reliable, the network connectivity and lifetime can be successfully
increased. In existing scenarios, the focus was to solve link failures using
alternate path scheme or balance energy consumption by proposing an energy
model. It was of no use to focus on a particular fault in the network. In the
proposed scheme, network reliability is measured in terms of link existence,
stability of routes and node to node connectivity. Fuzzy model is one of the
important decision making model to find the outcome of network with input and
output membership functions. Based on fuzzy decision model and reliable
routing, the ratio of number packets received to packets sent is successfully
increased without loss.
3.1 ASSUMPTIONS MADE FOR RELIABLE ROUTE SELECTION
The assumptions are made to create and identify reliable nodes among
high mobility environment. These assumptions are identified and CH
announced to all cluster members before the route commencement of
1. The mobility of nodes is kept low where nodes are moving within the
network zone or out of that.
2. The transmission distance is fixed and is decided by node mobility and
connectivity between nodes. If links are fluctuated randomly, a node may get
disconnected to increase transmission distance.
3. The data transfer rate is constant i.e. 4 packets/sec which is followed during
packet routing.

29
4. Data transfer and control transfer are activated bidirectional between source
CH and Destination CH.
5. Node stability and node mobility are estimated after all control packets are
received destination or sink CH or node. It is reported to main CH to absorb
current routing activity.
6. The routing protocol used is Dynamic Source Routing which provides high
energy efficiency and less routing overhead.
3.1.1 Route Setup Phase
In this phase, data is transmitted and route setup is initiated by CH for
packet forwarding to sink node. In any path, nodes store the information about
transmission capacity of the neighbour node before forwarding the packets
towards the destination. The link transmission capacity indicates the number of
packets that can be successfully received at the receiver through a particular
link. CH locates high transmission capacity links in its primary path. If primary
path is broken due to circumstances, secondary path is created with more
transmission capacity. Once the path is discovered, the probability of forward
and backward reception rate is estimated over a link. In setup phase, CH
broadcasts control packets and stores the count of received packets from
intermediate nodes in its cluster maintenance table. During the next set of
control packets transmission, the current history of data transmission will be
removed from the routing table. The sink node assumes that the initial
transmission capacity is zero and broadcast this value to all intermediate nodes
and it may be increased after set of all successful packet receptions.

30
3.1.2 Route Discovery Phase
Whenever CH wants to send data packets to sink node, the route
discovery process is started to obtain multiple routes from source node to sink
node. The reliability measures like transmission capacity, link stability, node
mobility, optimal traffic rate and residual energy are used to find multiple
routes. CH starts route discovery by transmitting Cluster Route Request (C_RR)
towards the sink node. Whenever neighbour or intermediate node receives
C_RR packets, it computes the above said reliability measures for a particular
route that is discovered from source CH to sink CH. These reliability measures
are also used to discover path for packet forwarding with minimum cost. The
measures like link stability, transmission capacity, mobility of neighbour node,
traffic rate are stored in routing table of every node located in the path. The
optimal path is found based on reliability measures among multiple paths.
If simple information is needed to transfer from source to sink, default routes
are used rather than searching or choosing more routes. These routes are the
shortest routes among multiple routes based on hop count and link stability. The
link stability is estimated based on the bit error rate. The number of packets
received with error at the sink should be kept low. Low bit error rate produces
high stable links for successful forwarding of packets. Default routes may also
act as primary routes to forward packets. CH sends C_RR message to all
intermediate nodes. The reliability measures are stored in routing table of
intermediate node in selecting an optimal path. In case of more default routes,
shortest routes will be first priority. Sink node will send C_RREP packets based
on number of paths on shortest routes. If more number of packets are to be sent
towards multiple routes, only shortest routes are considered for successful
delivery of packets.
When a source node or CH needs to send packets to a sink node, it looks for
the shortest route in its routing table. If any straight path from source to sink
node is not available, CH will send a route request to intermediate nodes. In

31
route request packets, it contains three major fields i.e. path stability, energy
metric and required energy for data transfer. The required energy is spent for
packet transmission and reception.
If any node receives route request packets with poor signal strength, it will
be dropped immediately from the node. Each node will confirm the required
energy for data transfer with route request packets initiated by CH. If the
conditions are met and satisfied, the reverse route will be made as an entry in
the routing table of all intermediate nodes in the path. If the signal strength of
node is above threshold, it is considered as stable node. Energy metric and path
stability are calculated to establish optimal routes between nodes. After first set
of control packets are transferred, and the route stability and residual energy
calculated and reported to CH. The relevant information is observed from route
request packets and moved to route forward table of all nodes. This information
will be added in the cluster head route maintenance table. If any duplicate
packets are received, it will be identified and discarded from the network based
on path stability and energy metric value. CH will always look for a node with
maximum reliability metric value and forward the packets.
The route request packets will be received at the sink node with different
routes. While receiving the first packet, the sink node initiates timer for duration
of route reply delay. Sink stores all received route request packets in its routing
table and estimate route forward value for path explored by RREQ. If sink node
receives more than one request packets before timer expires, it forwards route
reply packets with maximum reliability metric. The control overhead is
dramatically reduced during the route discovery phase due to multiple route
reply for single route request packets.
The sink node creates the fraudulent table and records the packets if it is not
received within the time period. It will be automatically deleted from the table.
The possibility of link breakage is often found in MANET. The proposed
scheme is adapted to link failures due to maximum drain energy and high

32
mobility. The route discovery mechanism is executed to know the status of
discovered routes after every 2 seconds. If any intermediate node is with weak
battery status or if it is receiving poor signal packets, the route availability is not
possible. If the route is available, it returns the mobile node to the downstream
of cluster region. Once the downstream node receives the packets, the table will
be updated. The data packets are routed through new route to stop packet losses
due to link failures.
3.2 ALGORITHM FOR NETWORK RELIABILITY ESTIMATION
Network reliability is measured and reported to CH by intermediate
nodes. The following steps are used to obtain network reliability.
Step 1: Set the location of intermediate nodes within transmission range
which is near to sink node through minimum hop route.
Step 2: Multi-hop routes are established from CH to sink node by
activating bidirectional links.
Step 3: Estimate packet loss rate from source to destination and keep it
minimum by increasing probability of link existence.
Step 4: Based on packet loss rate, link stability is estimated and reported
on particular route to CH. CH broadcasts the stability of route to all
intermediate node to use the path effectively to forward the packets.
Step 5: The probability of link existence is obtained based on link
ξ ξj
P ( β m =1 )= β j ( 1− β )
configuration. i.e. . Where β,ξ ,l ,m are the
coefficients and link capacity.
Step 6: Mobility of nodes are obtained based on speed and it is used to
measure link expiration time.
Step 7: Once the packets are received at the destination node or
neighbour nodes, it records the packet sending status, receiving status,
packet loss status and mobility of nearby node.

33
 Step 8: The energy rate is calculated based on energy dissipation of all
nodes. Approximate drain ratio is calculated from existing and new one.
i.e.,
ER χ = χ ER old + ( 1− χ ) ER new
Where 0< χ <1, indicates more updated information.
The total energy for transmitting a packet is calculated by,
m−1
Emn = ∑ α ×din( i+1 )×( τ req + τ ack )
i =1
m−1
+ ∑ α×d ni (i +1)×( τ req + τ ack + τ rts +τ cts )
i =1

In this equation, is the one route and i+1 is the nearest multicast route
τ rts ,τ cts
which can be used in case of any link failures. is propagation
delays occurs on Request To Send (RTS), and Clear To Send (CTS)
packets.
Step 9: Calculate the network reliability based on node mobility, link
existence and total energy dissipation. If no path exists, the reliability of
the network configuration is zero.
Step 10: All paths with high energy and stability are found
3.3 FUZZY LOGIC BASED NETWORK RELIABILITY SELECTION
Fuzzy logic control is a power decision making system which may have
sufficient data or not. The network lifetime and routing efficiency can be
improved using fuzzy logic. For cluster head selection, fuzzy logic can be used.
Once the network is layered based on fuzzy variable and fuzzy rules, the node
priority is estimated and used for choosing cluster head. The communication
between two CHs is not possible in the same layer, but the communication lies
in different layers. The isotropic data transmission is used in this concept with
respect to input and output variables of fuzzy logic. During cluster head
selection, some factors may affect the CHs performance. In two level fuzzy

34
logic rule, cluster head is chosen based on distance between CHs, node
centrality and sink capacity. The fuzzy based cluster head selection is
implemented based on residual energy, node capacity and stability. According
to physical characteristics of node, distance among CHs and node density, the
cluster region transmission range is expanded. The network lifetime is improved
in network region while choosing high stable nodes and CHs. The energy
consumption of CHs is always less than intermediate nodes and unknown nodes
which joins the network. The packet load is balanced while the data
transmission occurs between cluster head and cluster member. The sufficient
distance between cluster heads is maintained to balance network connectivity.
The energy metric, the node density, and the node centrality are used as the
fuzzy input variables and produces network reliability.
In this module, fuzzy model is used for choosing network reliability
based on residual energy and probability of link existence. These two
parameters acting as input to fuzzy inference system and produces network
reliability. The concept of mamdani fuzzy model is deployed in the proposed
scheme which produces output crisp value. If any one of the inputs goes below
threshold value, network reliability will be low.
3.3.1 Fault Tolerant Routing
The paths are identified and built based on node energy. Based on packets
flooding, the number of packets will be retransmitted. If the packets are flooded
from previous node, the packets may be retransmitted. Shortest path is chosen
by CH based on optimal energy, link capacity, and successful packet forwarding
ratio and path reliability. The probability of retransmission is reduced by means
of selecting high power node and path strength. If the destination node’s
strength is found by transmitting node where the power is nearing threshold
level, the transmission rate will be reduced automatically. The alternative route
can be found with addition, caching of packets. The next nearest neighbour

35
node is found for packet transmission to the node. The shortest path is identified
from the node and then retransmission begins.
If any two nodes are about to fail, the data is saved and located by other
mobile nodes in the region. The loss of packets from source to destination and
new route discovery process can be totally avoided. The data is saved by
alternative paths to avoid initializing new route discover process. If any node is
added to the cluster region, its transmission energy is compared with threshold
energy to reduce high power nodes. CH floods RREQ packets to all nodes to
find efficient route. During failure of any intermediate paths, the lesser effective
paths can be identified for forwarding the packets through that path towards
destination. If an intermediate node fails, the previous node in that path will also
get failure. Still, alternative paths considered will act as active path. If node
failures or link breakage occurs, alternative routes are considered to find the
efficient routes. The message alert will be given to all nodes from CH to
forward control packets successfully in order to improve network stability. The
delay is reduced by means of multi-hop routing towards the destination. It is
very useful when intermediate nodes fail. The routing procedure will be
followed to improve network routing efficiency.
The battery levels of the node are divided into three types. i.e. active
mode, critical mode and dead mode. In active mode, energy is saved above 50%
and energy lies between 20% and 50%, it is called as critical mode. In dead
mode, battery level is less than 20%. CH broadcasts RREQ packets to
destination node. Intermediate node will reply via route reply packets which
contain link energy metric, source ID and destination ID. Intermediate nodes
will reply to RREQ packets only if battery of node is greater than threshold
level, which may be in active mode and critical mode. Once the RREQ packets
arrive at the destination, the total energy of the particular route is calculated.
The total energy of the route is calculated from sum of total node’s
energy and remaining energy after route maintenance in that route. Maximum

36
energy factor is calculated in individual routes and common threshold value is
set .The calculated route energy is estimated based on link’s maximum energy.
The calculated routes total energy is the maximum energy of a link for that
route. The procedure is described below.
Step1: Nodes that not are not active in route maintenance, it will be kept
in sleep node.
Step2: CH broadcasts RREQ packets to all neighbour nodes inside
cluster region.
Step3: Neighbour nodes forward packets if its battery power is greater
than threshold value.
Step4: Sink node sends RREP packets through energy efficient routing.
3.4 RESULTS AND DISCUSSION
The simulation settings and parameters are summarized in table 4.1.
Table 3.1. FRS simulation settings
No. of Nodes 200
Area Size 1200 X 1200 sq.m
Mac 802.11
Radio Range 250m
Simulation Time 100 sec
Traffic Source CBR
Packet Size 512 bytes
Mobility Model Random Way Point
Initial energy 85 J
Transmitted power 0.879 mw
Received Power 0.08 mw
Protocol AOMDV

PERFORMANCE METRICS
The performance metrics are evaluated using simulation tool.

37
Network Reliability Rate: It is the combination of node reliability rate and link
reliability rate. Node reliability rate indicates nodes, which are genuine through
the entire communication process. Link reliability rate refers to the fault
tolerance of link which reaches within the transmission range.
Jitter: It is the packet interval which causes an amount of delay during the
transit period.
Throughput: It is the number of packets received at the destination per second.
The results are examined based on performance metrics like end-to-end
delay, packet delivery ratio, malicious node detection ratio, network lifetime,
end to end delay and overhead.

Figure 3.1 Network Reliability vs. Speed

In Figure 3.1, speed is varied up to 30m. From the results, the proposed
scheme FRS achieves more network reliability (22-44) nodes than existing
schemes PTSRP and REEDRE even while increasing the density of nodes.
Reliability of network is improved because of link existence. In the proposed
scheme, nodes may be influenced by the attackers to disconnect the network
connectivity. Routes are established from CH to all members through stable
links with maximum network connectivity.

38
 So the network reliability of FRS is high and produces less packet loss
among mobile nodes. Table 3.2 shows the comparison of network reliability
among proposed and existing schemes. The reliability of existing schemes is
very low compared to proposed scheme because of unbalancing links and nodes
in their network.
Table 3.2. Comparison of Existing schemes and Proposed schemes in terms
of network reliability
Speed (m) Network reliability (Nodes per links)
PTSRP REEDRE FRS
05 13 7 22
10 21 14 32
15 26 16 34
20 32 17 41
25 37 19 42
30 39 22 44

Figure 3.2. Packet delivery ratio Vs No. of Nodes

39
 Table 3.3. Comparison of Existing schemes and proposed schemes in
terms of packet delivery ratio
Packet Delivery ratio (%)
No. of Nodes
PTSRP REEDRE FRS
10 6 7 17
20 16 9 37
30 14 35 58
40 28 46 67
50 31 58 92
Figure 3.2 shows the result of Packet delivery ratio vs. number of nodes.
No. of nodes is varied as 10-50. It is shown that proposed scheme FRS achieves
more packet delivery ratio (17-92%) than the existing schemes. In any kind of
network, packet delivery ratio is a major metric to produce maximum network
lifetime. In the scheme FRS, number of packet losses is reduced successfully by
maintaining stable links and mobile nodes. If links are fluctuated, packets are
kept in intermediate nodes and are forwarded to the next hop node after routes
become stable. Table 3.3 shows the comparison table of packet delivery ratio of
FRS and existing schemes.
Table 3.4. Comparison of Existing schemes and proposed schemes in terms
of link stability ratio
No. of Nodes Link stability ratio (%)
PTSRP REEDRE FRS
10 53.7 62.8 82.8
20 44.2 52.3 72.4
30 34.5 46.1 57.2
40 24.2 34.6 49.4
50 21.8 25.4 45.8

40
 Figure 3.3. Link stability ratio vs. No. of nodes
Table 3.5. Comparison of Existing schemes and Proposed schemes in terms
of Fault tolerant routes
No. of Routes Fault tolerant routes
PTSRP REEDRE FRS
50 104 112 124
100 97 107 112
150 82 94 104
200 74 87 98
250 61 78 87
Figure 3.3 and Table 3.5 shows the performance analysis of link stability
ratio, while varying the number of nodes form 5 to 50. Links are discovered in
FRS based on traffic period, signal strength and mobility of nodes. FRS
produces high link stability ratio from (82.8 - 45.8) than existing schemes.
Links establish is done based on signal strength. If nodes are producing high

41
packet delivery ratio than existing schemes, it means that links are having
mobility in FRS.
Figure3.7 and Table 3.8 illustrates the performance of fault tolerable
routes for proposed and existing schemes. In FRS, routes are implemented with
maximum link capacity and more connectivity ratio. In this scenario, FRS
produces more fault tolerant routes (124-87 routes) due to high routing
efficiency.
Figure 3.8 and Table 3.9 illustrates the comparison of end to end delay
for FRS and existing schemes. FRS achieves less delay (8.9-15.2 msec) from
CH to end CH due to good routing efficiency. The routes are integrated with
stability and produce less consumption of delay for packet forwarding in FRS.
In existing schemes there is no focus on balanced routing, which leads to high
delay.

Figure 3.4 Fault tolerant routes Vs No. of routes

Table 3.6 Comparison of Existing schemes and Proposed schemes in terms
of End to end delay
Speed (m) End to end delay (msec)
PTSRP REEDRE FRS
5 14.4 16.5 8.9
10 18.4 19.7 12.3

42
 15 24.8 26.9 10.9
20 29.7 31.8 13.3
25 31.3 35.2 14.7
30 34.6 37.6 15.2

Figure 3.5. End to end delay Vs Speed

Table 3.7 Comparison of Existing schemes and Proposed schemes in terms

of Communication Overhead

Data Communication overhead (pkts)

packets PTSRP REEDRE FRS
5 6.7 5.7 3.9
10 10.2 9.4 5.7
15 14.2 11.7 6.4
20 19.7 15.8 7.9

43
 25 24.6 19.8 15.3

Figure 3.6. Communication Overhead Vs Data packets

Figure 3.6 shows comparison of communication overhead for existing
schemes and proposed scheme while increasing the flow of data packets from 5
to 25 packets. Communication overhead lies between node to node data
transfer. The excessive data packets may produce overhead and it may suppress
the communication between nodes. To avoid this issue, fault tolerable routes are
discovered to reduce excessive control packets in FRS. Compared to existing
schemes, FRS produces less overhead (3.9-15.3packets) due to stable routes.
Table 3.7 shows the analytical results of communication overhead among FRS
and existing schemes.
3.5 SUMMARY
In this research work, Fuzzy based reliable scheme is introduced for
achieving network reliability in MANET. Only fault tolerable routes are
activated as bidirectional routes where CH establishes efficient communication
activity. In existing schemes, the fault tolerable routes are established based on
link capacity and node connectivity. Here the activity of unknown attackers is

44
monitored and maintains the network stability ratio higher compared to existing
schemes

45
 CHAPTER 4
CONCLUSION AND FUTURE ENHANCEMENTS
In this chapter, the contributions of the research are highlighted and
the future enhancements are discussed.
4.1. CONCLUSION
Ad hoc network is one in all the foremost spirited and active fields within
the past few years. Mobile ad hoc network is one in all the unplanned network
classes. It is a temporary network where it may be deployed quickly in the
absence of infrastructure. Owing to dynamic nature, nodes may be simply
compromised by attackers and it ends up in disconnection of network.
Reliability is a major issue in MANET and it is ought to be thought-about with
a lot of attention. In previous analysis, it is found that reliability was not
measured supported by stability and quality of nodes and links.
Energy conservation is also a major concern in mobile ad hoc network.
Nodes consume a lot of energy throughout packet transmission. If the links are
disconnected, nodes might convey the packets once more and energy could also
be dissipated. To avoid this downside, reliable routes should be chosen to
extend network lifespan. In this research work, Fuzzy based reliable scheme is
proposed to achieve network reliability based on link existence and stability of
nodes. Fault tolerable routes are established from source to destination. Cluster
head establishes efficient group connectivity by activating fault tolerable routes.
In previous work, fault tolerable routes are established based on link capacity
and node connectivity. In the proposed work, the activity of intruder is also
monitored with network metrics and improved network stability ratio than
existing schemes. Based on simulation results, FRS produces less delay (8.9-
15.2 ms), high packet delivery ratio (17-92 %), high throughput (92-58
packets), more fault tolerant routes (112-87 routes), minimum overhead (3.9-
15.3 packets), less jitter (5-13 secs), high network connectivity ratio (26-82 %),

46
high link stability ratio (82.8-45.8 %), high network reliability (22-44 nodes per
links) than existing schemes.
4.2 FUTURE ENHANCEMENTS
 Data gathering can be achieved with receiver initiated multicast
routing to improve network lifetime.
 Reliable multicast routing can be further extended with symmetric
encryption to achieve authentication.
 Multicast capacity in hybrid routing can be analyzed with different
mobility patterns.
 Power aware routing can be developed based on various multicast
group size.
 Secure multicasting protocol can be implemented based on symmetric
cryptographic scheme and it can also be integrated with energy
management protocol to balance network integrity and energy
consumption.

47
REFERENCES

1. Abdulaziz Al-Nahari and Mohd Murtadha Mohamad, 2016.Receiver-

Based Ad Hoc On Demand Multipath Routing Protocol for Mobile Ad
Hoc Network. PLOS one Journal. 1-18.
2. Ajay Shah, Hitesh Gupta and MukeshBaghel, 2012. Energy-Efficient
Routing Protocol for Mobile Ad Hoc Networks. International Journal of
Engineering Research and Applications (IJERA), 2(4):1342-1346.
3. Alireza Shams Shafigh, Kamran Abdollahi, and MarjanKouchaki, 2012.
Developing a Fuzzy Logic Based on Demand Multicast Routing Protocol.
Journal of Electrical and Computer Engineering, Hindawi Publishing
Corporation. 1-12.
4. Alireza Shams Shafigh, Beatriz Lorenzo and SavoGlisic, 2014. Fuzzy
Logic Based Rate Control Scheme for ODMRP in Mobile Ad hoc
Networks. Autimatika, 55(2): 199-206.
5. BanderH.AlQarnl and Ahmed Almogren, 2016. Reliable Energy Efficient
Routing Protocol for MANET multicasting. Journal of Computer
Networks and Communications. 1-14.
6. Baolin Sun, Muyao Lu, Kun Xiao, Ying Song1 and Chao Gui, 2016. An
Energy Entropy-Based Minimum Power Cost Multipath Routing in
MANET. International Journal of Grid and Distributed Computing.
9(2):169-180.
7. Bheemalingaiah and Naidu, 2016. Energy Aware On-Demand Multipath
Routing Protocol in Mobile Ad Hoc Networks. International Journal of
Computer Networks and Wireless Communications. 6(5):14-33.

48
8. Budyal V R and Manvi S S, 2013.Intelligent Agent Based Delay Aware
QoS Unicast Routing in Mobile Ad hoc Networks. International Journal
of Multimedia and Ubiquitous Engineering. 8(1): 11-28.
9. Chinnasamy R and Vadivel R, 2017. Energy Efficient Spectrum Aware
Channel Sensing Routing Protocol for Cognitive Radio Mobile Ad-Hoc
Networks. International Journal of Computer Applications. 157(3):31-36.
10.De. Rango, Guerriero and Fazio, 2012. Link Stability and Energy Aware
Routing Protocol in Distributed Wireless Networks. IEEE Transactions
on Parallel and Distributed Systems. 23(4):713-726.
11.Fatemeh Tavakoli, MeisamKamarei, Gholam Reza Asgari, 2016. An
Efficient Fault-Tolerance Routing Algorithm for Mobile Ad-hoc
Networks. Journal of Advances in Computer Research. 7(2): 23-40.
12.Gomathi M and Rajendran G, 2012.Fuzzy Cost Enabled Cluster Based
Multipath Routing Algorithm for Mobile Ad-Hoc Networks. Journal of
Computer Science. 8(9):1434-1440.
13.Istikmal, AditKurniawan, and Hendrawan, 2017.Selective Route Based
on SNR with Cross-Layer Scheme in Wireless Ad Hoc Network. Journal
of Computer Networks and Communications. 1-Jayalakshmi V and
Rameshkumar R, 2012.Multipath Fault Tolerant Routing Protocol in
MANET. International Journal on AdHoc Networking Systems (IJANS).
2(1):23-35.
14.Javad Vazifehdan R, Venkatesha Prasad, and Ignas Niemegeers, 2014
Energy-Efficient Reliable Routing Considering Residual Energy in
Wireless Ad Hoc Networks. IEEE transactions on mobile computing, 13:
1-14.
15.Junwei Jin and SanghyunAhn, 2016. A Multipath Routing Protocol Based
on Bloom Filter for Multihop Wireless Networks. Mobile Information
Systems. 1-11.

49
16.Khaitiyakun, N, 2014. Data dissemination on MANET using Content
Delivery Network (CDN) technique. IEEE conference on Information
Networking. 2: 502-506.
17.KirandeepKaur and SheetalKalra, 2016. A Review Article on Energy
Efficient Routing Algorithm in MANETs. Journal of Energy
Technologies and Policy. 6(1):14-17.
18.Kokilamani and Karthikeyan, 2016. Location and Mobility Optimized
On-demand Geographical Multipath Routing Protocol for MANET. 7(4):
2835-2848.
19.Krishna. G. Deshpande, 2012. Agent Approach QoS Routing in Manet
Based on Fuzzy Priority Scheduler.
International Journal of Electronics Signals and Systems (IJESS). 1(2):76
-81.
20.Kulwinder Kaur and Kamaljit Kaur, 2015. Recent Trends Toward Fault
Tolerance Techniques in MANET. International Journal of Computer
Applications. 120(22): 47-52.
21.Lu Jin, Zhongwei Zhang and Hong Zhou, 2007.Deliberation and
Implementation of Adaptive Fuzzy Logic Based Security Level Routing
Protocol for Mobile Ad Hoc Network. IEEE Conference. 1-5.
22.Mahfuzur Rahman Bosunia, Daniel P. Jeong, Chanhong Park, and Seong-
HoJeong, 2015.A New Routing Protocol with High Energy Efficiency
and Reliability for Data Delivery in Mobile Ad Hoc Networks.
International Journal of Distributed Sensor Networks. 15:1-9.
23.Makarand R, Shahade and Chaudhari D N, 2016. A Reliable Power
Aware Routing Scheme for Mobile Ad Hoc Networks. International
Journal of Emerging Technology and Advanced Engineering. 6(2):188-
193.

50
24.Mallapur, Manvi, and Rao, 2009. A Fuzzy Based Approach for Multicast
Tree Computation in Wireless Multimedia Networks. Journal of
Information and Computing Science. 4(2): 89-92.
25.Mandhare V V and Thool R C, 2016. Improving QoS of Mobile Ad-hoc
Network using Cache Update Scheme in Dynamic Source Routing
Protocol. 7th International Conference on Communication, Computing
and Virtualization. 79: 692-699.
26.Monisha Rani and Er. AmitChhabra, 2015. Modified LA to Optimize the
Performance of Mobile Ad Hoc Network. 1283-1286.
27.NagulaMeera S K, Srinivasa Kumar D and SrinivasaRao D, 2016. Energy
Efficient Multicast Routing in Mobile Ad Hoc Networks: Contemporary
Affirmation of Benchmarking Models in Recent Literature. Global
Journal of Computer Science and Technology: Network. Web & Security.
16(4):35-40.
28.Nandhini and Sharmila, 2016. Secured message distribution based on
multi-bit Digital signature in Mobile Ad-Hoc Network. International
Journal of Advanced Engineering Technology. 8 (1):579-586.
29.Narayanan, Devi and Vincent Jayakumar, 2013. An Energy Efficient
Cluster Head selection for Fault Tolerant Routing in MANET.
International Journal of Engineering and Technology. 5(2):1281-1289.
30.Niranjan Kumar Ray and Ashok Kumar Turuk, 2016. A Hybrid Energy
Efficient Protocol for Mobile Ad Hoc Networks. Journal of Computer
Networks and Communications.1-11.
31.NishaChaudhary, Er Shiv Kumar Goel, NitinGoel, 2015. A Deep
Analysis: Highly Robust Fault Tolerant Secure Optimized Energy Ad-hoc
Networks Methodologies for Mobile Nodes. International Journal of
Advanced Research in Computer Science and Software Engineering.
5(7): 540-543.

51
32.Obulla Reddy B G and MaligelaUssenaiah, 2012. An Adaptive Fuzzy
Clustering and Location Management in Mobile Ad Hoc Networks.
International Journal of Computer Applications & Information
Technology. 1(3):.99-106.
33.Omar Smail, Bernard Cousin and Imene Snoussaoui, 2016. Energy-
Aware and Stable Cluster-Based Multipath Routing Protocol for Wireless
Ad Hoc Networks. International Journal of Networking and Virtual
Organisations. 1-24.
34.Pushpender and Prof. SohanGarg, 2013. A New Routing Technique
Based on Fuzzy Logic for Multi-Hop Wireless Mesh Networks. IOSR
Journal of Engineering. 3(11): 1-8.
35.Rajeshkanna R, Poorana Senthilkumar S and Kumuthini C, 2013. Energy
Efficient Routing Protocols in Mobile Ad hoc Network Based on
Enhanced AODV Protocol. International Journal of Computer Science
and Mobile Computing. 2(7): 391 – 395.
36.RakeshMeena, Sandeep Raghuwanshi and Yogendra Kumar, 2016.
Threshold based Energy efficient Fault Tolerance Transparent scheme in
MANET. International Journal of Advanced Computer Technology. 5(5):
87-93.
37.RamannaHavinal, Girish V. Attimarad and Giri Prasad M N, 2015.
EASR: Graph-based Framework for Energy Efficient Smart Routing in
MANET using Availability Zones. International Journal of Electrical and
Computer Engineering. 5(6):1381-1395.
38.Ranganath Kothamasu and Samuel H. Huang, 2007.Adaptive Mamdani
fuzzy model for condition-based maintenance. Fuzzy Sets and Systems.
Science Direct. 158:2715-2733.
39.Rathnamma and Chenna Reddy, 2016. A Power Efficient Trust based
Secure Routing Scheme for Mobile ad-hoc networks. International
Journal of Electrical Engineering and Computer Science. 2(2): 417-425.

52
40.Santhi and AlameluNachiappan, 2012.Fuzzy-cost based
multiconstrainedQoS routing with mobility prediction in MANETs.
Egyptian Informatics Journal, 13:19-25.
41.Santhosh T, Kiran Kumar B and E.SathishBabu, 2014. Energy Efficient
Reliable Routing Protocol for Mobile Ad Hoc Networks. International
Journal Of Computational Engineering Research. 2(5):1470-1473.
42.Saravanan Nallusamy, Subramani Appavupillai and Sivakumar
Ponnusamy, 2016. Mobile Agents based Reliable and Energy Efficient
Routing Protocol for MANET. International Journal of Intelligent
Engineering and Systems. 9(3): 110-116.
43.Senthilnathan Palaniappan and Kalaiarasan Chellan, 2015. Energy-
efficient stable routing using QoS monitoring agents in MANET.
EURASIP Journal on Wireless Communications and Networking. 13:1-
11.
44.Singh R, Rajesh Babu and Indrani Chatterjee, 2012 .A Reliable multicast
routing approach for VANET. International Journal of Computer Science
Issues. 9 (2) : 575-579.
45.Soon-gyo Jung, Byungseok Kang, SanggilYeoum, and HyunseungChoo,
2016. Trail-Using Ant Behavior Based Energy-Efficient Routing Protocol
in Wireless Sensor Networks. International Journal of Distributed Sensor
Networks.1-9.
46.SudhirGoswami, Chetan Agrawal and Anurag Jain, 2015. Location based
Energy Efficient Scheme for Maximizing Routing Capability of AODV
Protocol in MANET. International Journal of Wireless and Microwave
Technologies. 3: 33-44.
47.Sugandh and Prof.RakeshPanday, 2016. Energy Efficient-Long Life
LEACH Variant Protocol for MANET Environment. International
Journal of Computer Science and Information Technologies. 7 (5): 2320-
2325.

53
48.Suhail Ahmad Ganie and Nidhi Sharma, 2016. Interference-Aware and
Fault Tolerant Multipath Routing Protocols for Mobile Ad Hoc
Networks. International Journal of Engineering Science and Computing.
6(10): 2524-2527.
49.Sultanuddin S J and Ali Hussain M D, 2016. Shortest and Efficient
Multipath Routing in Mobile ad hoc Network (MANET). Indian Journal
of Science and Technology. 9(45):1-9.
50.Vadivel R and Murali Bhaskaran V, 2012.Energy Efficient With Secured
Reliable Routing Protocol (EESRRP) For Mobile Ad-Hoc Networks.
Procedia Technology. 4: 703 – 707.
51.Vadivel R and MuraliBaskaran V, 2016.Adaptive reliable and congestion
control routing protocol for MANET. Wireless Networks. Springer, 1:1-
11.
52.Vijayashree Budyal, Manvi S S and Hiremath S G, 2013. Fuzzy Based
Node Disjoint QoS Routing in MANETs by Using Agents. Proceedings
of International Conference on Advances in Communication Network,
and Computing. 7-12.
53.Viveksoi and Dhaliwal, 2017. Performance comparison of DSR and
AODV Routing Protocol in Mobile Ad hoc Networks. International
Journal of Applied Engineering Research. 13(7): 1605-1616.
54.Yujun Zhang, Tan Yan, JieTian , Qi Hu, Guiling Wang and Zhongcheng
Li , 2014. TOHIP: A topology-hiding multipath routing protocol in
mobile ad hoc networks. Ad hoc Networks. Elsevier. 21: 109-122.
55.ZeeshanIqbal S. Khan, Amjad Mehmood, Jaime Lloret, and Nabil Ali
Alrajeh, 2016. Adaptive Cross-Layer Multipath Routing Protocol for
Mobile Ad Hoc Networks. Journal of Sensors. 1-18.

54
RESEARCH PUBLICATIONS
1. Dr. S. Gopinath, N. P. Narayani Priyadharshini, S. Niresh, M. Srinath, V.
Prasanna “Design and Development of Fuzzy based Reliable Scheme for
Energy Efficiency in MANET”, International Conference on Latest
Trends in Science, Engineering and Technology, Pg. No. 31.

55