International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1709 - 1712

_______________________________________________________________________________________________

Implementation of Bio Inspired Algorithm in Identification of Best Route via Ant

Colony Optimization, Energy Level & Throughput with Encryption
Monica Kumari Toppo, Mr.B.Sundarraj
B.Tech, CSEAssistant Professor, Department of CSE
Bharath UniversitBharath University

Abstract:- WSN has terribly minimum life time for information Transmission. Packets drop is sometimes expected. Emmet Colony optimisation
is most popular idle supported secretion worth within the network or SRTLD is employed once secretion Substance isn\'t gift supported Power,
Location, and Routing & Security. we tend to additionally contemplate Node\'s turnout, price excluding energy state. We tend to write the
Packets throughout Transmission for Secured Communication.
Keywords:- Wireless Sensor Node(WSN), Secure Real-Time Load Distribution SRTLD), Nodes, Power, Location, Routing & Security, packets.

__________________________________________________*****_________________________________________________
I.

INTRODUCTION:

The sophisticated advancement of digital physics and microelectro-mechanical systems (MEMS) have created doable
the event of low-power, multifunctional, inexpensive
wireless sensing element nodes. These wireless sensing
element nodes communicate with one another during a
multihop manner to make a system known as a wireless
sensing element network (WSN) The design of WSN
systems depends on the quality, that specifies a physical
(PHY) and medium access management (MAC) layer
dedicated to a low-rate wireless personal space network
(LR-WPAN) . A WSN could embrace a vast variety of
wireless sensing element nodes placed in shut proximity to
an incident to gather the specified facts regarding the
physical world and send these to the sink node (WSN base
station). A WSN permits a user to profitably sense and
monitor from a distance. Miniaturized wireless sensing
element nodes have value and size restrictions. additionally
the procedure speed, memory, energy and information
measure area unit constraints that increase the WSN
complexness. Generally, the failures during a WSN area unit
caused by the battery power exhaustion, inactivity periods,
and vulnerability to destruction attributable to the smallsized sensing element nodes. Most low-power wireless
networks sometimes have unreliable links with restricted
information measure, and their link quality will be heavily
influenced by environmental factors. Basically, the analysis
challenges in WSNs area unit Brobdingnagian. The
restricted network lifespan is that the most typical drawback
in WSNs. The routing protocols should exploit the character
of the WSN and area unit associated with numerous
problems, together with the very fact that the majority
knowledge is just valid for a brief time. The routing
protocols designed for a WSN should so balance period of
time performance and energy. Recently, the routing protocol

SRTLD has achieved. Improved performance as compared

to alternative state of the art routing protocols like LQER,
MM Speed, RTPC, and RPAR, as elaborate in. SRTLD was
by experimentation evaluated on a true WSN testbed .
SRTLD could be a geodirectional- based mostly localized
routing protocol that generates one hop optimum node
choices. The optimum call depends on the end-to-end delay,
packet reception rate (PRR), and remaining battery power.
the choice and geo-cast forwarding provides period of time
communication, load distribution to boost the WSN lifespan,
and higher knowledge turnout over the WSN. Moreover,
SRTLD reduces the ability consumption by minimizing the
transmitter power level to broadcast with a spread. SRTLD
routing protocols possess some limitations. the key one is
that the broadcast of how-do-you-do messages at each hop
to get new neighboring nodes. Broadcasting at each hop
causes ultra-high power consumption, extra delay, and
packet loss, and therefore reduces the info turnout within the
WSN. The higher than mentioned challenges like high
inactivity periods, power consumption, and vulnerability to
destruction, addition Delay, and packet loss, necessitate a
replacement autonomous mechanism . Probabilistic
strategies that give measurability and preventability will be
found in nature and tailored to technology. Biological
impressed optimisation techniques give the utmost
performance particularly in digital communication.
hymenopteran colony optimisation (ACO) is one amongst
the most effective meta-heuristic algorithms in observe. The
ACO algorithmic program works within the same manner as
real ants, which permit it to resolve complicated
computations and completely different separate optimisation
issues with efficiency. during this paper we tend to propose
the look, implementation, simulation studies, and real
testbed experimentation of the Biological-inspired SelfOrganized Secure Autonomous Routing Protocol
(BIOSARP). the look of the planned protocol is predicated
1709

IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1709 - 1712

_______________________________________________________________________________________________
on improved hymenopteran colony optimisation. BIOSARP
simulation results were compared with those of energy and
delay ants algorithmic program (E&D ANTS) , SRTLD and
improved energy-efficient ant-based routing (IEEABR) .
what is more, BIOSARP is enforced on wireless sensing
element nodes called TelosB radio sensing element boards.
TelosB consists of a low-power transceiver supported the
CC2420 ChipCon chip. 10 TelosB nodes were deployed
within the field to construct region WSN testbed. we tend to
enabled TelosB integral wetness, light, and temperature
sensors whereas playing the experimentation. the $64000
WSN testbed performance was evaluated in terms of the
delivery quantitative relation and compared.
II.

RELATED WORK:

In paper [1] proposed for wireless sensor

networks, including habitat monitoring, structural health
monitoring, pipeline monitoring, precision agriculture,
active volcano monitoring, and many more. The energy
consumption of these applications is a critical feasibility
metric that defines the scope and usefulness of wireless
sensor networks. This paper provides a comprehensive
energy model for a fully functional wireless sensor network.
In paper [2] the protocol and compatible interconnection
for data communication devices using low data rate, low
power and low complexity, short-range radio frequency
(RF) transmissions in a wireless personal area network
(WPAN). Keywords: ad hoc network, low data rate, low
power, LR-WPAN, mobility, personal area network (PAN),
radio frequency (RF), short range, wireless, wireless
personal area network (WPAN). In paper [3] Global
optimization methods play an important role to solve many
real-world problems. Flower pollination algorithm (FP) is a
new nature-inspired algorithm, based on the characteristics
of flowering plants. In this paper, a new hybrid optimization
method called hybrid flower pollination algorithm (FPPSO)
is proposed. In paper[4]a cross-layer protocol (XLP) is
introduced, which achieves congestion control, routing, and
medium access control in a cross-layer fashion. The design
principle of XLP is based on the cross-layer concept of
initiative determination, which enables receiver-based
contention, initiative-based forwarding, local congestion
control, and distributed duty cycle operation to realize
efficient and reliable communication in WSNs. In paper[5]
Wireless Senor Network (WSN), real time critical events
anticipate an efficient quality-of-service (QoS) based routing
for data delivery from the network infrastructure. Designing
such QoS based routing protocol to meet the reliability and
delay guarantee of critical events while preserving the
energy efficiency is a challenging task.In paper[6] presents
a proactive routing method that is aware of the nodes
destruction threat and adapts the routes accordingly, before

node failure results in broken routes, delay and power

consuming route re-discovery. The performance of the
presented routing scheme is evaluated and compared to
OLSR based routing in the same scenario.In paper[7] Smart
sensor nodes are low power devices equipped with one or
more sensors, a processor, memory, a power supply, a radio,
and an actuator.1 A variety of mechanical, thermal,
biological, chemical, optical, and magnetic sensors may be
attached to the sensor node to measure properties of the
environment.In paper[8] proposes an enhanced real time
with load distribution (ERTLD) routing protocol for MWSN
which is based on our previous routing protocol RTLD.
ERTLD utilized corona mechanism and optimal forwarding
metrics to forward the data packet in MWSN. It computes
the optimal forwarding node based on RSSI, remaining
battery level of sensor nodes and packet delay over onehop.In paper [9]Wireless Sensor Networks consisting of
nodes with limited power are deployed to gather useful
information from the field. In WSNs it is critical to collect
the information in an energy efficient manner. Ant Colony
Optimization, a swarm intelligence based optimization
technique, is widely used in network routing.In paper [10]
Wireless sensor network environments links are extremely
unreliable. Ideal radio environments use a retransmission
mechanism. Energy-efficient reliable data transmission is a
fundamental routing issue in wireless sensor networks.
III.
PROJECTED SYSTEM:
Ant Colony optimisation is most popular idle supported
secretion worth within the network or SRTLD is employed
once secretion Substance isn\'t gift supported Power,
Location, Routing& Security. MODIFICATION a part of
the Project, contemplate Node\'s output, price except for
energy. we tend to write in code the Packets throughout
Transmission for Secured Communication.
IV.

ARCHITECTURE DIAGRAM:

1710
IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1709 - 1712

_______________________________________________________________________________________________
MODULE DESCRIPTION:

Network readying
Route Identification
Pheromone Calculation
Throughput Calculation
Energy & value Estimation
Encryption & cryptography
Best Route Identification & knowledge Transfer

Network readying
we have a tendency to produce a configuration to avoid
security downside. Network has several range of node
details. It maintains the affiliation details additionally.
Nodes area unit interconnected and exchange knowledge
with different nodes. Nodes area unit connecting with
different nodes within the network. Network server
maintains the nodes information processing Address, Port
details and standing. Node offer request to server and find
the required response from server.
Route Identification
During this module the network can confirm the versatile
path to transfer the information from the supply node to the
destination node. there\'ll be several ways are going to be
offered from supply node to the destination node. so the
information are going to be transfer via the trail that has the
best property so the information can reach the destination
node in reliable manner
Secretion Calculation
The secretion concentration helps to determine choose and
drop of objects with less parameters and calculations.
Pismire Colony improvement (ACO) may be a assortment of
biologically impressed meta heuristics for the finding of
adverse combinatorial improvement issues. Pismire Colony
improvement algorithms take their inspiration from pismire
colonies and therefore the observation that ants area unit
able to realize the shortest path from food sources back to
their nests. Improvement issues that are tackled through the
utilization of ACO.
Turnout Calculation
A typical technique of performing arts a measuring is to
transfer a \'large\' file from one ... The turnout is then
calculated by dividing the file size by the time to urge. the
explanations for measurement turnout in networks. Folks
area unit usually involved regarding measurement the
utmost knowledge turnout in bits per second of a
communications link or network access. A typical technique
of performing arts a measuring is to transfer a \'large\' file

from one system to a different system and live the time

needed to complete the transfer or copy of the file. The
turnout is then calculated by dividing the file size by the
time to urge the turnout in megabits, kilobits, or bits per
second.
Energy & value Estimation
During this module the network can confirm the versatile
path to transfer the information from the supply node to the
destination node. there\'ll be several ways are going to be
offered from supply node to the destination node. So the
information are going to be transfer via the trail that has the
best property so the information can reach the destination
node in reliable manner. thus for each node has their energy
and value of that node is calculated so supported the price
we are able to send the information and it opt for the shortest
path. can cause no packet loss within the network.
Encoding & Cryptography
During this module the before transferring knowledge
the date is encrypted by RC4 algorithmic rule The RC4
algorithmic rule generates a pseudo-random key stream
that\'s then accustomed generate the cipher text (by XORing
it with the plaintext). it\'s known as pseudo- random as a
result of it generates a sequence of numbers that solely
approximates the properties of random numbers. The
sequence of bytes generated isn\'t random since the output is
often an equivalent for a given input however it\'s to
approximate random properties to create it tougher to crack.
The key stream is generated from a variable length key
mistreatment an inside state composed of the subsequent
elements:

A 256 bytes array (denoted S) containing a

permutation of those 256 bytes
Two indexes i and j, accustomed purpose
components within the S array (only eight bits area
unit necessary for every index since the array solely
have 256 elements)

Best Route Identification & knowledge Transfer:

The modification that we have a tendency to do during
this project is capability Calculation. If the supply node
needs to send the information to the destination node via
versatile ways and there area unit several versatile ways area
unit offered to send the information to the destination node.
At now we have a tendency to area unit scheming the
capability of the offered ways. so that path has the best
capability, so the information are going to be send to via that
path to the destination node.

1711
IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________

International Journal on Recent and Innovation Trends in Computing and Communication

Volume: 3 Issue: 3

ISSN: 2321-8169
1709 - 1712

_______________________________________________________________________________________________
V.

EXPERIMENTAL SETUP AND RESULT:

Software requirement of this project includes JAVA JDK as

front end and SQL server 2008 as backend while hardware
requirements include Windows OS, RAM 512 Mb and
Pentium IV processor.
In this project we define a source node and a
destination node and some intermediate nodes through
which a file is send to the destination node. All the nodes are
set to have the same pheromone valueand cost at the
beginning. So initially when the file is sent it takes the initial
destination node and finds the best path for send the packets
through source node to destination node. But as the
pheromone value and cost is changed (i.e. pheromone value
and cost is zero), then the directly calculate the throughput
value and the takes the packets by the bestpath available.
Additionally, find the best path and best node is discovered
and an alternate path is taken by the packet.
VI.

CONCLUSION:

Real WSN test bed that consisted of ten wireless

detector nodes (TelosB) was utilized within the open field.
TOSSIM was wont to compile the BIOSARP routing
protocol on a laptop. The BIOSARP code size is a smaller
amount than the SRTLD routing protocol. Hence, BIOSARP
may be applied to differing kinds of radio detector boards on
totally different platforms. The test bed results showed that
the BIOSARP routing protocol outperformed SRTLD.
Nonetheless, the BIOSARP routing protocol-based WSN
performed well, and its filmable behavior once round-faced
with environmental changes ensured reliable and
economical information transfer.

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

Netw. Comput.Appl., vol. 35, no. 5, pp. 15081536,

2012.
Y.-F. Wen, Y.-Q.Chen, and M. Pan, Adaptive ant-based
routing in wireless device networks victimization
Energy*Delay metrics, J. Zhejiang Univ. Sci.A, vol. 9,
no. 4, pp. 531538, 2008.
A. M. Zungeru, K. P. Seng, L.-M.Ang, and W. Chong
Chia, Energy potency performance enhancements for
ant-based routing algorithmic rule in wireless device
networks, J. Sensors, vol. 2013, p. 17, Dec. 2013.
Chipcon, Oslo, Norway. (2010). CC2420 Low Power
Radio
Transceiver
[Online].
Available:
http://www.chipcon.com
K. Saleem, N. Fisal, M. A. Baharudin, A. A. Ahmed, S.
Hafizah, and S. Kamilah, Ant colony galvanized selfoptimized routing protocol supported cross layer design
for wireless device networks, WSEAS Trans. Commun.,
vol. 9, no. 10, pp. 669678, 2010.
G.-P. Qi, P. Song, and K.-J. Li, Blackboard mechanism
based mostly pismire colony theory for dynamic
readying of mobile device networks, J. Bionic Eng., vol.
5, no. 3, pp. 197203, 2008.
G. Chen, T.-D.Guo, W.-G. Yang, and T. Zhao, An
improved antbased routing protocol in wireless device
networks, in Proc. Int. Conf. cooperative Comput.,
Netw., Appl. Worksharing, New York, NY, USA, Nov.
2006, pp. 17.
K. Ghoseiri and F. Morshedsolouk, ACS-TS: Train
programing victimization pismire colony system, J.
Appl. Math. call Sci., vol. 2006, no. 3, p. 28, 2006.
T. Stuetzle and M. Dorigo, A short convergence proof
for a category of ACO algorithms, IEEE Trans.
Evol.Comput., vol. 6, no. 4, pp. 358365, Aug. 2002.

REFERENCE:
[1]

[2]

[3]

[4]
[5]

[6]

A. A. Ahmed and N. F. Fisal, Secure period of time

routing protocol with load distribution in wireless device
networks, Security Commun. Netw., vol. 4, no. 8, pp.
839869, 2011.
F. Gmez Mrmol and G. Martnez Prez, Providing
trust in wireless device networks employing a bioinspired technique, Telecommun.Syst., vol. 46, no. 2,
pp. 163180, 2011.
D. A. Pelta and N. Krasnogor, Nature-inspired
cooperative methods for optimisation, Int. J. Intell.
Syst., vol. 24, no. 7, pp. 723725, 2009.
A. Muoz, P. Anton, and A. Maa, Multiagent systems
protection, Adv. Softw. Eng., vol. 2011, p. 4, Jun. 2011.
B. Zhang, Y. Wu, J. Lu, and K.-L.Du, Evolutionary
computation and its applications in neural and fuzzy
systems, Appl. Comput.Intell. Soft Comput., vol. 2011,
p. 7, Jan. 2011.
A. M. Zungeru, L.-M. Ang, and K. P. Seng, Classical
and swarm intelligence based routing protocols for
wireless device networks: A survey and comparison, J.
1712

IJRITCC | March 2015, Available @ http://www.ijritcc.org

_______________________________________________________________________________________