Utilization of Compact Genetic Algorithm for Optimal Shortest Path Selection to Improve

the Throughput in Mobile Ad-Hoc Networks

N. Thamaraikannan, Research Scholar, Department of Computer Science and Engineering,
Karpagam Academy of Higher Education, Coimbatore, Tamilnadu, India.
E-mail:thamaraikanna@gmail.com
Dr. Kamalraj Subramaniam, Professor, Department of Electronic Communications and Engineering,
Karpagam Academy of Higher Education, Coimbatore, Tamilnadu, India

Abstract

In MANET, the throughput of the network depends on the route selected between the
source node and the destination node with the minimum distance. In the existing research work,
TSS algorithm is proposed for secured energy-efficient data transmission in WSN. But it is not
efficient in delay. In order to increase the efficiency in delay, compact genetic algorithm based
shortest path selection is applied. The internal operations of the compact genetic algorithm
improve the shortest path computation and selection. This is a probabilistic model called
compact GA that receives learning models has input and provides a new solution. The simulation
results are compared with the existing approaches like TSS, Dijkstra’s and optimal cost weight
algorithm to evaluate the performance of the proposed approach in terms of objective function
values, population size, path cost, computation time, throughput, and packet delivery ratio.

Keywords: Mobile Sensor Network, Route Discovery, Throughput, Energy Efficiency,

Trustiness, Artificial Immune System

1. Introduction

MANET is a temporary network having a collection of mobile sensor nodes, where it can
accommodate with any existing infrastructure or centralized administration. Wireless sensor
network construction and deployment are cheap, easy, and location independent. Mobile sensor
network based communications are used in various applications from healthcare to military.
They are currently used for monitoring human activity, natural disasters, and environmental
phenomena. MANET is intensively used for emergency purposes like military situations and
surveillance monitoring. Since mobile sensor nodes are having mobility and dynamic in nature, it
is difficult to send data effectively in terms of energy and security. One of the major
considerations in the mobile nodes is the limited battery. Because of each node in the network is
restricted to a fixed transmission range, a source node needs the help of intermediate nodes
available on the route to a destination. The main portion of the network efficiency is affected
mostly by the routing protocol deployed. Also, the efficiency varies according to the application
and resource utilization during transmission. Energy efficiency is an important issue for
employing the distributed WSN in smart space and in extreme environments. Protocols using
cluster-based communication plays a vital role in WSN for reducing energy consumption.

Most of the clustering protocols divide the entire nodes into clusters. Each cluster has a
cluster head (CH), having highest energy among the other nodes within the cluster. CH is elected
in each cluster within a stipulated time interval. CH gathers the data from cluster nodes and
aggregates to the base station/sink-node directly or through CH from other clusters in the
network. In these clustering approaches the CH acts as a relay sensor, to increase the network
lifetime. All the clustering protocols follow cross-layer techniques to improve the energy
efficiency in hierarchical WSN [12]. A main advantage of clustering is, the CH eliminates
redundant and correlated data to reduce the volume of the data to be aggregated. Since the
clustering approaches can increase network lifetime and improve energy efficiency by
minimizing energy consumption and balancing energy consumption among the nodes during the
network lifetime.

Several existing routing protocols were discussed energy efficiency or security issues in
WNS. But it is necessary to provide a better solution considering energy efficiency and security
in WSN because military kind of application is functioning in remote places, needs more energy
for secured communication. Due to the application's necessity, WSN should transmit the data
with high security, and it should have the capability of detecting malicious activities.

Attacks against WSN are grouped into two main categories such as passive attacks and
active attacks. Passive attackers are hidden attacks like eavesdropping, node malfunctioning,
node tampering/destruction, and traffic analysis. Active attacks directly affect the network
operations. They include Denial of Service (DoS), jamming, hole attacks (sink, warm, black),
flooding, etc. Various security issues and their deference discussed in the following related work
section. Sinkhole and Sybil attacks interrupt the normal nodes available on the route as well as
damage the data during transmission process which reduces the throughput of the network.

In an unsafe networking situation, adversaries may compromise link security or attempt

to simulate legitimate nodes which can perform malicious actions. Facilitating data encryption in
communication is the first step of securing the network. Traditional public key schemes are not
feasible because of processor and battery limitations in the sensor nodes. This makes symmetric
cryptography very appealing. Recently, several key pre-distribution schemes (KPS) have been
proposed to establish common keys, which are requisite for symmetric cryptosystems. In KPS,
nodes are preloaded with key information prior to deployment. After deployment, nodes form
secure communication links among neighbor nodes with a probability that is based on the key
information shared between the two nodes. A common architecture diagram illustrating the
calculation of shortest path is depicted in Figure-1.

Figure-1: Shortest Path Calculation in MANET

From the above discussion, this study motivated to concentrate on secured routing, where
the path is the shortest path among the available paths between source and destination. To do
this, an optimization technique (Genetic Algorithm-GA) is utilized to select neighbor nodes as
trusted, less-distance and more energy in a route. This optimum node based shortest path
selection verifies each pair of hops in the route from source to destination to increase the energy
efficiency and throughput.

2. Preliminary Work
 Numerous techniques were proposed in the earlier research works to design and develop a
routing protocol for WSN. In the beginning of 21st century, Mobile Ad-Hoc Networks are
moving forward for finding practical abilities and providing new innovative applications [3]. A
Mobile sensor network is widely deployed, used and divide into several kinds of Wireless Sensor
Networks such as MANET, WSS, WSAN, WiSAN, WUSN, UWSN, WSIS, WDSS, WBSMN,
SSN, UAVSN and IWSN [4]. There are many issues and problems arise when the WSN
application move forward to large-scale problems. Till now, most of the innovative solutions are
provided only for small-scale WSN applications. One-solution-many-problems for our most
needed secured energy efficient applications is somewhat restricted [5], where it is not answering
for large homogeneous/heterogeneous problems under scientific and industrial problems [6, 7].In
terms of energy, batteries are considered as the most important factor to be limited in WSS for
secured energy efficient. The battery power can be saved by changing the state of the sensor
nodes such as off, sleep, standby and using the power efficiency of the wireless spectrum [8].
Energy efficiency can also be increased by, scaling-down the modulation [9], packet
transmission according to the properties of the sensor nodes [10].

In communication point of view, in Mobile Ad-Hoc Networks, most of the communication

links are bidirectional. Due to the behavior and characteristics of the applications, the
communication may be in unidirectional [11, 12]. The communication efficiency is increased
but, it is suitable for the only specific application. In heterogeneous networks, communication in
the opposite [reverse] direction is not possible [13] but the communication among the nodes in
various heterogeneous networks is restricted only among networks belongs to MANET
applications. Due to the ambient factors such as noise and interference [11], it is necessary to
lead the link is unidirectional. Since the data is noiseless, construction and reconstruction of the
data are very speed and it is effective. In recent applications, most of the MAC layer protocols
using the bidirectional links, where routing protocols using MAC can utilize only bi-directional
links for routing [14]. Counting the hop length, a novel handshaking mechanism and ACK based
unidirectional packet transmission are the key design parameters of a routing protocol to increase
the lifetime of the network discussed in [15].

In the existing system, the requisites of WSN environment are examined, and proposed
aTSS–[Three Stage Security] [16] mechanism which consists of three stages. In the first stage,
TSS concentrates on clustering the nodes in the network for reducing the energy consumption. In
the second stage, TSS concentrates on providing security for Nodes using KDM–[Key
Distribution Management] method. Finally, in the third stage, TSS concentrates on providing
security for data using ECC–[Elliptical Cryptography Method] method. Even though the security
is fulfilled by TSS algorithm, the ECC based cryptography takes more time for generating the
keys and hence it has lesser efficiency in terms of delay.

From the above discussion, it is noticed that there are various techniques and technologies was
proposed for different purpose such as routing, improving energy efficiency, communication
link, clustering and utilizing the MAC protocols separately. In order to provide a secure, energy
efficient and improved throughput based routing mechanism, a compact Genetic Algorithm is
utilized here to choose the optimum nodes based route. Transmitting data using this optimum
route improves the energy efficiency with improved throughput.The contribution of the proposed
approach is:

1. Random Network Deployment where the nodes are trusted nodes by default
2. Using GA obtaining dynamic shortest path
a. Using fitness function evaluation objective function value is obtained
b. As a part of optimization properties like selection, crossover, mutation is applied
repeatedly/iteratively to generate new populations for creating more optimum
solutions.

3. Proposed Approach

In this paper, an optimal path is discovered for data transmission in a given network.The
optimal path is constructed only by selecting optimal nodes in terms of energy, distance and trust
values. The entire functionality of the proposed approach is described in the following sections.

3.1 Network Assumptions

In this paper, the physical network model is represented as a graph (see Figure-2).
Where

(1)
. (2)
 The network used in this paper has certain attributes and their values are given here to
understand the proposed approach more efficiently. The area of the network G is measured by
width (R) and breadth (W), deployed by N number of nodes at a random location (X, Y), each
pair of nodes are interlinked by E number of edges/links. Each link is assigned by a cost C. Any
node S can be selected as a source node and D as a destination node for data transmission. The
existing link between a pair of the node is assigned as 1 and no-link is assigned as 0. Each has
initialized by a trust value 100. It is assumed that there as M number of paths available between
S and D. The distance is calculated as “Dist” and the intermediate hope nodes are represented h1
to hm. Finally, the optimal distance of the optimal route is denoted as “OptDis”.

 G: Given network where G= R x W

 R: width of the network G
 W: Height of the network G
 N: Number of Nodes available in the network G.
 E: Number of Links/Edges
 C = [ ] is the cost weight matrix
 S, D denotes the source and destination node
 Link is represented as ( )
 =
 (Xi, Yi): Location index for each node-i
 ITV: Initial Trust Value for each node-i is assigned as 100. // Trust value
 M: Total number of paths possible from S1 to D1
 K: Number of Shortest paths from S1 to D1
 Dist-1: Raw Distance from S1 to D1
 {h1, h2, …, hm} : Next hops or intermediate nodes between S1 and D1
 OptDis: Optimum path distance

87 17 86
112 9
18
4
21 18
22 44 46 92
16
39 37
25
3
8 16 24
22
26 88
94 12
92 96 32
112
25 7 12 89
2 114 21
24
60 24 89 13
11 36 114 60
1
18
28 100 20 114
 Figure-2: Proposed Network Model

Also, it is assumed that S is the source node and D is the Destination Node. It is assumed
that each node is initialized with an initial energy IE is 100. For each data packet transmission,
Node-i spends m joules of energy for sending the data packet from IE. For receiving the data
packet, Node-i spends 1 joules of energy from IE.The state of each node is changed in a
periodical manner such as: Alive, Sleep, Wakeup, Tx, Rx, and Idle. There are various ways the
delay can be reduced. In this paper, the optimal path is selected by the compact genetic
algorithm. Since the best path is selected the time taken for data transmission is decreased
automatically.

Network Model
Consider the network model in Figure -2, which constitutes multi-hop network diagram
of nodes and links called edges. Each node is associated with another node in the network by
called cost matrix. It is cost weighted value that contains from the source node, intermediate
nodes, and destined node. The genetic algorithm provides a link and it is called as GI(i,j) for the
link between the nodes. If a link exists cost will be obtained, whereas link is not provided
between the nodes. The GI matrix is a diagonal zero matrix, which considers 0 and 1 based on
the link. The genetic algorithm consists of genetic representation called chromosomes and fitness
function. These are the acquired properties of the considered node. Here 25 nodes are considered
with 50 links and 25 chromosomes are random hits the algorithm to give the following cost
matrix is shown in Table-1.
 Table-1: Cost Matrix Using Compact GA Algorithm

The position in the chromosome is represented as locus which varies from 1 to N. the link matrix
gives the existence between the paths.
Genetic Algorithm Based Node Representation
Data transmission considered from source to destination, where intermediate nodes vary
from N1 to Ni-1 to reach the destination. Each chromosome is the gene property between the
considered S and D nodes, for this locus is identified that is called position in the chromosome
(see Figure-3).
Nt-1
S
Nt-2
N2

D
N1

locus: 1 2 3 l-2 l-1 l

chromosome ………
: S N1 N2 . Nk-1 Nk D
 Figure-3: Routing path and its locus
Here chromosome value gives higher fitness value. This is random case generation in
which cost matrix of different gains is considered otherwise zero. This is based on selection
theory in which solutions are generated randomly to follow fitness function, these solutions form
a population.
Operations

1. Selection or Reproduction
2. Crossover
3. Mutation

The optimal solution is obtained based on the above-defined properties applied to the
probabilistic model. The selection property will look into the common attribute based on the
fitness. This will leads to getting offspring (Table-2). The larger fitness value is always
considered for reproduction. Crossover finds for the similar approach between the pairs
considered. If more than one attributes shares the common features then it will be considered for
crossover property and taken into consideration. Mutation property states that to change the
value of a pattern to avoid the global optimum change. The numbers are generated randomly to
obtain population; if it accepts then the corresponding node is selected. Recombination property
includes all the considered selection factors for the algorithm and evaluation of fitness function is
called through.
In a considered network deployed diagram, all the nodes are randomly deployed; using the
proposed approach dynamic path is explored. Each round of algorithm gives all the best and
worst solutions, the worst solutions are called off. The best ones are considered for the
operations like crossover and mutation and selection for repeating the algorithm. Here a random
number of nodes is considered and based on the cost associated with each node all the node
elements explored (Table-3).

Fitness Function
 A genetic representation approach is used to obtain the objective function
with a random number of numbers. Based on this candidates are evaluated and given for
optimization. The fitness function used for evaluation is given below:

Fitness function F = (3)

Initially, there is no drift is applicable. In the next repeatedly/iterative generations

objective functions are added with a penalty, where represents generation number.

Q(S g) = O (s) + Pi (4)

O(s) = objective function
Pi = penalty
This is the prime step when initial population is generated.
Decision Model
The building blocks of the objective function are given to optimization for best
individuals. The optimization which in turn contains properties called selection crossover and
mutation.

Generate Initial Evaluate Objective Optimization Best

population Function Individuals

Results
Properties
selection
(tournament),
crossover,
mutation

Figure-4: GA Model for refining individuals

In our network, the node which is randomly deployed is considered as a population.
Based on the heuristic models the objective function is implemented to give estimated path
discovery. It will go N iterations until path discovered or all possible inputs are applied to the
probabilistic model, whichever is earlier. Each generation output gives best result and worst
result according to the random input. The worst results are removed from the considerations and
the best result is optimized and given to reproductive property (see Figure-4). It continuous
linearly until obtaining the optimum result.
The node is assigned with ID; each node has unique ID with no replication. This is
converted to binary code and used for candidate generation. Initial generation is selected in a
random manner based on a compact genetic algorithm. The probabilistic model is shown in the
Figure-5. It accepts the learning candidates as an input and provides the new solution.
Probabilisti
c Model
Learning New Solution

Compact
GA
Figure-5: Probabilistic model approach.

Assume node 3 is represented as 00011 and can become a first generation candidate
solution. Like through all the arrived generations were passed to the probabilistic model to give
the solution. Here each node is identified as 5 digits binary code it identifies maximum 25th node
was represented as 11001. The bit position in the coarse grain is obtained in chromosome and
equivalent position is obtained in the locus. Example for consideration if the bit position was
identified in the Nth part and it is matched with the higher fitness value.
Table-2: Fitness Function Calculation
1 0 1 1 1 1 0 0 1 1 0 1 1 1 0 1 0xAD
Fitness

1 0 1 0 1 1 0 0 0 0 0 1 1 1 0 0 0x115

In the 11th position of both identities is matching an equivalent fitness value in the generation is
identified as a hex value (Table-2). Only the close values are considered in each generation. The
tuples are closely considered for affirmative values and position value is chosen for next
generation. After each generation, there is a possibility of ‘n' solutions which is considered as a
true and false output. The penalty will be considered for next to ‘i' generation whereas all false
outputs are debarred and best of true results are considered for next generation. It will continue
until all the nodes of lesser cost are considered.
Table-3: Crossover
Node 5 Node 17
00101 10001 Offspring Offspring
Node 5 Node 17
Crossover 11010 01110
Mutation, it restricts the solutions which are set for local optimum, the chromosome output is
modified consider the path after random generation, here initial population is considered with a
lower value of 1 to a maximum value of 25.
Table-4: Cost Estimation
Node BCD Cost
1 00001
5 00101 30
10 01010 28
14 01110 14
19 10011 12
20 10100 24
21 10101 60
22 10110 32
25 11001 34

Theorem-1: Let G be the set of generations if there exists a generation G' which depends on {G}
such that every node say ‘’ in G, such || G’, we can break ‘into:
1. null node (or) ||0 (or) 1.
2. | G’
3. for all j 0, the network node

Where denote the nodes in the network, z is the optimal path among j number of paths between .
The cost matrix considered for the population is given in Table-7. A cost matrix is
obtained from the nodal diagram in which probabilistic vector of size is considered. Each node in
the network is associated with a weight which is linked to the other nodes. For every position,
each node identity is passed through the fitness function algorithm to give a proper estimate.
Mutation property allows G1 X G2. It contains input chromosome and output chromosome,
randomly choose the crossing site and move for exchange. The probability vector of size L is
given as,

The compact genetic algorithm gives the solution is depicted in below Table-5.
Table-5: GA Solution
Node# Position GA
1000 0 4/8
0011 1
1100 2 4/8
1101 3 L * Log2(N+1)
0111 4 3/8 bits
0111 5
1000 6 4/8
1001 7
Population complexity issues the marginal distribution of the considered set for distribution and
given as follows,

Where is the marginal distribution is a kth subset of genes.

The sample space of hit function contains the equivalent value in consecutive generations are
given below in Table-6.
Table-6: Fitness function results in consecutive generations
11000 00110
01011 10100
01010 10101
10101 Fit = 8 10101 Fit=2
 11001 Fit = 6 11001 Fit=4
11011 00100
01110 10001
01111 10000

6. Simulation Results

Using the proposed approach it is clearly stated that the objective function based shortest
path algorithm always provides efficient generation of the path among nodes. If node size
increases the random number generation also increase that leads to increases in sample space.
Fitness function generates the equal success rate of individual candidates consider for
generations. The proposed probabilistic model accepts the learned inputs for processing and
provides the new solution in each sample. All the cumulative sample true results are reframed by
providing parameters like mutation and crossover the same is applied to the algorithm. It
continues until all the working cost is considered for the linear graph. Here 25 nodes with 50
links are considered. The simulation is implemented in network simulator and the result is
compared with existing shortest path algorithm techniques like Dijkstra's algorithm, optimal
shortest path algorithm.
Table-7: Cost matrix for Network Model with 25x25 nodes
 Table-8: Fitness Algorithm for Path Discovery
0.10958
Ind-1 Fitness : 8 Path : 1-2-8-9-17-18-25
0.79693
Ind-2 Fitness : 4 Path : 1-2-8-12-17-16-18-22-25
0.16369
Ind-3 Fitness : 2 Path : 1-5-6-10-5-2-8-7-11-12-17-18-25
0.39862
Ind-4 Fitness : 8 Path : P1
0.59905
Ind-5 Fitness : 8 Path : P2
0.19005
Ind-6 Fitness : 7 Path : P3
Ind-7 Fitness : 0.65916 Path : P4
 7
0.93083
Ind-8 Fitness : 8 Path : P5
0.95963
Ind-9 Fitness : 5 Path : P6
0.76691
Ind-10 Fitness : 7 Path : P7
0.30967
Ind-11 Fitness : 8 Path : P8
0.16483
Ind-12 Fitness : 9 Path : P9
0.64632
Ind-13 Fitness : 6 Path : P10
0.25718
Ind-14 Fitness : 4 Path : P11
0.29908
Ind-15 Fitness : 5 Path : P12
0.02395
Ind-16 Fitness : 7 Path : P13
0.45737
Ind-17 Fitness : 5 Path : P14
0.53287
Ind-18 Fitness : 4 Path : 1-5-10-14-19-20-21-22-25
Ind-19 Fitness : 0.11471 Path : P15
0.27748
Ind-20 Fitness : 9 Path : P16
0.01657
Ind-21 Fitness : 6 Path : P17
0.34119
Ind-22 Fitness : 3 Path : P18
Ind-23 Fitness : 0.43150 Path : P19
 8
0.10978
Ind-24 Fitness : 7 Path : P20
0.64303
Ind-25 Fitness : 5 Path : 1-5-2-6-7-8-9-17-16-18-25

Paths shall be modified by crossover and mutation. A number of generations considered

here are 50 maximum and individual approximations include of all the nodes in each sample it is
depicted in Figure-6. This collective crossover and mutation give a rate of convergence.
Comparison of individual generation and path cost is given in Table-7. Individual results are
compared with the winning probability of vector size. In the compact genetic algorithm,
population complexity is obtained from learning models. All three are linear equation based and
computed in every generation. The computational time is the time taken in which path
exploration to successive data transmission. The proposed approach is compared with Dijkstra's
algorithm, a number of nodes are considered here are 25. Computational time is increased if the
path length is high. Generally, for the considered network model, it is found that the proposed
algorithm gives the time which is lesser than 0.9 secs. It is shown in Figure -7. The generalized
functionality of node deployment is set to true for the considered network. Here route failure
ratio is considered by exploring different paths throughout the nodes. For 25 nodes there is a
direct link of 50 edges, each iteration is tested less than 50 generations, the failure ratio in route
discovery is under probability of 0.02 steps. It is shown in Figure -8. Scalability of the network
is considered here as a number of building blocks with population size N. For various distance
building blocks are identified and matched with a different population. It is depicted in the
Figure-9. Function evaluation is considered for a basic number of blocks and population size,
the size is considered here goes to {0.1, 0.01, 0.001…}. The number of blocks is a linear
equation and gives the standard population size and it is shown in Figure -10. Estimated
optimum for a maximum of 25 nodes with proposed approach is compared with the shortest path
of the non-GA algorithm. Best and worst path discovery is considered with two approaches and
found the compact GA approach gives the optimal output. Dispersion index is underperformance
in case of the existing approach. Performance metrics like 50 nodes and 25 nodes based on
complexity, the average time is compared and the results are shown in Table-8.
 Avg.max Avg.avg Avg.min
800

700

600

500
Path Cost

400

300

200

100

0
1 2 3 4 5 6
Generations

Figure-6: Generations vs. Path Cost

GA Dijikstra
1.8
1.6
1.4
Computational Time

1.2
1
0.8
0.6
0.4
0.2
0
5 10 15 20 25 30 35 40 45 50
Number of Nodes

Figure-7: Performance Analysis between GA and Dijkstra In terms of Computational Time

 Route Failure Ratio
0.03

0.025
Route Failure Ratio

0.02

0.015

0.01

0.005

0
5 10 15 20 25 30 25 40 45 50
Number of Nodes

Figure-8: Route Failure Ratio in terms of Number of Nodes

k=4, d=0.25 k=5,d=0.20

1200

1000
Population Size

800

600

400

200

0
1 2 3 4 5 6
Number of Building Blocks

Figure-9: Scalability

Table-9: Performance Analysis between CGA and Non-GA Approaches

Results over 50 runs Shortest path problem

CGA based NON-GA based
Estimated optimum 610646.5
 (ms)
Best path (sec) 600 1250
Worst path (sec) 620 1375
Dispersion 0.56% 0.92%
Average Time 247 sec 262 sec

8. Conclusion

This paper presents compact genetic algorithm (GA) for path discovery in Mobile Ad-
Hoc Networks (WSN). The proposed routing path problem solves the dynamic discovery by
means of chromosome discovery to generate initial population, to evaluate objective function, to
optimize by means of selection, crossover and mutation properties to provide best individuals to
give an approximate result for consideration. It explores the route for data transmission.
Mutation considers bit flip; crossover has common properties for extracting information between
two genres. The proposed model supports high convergence factor than the optimal shortest path
which lies in the probability of 0.85 < P (i) < 0.92. The route failure is analyzed with other
approaches; here the subspace complexity is little high due to random tries in the initial
population. If a number of nodes increase the possible tries for evaluating objective function also
increases. 80% route discovery successive rates are obtained in the considered inputs. Some
routes initial energy level of certain nodes is made low, through that the path discovery fail is
noticed. The proposed algorithm which specifies for dynamic discovery is speedily matched with
other algorithms. Hence by using a different population generation algorithm, it can be improved
to find the route discovery if node size increases.

References

[1]. Inhye Park, Hyungkeun Lee and Seokjoong Kang, “RIX-MAC: An Energy-Efficient
Receiver-Initiated Wakeup MAC Protocol for WSNs”, KSII Transactions On Internet And
Information Systems Vol. 8, NO. 5, May. 2014.
[2]. NityanandaSarma and Sukumar Nandi, “ A Multipath QoS Routing with Route Stability for
Mobile Ad-Hoc Networks”, IEEE –Technical Review-2010.

[3]. Habib F. Rashvand, Ali Abedi, Jose M. Alcaraz-Calero, Paul D. Mitchell, and Subhas
Chandra Mukhopadhyay, "Wireless Sensor Systems for Space andExtreme Environments: A
Review", IEEE SENSORS JOURNAL, VOL. 14, NO. 11, November 2014.

[4]. L. Labonte et al., “Wireless sensor and actuator networks with delayed noise feedback
(WiSAN),” in Proc. IEEE Int. Conf. Wireless SpaceExtreme Environ. (WiSEE), Baltimore, MD,
USA, 2013, pp. 1–5.

[5]. Wikipedia. (Jun. 2014). Wireless Sensor Network.

[Online].Available:http://en.wikipedia.org/wiki/Wireless_Sensor_Network.

[6]. H. F. Rashvand and J. M. Alcaraz-Calero, Distributed Sensor Systems: Practice and

Applications. London, U.K.: Wiley, 2012.

[7]. L. Marques and A. Casimiro, “Fighting uncertainty in highly dynamic mobile Ad-Hoc
Networks with probabilistic models,” in Proc. IEEE 32ndInt. Symp. Rel. Distrib. Syst., Braga,
Portugal, Sep./Oct. 2013, pp. 31–40.

[8]. S. Rhee, D. Seetharam, and S. Liu, “Techniques for minimizing power consumption in low
data-rate Mobile Ad-Hoc Networks,” in Proc. IEEE Wireless CommunicationNetworking Conf.
(WCNC), Atlanta, GA, USA, Mar. 2004, pp. 1727–1731.

[9]. C. Schurgers, O. Albert Horne, and M. B. Srivastava, "Modulation scaling for energy-aware
communication systems," in Proceeding of International Symposium Low Power Electron.
Design, Huntington Beach, CA, USA, 2001, pp. 96–99.

[10]. S. Mukhopadhyay, D. Panigrahi, and S. Dey, "Data-aware, low-cost error correction for
wireless sensor networks," in Proc. IEEE Wireless CommunicationNetworking Conf. (WCNC),
Atlanta, GA, USA, Mar. 2004, pp. 2492–2497.

[11]. V. Ramasubramanian and D. Mosse, "BRA: A bidirectional routing abstraction for

asymmetric mobile ad hoc networks," IEEE/ACM Transaction on Networking., vol. 16, no. 1,
pp. 116–129, Feb. 2008.
[12]. L. Sang, A. Arora, and H. Zhang, "On link asymmetry and one-way estimation in wireless
sensor networks," ACM Trans. Sensor Networks , vol. 6, no. 2, pp. 12:1–12:25, 2010, Art. ID
12.

[13]. G. Wang, D. Turgut, L. Bölöni, Y. Ji, and D. C. Marinescu, “A MAClayer protocol for
wireless networks with asymmetric links,” Ad HocNetworks, vol. 6, no. 3, pp. 424–440, 2008.

[14]. B. B. Chen, S. Hao, M. Zhang, M. C. Chan, and A. L. Ananda,“DEAL: Discover and

exploit asymmetric links in dense wireless sensor networks," in Proc. 6th Annual IEEE
Commun. Soc. Conf. Sensor, Mesh, Ad Hoc Commun. Netw. (SECON), Jun. 2009, pp. 1–9.

[15]. Anil UfukBatmaz, HuseyinUgurYildiz, and BulentTavli, “Role of Unidirectionality and

Reverse Path Length Wireless Sensor Network Lifetime", IEEE SENSORS JOURNAL, VOL.
14, NO. 11, November 2014.
[16]. Muthumayil, K, Manikandan, S &Rajamani, V 2016, ‘TSS: A secure clustered energy
efficient algorithm for wireless sensor networks’, International Journal of Advanced Engineering
and Technology, vol. 7, no. 1, pp. 427-433.