Data transmission occurs from transmitting node to sink node, which communicate each other via large number of intermediate nodes or directly to an external base station. A network consists of numbers of nodes with one as a source and one or more as a destination node.

1. ICRTEDC-2014 40
Vol. 1, Spl. Issue 2 (May, 2014) e-ISSN: 1694-2310 | p-ISSN: 1694-2426
GV/ICRTEDC/10
DATA TRANSMISSION IN WIRELESS
SENSOR NETWORKS FOR EFFECTIVE
AND SECURE COMMUNICATION
1
Dr. Hardeep Singh, 2
Dr.Dinesh Arora
1
Indo Global College of Engg. & Technology, Mohali, Punjab, India
2
Gurukul Vidyapeeth Institute of Engg. & Technology, Banur, Punjab, India
1
hardeep_saini17@yahoo.co.in, 2
drdinesh169@gmail.com
ABSTRACT: Wireless sensor network based
communication is carried out through a wireless channel.
In a wide area there are multiple users say as an example:
mobile users. Numbers of towers in area act as sensors
called as nodes in wireless sensor networks. Thus from
one node to other, communication is carried out without
any physical link. In other words, data transmission occurs
from transmitting node to sink node, which communicate
each other via large number of intermediate nodes or
directly to an external base station. A network consists of
numbers of nodes with one as a source and one or more as
a destination node. One of the advantages of wireless
sensor networks is their ability to operate unattended in
harsh environment in which manually human monitoring
schemes are inefficient and risky.
Keywords: Wireless sensor network; Sensor; Bacteria
Foraging Optimization; Routing; Nodes;
1. INTRODUCTION TO WIRELESS SENSOR
NETWORK
Wireless sensor network (WSN) consist of thousands of
sensor nodes, which is capable of sensing and computing
the events in wireless communication systems. These
nodes or sensors processes the events happening near
sensor by sensing electronic conditions related to the
environment surrounding the sensor and transduce them
into electrical signals. Data transmission occurs from
transmitting node to sink node, which communicate each
other via large number of intermediate nodes or directly to
an external base station. Greater the number of nodes
placed; greater the cluster size thereby covering large
geographical area. Sensor observes change in environment
enclosed data in data packets and route these packets to
destination sensor present in sensor field. Figure 1.1
illustrates this process; red dot indicates source and
destination node. These sensors communicated with
intermediate nodes to route the path until destination or
sink node encountered. Wireless sensor nodes are low cost
sensor nodes, which are multifunction, used to collect data
from region of interest and report it back to sink node.
1.1 Operating Stages of WSN Network
A typical wireless sensor network work in five main
stages, which are, cogitate stage, establishment of nodes,
post establishment stage, working stage, post working
stage. Typical sensor network operated in such a way to
provide real time communication, which is energy
efficient to enhance network lifetime and provide data
availability in needed situations.
a) In cogitate stage survey is done regarding
deployment environment and its condition to
select a suitable mechanism to establish the nodes
in selected site.
Figure 1.1: Deployment of sensors in environment [2]
b) In establishment stage, nodes are deployed in site
region; which can be either done randomly or
planted manually.
c) In post establishment work, sensor network
operators need to identify or estimate the location
of sensors to access coverage
d) Working stage involves sensing and monitoring
the environment to generate data.
e) Post working stage involves shutting down and
preserving the sensor for future work.
1.2 Components of WSN/Architecture of WSN based
System
Wireless sensor network consist of devices with inbuilt
sensors. Such devices are called nodes. These nodes are
networked using IEEE 802.15.4 standard as a base
standard. Nodes are placed in the environment field called
sensor field. The process of placing nodes in sensor field is
termed as deployment of nodes, which can be done
randomly or planted manually.
Figure 1.2: Basic Structure of WSN Based System
Base station can be considered as a node may be fixed or
mobile which connects sensor field to an existing
communication infrastructure like internet for
broadcasting information to users at remote places.

2. 41 ICRTEDC -2014
1.3 Advantages of Wireless Sensor Networks
 Low Power Consumption
Most of the wireless sensor nodes are battery
operated and are designed in such a way to
consume low battery power. For ex. Typical,
4AA battery can operate node up to three years of
lifetime. They also have a capability to scavenged
power from external environment through various
in built transducers like piezoelectric generator
and solar cell.
 Cost Reduction
Wireless sensing technology is much better than
traditionally technology because it employs
inbuilt embedded construction and distributed
nature. It uses low power and relatively
transreceivers and microcontrollers. Sensor node
in W.S.N system costs less than even one
hundred dollar.
 Efficiency Enhancement
Wireless sensor networks optimize measurement
processes and networks can access data almost
anywhere and anytime thereby increasing the
efficiency of measuring systems. It also decreases
downtime.
 Mesh Technology
Transmitting data using mesh topology consumes
less power than transmitting directly between
transmitting and sensing node. Most of the sensor
networks are scalable; they have an ability to
adapt to changes in node density and topology.
Nodes in WSN network are capable enough to
responds to special events that network needs to
study.
 Better Coverage
Wireless sensor network systems offer better
coverage than any other sensing technology. Due
to the cost advantage and employment of mesh
technology, organizations can implement more
sensors in a environmental field thereby
enhancing s/n ratio of the system and increases
the amount of useable data.
2. LITERATURE SURVEY
This section enlightens the earlier work done related to
wireless sensor networks. The word done expressed in this
section includes literature survey illustrating the research
that has already done by the various author in the field of
wireless sensor which may be various routing protocols
for lifetime enhancement, throughput paths, best roués
and in field of wireless sensor network security.
M. Saleem et al [2] presented his work in 2011. In
his paper, he has presented a rather extensive survey of
these SI-based algorithms for routing in WSNs. They also
pointed out a number of methodological flaws in the way
these algorithms are commonly presented and empirically
evaluated. Finally, they had outlined a general recipe for
the definition of scientifically sound experiments and
performance evaluation. Apart from the highlighted
methodological problems, the domain of SI-based WSN
routing lacks of contributions falling in the two opposite
areas of mathematical modeling and real-world
implementations. From the one hand, simulation-based
studies should be complemented with mathematical
models, that allow to study very large systems and general
algorithm properties, and can favor fair comparisons
among the algorithms. From the other hand, simulation
should be just the first step towards hardware
implementations. Experiments with real testbeds force the
experimenter to face a wide set of problems and
challenges that can hardly be replicated in simulation.
They strongly believe that they will witness a large
diffusion of SI-based solutions for real-world WSNs once
SI researchers will commit themselves to the use of sound
experimental methodologies, and will carry out studies
integrating mathematical modeling, simulation, and real-
world testing.
David A Maltz. et.al [1] presented their work in
May, 2001 on protocols which operate in an on-demand
fashion and that they must carefully limits the number of
nodes required to react to a given topology change in the
network, such routing protocol is used in ad hoc network
which must automatically adjust to the environments that
can vary between the extremes of high mobility with low
bandwidth, and low mobility with high bandwidth. The
author incorporate above two principles in a routing
protocol called dynamic source routing (DSR). Due to his
proposed work, protocol adapts quickly to routing changes
when node movement is frequent, yet requires little or no
overhead during periods in which node moves less
frequently. The work proves the practicality of the DSR
protocol through performance results collected from a full-
scale 8 node test bed, and it demonstrates several
methodologies for experimenting with protocols and
applications in an ad hoc network environment, including
the emulation of ad hoc networks.
Shaik Sahil Babu et al [3] introduced a new
algorithm in their article in august, 2011 for the formation
of trustworthy route from source node to sink node for
secure routing of messages in wireless sensor networks.
This algorithm process the information given by the Trust
dependent Link State Routing. Direct Trust dependent
Link State Routing Protocol based on Geometric Mean
(GM) of the QoS characteristics, which allow the trusted
nodes only to participate in the routing. Execution of this
algorithm at any node, gives different trusted routes to the
BS with different route trusts by filtering the un-trusted
nodes on the basis of trust metrics levels. The source node
selects the best trustworthy route among many trusted
routes given by the neighbor nodes based on neighbor
node trust levels and the route trust levels of different
routes given by them. The newly formed trustworthy route
from source node to sink will be the best trustworthy route
without considering the malicious nodes.
S.Manju Priya and Dr. S.Karthikeyan [4]
presented a research paper in international journal in
March 2012 in which their main focus is to proposed a
novel way by using clustered multipath routing to improve
the lifespan of sensor network. Authors consider energy
saving and lifetime maximization as a significant
challenge in field of wireless sensor network. To increase
the energy of the nodes it is necessary to implement
energy routing algorithm.
Jamal N. Al-Karaki et.al [5] presented a survey of
the state-of-the-art-routing techniques in WSNs. They
proposed a research paper in December 2004, which

3. ICRTEDC-2014 42
outlines the design challenges for routing protocols in
WSNs followed by a comprehensive survey of different
routing techniques. Author studies the design tradeoff
between energy and communication overhead saving in
energy routing paradigm. Authors also enlighten the
advantages and performance issues of each routing
technique.
Al-Sakib Khan Pathan et al [6] proposed a paper
in Feb.20-22, 2006 to investigate the security related
issues and challenges in wireless sensor networks. They
identify the security threats, review proposed security
mechanisms for wireless sensor networks. They also
discussed the holistic view of security in wireless sensor
networks. Ensuring holistic security in wireless sensor
networks is a major research issue. Many of the today
proposed security schemes are based on specific security
models. In future though security mechanism become well
established for each individual layer, combining all the
mechanism together for making them work in
collaboration with each other will incur a hard research
challenge.
Tanveer Zia and Albert Zomaya [7] proposed a
research paper to document all the known security issues
in wireless sensor network and have provided the research
direction towards countermeasures against the threats
posed by these issues. Current research in sensor network,
security is mostly built on a trusted environment; however,
there are several research challenges remain answered. In
this paper authors discussed threat models and unique
security issues faced by wireless sensor networks. Based
on observation they motivate the need of a security
framework to provide countermeasures against attacks in
wireless sensor networks.
3. ROUTING IN WSN
Wireless sensor networks are the network consisting of
spatially distributed self ruled (autonomous) devices using
sensors to monitor physical or environmental conditions.
In simple words those networks in which communication
is carried out through a wireless channel are Wireless
Sensor Networks. These networks are highly distributed
networks of small wireless nodes, monitors the
environment or system by measuring physical parameters
such as temperature, pressure. A network consists of
numbers of nodes with one as a source and one as a
destination. In a wide area the number of nodes is not
specified.
Here the concentration point is neither routing nor
transmission but deployment which means to distribute
systematically or strategically. In Wireless sensor
networks this arrangement method is called as sensor take
battle station.
These wireless sensor network’s faces numbers of
following problems at the time of communication.
 Issue regarding deployment
 Issue regarding distance
 Issue regarding energy consumption
 Issue regarding coverage area
3.1 Bacteria Foraging Optimization (BFO) in Wireless
Sensor Netwoks
Evolutionary algorithms are stochastic search methods that
mimic the metaphor of natural biological evolution.
Evolutionary algorithms operate on a population of
potential solutions applying the principle of survival of the
fittest to produce better and better approximations to a
solution. At each generation, a new set of approximations
is created by the process of selecting individuals according
to their level of fitness in the problem domain and
breeding them together using operators borrowed from
natural genetics. This process leads to the evolution of
populations of individuals that are better suited to their
environment than the individuals that they were created
from, just as in natural adaptation [8].
3.2 Principle of Evolutionary Algorithms
Evolutionary algorithms model natural processes, such
as selection, recombination, mutation, migration, locality
and neighborhood. Evolutionary algorithms work on
populations of individuals instead of single solutions. In
this way the search is performed in a parallel manner. At
the beginning of the computation a number of individuals
(the population) are randomly initialized. The objective
function is then evaluated for these individuals. The
first/initial generation is produced. If the optimization
criteria are not met the creation of a new generation starts.
Individuals are selected according to their fitness for the
production of offspring. Parents are recombined to
produce offspring. All offspring will be mutated with a
certain probability. The fitness of the offspring is then
computed. The offspring are inserted into the population
replacing the parents, producing a new generation. This
cycle is performed until the optimization criteria are
reached. Such a single population evolutionary algorithm
is powerful and performs well on a wide variety of
problems. However, better results can be obtained by
introducing multiple subpopulations [8]. Every
subpopulation evolves over a few generations isolated
(like the single population evolutionary algorithm) before
one or more individuals are exchanged between the
subpopulation. The multi-population evolutionary
algorithm models the evolution of a species in a way more
similar to nature than the single population evolutionary
algorithm.
4. CONCLUSION
Although sensor network provide great applications and
meet all the requirements of today’s network technology;
there are still some issues that modern sensor technology
is facing which need to be overcome in existing
technology. First section covers basics of wireless sensor
network, including its characteristics, advantages and
applications. Second conclude about earlier work done in
related field. It is concluded that in wireless sensor
networks we should focused our research to Optimum
route distance between nodes and sensors; increase in
Sensor Coverage and total energy dissipation.
REFERENCE
1. David A. Maltz, “On-Demand Routing in Multi-hop
Wireless Mobile Ad Hoc Networks”,Ph.D thesis, School of
Computer Science, Carnegie Mellon University, Pittsburgh,
PA 15213, May 2001.
2. Muhammad Saleema, Gianni A. Di Caro and Muddassar
Farooqc, “Swarm intelligence based routing protocol for
wireless sensor networks: Survey and future directions”,
Information Sciences 181 (2011) 4597–4624, ELSEVIER,
doi:10.1016/j.ins.2010.07.005, 2010.
3. Shaik Sahil Babu, Arnab Raha and Mrinal Kanti Naskar,
“Trustworthy Route formation Algorithm for WSNs”,
International Journal of Computer Applications (0975 –

4. 43 ICRTEDC -2014
8887), Volume 27– No.5, August
2011,http://www.ijcaonline.org/volume27/number5/pxc3874
497.pdf
4. S.Manju Priya and Dr. S. Karthikeyan, “An Efficient
Clustered Multipath Routing to improve lifespan in WSN”,
IJCSI International Journal of Computer Science Issues,
ISSN (Online): 1694-0814, Vol. 9, Issue 2, No 2, March
2012.
5. Al-Karaki, J.N. and Kamal, A.E, “Routing techniques in
wireless sensor networks: a survey”, Wireless
Communications, IEEE ,Volume:11 , Issue: 6 , pp.6-28,
2004.
6. Al-Sakib Khan Pathan, Hyung-Woo Lee and Choong Seon9.
Hong, “Security in Wireless Sensor Networks: Issues and
Challenges”, ICACT2006, ISBN 89-5519-129-4, pp.1043-
1048, Feb. 20-22, 2006.
7. Tanveer Zia and Albert Zomaya, “Security Issues in
Wireless Sensor Networks”, Proceeding of the International
Conference on Systems and Networks, ICSNC ’06, IEEE
Computer Society, pp.40.
8. Caichang Ding, Wenxiu Peng, Lu Lu and Yuanchao Liu,
“Population Based Learning Algorithm to Solving
Permutation Scheduling Problems”, A Book On Advanced
Research on computer science and information Engineering.