VELTECH MULTITECH Dr.

RANGARAJAN
Dr.SAKUNTHALA ENGINEERING COLLEGE

BATCH NO:12
REVIEW NO:4
Under the guidance of
Mr. V.R.Vimal
(Asst Professor of CSE) By,
M.Gowthami(VM6235)
C.Bhagya Shree(VM6231)
J.Vincy(VM6187)
 ABSTRACT

The project aims at developing a secured data

transmission in wireless sensor network. Packet are
routed via ant colony optimization using Pheromone
Value .When pheromone value do not exist, best Route
is chosen based on Energy Level , Throughput. Cost is
also considered for Data Transmission.
Existing system
 WSN has very minimum life time for Data Transmission
therefore packets drop is usually expected.
The major factor to be tackled in the WSN is the network
lifetime.
A recent WSN routing protocol is defined as secure real-time
load distribution .It broadcast packets to perform neighbour
discovery and calculation at every hop while transferring data
packets.
Issues In Existing System

Packet drop usually leads to collision.

Transmission of packets is not secure and time delay occurs
PROPOSED SYSTEM
Ant Colony Optimization is preferred based on Pheromone
Value in the network or SRTLD is used when Pheromone
Substance is not Present based on Power, Location, Routing
& Security.

Inthe modification part of our Project, we also consider

Node's Throughput, Cost apart from Energy Level.

We Encrypt the Packets during Transmission for Secured

Communication.
 Literature Survey
XLP: A Cross-Layer Protocol for Efficient Communication in Wireless
Sensor Networks :
Based on the initiative determination concept, XLP serves as a
proof of concept and performs receiverbased contention, initiative-based forwarding,
local congestion control, and distributed duty cycle operation to realize efficient and
reliable communication in WSNs.

Wireless Sensor Network Survey:

We have surveyed in this paper issues on three different
categories: (1) internal platform and underlying operating system, (2) communication
protocol stack, and (3) network services, provisioning, and deployment issues. There
are still many issues to be resolved around WSN applications such as communication
architectures, security, and management. By solving these issues, we can close the gap
between technology and application.
SPEED: A Stateless Protocol For Real-Time Communication In Sensor
Networks:
Many excellent protocols have been developed for ad hoc networks.
These include real-time requirements and nodes which are severely constrained in
computing power, bandwidth, and memory. This combination of MAC and network
layer adaptation improves the end-to-end delay and provides good response to
congestion and voids.

Environmental Monitoring Aware Routing: Making Environmental

Sensor Networks More Robust:
We have proposed a routing approach that proactively adapts routes in a
wireless sensor network based on information on node-threatening environment
influences. The approach, called Environmental Monitoring Aware (EMA) routing,
has been evaluated by computer simulation and has demonstrated good performance
in the considered forest fire scenario. In particular, EMA routing can support multiple
sinks with no additional overhead..
Statistical Model Of Lossy Links In Wireless Sensor Networks:
We have developed a set of non-parametric statistical models for
characterizing links in wireless ad-hoc networks. In addition to modeling properties
of a single link our statistical models also capture features of groups of links
associated with a particular receiver, a particular transmitter, a particular radio, and
links associated with a group of radios that are geographically close. The models and
generators are analyzed in terms of their accuracy. They are also used to identify
future directions for developers of protocols and localized algorithms for wireless
sensor networks.

Modelling The Energy Cost Of A Fully Operational Wireless Sensor

Network:
In our energy model, we have not considered the energy required for
local signal processing, such as the energy consumed by the analog-to-digital (ADC)
converter to produce a high resolution senor data. In reality, however, the ADC
consumes a significant amount of power. In the future, we will accommodate this
fact to assess the feasibility of using existing off-the-shelf hardware for building
wireless sensor networks
Probabilistic Qos Guarantee in Reliability and Timeliness Domains in
Wireless Sensor Networks:
It propose a novel packet delivery mechanism called MMSPEED for
wireless sensor networks to provide service differentiation and probabilistic QoS
guarantees in timeliness and reliability domains. For the timeliness domain, we
provide multiple network-wide speed options so that various traffic types can
dynamically choose the proper speed options for their packets depending on their
end-to-end deadlines. For the reliability domain, we use probabilistic multi-path
forwarding to control the number of packet delivery paths depending on the
required end-to-end reaching probability

Saving Energy and Improving Communications Using Cooperative

Group-Based Wireless Sensor Networks:
In this paper we have analyzed cooperative group-based WSNs. In this
type of WSNs when a sensor detects a new event, the alert is sent to its group and
it is distributed to an appropriate neighboring groups based on the information
shared between sensors. Cooperation between groups could be used to change the
direction of the alert propagation and the level of the alert in order to take the
appropriate actions. Moreover, in future works we will study the energy issues
related with mobile sensors and the communication procedures of joining and
leaving the groups.
Secure Real-Time Routing Protocol with Load Distribution in Wireless
Sensor Networks:
Wireless sensor network (WSN) is a wireless ad hocnetwork that
consists of a very large number of tiny sensor nodes communicating with each other
with limited power and memory constrain. WSN demands real-time forwarding
which means messages in the network are delivered according to their end-to-end
deadlines (packet lifetime). Recently, many real-time routing protocols have been
proposed, but none is designed with security..

Providing Trust in Wireless Sensor Networks using a Bio-Inspired

Technique:
It proposed a Bio-inspired Trust and Reputation Model for WSNs, called
BTRM-WSN. It is based on the Ant Colony System (ACS) and a complete
description of its main features has been shown. We have seen how the pheromone
traces deposited by ants help following ants to find the most trustworthy server
through the most reputable path all over the network. Specifically we have
explained how the pheromone updating is carried out, as well as how to measure the
quality of a path or how to punish or reward a server depending on its behavior.
Classical and Swarm Intel-Ligence Based Routing Protocols for Wireless
Sensor Networks: A Survey and Comparison:
Together with emergence of WSN networks, new routing approaches
are required since networks have highly dynamism and distributed. When literature is
investigated, it is obviously seen that routing protocols for WSNs are implementations
from wired networks. The researches done have shown that swarm intelligence based
routing protocols can remove at least one or several problems in the area such as battery
life, scalability, maintainability, survivability, adaptability and so on. Ant based
approaches are attracted by much researchers than other approaches.

Energy Efficiency Performance Improvements for Ant-Based Routing

Algorithm in Wireless Sensor Networks:
The application of the Ant Colony Optimization metaheuristic to
solve the routing problem in wireless sensor networks. A basic ant-based routing
algorithm was proposed, and several improvements, inspired by the features of wireless
sensor networks were considered and implemented. The resulting routing protocol,
called EnergyEfficient Ant Based Routing (EEABR), uses lightweight ants to find
routing paths between the sensor nodes and the sink nodes, which are optimised in terms
of distance and energy levels. As future work we intend to study the initialization method
to populate the routing tables with initial pheromone levels.
Ant Colony Inspired Self-Optimized Routing Protocol Based On Cross
Layer Architecture For Wireless Sensor Networks:
It proposes an enhanced ant colony inspired self-optimized
routing protocol for WSN. Our specified mechanism is based on link quality, energy
and velocity parameters. The adopted cross layer architecture helps WSN in
improving the overall data throughput; especially in the case of real time traffic. The
cross layer design also assists WSN in better delivery ratio while maintaining energy
consumption. The algorithm is also capable of avoiding permanent loops which
promotes dead lock in the running networks. Our immediate future work evolved to
enhance our routing mechanism with autonomous security system.

Blackboard Mechanism Based Ant Colony Theory For Dynamic

Deployment Of Mobile Sensor Networks:
A novel bionic swarm intelligence algorithm, called ant
colony algorithm based on a blackboard mechanism, is proposed to solve the
autonomy and dynamic deployment of mobiles sensor networks effectively. A
blackboard mechanism is introduced into the system for making pheromone and
completing the algorithm. Every node, which can be looked as an ant, makes one
information zone in its memory for communicating with other nodes and leaves
pheromone, which is created by ant itself in nature.
An Improved Ant-Based Routing Protocol in Wireless Sensor Networks:
Routing in wireless sensor networks (WSNs) is very challenging due
to their inherent characteristics of large scale, no global identification, dynamic topology,
and very limited power, memory, and computational capacities for each sensor. Recent
research on WSNs routing protocol has proved that data-centric technologies are needed
for performing in-network aggregation of data to yield energy-efficient dissemination.
As an effective distributed approach, ant colony optimization (ACO) algorithms have
been introduced to the design of data-centric routing protocol and have got many
achievements, but still have some shortcomings blocking their further application in the
large scale WSNs.

Comparison of Different Topologies For Island-Based Multi-Colony Ant

Algorithms For The Minimum Weight Vertex Cover Problem:
. We compared the effect of different parallel algorithms for the
MWVCP. We have confirmed that, similar to the case of the TSP, the simple use of
parallel independent runs is a good approach. In small problem cases it was even better
that other, more complicated topologies like fully connected, replace worst and the ring.
In larger problem cases, this advantage has been lost, but the results were still of good
quality. We also introduced a variation of the algorithm corresponding to the ring
topology..
 SYSTEM SPECIFICATION
Hardware Requirements
Processor : Pentium IV
RAM : 512 MB
HDD : 80 GB

Software Requirements
Platform : Windows Xp / Ubuntu
Front End : JAVA
Back End : MY SQL
Architecture Diagram:
User Registration Server
Data Base
registration

No
User Login User Invalid
Validation User Login

YES

Network
Creation

Node
Created
User login

Sending RC4 Network Destination

Request Encryption Node

Yes No
Phenomone
value

Yes
Buffer
level
No
NO
Yes
Through
put

Send Data RC4

Decryption
 Network Deployment
 Route Identification
 Pheromone Calculation
 Throughput Calculation
 Energy & Cost Estimation
 Encryption & decryption
 Best Route Identification & Data Transfer
Available Paths:

S N1 N2 D S N3 N2 D S N5 N2D
S N1 N4 D S N3 N4 D S N5 N4 D
S N1 N6 D S N3 N6 D S N5 N6 D
Pheromone value:
Node which has more pheromone value is preferred for Data transfer which is called
as ANT Colony optimization.So,
SN1N6D I
is the preferred path
Our implementation :
If no pheromone value is present in the network then following logic is used
1. Throughput
2. Cost
3. Energy
Server is deployed to monitor all the above said factors to achieve best route
for data transfer
For example
N1 TP: 100%
Cost: 1 MB /10-Rs
Energy: 60 units
N2 TP: 80%
Cost: 1 MB /7-Rs
Energy: 100 units

N3 TP: 50%
Cost: 1 MB /6-Rs
Energy: 50 units

N4 TP: 90%
Cost: 1 MB /12-Rs
Energy: 80 units

N5 TP: 100%
Cost: 1 MB /15-Rs
Energy: 100 units

N6 TP: 100%
Cost: 1 MB /10-Rs
Energy: 80 units
Source node cost option system will find out nodes with maximum
throughput with optimum cost & lifetime to transfer the packets

Consider 1MB transfer requires/unit of energy

Scenario:1

If source transfer 50 MB of Data

 Source selected minimum cost then route is constructed as

S  N1  N6  D

Most Ideal Route

Throughput: 100% of both the nodes
Cost (N1+N6):(500+500)=Rs.1000
Energy used (50+50) =100 units
Implementation Of Module 1
Network deployment
After compilation,login page will be opened.
To create a new node new button has to be selected
 The node name,password,pheromone value and cost is given and submit button is
selected.
Now a new node “aa” is created.we can create many nodes in the same manner.
Each node is connected to other nodes by selecting the node name and then by
selecting connection button
To sign into the particular node name and its password is given
After signing in to the node we can send the datas to the other node using
the pheromone value .
[1] M. C. Vuran and I. F. Akyildiz, “XLP: A cross-layer protocol for efficient communication in
wireless sensor networks,” IEEE Trans. Mobile Comput., vol. 9, no. 11, pp. 1578–1591, Nov.
2010.
[2] Part 15.4: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications
for Low-Rate Wireless Personal Area Networks (WPANs), IEEE Standard 802.15.4, 2006.
[3] J. Yick, B. Mukherjee, and D. Ghosal, “Wireless sensor network survey,” Comput. Netw., vol.
52, no. 12, pp. 2292–2330, 2008.
[4] T. He, J. Stankovic, C. Lu, and T. Abdelzaher, “SPEED: A stateless protocol for real-time
communication in sensor networks,” in Proc. 23rd Int. Conf. Distrib. Comput. Syst.,
Providence, RI, USA, 2003, pp. 46–55.
[5] B.-L. Wenning, D. Pesch, A. Timm-Giel, and C. Görg, “Environmental monitoring aware
routing: Making environmental sensor networks more robust,” Telecommun. Syst., vol. 43, nos.
1–2, pp. 3–11, 2010.
[6] A. Cerpa, J. L.Wong, L. Kuang, M. Potkonjak, and D. Estrin, “Statistical model of lossy links
in wireless sensor networks,” in Proc. ACM/IEEE 4th Int. Symp. IPSN, Los Angeles, CA, USA,
Apr. 2005, pp. 81–88.
[7] W. Dargie, X. Chao, and M. Denko, “Modelling the energy cost of a fully
operational wireless sensor network,” Telecommun. Syst., vol. 44, nos. 1–2, pp. 3–15, 2010.
[8] A. M. Zungeru, L.-M. Ang, and K. P. Seng, “Classical and swarm intelligence
based routing protocols for wireless sensor networks: A survey and comparison,” J. Netw.
Comput. Appl., vol. 35, no. 5, pp. 1508–1536, 2012.
[9] Y.-F. Wen, Y.-Q. Chen, and M. Pan, “Adaptive ant-based routing in wireless sensor networks
using Energy*Delay metrics,” J. Zhejiang Univ. Sci. A, vol. 9, no. 4, pp. 531–538, 2008.
[10] A. M. Zungeru, K. P. Seng, L.-M. Ang, and W. Chong Chia, “Energy efficiency performance
improvements for ant-based routing algorithm in wireless sensor networks,” J. Sensors, vol.
2013, p. 17, Dec. 2013.
[11] Chipcon, Oslo, Norway. (2010). CC2420 Low Power Radio Transceiver [Online]. Available:
http://www.chipcon.com
[12] K. Saleem, N. Fisal, M. A. Baharudin, A. A. Ahmed, S. Hafizah, and S. Kamilah, “Ant
colony inspired self-optimized routing protocol based on cross layer architecture for wireless
sensor networks,” WSEAS Trans. Commun., vol. 9, no. 10, pp. 669–678, 2010.
[13] G.-P. Qi, P. Song, and K.-J. Li, “Blackboard mechanism based ant colony theory for
dynamic deployment of mobile sensor networks,” J. Bionic Eng., vol. 5, no. 3, pp. 197–203,
2008.
[14] G. Chen, T.-D. Guo, W.-G. Yang, and T. Zhao, “An improved antbased routing protocol in
wireless sensor networks,” in Proc. Int. Conf. Collaborative Comput., Netw., Appl.
Worksharing, New York, NY, USA, Nov. 2006, pp. 1–7.
[15] K. Ghoseiri and F. Morshedsolouk, “ACS-TS: Train scheduling using ant colony system,” J.
Appl. Math. Decision Sci., vol. 2006, no. 3, p. 28, 2006.
[16] T. Stuetzle and M. Dorigo, “A short convergence proof for a class of ACO algorithms,”
IEEE Trans. Evol. Comput., vol. 6, no. 4, pp. 358–365, Aug. 2002.
In Progress…….