Peer-to-Peer Networking and Applications

https://doi.org/10.1007/s12083-019-00772-w

Volunteer nodes of ant colony optimization routing for minimizing

delay in peer to peer MANETs
N. Noor Alleema 1 & D. Siva Kumar 2

Received: 2 November 2018 / Accepted: 27 May 2019

# Springer Science+Business Media, LLC, part of Springer Nature 2019

Abstract
A Mobile ad hoc Network (MANET) is an infrastructure less network that permits nodes to make a wireless network with
mobility. In MANETs, the node linkages breaks are frequent due to all nodes are in movement. When neighbor nodes travel out
of other node communication range connection among both mobile nodes breaks. Thus it makes delay and packet loss in the
network. In the present Traffic Control method, several times, since the highest traffic, heavy rain, accidents, or other reasons,
there may be probabilities of jam on roads. Thus, people could get delay owing to the highest traffic. Therefore, it is highly
preferred to have an effective way to track the traffic on roads and thus select the suitable road that is traffic free. To resolve these
problems, the volunteer Nodes of Ant Colony Optimization Routing (VNACO) is proposed. The primary objective of VNACO is
to reduce both the delay and routing overhead in Peer to Peer (P2P) MANETs. Here, peer node act as a volunteer node and mobile
node for transmitting data from source to destination. During data transmission, the relay node moving out of communication
range when the volunteer node overheard the dropped data packet then deliver the data to the corresponding relay node. As a
result, minimizes both the delay and packet losses. In VNACO, the volunteer’s nodes are elected based on node aptitude. Node
aptitude is calculated by iterating node connectivity, transmission processing time, node energy and available bandwidth. In
addition, an ant colony optimization algorithm to finds the optimal route and reduce the routing overhead in P2P MANETs. The
significant application of this mechanism is utilized for the traffic management system. Network simulation results indicate that
the VNACO mechanism is minimizing 22% delay and reducing 14% packet losses compared to the baseline protocol.

Keywords Peer to Peer Mobile Ad hoc Network . Volunteering nodes . Ant colony optimization . Delay reduction .
Simulation results

1 Introduction inquiries in a disseminated surrounding. Since MANETs are col-

The more significant part of P2P computing has mainly focused
on supplies interrelated to proficient research and
routing.MANET forms a dynamic wireless network without
any centralized administrator or any pre-existing infrastructure.
Both MANETs and P2P Networks are self-reconfiguration and
networks with energetic topology and dependable for routing
This article is part of the Topical Collection: Special Issue on P2P
Computing for Intelligence of Things
Guest Editors: Sunmoon Jo, Jieun Lee, Jungsoo Han, and Supratip Ghose
* N. Noor Alleema
noor.alleema@gmail.com
1
Department of Computer Science Engineering, Sathyabama Institute
of Science and Technology, Chennai, India
2
Department of Electronics and Communication Engineering,
Easwari Engineering College, Chennai, India
lected resource-restrained devices vulnerable to mistakes, but
P2P networks are error recovery; also P2P networks are the
perfect data allocation scheme for MANETs. In MANETs, while
a mobile node does not continuously accessible. But, both P2P
and MANET need nodes to assist more to make the network
functional.
MANET is a communication network in which the nodes
are mobile. The mobile nodes are closest to the communica-
tion range; directly communicate the data whereas the nodes
that are not inside the communication range require other in-
termediate nodes to transmit the data [1]. In MANETs, the
node linkages breaks are frequent due to all nodes are in
movement. When neighbor nodes travel out of other node
communication range connection among both mobile nodes
breaks. A MANET protocol not awake of the P2P application
attempts to restore a new route to the same receiver, self-
determining from the essential attempt. Instantly trying to cre-
ate a new path to the same sender of the message, another

sender might offer the message at fewer costs after the net-
work topology modified. Thus the mobile nodes include
informing route breaks to P2P node which next resolves
whether the previous sender is still functional otherwise other
link associates are more suitable. P2P MANETs has numerous
challenges, but significant issues are node mobility and
routing [2]. The node mobility creates more loss of data
packets, and inefficient routing makes additional overhead.
A delay-sensitive multicast protocol (DSMP) introduced to
evaluate the individual hop delay as well as total path delay in
the network. This protocol assesses the busy or idle state of the
channel in the network. In DSMP, the forwarder node is selected
by the highest data transmission rate nodes. However, this
scheme delay measurement does not make accurate, and it makes
a lesser network capacity. In addition, it increases the forwarders
total communication time [3]. To overcome these problems, a
volunteer Nodes of Ant Colony Optimization Routing
(VNACO) for minimizing delay in P2P MANETs is proposed.
The VNACO method includes the following contributions:
& Here, peer nodes act as volunteer nodes and mobile nodes
for transmitting data from source to destination.
& The volunteer nodes are selected based on the node apti-
tude by the iteration method. Node aptitude is calculated
by iterating node connectivity, transmission processing
time, node energy and available bandwidth.
& Volunteer node promotes data packet transmission, in ac-
cordance with the quality of the link between nodes, ex-
plicitly more than one volunteer node receives data
packets, and redundancy helps for routing packets consis-
tently. The volunteer nodes are used to reduce packet
losses during data transmission.
& Then the next step is to pass the data starting from source to
destination based on the ant colony optimization algorithm.
This method reduces the routing overhead in the network.
& During data transmission, the relay node moving out of
communication range when the volunteer node overheard
the dropped data packet then deliver the data to the corre-
sponding relay node. Hence reduces both the packet losses
and delay in the network.
The rest of this chapter is described as follows: Section 2
describes the related work. Section 3 described the volunteer
node selection and data transmission for reducing delay in P2P
MANETs. The performance and comparative analysis are shown
in section 4. The conclusion is described in section 5.
2 Related work
A MANETs contains numerous mobile nodes which are wire-
less. It vigorously exchanges data between them without the
dependence on a wired backbone network or a fixed base station.
Peer-to-Peer Netw. Appl.
For the reason of restricted communication area of wireless net-
work nodes, to exchange the data with another node in the net-
work the multiple hops are habitually required for a node. A node
can communicate directly or indirectly with nodes inside the
wireless area. Changes occur periodically in MANET because
of its mobility [4]. The features of interconnected mobility and
node relationships improve network performances [5].
Network layer plays a significant role in MANET because
of several protocols are developed. The main intent in routing
is to recognize a pathway from a specific source to the receiver
and to maintain that path until data transmission between
those nodes in the communication network. Data forwarding
is a technique to forward the data from one node to another.
Routing in MANET can be categorized as either proactive or
reactive. The routing information is placed in the form of a
table in proactive routing. In reactive routing, the route dis-
covery process begins only if there is data transmission is
required between two nodes.
Opportunistic routing protocol has reported more concentra-
tion in the research area of MANETs [6]. Many routing strategies
have been introduced to handles without the cooperative perfor-
mance of movable nodes. Usually, the node Cooperative com-
munication mechanism is improving the multi-hop data trans-
mission in MANET [7]. Multi-hop data transmission is the pos-
sibility to adjust the coverage of nodes, and data rates in the
network [8]. Cooperative communication is a successful method
to remove channel damages in the network. The cooperation
method can minimize network overhead [9].
Proactive Source Routing Protocol (PSR) can declare enor-
mous topology information compare to the source routing.
Even though it has less routing overhead compared to the
reactive routing protocol [10]. A PSR is a lightweight routing
protocol. The PSR protocol consists of best path selection
when congestion, energy utilization balancing, load balancing
and data transmission in untrustable locations. In addition, the
PSR handles opportunistic data forwarding in the network.
PSR can preserve network topography information than the
distance vector and it has lesser routing overhead [11]. PSR
offers better connectivity also it attain enhanced data transpor-
tation. A tree-based PSR scheme integrates proactive routing
and opportunistic data forwarding. It provides low routing
overhead and delay without reducing the overall throughput
[12]. To maintain source routing, every node keeps a breadth-
first search tree of the whole network rooted. It is adapted to
reactive resource routing; however, the common procedures
are relevant to another case of routing [13].
In [14], particularly examines the multipath routing in
MANETs. MANET nodes are normally distinguished by their
high degree of mobility, memory resources, processing, and re-
stricted power. Thus, it is increasing the consistency of data com-
munication and load balancing. It is of significance in MANETs
because of the limited bandwidth among the nodes. The outcome
results are united to show that bandwidth and energy are
Peer-to-Peer Netw. Appl.
dissimilar metrics and the source consumption in MANET
routing protocols. The result examination demonstrates that it is
expensive and suggests the opportunity to develop in link layer
[15]. Multicasting technique permits sending a similar message
to a collection of destinations concurrently. The multicast routing
protocol has some constraints for the challenges like the short
battery life of the mobile devices, lack of bandwidth, and its
dynamic nature. Hence, tackle these constraints a reliable neigh-
bour nodes selection method [16].
Multi-disjoint Routing protocol was developed based on a
source routing model for enhancing efficiency in MANTEs
[17]. Reliable and Energy Efficient Protocol improve the net-
work reliability by Busy Tone System (BTS). This BTS meth-
od is to reduce the additional overhead during error recovery.
In this scheme, energy utilization is reduced by the clustering
method based on residual energy and node distance to offer
more network stability [18]. The Vague Set measurement
Technique (VST) is used to enhance energy efficiency. VST
is an interval-based membership that computed based on dis-
tance and node energy [19]. Trust Models in MANET, usually
believe that the packet has various security requirements. In
the trust model, the node communicates the data packet to the
receiver when it checks the trust level of mobile nodes [20]. In
MANET, flooding creates high traffic overhead. But, quick
partial flooding method utilized that the position of the nodes
to accomplish flooding within the path of the receiver across a
sub-graph of the original graph [21].
A Delay Tolerant Network is used for the purpose of com-
munication among the nodes to avoid the probability of con-
nectivity loss. Co-ordination among rescue and relief teams
can be achieved in an effective manner. Combined collection
establishment and assortment method have been applied so
that restricted extra data flow is denigrated. Appropriate run
time and memory restrictions have been elected to promote
diminish redundancy [22].
By using link layer information, overcome the problem of
congestion and traffic in the network. The recent major prob-
lem is to deal with the varying packets drop congestion. It is a
challenging concern, due to link-layer contentions, dynamic
wireless channel description, quick topology variations, etc. In
[23] proposed a method called cross-layer adaptive transmis-
sion. It has the capable to process the congestion in MANET
effectively. The outcome shows that congestion handling ca-
pacity is better. The node Link and Path Stability parameters
[24] are used to determine the stability of path and link.
However, this proactive routing scheme can’t handle stable
paths thus causes connections breakage and dropping more
data packets in the network. Received signal strength metric
[25] based route to maintain steadiness of route. However, it
increases the route hop count in MANET. Quality of Service
(QoS) routing protocol [26] creates the route by association
among two nodes stability factor. This scheme maintains to-
pology. However, this scheme makes an additional delay.
3 Volunteer nodes of ACO routing
for minimizing delay in P2P MANET
Building an application suite for disconnected Mobile Ad hoc
Networks (D-MANETs) requires some communication
middleware system with which mobile hosts can collaborate
in a peer-to-peer manner to ensure message transportation.
The majority of P2P computing investigation has concentrated
on concerns correlated to efficient routing. It is a usual devel-
opment for P2P network and MANET to be combined togeth-
er so that a P2P operate on a cooperative MANET. Both
MANET and the P2P network need nodes to help one another
in order to make the network valuable.
In this scheme, a MANET is selected P2P if it contains an
autonomous mobile node builds a dynamic environment which
transmits the data from one to other directly without needs man-
ager or central distributor and peer nodes are act as volunteer
nodes. A P2P MANET should present adequate node connectiv-
ity and confronting failure performance while increasing the
node scalability. Due to node mobility, the nodes are moving
out of communication range. When the volunteer nodes help to
forward the dropped packets overheard to the relay node.
The network contains a set of nodes that form the graph G
(V, E) where there are V vertices and E edges. Here the verti-
ces correspond to the nodes, and the edges correspond to the
links that are active. Initially, every node floods an identity
message for maintaining a network topology. This message
contains its ID and location of a mobile node. While the neigh-
bor nodes are accepted this message and update the routing
table. This procedure is continued until the entire nodes
reached this message. Figure 1 demonstrates that the architec-
ture of the VNACO scheme.
In this scheme, every mobile node wants to send data to other
nodes; it initially checks the routing table for finding the route
from Source (S) to Destination (D). If it does not has a path from
source to destination in the routing table, when the source selects
the route by an ACO method. Here, the common neighbors of
the current source and the next intermediate hop form a subset
called the Volunteer Nodes VN(S, D). These volunteer nodes are
selected based on the node aptitude by the iteration method.
During data transmission, the data does not reach the next inter-
mediate hop successfully, and no acknowledgement is sent due
to dynamic topology then the volunteer nodes forward the
packets overheard to the next hops. This process is consecutively
performed until the data reached the destination.
3.1 Volunteer node selection
In this scheme, every mobile node sporadically disseminates
HELLO messages that consist of node states such as which
node is acting as the volunteer or neighbor node. Then, every
mobile node generates a list of the node is neighbors and
volunteers.
 Peer-to-Peer Netw. Appl.

Fig. 1 Architecture of VNACO

The Volunteer selection method reaches the following shortlisted based on iteration 2. The iteration 2 contains an
objects: additional parameter like node Transmission Processing

& First, it assures that adequate volunteer is selected thus

each node is in communication range of at least one vol-
unteer. The volunteer nodes are selected based on the node
aptitude by the iteration method.
& Second, the selected volunteers move around the network
so as to guarantee that all nodes distribute the task of
providing overall connectivity in the network.
& Third, it tries to reduce volunteer nodes elected count, so
rising the lifetime of the network, but diminish both the
network latency and loss of capacity.

The volunteer’s nodes are elected based on node aptitude.

The source, measure the node aptitude by the iteration meth-
od. Figure 2 explains the volunteer node selection in P2P
MANET.
In the first Iteration, it checks the Node Connectivity (NC);
if the node NC is above the average connectivity that nodes
are priorities to become a volunteer.
Additional NC
IT 1 ¼ ð1Þ
AvgNC
n N Ci
AvgNC ¼ ∑ ð2Þ
i¼0 n

Where n represents the node count.

In P2P MANET, a number of nodes are talking to become a
volunteer-based on iteration1, Also selected nodes are Fig. 2 Volunteer node selection method
Peer-to-Peer Netw. Appl.

Fig. 3 Flowchart for VNACO

Time. Here, IT2 represents the node Transmission Processing Where.

Time (TPT) and IT1 computation. The node TPT measure-
ℓ Represents the random number among 0 to 1
ment is given in Eq. 3.

The iteration 3 measurement is settled the volunteer
IT 2 ¼ ð1−IT Þ1 þ 1 NC*TPT ð3Þ node from iteration 2 shortlisted nodes. The iteration 2
 Peer-to-Peer Netw. Appl.

computation along with node energy finds the volunteer estimating quality resolutions received from ants. Ants con-
node as in Eq. 4. struct roots by performing randomized trips via a connected
  graph.
RE
IT 3 ¼ 1− þ IT 2 ð4Þ The ants’ search behavior is determined by a probability
IE alteration regulation that manages how every ant elects its
adjacent vertex to see on the structure of its trip. This rule
Where.
specified by three factors such as a neighborhood definition,
RE Remaining Energy of node ant and pheromone trial value applies the heuristic informa-
IE Initial Energy of node tion among the vertices of the construction graph. At each
During volunteer node selection, available bandwidth is a step, an ant employs a probability transition rule to choose
significant parameter because of it tolerating the QoS. Also, the operation point it will see next time. Once total ants have
the available bandwidth is less compared to the data packet, built their tours, pheromone trail values are modified.
and it generates an additional delay. Thus iteration 4, we filter During route discovery, the Fants discovers the route to D by
the volunteer node by available bandwidth. The Iteration 4 pheromone value and Bants come back the subsequent traces.
computation is given in Eq. 5. The source (S) flood Fant to its adjacency node for finding
which has the highest good rate need threshold. Then check
IT 4 ¼ IT 3 þ ABW ð5Þ which adjacency is greater than the threshold next the S broad-
cast Fant message to those nodes. This Fant message consists of
The available bandwidth computation is given below. {SID, DID, Hopcount, bandwidth, TTL, path field}. In addition,
C BW −U BW this Fant message traces the link capacity, hop count, commu-
ABW ¼ ð6Þ nication delay. While the Fant message attains the D, it com-
WF
putes the path predilection rate based on hop count, capacity
Where. and delay parameter.
ABW Available bandwidth The path predilection rate computation among node a and
UBW Utilized Bandwidth b is given below.
CBW Channel Bandwidth ðHC G DG C G Þa
WF Weight Factor PRðhÞ ¼ ð8Þ
∑b∈Pi ðHC G DG C G Þb
The weight factor represents the data packet. The weight
Factor computation is given below. Where,

ROverhead þ P HCG Hop Count best good value

WF ¼ ð7Þ DG Delay good value
P
CG Capacity good value
Pi Set of route from S to D
P Size of the data packet
ROverhead Routing Overhead
The Node Connectivity, Transmission Processing Time, Table 1 Simulation parameters of VNACO
node energy and available bandwidth parameters are used to
Parameter Value
find the node aptitude and thus it chooses the volunteer nodes
in the P2P MANET. This process is done during the route # nodes 50
discovery process and inability volunteer nodes are removed Model of Antenna Omni Antenna
from the list. Then the next step is to pass the data starting Model of Mobility Random Way Point
from source to destination based on an ant colony optimiza- Model of Radio Propagation Two Ray Ground
tion algorithm. Model of Traffic CBR
Simulation Area 1000 × 600
3.2 Ant colony optimization based route selection Simulation Time 100 s
Transmission Range 250 m
The ant colony optimization approach is used for solving node Type of Channel Wireless Channel
deployment problem which is symbolized as a connected Type of MAC 802.11
graph and reducing the path overhead. The trip construction Packet size 512 bytes
procedure for ants includes the ants’ adjacency definitions as Type of Network Interface Wireless Phy
well as heuristic facts. The cost function is utilized for
Peer-to-Peer Netw. Appl.

Fig. 4 Received packet rate

Then the Bant message is returned to the S, and this Bant
message is generated by path predilection rate. Every relay
node accepts the Bant message and updates the pheromone
value. The pheromone trial values on a mobile node are given
in Eq. 9.

4 Simulation analysis
PV a;b ¼ 1 þ PV a;b PRðhÞ ð9Þ
Where PR(h) represents the path predilection rate of the hth
route which fulfilled the QoS necessity. Initially, the phero-
mone value among the node a and b is PVa,b = 0 Then the
pheromone value is updated for every relay node receives
the Fant message is given below.
PV a;b ¼ ΔPV a;b þ PV a;b ð10Þ
Finally, the S reaches the several Bant message then the S
selects the highest pheromone value node for data transmis-
sion. Due to the node mobility, the nodes are moving out of
communication range when the volunteer node helps to
collect loss packets and send to the relay node. Hence, the
data reaches the destination successfully. The flowchart for
the VNACO is shown in Fig. 3.
Network Simulator provides a substantial maintain to
plenty of protocols. It is a primarily Unix based. The
performance analysis parameters of VNACO are de-
scribed in Table 1.
User Datagram Protocol is used for communication
between the nodes. The propagation model two ray
ground is used for propagating the radio waves. The
Omni-directional antenna is used for receiving the sig-
nals from all directions. The performance analysis pa-
rameters are received packets, lost packets, residual en-
ergy, routing overhead and average delay occurred in
the nodes, are estimated in VNACO and DSMP.

Fig. 5 Loss packets rate

 Peer-to-Peer Netw. Appl.

Fig. 6 Average delay

The received packets rate (RPR) is computed using the The throughput of the network can be calculated using the
formula 11. formula 14.

∑n0 Packet Received ðnÞ ∑n0 Packet Received ðnÞ*Packet Size

RPR ¼ ð11Þ Throughput ¼ ð14Þ
∑n0 Packet Received ðnÞ þ ∑n0 Packet LostðnÞ 1000
Where,
The Loss of Packets Rate (LPR) is computed using the n Node Count
formula 12. AvgDelay Average Delay

∑n0 Packet Lost ðnÞ The routing schemes simulation time increases the node
LPR ¼ ð12Þ
∑n0 Packet Received ðnÞ þ ∑n0 Packet LostðnÞ received packet rate also increased since the rate of data packet
is added cumulatively. But, the number of packets delivered is
higher in the VNACO technique compared to the DSMP
Delay per node is measured using formula 13.
mechanism as shown in Fig. 4. It shows that the VNACO
has a 40% better-received packet rate when compared to the
1 n

AvgDelay ¼ ∑0 Packet Received TIME ðnÞ−Packet SentTIME ðnÞ DSMP mechanism at simulation time 100 s. Due to the vol-
n unteer nodes reduce the maximum packet losses as a result
ð13Þ increases the received packets rate in the network.

Fig. 7 Throughput
Peer-to-Peer Netw. Appl.
Fig. 8 Residual energy
There is a lesser number of packets lost in the proposed
VNACO mechanism is shown in Fig. 5. At simulation time
100 s, the loss packet rate of DSMP is greater by 14% when
compared to that of VNACO. This result indicates DSMP
have the highest data losses in the network. But in VNACO
the volunteer nodes capture the loss of packets thus it reduces
the packet losses in the P2P MANET.
The delay comparison between the VNACO and DSMP is
revealed in Fig. 6. It demonstrates that the VNACO has a 22%
lower delay when compared to the DSMP mechanism at
100 s. The DSMP raises the forwarder total transmission time
also it does not measure the accurate delay value. As a result,
the DSMP increase network delay. But in VNACO, the vol-
unteer’s nodes reduce the delay of mobile nodes.
Figure 7 shows the performance of throughput between
VNACO and DSMP. It can be observed from Fig. 7 that the
number of packets received successfully for every 1000
packets for VNACO is greater than 40% compared to that of
DSMP mechanism at 100 s. The DSMP scheme stimulates
Fig. 9 Routing overhead
less capacity of the network thus it reduces network through-
put. But VNACO improves the network throughput since the
volunteer nodes do efficient data transmission.
Figure 8 depicts the performance of the residual energy of
VNACO and DSMP. It indicates that the 0.31-joule energy is
saved per node by using VNACO when compared with the
DSMP. In VNACO, the ACO algorithm is to improve the
energy efficiency in the network. But DSMP does not concen-
trate the energy efficiency of the network.
The Routing Overhead is described as the total number of
control packets transmitted for generating a data path per data
packet. It is obtained by calculating the ratio between the total
numbers of control packets sent to the total number of control
packets received. Figure 9 shows the Normalized routing
overhead for VNACO and DSMP mechanisms.
Figure 9 demonstrates that the VNACO has less overhead
than the DSMP since VNACO select the route by ant colony
optimization. This route optimization algorithm maximum
avoids unwanted flooding during data transmission.

5 Conclusions
In MANETs, the node linkages breaks are frequent due to all
nodes are in movement. When neighbor nodes travel out of other
node communication range connection among both mobile
nodes breaks. When the volunteer node overheard the dropped
data packet then deliver the data to the corresponding relay node.
In, VNACO, adaptively chosen’s volunteers from P2P
MANETs, and rotates particular time. The Node Connectivity,
Transmission Processing Time, node energy and available band-
width parameters are used to find the node aptitude thus it
chooses the volunteer nodes in P2P MANET. This volunteer
nodes not only maintains network connectivity, it also decreases
delay, and provides essential energy savings. Data is transmitted
from source to destination using the ant colony optimization
algorithm. The updated ant highest pheromone value node is
selected as a relay node. The ant colony optimization algorithm
for finding the optimal path and reduce the routing overhead.
Finally, the volunteer’s nodes and forwarding relay node together
reduces the data packet losses and delay during data transmis-
sion. Simulation analysis is carried out and it shows the VNACO
minimizing 22% delay and reducing 14% packet losses com-
pared to the baseline protocol. In Future, we have investigates
the security part like encryption and decryption to secure the data
packets in the process.
References
1. Ramanathan R, Redi J (2002) A brief overview of ad hoc networks:
challenges and directions. IEEE Commun Mag 40(5):20–22
2. Wu F, Xu L, Kumari S, Li X (2017) A privacy-preserving and
provable user authentication scheme for wireless sensor networks
based on the internet of things security. J Ambient Intell Humaniz
Comput 8(1):101–116
3. Chen YH, Hu CC, Wu EHK, Chuang SM, Chen GH (2017) A
Delay-Sensitive Multicast Protocol for Network Capacity
Enhancement in Multirate MANETs. IEEE Syst J 12(1):926–937
4. Puri S, Arora V (2014) Routing Protocols in MANET: A Survey.
Int J Comput Appl 96(13)
5. Jia R, Yang F, Yao S, Tian X, Wang X, Zhang W, Xu J (2017)
Optimal Capacity–Delay Tradeoff in MANETs With Correlation
of Node Mobility. IEEE Trans Veh Technol 66(2):1772–1785
6. Wang Z, Chen Y, Li C (2014) PSR: A lightweight proactive source
routing protocol for mobile ad hoc networks. IEEE Trans Veh
Technol 63(2):859–868
7. Al-Karaki JN, Kamal AE (2008) Stimulating node cooperation in
mobile ad hoc networks. Wirel Pers Commun 44(2):219–239
8. Chaudhary A, Sachdev S, Pradhan T, Kamath S (2014) Improving
performance of MANET via cooperative communication with se-
lective cooperation method considering dynamic traffic pattern
using ns2. International Conference on High-Performance
Computing and Applications, pp. 1–5
9. Shan H, Zhuang W, Wang Z (2009) Cooperation or not in mobile ad
hoc networks: a MAC perspective. IEEE International Conference
on Communications:1–6
Peer-to-Peer Netw. Appl.
10. Mule R, Patil B (2016) Proactive source routing protocol for oppor-
tunistic data forwarding in MANETs. In Automatic Control and
Dynamic Optimization Techniques, IEEE International
Conference, pp. 227–232
11. Wang Z, Li C, Chen Y (2011) PSR: Proactive source routing in
mobile ad hoc networks. In: Global Telecommunications
Conference (GLOBECOM 2011), 2011 IEEE, pp. 1–6
12. Haseena MK, Philip A (2015) A Fast and Reliable Tree based
Proactive Source Routing in Mobile Adhoc Network.
International Journal of Engineering and Computer Science 4(7):
13422–13425
13. Acs G, Buttyan L, Vajda I (2006) Provably secure on-demand
source routing in mobile ad hoc networks. IEEE Trans Mob
Comput 5(11):1533–1546
14. Mueller S, Tsang RP, Ghosal D (2014) Multipath routing in mobile
ad hoc networks: Issues and challenges. In: Performance tools and
applications to networked systems. Springer, Berlin, Heidelberg,
pp. 209–234
15. Feeney LM (2011) An energy consumption model for performance
analysis of routing protocols for mobile ad hoc networks. Mobile
Networks and Applications 6(3):239–249
16. Yadav AK, Tripathi S (2017) QMRPRNS: Design of QoS multicast
routing protocol using reliable node selection scheme for MANETs.
Peer-to-Peer Networking and Applications 10(4):897–909
17. Khudayer BH, Kadhum MM, Chee WT (2015) Multi-disjoint
Routes Mechanism for Source Routing. Information Science and
Applications 339(23):189–204
18. AlQarni BH, AlMogren AS (2016) Reliable and Energy Efficient
Protocol for MANET Multicasting. Journal of Computer Networks
and Communications
19. Das SK, Tripathi S (2015) Energy efficient routing protocol for
MANET based on vague set measurement technique. Procedia
Computer Science 58:348–355
20. Veeresha M, Sugumaran M (2017) Optimal hybrid broadcast sched-
uling and adaptive cooperative caching for spatial queries in road
networks. J Ambient Intell Humaniz Comput 8(4):607–624
21. Abdallah AE (2018) Low overhead hybrid geographic-based
routing algorithms with smart partial flooding for 3D ad hoc net-
works. J Ambient Intell Humaniz Comput 9(1):85–94
22. Gupta AK, Mandal JK, Bhattacharya I, Mondal T, Shaw SS
CTMR-collaborative time-stamp based multicast routing for delay
tolerant networks in the post-disaster scenario. Peer-to-Peer
Networking and Applications 11(1):162–180, 2008
23. Sharma VK, Kumar M (2017) Adaptive congestion control scheme
in mobile ad-hoc networks. Peer-to-Peer Networking and
Applications 10(3):633–657
24. Idoudi H, Abderrahim OB, Mabrouk K (2016) Generic links and
paths stability model for Mobile Ad Hoc Networks. IEEE
International Conference on Wireless Communications and
Mobile Computing:394–398
25. Brahmbhatt S, Kulshrestha A, Singal G (2015) SSLSM: signal
strength based link stability estimation in MANETs. IEEE
International Conference on Computational Intelligence and
Communication Networks:173–177
26. Yang P, Huang B (2008) QoS routing protocol based on link stabil-
ity with dynamic delay prediction in MANET. IEEE Conference on
Computational Intelligence and Industrial Application 1:515–518
Publisher’s note Springer Nature remains neutral with regard to
jurisdictional claims in published maps and institutional affiliations.
Peer-to-Peer Netw. Appl.

N. Noor Alleema obtained her

Bachelor degree in Computer
Science from Madras University,
Chennai in 2000-2004 and Master
degree in the Department of
Computer Science and
Engineering from Anna
University, Chennai in 2006.
Currently, she is a PhD candidate
in the Department of Computer
Science and Engineering,
Sathyabama Institute of Science
and Technology, Chennai. Her
main research interest now on
Mobile Ad Hoc networks
(MANETs).

D. Siva Kumar is a Professor in

the Department of Electronics
and communication at Easwari
Engineering College. He received
his PhD degree from Anna
University. Having more than 20
years Teaching and Research
E x p e r i e n c e i n Va r i o u s
Engineering Colleges in and
around Tamil Nadu. He has pub-
lished a large number of confer-
ence papers and journal articles
on a range of research areas such
as Mobile Ad hoc Network, wire-
less Mesh Networks and network-
ing. His current research interests are in mobile computing, Wireless
Sensor Networks and wireless network. The Outstanding Faculty
Award - 'Certificate, Bronze Medal and Memento' has been bestowed to
him in view of recognition of his Contributions, Achievements and
Excellence in Electronics Engineering.