1

CHAPTER 1
INTRODUCTION

1.1 Wireless Sensor Networks

1.1.1 Objective

Sensor networks provide endless opportunities, but at the same time pose formidable
challenges, such as the fact that energy is a scarce and usually non-renewable resource. However,
recent advances in low power VLSI, embedded computing, communication hardware, and in
general, the convergence of computing and communications, are making this emerging technology
a reality. Likewise, advances in nanotechnology and Micro Electro-Mechanical Systems (MEMS)
are pushing toward networks of tiny distributed sensors and actuators.

1.1.2 Basic Concepts

Smart environments represent the next evolutionary development step in building, utilities,
industrial, home, shipboard, and transportation systems automation. Like any sentient organism,
the smart environment relies first and foremost on sensory data from the real world. Sensory data
comes from multiple sensors of different modalities in distributed locations. The smart
environment needs information about its surroundings as well as about its internal workings; this is
captured in biological systems by the distinction between exteroceptors and proprioceptors. The
challenges in the hierarchy of: detecting the relevant quantities, monitoring and collecting the data,
assessing and evaluating the information, formulating meaningful user displays, and performing
decision-making and alarm functions are enormous.

The information needed by smart environments is provided by Distributed Wireless Sensor

Networks, which are responsible for sensing as well as for the first stages of the processing
hierarchy. The importance of sensor networks is highlighted by the number of recent funding
initiatives, including the DARPA SENSIT program, military programs, and NSF Program
Announcements. The study of wireless sensor networks is challenging in that it requires an
enormous breadth of knowledge from an enormous variety of disciplines. In this chapter we outline
 2

communication networks, wireless sensor networks and smart sensors, physical transduction
principles, commercially available wireless sensor systems, self-organization, signal processing
and decision-making, and finally some concepts for home automation.

Routing is process of moving packets from source network to a destination network in

internetworking devices. Routing protocols use a routing algorithm which is a mathematical
formula to forward the packet to its destination. The routing algorithm varies from one routing
algorithm. In wireless network two types of communication paradigm exists, which use different
routing algorithm due to the nature of it use, infrastructure uses the traditional wired routing and in
mobile ad hoc wireless network nodes are connected by wireless link through physical layer and
data link layer, thus the network topology may keep changing randomly due to the movement of
nodes. Routing protocols for ad hoc network must be able to perform effective and efficient
mobility as they are dynamic and no centralized infrastructure present. Many routing protocols
have been proposed in MANET.

Routing methods can be fixed (i.e. pre-planned), adaptive, centralized, distributed,

broadcast, etc. Perhaps the simplest routing scheme is the token ring. Here, a simple topology and a
straightforward fixed protocol result in very good reliability and precomputable QoS. A token
passes continuously around a ring topology. When a node desires to transmit, it captures the token
and attaches the message. As the token passes, the destination reads the header, and captures the
message. In some schemes, it attaches a ‘message received’ signal to the token, which is then
received by the original source node. Then, the token is released and can accept further messages.
The token ring is a completely decentralized scheme that effectively uses TDMA. Though this
scheme is very reliable, one can see that it results in a waste of network capacity. The token must
pass once around the ring for each message. Therefore, there are various modifications of this
scheme, including using several tokens, etc.
 3

Fig 1.1 Wireless Sensor Networks

The figure generally consists of a data acquisition network and a data distribution network,
controlled and monitored by a management center. The plethora of available technologies makes
even the selection of components difficult, let alone the design of a consistent, reliable, robust
overall system. The increasing interest in wireless sensor networks can be promptly understood
simply by thinking about what they essentially are: a large number of small sensing self-powered
nodes which gather information or detect special events and communicate in a wireless fashion,
with the end goal of handing their processed data to a base station. Sensing, processing and
communication are three key elements whose combination in one tiny device gives rise to a vast
number of applications.

Using low-power mode for the processor or disabling the radio is generally advantageous,
even though periodically turning a subsystem on and off may be more costly than always keeping
it on. Techniques aimed at reducing the idle mode leakage current in CMOS-based processors are
also noteworthy. Medium Access Control (MAC) solutions have a direct impact on energy
consumption, as some of the primary causes of energy waste are found at the MAC layer:
collisions, control packet overhead and idle listening. Power saving forward error control
techniques is not easy to implement due to the high amount of computing power that they require
and the fact that long packets are normally not practical. Energy-efficient routing should avoid the
loss of a node due to battery depletion. Many proposed protocols tend to minimize energy
consumption on forwarding paths, but if some nodes happen to be located on most forwarding
paths (e.g., close to the base station), their lifetime will be reduced.
 4

1.1.3 Advantages of WSN

 Flexible if there is ad-hoc situation when additional workstation was

required.
 Implementation cost is cheaper than wired network.
 Ideal for the non-reachable places such as across river or mountain or rural
area.
 Ideal for temporary network setups.

1.1.4 Disadvantages of WSN

 Lower speed compared to wired network.

 Less secure because hacker's laptop can act as Access Point.
 More complex to configure than wired network.
 5

1.1.5 Applications of WSN

Possible applications of sensor networks are of interest to the most diverse fields.
Environmental monitoring, warfare, child education, surveillance, micro-surgery, and agriculture
are only a few examplesJust as they can be used to monitor nature, sensor networks can likewise be
used to monitor human behavior. Medical research and healthcare can greatly benefit from sensor
networks: vital sign monitoring and accident recognition are the most natural applications. An
interesting application to civil engineering is the idea of Smart Buildings: wireless sensor and
actuator networks integrated within buildings could allow distributed monitoring and control,
improving living conditions and reducing the energy consumption, for instance by controlling
temperature and air flow. Military applications are plentiful. The network detects the muzzle blast
and the acoustic shock wave that originate from the sound of gunfire. The arrival times of the
acoustic events at different sensor nodes are used to estimate the position of the sniper and send it
to the base station with a special data aggregation and routing service.

Going back to peaceful applications, efforts are underwayatCarnegie Mellon University and
Intel for the design of Iris Net (Internet-scale Resource-Intensive Sensor Network). The network
interface of a PC indeed senses the virtual environment of a LAN or the Internet rather than a
physical environment; with an architecture based on the concept of a distributed database, this
hardware can be orchestrated into a global sensor system that responds to queries from users.
Sensors can be used to capture vital signs from patients in real-time and relay the data to handheld
computers carried by medical personnel, and wearable sensor nodes can store patient data such as
identification, history, and treatments.
 6

Fig.1.1.4. Application of wireless sensor network

Military Scenarios: WSN supports tactical network for military communications and automated
battle eldest.

Rescue Operations: It provides Disaster recovery, means replacement of xed infrastructure

network in case of environmental disaster.

Data Networks: WSN provides support to the net-work for the exchange of data between mobile
devices.

Device Networks: Device Networks supports the wireless connections between various mobile
devices so that they can communicate.

Free Internet Connection Sharing: It also allows us to share the internet with other mobile
devices.

Sensor Network: It consists of devices that have capability of sensing, computation and wireless
networking. Wireless sensor network combines the power of all three of them, like smoke
detectors, electricity, and gas and water meters.
 7

1.1.6 Characteristics of WSN

In ad hoc networks, wireless nodes self-organize into an infrastructure less network with a
dynamic topology. The number of nodes in a typical sensor network is much higher than in a
typical ad hoc network, and dense deployments are often desired to ensure coverage and
connectivity; for these reasons, sensor network hardware must be cheap. Nodes typically have
stringent energy limitations, which make them more failure-prone. They are generally assumed to
be stationary. Sensor networks are the key to gathering the information needed by smart
environments, whether in buildings, utilities, industrial, home, shipboard, transportation systems
automation, or elsewhere. Recent terrorist and guerilla warfare countermeasures require distributed
networks of sensors that can be deployed using, e.g. aircraft, and have self-organizing capabilities.
In such applications, running wires or cabling is usually impractical. A sensor network is required
that is fast and easy to install and maintain. In WSN applications, it is usual to locate nodes close or
inside the observed phenomenon. This concept of network needs new network protocols which
adjust to the new raised requirements. Traditional ad-hoc techniques can not cover those
requirements because they cannot adjust to the design principles of this kind of networks.

 Lifetime

Lifetime is extremely critical for most applications, and its primary limiting factor is the energy
consumption of the nodes, which need to be self-powering.

 Flexibility

Sensor networks should be scalable, and they should be able to dynamically adapt to changes in
node density and topology, like in the case of the self-healing minefields. In surveillance
applications, most nodes may remain quiescent as long as nothing interesting happens.

 Maintenance

The only desired form of maintenance in a sensor network is the complete or partial update of
the program code in the sensor nodes over the wireless channel. All sensor nodes should be
updated, and the restrictions on the size of the new code should be the same as in the case of wired
programming.
 8

 Data Collection
Data collection is related to network connectivity and coverage. An interesting solution is the
use of ubiquitous mobile agents that randomly move around to gather data bridging sensor nodes
and access points, whimsically named data MULEs (Mobile Ubiquitous LAN Extensions) in.

 Communication
Most sensor networks use radio communication, even if alternative solutions are offered by
laser and infrared. Nearly all radio-based platforms use COTS (Commercial Off-The-Shelf)
components
 9

CHAPTER 2
LITERATURE SURVEY

PAPER 1:

Efficient Algorithm for Prolonging Network Lifetime of Wireless Sensor Networks

Md Nafees Rahman, Tsinghua Science 562 and Technology, December 2011, 16(6): 561-568

Abstract: One of the fundamental design challenges in designing a Wireless Sensor Network
(WSN) is to maximize the network lifetime, as each sensor node of the network is equipped with a
limited power battery. To overcome this challenge, different methods were developed in the last
few years using such techniques as network protocols, data fusion algorithms using low power,
energy efficient routing, and locating optimal sink position. This paper focuses on finding the
optimal sink position. Relay nodes are introduced in conjunction with the sensor nodes to mitigate
network geometric deficiencies since in most other approaches the sensor nodes close to the sink
become heavily involved in data forwarding and, thus, their batteries are quickly depleted. A
Particle Swarm Optimization (PSO) based algorithm is used to locate the optimal sink position
with respect to those relay nodes to make the network more energy efficient. The relay nodes
communicate with the sink instead of the sensor nodes. Tests show that this approach can save at
least 40% of the energy and prolong the network lifetime.

Perception from this paper:

This paper presents a simple scheme for improving the network lifetime without compromising any
of the strict requirements of wireless sensor networks. a scheme is proposed where relay nodes are
used to collect data from the sensor nodes to pass them to the sink. We have calculated the required
number of relay nodes to maintain the network connectivity successfully and then investigated
their effect on network lifetime.
 10

PAPER 2:

Sensors Lifetime Enhancement Techniques in WSN

C.Karthik Sendhil Kumar, R.Sukumar- Department of ECE, ISSN: 2249-9555,Vol. 3, No.2, April
2013

Abstract—Advances in wireless communication made it possible to develop wireless sensor

networks (WSN) consisting of small devices, which collect information by cooperating with each
other. These small sensing devices are called nodes and consist of CPU (for data processing),
memory (for data storage), battery (for energy) and transceiver (for receiving and sending signals
or data from one node to another). The size of each sensor node varies with applications. When
sufficient number of nodes dies, the network may not be able to perform its designated task. Thus
the life time of a network is an important characteristic of a sensor network and it is tied up with
the life time of a node.

Perception from this paper:

This paper presents a survey of different techniques to enhance the lifetime of the sensors in WSN
and identifies future trends in designing energy efficient WSN protocols.In this paper; we made an
attempt to summarize the results of major contributions of various researchers in the field of energy
efficiency in wireless sensor networks. These energy saving methods are basically used to increase
the life time of sensor nodes in wireless sensor networks. We have also stressed the importance of
design issues of Wireless Sensors Networks such as power consumption, hardware constraints,
environment, and transmission media. There are still many issues to be resolved around energy
management.
 11

PAPER 3:

Efficient Techniques for Prolonging Sensors Lifetime of Wireless Sensor Networks.

Sunil Kumar, Jaswinder Kaur, International Journal of P2P Network Trends and Technology

Abstract— Sensor nodes are limited in power, computational capacities, and memory. So the
routing protocols used in ad hoc networks usually cannot be used in sensor networks even different
routing mechanisms are used in sensor networks. Since energy awareness is an essential design
issue, many routing protocols have been proposed for WSNs based on network structure and
protocol operation. Furthermore, these protocols can be classified into multipath-base three
categories, namely, proactive, reactive, and hybrid protocols.

Perception from this paper:

In this paper we present a survey of the state-of-the-art routing techniques for WSNs from the
recent work; highlighting their objectives, features, complexity, etc. Since energy awareness is an
essential design issue, many routing protocols have been proposed for WSN based on network
structure and protocol operation. Based on network structure routing protocols are divided into flat,
hierarchical, and location based network, while based on protocol operation routing protocols are
divided into coherent, negotiation, multipath, QoS and query-based.
 12

PAPER 4:

Achieving Source Location Privacy and Network Lifetime Maximization through Tree-Based
Diversionary Routing in Wireless Sensor Networks

Jun Long1, Mianxiong Dong2, Kaoru Ota3, and Anfeng Liu1, IEEE Acess, Volume 2, 2014

Abstract—Wireless sensor networks (WSNs) have been proliferating due to their wide applications
in both military and commercial use. However, one critical challenge to WSNs implementation is
source location privacy. In this paper, we propose a novel tree-based diversionary routing scheme
for preserving source location privacy using hide and seek strategy to create diversionary or decoy
routes along the path to the sink from the real source, where the end of each diversionary route is a
decoy (fake source node), which periodically emits fake events. Meanwhile, the proposed scheme
is able to maximize the network lifetime of WSNs.

Perception from this paper:

The main idea is that the lifetime of WSNs depends on the nodes with high energy consumption or
hotspot, and then the proposed scheme minimizes energy consumption in hotspot and creates
redundancy diversionary routes in non hotspot regions with abundant energy. Hence, it achieves
not only privacy preservation, but also network lifetime maximization. Furthermore, we
systematically analyze the energy consumption in WSNs, and provide guidance on the number of
diversionary routes, which can be created in different regions away from the sink.
 13

PAPER 5:

HEAD: A Hybrid Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks

GUO Jianli, LIU Hongwei Department of Computer Science and Technology, Harbin Institute of
Technology

Abstract—Mobile ad hoc networks rely on the cooperation of nodes for routing and forwarding.
However, it may not be advantageous for individual nodes to cooperate. In order to make the
mobile ad hoc network more robust, we propose a scheme called HEAD (a hybrid mechanism to
enforce node cooperation in mobile ad hoc networks) to make the misbehaviour unattractive.
HEAD is an improvement to OCEAN (observation- based cooperation enforcement in ad hoc
networks). It employs only first hand information and works on the top of DSR (dynamic source
routing) protocol. By interacting with the DSR, HEAD can detect the misbehavior nodes in the
packet forwarding process and isolate them in the route discovery process. In order to detect the
misbehavior nodes quickly, HEAD introduces the warning message.

Perception from this paper:

In this paper, we also classify the misbehavior nodes into three types: malicious nodes, misleading
nodes, and selfish nodes. They all can be detected by HEAD, and isolated from the network. In this
paper we give a detail description on HEAD. It deletes the avoid list field in the RREQ message,
keeping the DSR protocol unmodified. By introducing the reputation table and warning message,
HEAD can detect misbehaving nodes quickly.
 14

PAPER 6:

A Study on Energy Efficient Routing Protocols in Wireless Sensor Networks

Monica R Mundada, Savan Kiran,International Journal Of Distributed And Parallel Systems

(IJDPS)

Abstract- Traditional wireless communication networks like Mobile Ad hoc Networks (MANET)
differs from WSN. WSN have unique characteristics such as denser level of node deployment,
higher unreliability of sensor nodes and severe energy, computation and storage constraints which
present many challenges in the development and application of WSN.WSN has a design trade-off
between energy and communication overhead which forms the nerve center of the routing
techniques.

Perception from this paper:

In this paper we present a survey of state-of-the-art routing techniques in WSNs under all the three
categories. We epitomize these routing techniques and bring out the advantages and disadvantages
followed by their application domain. Regardless, the sensor nodes can also be grouped for
efficient data dissemination to the sink. Hierarchical routing protocols adopt the clustering
approach by grouping sensor nodes. This approach is highly scalable and thus used in a number of
applications.
 15

PAPER 7:

Power Conservation and Security Enhancement in Wireless Sensor Networks: A Priority

Based Approach

P. Sivakumar, K. Amirthavalli and M. Senthil, International Journal of Distributed Sensor

Networks

Abstract-In wireless sensor networks (WSN), two major challenges are how to conserve the battery
power and a series of security challenges. The power conservation and security are important for
reliability and longevity of a WSN. This paper proposes an approach called “priority based
approach (PBA)” which empowers the node to choose the most important packet based on the
priority and the current energy status of the forwarding node. Thus we can minimize the average
delay and energy spent and maximizes the throughput and packet delivery ratio (PDR) when
compared to game theory approach.

Perception from this paper:

In this paper, we proposed an approach called “priority based approach (PBA)” and established a
relationship between packet priority and current energy status of a sensor node which decides the
most urgent message to forward first according to its priority and also its energy level. By giving
less priority to the attacker node, we then improved the security of a network. Also, the proposed
priority based approach emphasizes reducing the workload on some nodes depending upon the
energy level and gives time to refill their energy. Therefore PBA ensures a real time
communication in WSN with minimizing the delay and energy spent and maximizing the PDR and
throughput which further maximizes the lifetime of the network.
 16

CHAPTER 3
SYSTEM ANALYSIS

3.1 Existing system

Existing method uses EESSDA scheme for secure data aggregation in WSNs. Different
from general data aggregation that preserves data privacy by encryption technology, EESSDA
achieves data privacy through secure channel. Because EESSDA does not need it saves much
energy for encryption/decryption operations and reduces the time of data processing, and
consequently leads to improvement of aggregation accuracy. In existing, EESDA method data
aggregation done by aggregation nodes, the sink used to communicate with leaf nodes through
aggregate nodes. ---> The agg. Nodes need to build with more memory unit, apart from leaf nodes.
It performs the slicing and aggregation at agg. Nodes, it adds nodes more traffic in the network and
consumes power. In case if aggregation node tends to failure, the leaf nodes attached along with it
could not be communicated to sink.

Fig.3.1.Existing Process Method

 17

3.2 .Proposed system

In existing method when there is a long time packet transmission is existent between two
nodes, these cause the packet travel through set of nodes and finally make energy drain only on
those set of nodes and causes them to run out of energy at one time and no longer could they exist
in network. We propose dynamic source routing, which is on demand protocol. So it consumes
bandwidth less than proactive protocols. Since it is reactive protocol the data aggregation is not
required.The intermediate nodes does not necessary to have more memory units, since the
intermediate nodes only does forwarding and does not store the data. i.e., only routes its inlet data
to outlet route.The residual energy prediction is proposed among availability of nodes, the high
power nodes are predicted and alternate path will be chosen .Instead of nodes drying along
particular path all availability of nodes utilized to derive uniform power utilization by cockroach
network.

Fig: 3.2. Flowchart of Proposed Method

 18

3.3 Cockroach network

In Cockroach network, shown in Fig. 5.2.4 Suppose all nodes could controls more than two unit-
capacity edges, that is in inlet or outlet a node could receive data from more than two nodes and
could aggregate or each node could send multiple packets of same message or small quantity of
large packet into small and send it to more than two unit capacity nodes. The actual capacity of the
Cockroach network with one traitor node is 2, if the node is designed to have two unit capacities. If
it exceeds the limit any node can aware of excess of node and misbehavior in its coverage and
thereby traitor could be identified. Sometimes the concept of implementing packet splitting might
cause a huge worry by Node-based attacks and edge-based attacks. But in case of splitting under
cockroach network with predefined edge capacity can do better and get rid of this node based
attack.

Fig: 3.3 Cockroach Network

Cockroach Network follows min-cut algorithm. i.e., every node aware of its neighbors and also
aware of its own and its neighbors’ edge capacity. If the adversary may control any z unit-capacity
edges, it is clear that it should always take over edges on the minimum cut of the network.
However, if the adversary may control any s nodes, it is not so obvious: it may have to choose
between proximity to the min-cut and the number of output edges. For example, in the Cockroach
network, node 4 has only one output edge, but it is on the min-cut (which divides nodes S, 1, 2, 3,
4, 5 from D); node 1 has two output edges, so apparently more power, but it is one step removed
from the min-cut, and therefore its impact may be diminished. This uncertainty about where a
network is most vulnerable seems to make the problem hard. Indeed, we find that many standard
network coding techniques—in particular, linear codes over a finite field—fail to achieve capacity.
Since all intermediate nodes will be known to all Source and destination knows and edge capacity.
Source and destination nodes know the current message sequence number and all other messages
intended for it. So successfully destination node can recover all packets intended for it. In case
 19

even some of the packets lost also could be informed to source node through their sequence
number. There is no acknowledgement for particular packet which is lost. So source can identify
and resend the part of packet which is not received.
Uniform energy consumption has approach two approaches in communication patterns. The first is
one-to-many, where the base station sends control or management packets to each of the devices in
the system. This mode requires system-wide broadcasting. The second is many-to-one, where each
device transmits its packets up the tree to the gateway. This mode is sometimes called converge
casting. Transforming tree-based LLNs to work within the Iota requires the redesign and
reimplementation of a number of basic Internet protocols. In cockroach network each node varies
its size from certain low level to maximum packet size depends on the number of nodes available
between source and destination.
 20

CHAPTER 4
METHODOLOGY

The primary design goal of WSN is to acquire the monitored data from target area and
deliver it to base station for its evaluation, while trying to prolong the lifetime of the network. The
design of routing protocols in WSN is influenced by many challenging factors and these factors
must be considered to achieve efficient communication in WSN. In the following section, we
briefly discuss some of these design issues that affect routing process in WSN.

4.1 Data Aggregation:

Data gathering involves systematically collecting the sensed data from multiple sensors
and transmitting the data to the base station for further processing. Such suppression (eliminating
duplicates), min, max and average [4]. This technique has been used to achieve energy efficiency
and traffic optimization in a number of routing protocols [3] [5]. In some network architectures, all
aggregation functions are assigned to more powerful and specialized nodes [6]. Signal processing
methods can also be used for data aggregation. In that case, it is referred to as data fusion where a
node is capable of producing a more accurate output signal by using some techniques such as beam
forming to combine the incoming signals and reducing the noise in these signals [4].

Fig.4.1.In-network processing

4.2 SPAN­DSR:
Another improvement to Span-DSR would involve a fast handoff of routes between a
withdrawn coordinator and its replacement, eliminating the latency of routing through a sleeping
node and waiting for a route error to propagate to the source. There are many issues with this
approach, including the fact that a new coordinator may not be able to take over all routes
 21

(connectivity may have been restored by two announcing coordinators instead of one). Another
simple way to avoid the latency of routing through a withdrawn coordinator would be to make the
coordinator stay up until all outstanding packets are cleared and a new route has been found.

4.3 HYBRID ENERGY-EFFICIENCY DISTRIBUTED CLUSTERING (HEED):

The extended version of the basic scheme of LEACH is called HEED [10, 11] in which
power balancing is achieved by using residual energy and node degree as a metric for cluster
selection. The four most important primary goals of HEED are listed below:
1. Prolonging network lifetime by distributing energy consumption.
2. Terminating the clustering process within a constant number of iterations.
3. Minimizing control overhead.
4. producing well distributed CHs and compact clusters. Since CHs are selected randomly in
LEACH, which increases the rate of death of nodes. But it is not possible in HEED, so it improves
network lifetime over LEACH.

4.4 Approaches on Improving the Lifetime of a WSN:

We have introduced relay nodes in conjunction with the PSO based algorithm. These relay
nodes reduce the burden of the data traffic on the sensor nodes, especially of those, which are close
to the sink, by carrying the data traffic to the sink. Hence the energy consumptions of the sensor
nodes decrease and the lifespan increases. The optimal location of the sink with respect to those
relay nodes is found by using the PSO based algorithm [2].

4.5 Station controlled Dynamic Clustering Protocol:

Cluster based routing has several merits like minimized control messages, re-usability of
bandwidth and enhanced power control. Those technique reduces the energy consumption but with
several disadvantages like lack of QoS, inefficient transmission.

4.6 Optimized Lifetime Enhancement Scheme for Data Gathering:

Thus energy difference between the various nodes increases with time resulting in degraded
network performance. The LEACH and PEGASIS schemes which provided elegant solutions to the
problem suffer basic drawbacks due to randomization of cluster heads and greedy chain formation
respectively. In this paper, we propose an Optimized Lifetime Enhancement (OLE) Scheme which
shows enhanced performance over these schemes. OLE increases the network performance by
 22

ensuring a sub-optimal energy dissipation of the individual nodes despite their random deployment
[3].

4.7 Method of Reducing Power Consumption:

In wireless sensor network, power issue is one of the biggest challenges i.e., limited source
of power which is also hard to replace or recharge. Optimized path destined for a sink node is set
using a common channel in which first and second nodes use a CSMA scheme. Node of the parent
node and the second node is one of child nodes of the first node.

Fig .4.7. Power Consumption of WSN in Various States Sensor

 23

CHAPTER 5

ALGORITHMS

5.1 Routing Algorithms

There are many ways to classify the MANET routing protocols, depending on how the
protocols handle the packet to deliver from source to destination. But Routing protocols are
broadly classified into three types such as Proactive, Reactive and Hybrid protocols.

Fig.5.1. Classification of routing protocols

5.1.1. Reactive Protocols

These types of protocols are also called as On Demand Routing Protocols where the routes are not
predefined for routing. A Source node calls for the route discovery phase to determine a new route
whenever a transmission is neede
d. This route discovery mechanism is based on flooding algorithm which employs on the technique
that a node just broadcasts the packet to all of its neighbors and intermediate nodes just forward
that packet to their neighbors. This is a repetitive technique until it reaches the destination.
Reactive techniques have smaller routing overheads but higher latency.

Example Protocols: DSR, AODV

 24

5.2. Overview of Routing Protocols

In this section, a brief overview of the routing operations performed by the familiar protocols
DSDV, AODV and DSR are discussed.
5.2.1 Dynamic Source Routing (DSR) Protocol
The Dynamic Source Routing (DSR) is a reactive unicast routing protocol that utilizes source
routing algorithm [13]. In DSR, each node uses cache technology to maintain route information of
all the nodes. There are two major phases in DSR such as:
• Route discovery
• Route maintenance
When a source node wants to send a packet, it first consults its route cache. If the required route is
available, the source node sends the packet along the path. Otherwise, the source node initiates a
route discovery process by broadcasting route request packets. Receiving a route request packet, a
node checks its route cache. If the node doesn’t have routing information for the requested
destination, it appends its own address to the route record field of the route request packet. Then,
the request packet is forwarded to its neighbors. If the route request packet reaches the destination
or an intermediate node has routing information to the destination, a route reply packet is
generated. When the route reply packet is generated by the destination, it comprises addresses of
nodes that have been traversed by the route request packet. Otherwise, the route reply packet
comprises the addresses of nodes the route request packet has traversed concatenated with the route
in the intermediate node’s route cache. Whenever the data link layer detects a link disconnection, a
ROUTE_ERROR packet is sent backward to the source in order to maintain the route information.
After receiving the ROUTE_ERROR packet, the source node initiates another route discovery
operation. Additionally, all routes containing the broken link should be removed from the route
caches of the immediate nodes when the ROUTE_ERROR packet is transmitted to the source. The
advantage of this protocol is reduction of route discovery control overheads with the use of route
cache and the disadvantage is the increasing size of packet header with route length due to source
routing.
 25

CHAPTER 6

INTRODUCTION TO SIMULATION

6.1 General

Simulation has become a very powerful tool for industrial application as well as in
academics, nowadays. It is now essential for an electrical engineer to understand the concept of
simulation to study the system or circuit behavior without damaging it .The tools for doing the
simulation in various fields are available in the market for engineering professionals. Many
industries are spending a considerable amount of time and money in doing simulation before
manufacturing their product. In most of the research and development (R&D) work, the simulation
plays a very important role. Without simulation it is quiet impossible to proceed further. It should
be noted that in electronics, computer simulation and a proof of concept hardware prototype in the
laboratory are complimentary to each other. However computer simulation must not be considered
as a substitute for hardware prototype. The objective of this chapter is to describe simulation of an
acknowledgement based approach for detecting routing misbehavior occurring in MANETS.

6.2 The Role of Simulation

The behavior of the network and the various applications and services it supports can then
be observed in a test lab; various attributes of the environment can also be modified in a controlled
manner to assess how the network would behave under different conditions. While a simulation
program is used in conjunction with live applications and services in order to observe end-to-end
performance to the user desktop. Network simulators serve a variety of needs. Compared to the
cost and time involved in setting up an entire test bed containing multiple networked computers,
routers and data links, network simulators are relatively fast and inexpensive. They allow
engineers, researchers to test scenarios that might be particularly difficult or expensive to emulate
using real hardware - for instance, simulating a scenario with several nodes or experimenting with
a new protocol in the network. Network simulators are particularly useful in allowing researchers
to test new networking protocols or changes to existing protocols in a controlled and reproducible
environment. A typical network simulator encompasses a wide range of networking technologies
and can help the users to build complex networks from basic building blocks such as a variety of
 26

nodes and links. With the help of simulators, one can design hierarchical networks using various
types of nodes like computers, hubs, bridges, routers, switches, links, mobile units etc.

There are a wide variety of network simulators, ranging from the very simple to the very
complex. Minimally, a network simulator must enable a user to represent a network topology,
specifying the nodes on the network, the links between those nodes and the traffic between the
nodes. More complicated systems may allow the user to specify everything about the protocols
used to handle traffic in a network. Graphical applications allow users to easily visualize the
workings of their simulated environment. Text-based applications may provide a less intuitive
interface, but may permit more advanced forms of customization.

6.3 Software Tools and Methodology:

6.3.1 Network Simulator 2

NS (Network simulator) is a name for series of discrete event network simulators,

specifically ns-1, ns-2 and ns-3. All of them are discrete-event network simulator, primarily used
in research and teaching. Ns-3 is free software, publically available under the GNU GPLv2 license
for research, development, and use. The goal of the ns-3 project is to create an open simulation
environment for networking research that will be preferred inside the research community; this
mainly means two things:

 It should be aligned with the simulation needs of modern networking research

 It should encourage community contribution, peer review, and validation of the software.

Since the process of creation of a network simulator that contains a sufficient number of high-
quality validated, tested and actively maintained models requires a lot of work, ns-3 project spreads
this workload over a large community of users and developers. Network Simulator 2 Consists of

 C++: Internal mechanism

 OTcl: User interface
 TCL: Connecting C++ to OTcl
 27

Fig.6.1 Network Simulator-2 Architecture

6.3.2. Network Animator

Nam is a Tcl/TK based animation tool for viewing network simulation traces and real
world packet traces. It supports topology layout, packet level animation, and various data
inspection tools. Nam began at LBL. It has evolved substantially over the past few years. The nam
development effort was an ongoing collaboration with the VINT project. Currently, it is being
developed as an open source project hosted at Source forge.
 28

Fig 6.2 Network Animator

6.3.3 Xgraph
 One part of the ns-allinone package is 'xgraph‘
 A plotting program which can be used to create graphic representations of simulation
results.
Xgraph is an X-Windows application that includes:
 interactive plotting and graphing
 animation and derivatives
 portability and bug fixes
 29

CHAPTER 7
DEVELOPMENT OF PROJECT

7.1 Creation of nodes

 First to create new nodes in network animator.
 Fix node number and data rate values.
 Create tcl file to set the initial setting as the same time whole process running process.
 In tcl script set channel, propagation, physical or wireless.
 To set MAC layer, antenna size, queue length.
 Initial co-ordination values are set.
 Set all co-ordinates value like X, Y and Z.
 Set the value for each and every node.
 Create TCP connection and connect to agent by using Attach command.
 Sink TCP connection with new agent.
 Create FTP connection and connect to null agent.
 Set the initial date rate value for FTP
 Attach the FTP connection with null agent by using Attach command.
 Connect the FTP connection.
 After packet transmission complete stop the wireless connection.
 Stop the network simulator and exit the main program
 Run the network simulator.
 It create trace file.
 Trace file is fully report format details.
 It explains when the nodes sent the packet with starting and ending time.
 Perl language is used to represent the report in text format
 It is predefined by research oriented people create the format modules to follow to run
that file.
 30

7.2 Software and hardware requirement

7.2.1 Software Used:

Simulator : NS2
Front End : OTCL
Back End : C++

7.2.2 Hardware Used:

Processor : P - IV (Dual Core 3.0 GHz Processor)

Hard Disk : 300 GB
RAM : 2 GB
 31

7.3 Test Data and Output

The simulation results and performance comparison of the three routing protocols is
analyzed. Comparison of DSR, EESSDA and EADSR based on metrics such as throughput, control
overhead, packet delivery ratio and average end-to-end delay by using the NS-2 simulator.
Simulations were done by varying the number of nodes and keeping speed of the node is constant
(20ms) then varying the speed of the nodes keeping the number of the nodes is constant (40nodes).
The number of nodes for each comparison was also varied from 30 to 40 to 50 to identify the
result. In all scenarios the Comparison were based on performance metric: Network latency,
Network Lifetime, End to End Delay and Network Traffic.

Initial energy – 60
Network traffic – 300 Bps

DSR EESSDA EADSR UECDSR

No of
Nodes
Network Network Network Network Network Network Network Network
Latency Lifetime Latency Lifetime Latency Lifetime Latency Lifetime
(in ms) (in ms) (in ms) (in ms)

10 6.734 35 5.52 39 3.1065 42 2.166 48

20 13.55 30 13.42 34 6.213 39 5.322 45

30 28.51 24 27.6 29 12.49 35 11.41 40

40 57.02 19 55.1 24 29.8 31 24.78 36

Table.7.1. Simulation parameter values by varying number of nodes

 32

7.2.Network Latency of DSR,EADSR and UEDSR

Fig.7.3 Network Latency of DSR,EESSDA ,EADSR and UEDSR

 33

Fig.7.4 Network Time of DSR, EESSDA AND EADSR

 34

CHAPTER 8
CONCLUSION AND DISCUSSION
CONCLUSION
In this paper, a group nodes involved in cockroach network set is active for part of time and idle
for rest. Based on the no of hops and distance the power level is calculated to enhance the life time
of nodes, where all nodes floods its routing table to all its neighbors using dynamic source routing.
This approach sniffs the energy drain at each nodes and isolate those nodes from packet
transmission when its energy drain beyond certain level, so that keep the entire network to live.
Instead of sending bulk of packets, the proposed method used to split the packets along cockroach
network and each packet would take separate best energy path in their route. Hence no specific
path gets drain soon.

DISCUSSION
EESSDA does not need it saves much energy for encryption/decryption operations and reduces the
time of data processing, and consequently leads to improvement of aggregation accuracy. In DSR
residual energy prediction is proposed among availability of nodes, the high power nodes are
predicted and alternate path will be chosen. So it consumes bandwidth less than proactive
protocols. Cockroach network have uniform capacity.
 35

CHAPTER 9
APPENDICES

9.1 APPENDIX 1
A.1.1 SAMPLE CODEING IN WIRELESS
# Define options
set val(chan) Channel/WirelessChannel ;# channel type
set val(prop) Propagation/TwoRayGround ;# radio-propagation model
set val(netif) Phy/WirelessPhy ;# network interface type
set val(mac) Mac/802_11 ;# MAC type
set val(ifq) Queue/DropTail/PriQueue ;# interface queue type
set val(ll) LL ;# link layer type
set val(ant) Antenna/OmniAntenna ;# antenna model
set val(ifqlen) 50 ;# max packet in ifq
set val(nn) 50 ;# number of mobilenodes
set val(rp) DSDV ;# routing protocol
set val(x) 1000 ;# X dimension of topography
set val(y) 1000 ;# Y dimension of topography
set val(stop) 150 ;# time of simulation end

set ns [new Simulator]

set tracefd [open simple.tr w]
set namtrace [open simwrls.nam w]

$ns trace-all $tracefd

$ns namtrace-all-wireless $namtrace $val(x) $val(y)

# set up topography object

set topo [new Topography]

$topo load_flatgrid $val(x) $val(y)

create-god $val(nn)

# configure the nodes

$ns node-config -adhocRouting $val(rp) \
-llType $val(ll) \
-macType $val(mac) \
-ifqType $val(ifq) \
-ifqLen $val(ifqlen) \
-antType $val(ant) \
-propType $val(prop) \
-phyType $val(netif) \
-channelType $val(chan) \
-topoInstance $topo \
 36

-agentTrace ON \
-routerTrace ON \
-macTrace OFF \
-movementTrace ON

for {set i 0} {$i < $val(nn) } { incr i } {

set n($i) [$ns node]
}

# Provide initial location of mobilenodes

$n(0) set X_ 347.0
$n(0) set Y_ 3.0
$n(0) set Z_ 0.0

$n(1) set X_ 345.0

$n(1) set Y_ 36.0
$n(1) set Z_ 0.0

$n(2) set X_ 330.0

$n(2) set Y_ 121.0
$n(2) set Z_ 0.0

$n(3) set X_ 316.0

$n(3) set Y_ 152.0
$n(3) set Z_ 0.0

$n(4) set X_ 246.0

$n(4) set Y_ 90.0
$n(4) set Z_ 0.0

$n(5) set X_ 379.0

$n(5) set Y_ 6.0
$n(5) set Z_ 0.0

# Set a TCP connection between n(1) and n(31)

set tcp [new Agent/TCP/Newreno]
$tcp set class_ 2
set sink [new Agent/TCPSink]
$ns attach-agent $n(1) $tcp
$ns attach-agent $n(31) $sink
$ns connect $tcp $sink
set ftp [new Application/FTP]
$ftp attach-agent $tcp
$ns at 10.0 "$ftp start"

# Set a TCP connection between n(31) and n(43)

set tcp [new Agent/TCP/Newreno]
$tcp set class_ 2
 37

set sink [new Agent/TCPSink]

$ns attach-agent $n(31) $tcp
$ns attach-agent $n(43) $sink
$ns connect $tcp $sink

#defining heads
$ns at 0.0 "$n(0) label CH"
$ns at 0.0 "$n(1) label Source"
#$ns at 0.0 "$n(2) label N2"

$ns at 10.0 "$n(5) setdest 785.0 228.0 5.0"

$ns at 13.0 "$n(26) setdest 700.0 20.0 5.0"
$ns at 15.0 "$n(14) setdest 115.0 85.0 5.0"

#Color change while moving from one group to another

$ns at 73.0 "$n(2) delete-mark N2"
$ns at 73.0 "$n(2) add-mark N2 pink circle"
$ns at 124.0 "$n(11) delete-mark N11"
$ns at 124.0 "$n(11) add-mark N11 purple circle"
$ns at 103.0 "$n(5) delete-mark N5"
$ns at 103.0 "$n(5) add-mark N5 white circle"
$ns at 87.0 "$n(26) delete-mark N26"
$ns at 87.0 "$n(26) add-mark N26 yellow circle"
$ns at 92.0 "$n(14) delete-mark N14"
$ns at 92.0 "$n(14) add-mark N14 green circle"

# Define node initial position in nam

for {set i 0} {$i < $val(nn)} { incr i } {
# 20 defines the node size for nam
$ns initial_node_pos $n($i) 20
}

# Telling nodes when the simulation ends

for {set i 0} {$i < $val(nn) } { incr i } {
$ns at $val(stop) "$n($i) reset";
}

# ending nam and the simulation

$ns at $val(stop) "$ns nam-end-wireless $val(stop)"
$ns at $val(stop) "stop"
$ns at 150.01 "puts \"end simulation\" ; $ns halt"
proc stop {} {
global ns tracefd namtrace
$ns flush-trace
close $tracefd
close $namtrace
exec nam simwrls.nam &
}

$ns run
 38

9.2 APPENDIX 2

A.2.1 SNAPSHOTS

Fig A.2.1 NODE CREATION PROCESS

Fig A.2.2 Choosing Best Path Using DSR Protocol

 39

Fig A.2.3 Uniform Utilization Of Nodes

Predict high power and residual lower nodes:
INITIALIZE THE LIST XList Head
the resi is 2 49.939999999999998
the resi is 3 49.879999999999995
the resi is 4 49.819999999999993
the resi is 5 49.759999999999991
the resi is 6 49.699999999999989
the resi is 7 49.639999999999986
the resi is 8 49.579999999999984
the resi is 9 49.519999999999982
the resi is 10 49.45999999999998
.
.

the resi is 266 34.099999999999397

the resi is 267 34.039999999999395
the resi is 268 33.979999999999393
-----------------------------------------------------
Low power node 268 s 33.979999999999393
 40

the resi is High power node 182 64.139999999999588

the resi is High power node 183 64.079999999999586
the resi is High power node 184 64.019999999999584
the resi is High power node 185 63.959999999999582
the resi is High power node 186 63.899999999999579
the resi is High power node 187 63.839999999999577
the resi is High power node 188 63.779999999999575
the resi is High power node 189 63.719999999999573
the resi is High power node 190 63.65999999999957
.
.
.
the resi is High power node 681 34.199999999998454
the resi is High power node 682 34.139999999998452
the resi is High power node 683 34.079999999998449
the resi is High power node 684 34.019999999998447
the resi is High power node 685 33.959999999998445
-----------------------------------------------------
High power node 685 s 33.959999999998445

Delay time:
start at 0.015374 end at 0.044187 end to end delay is 0.021664
start at 0.011727 end at 0.034747 end to end delay is 0.017308
start at 0.079962 end at 0.082936 end to end delay is 0.002236
start at 0.087744 end at 0.096028 end to end delay is 0.006228
start at 0.050000 end at 0.051914 end to end delay is 0.001439
start at 0.100000 end at 0.142098 end to end delay is 0.031652
start at 0.150000 end at 0.164722 end to end delay is 0.011069
start at 0.200000 end at 0.206460 end to end delay is 0.004857
start at 0.250000 end at 0.254704 end to end delay is 0.003536
start at 0.300000 end at 0.328074 end to end delay is 0.021108
start at 0.350000 end at 0.351970 end to end delay is 0.001481
 41

9.3 APPENDIX 3
LIST OF PUBLICATION

1. presented my paper,”COMPARISION OF ENERGY EFFICIENT AND SCALABLE

SECURE DATA AGGREGATION AND DYNAMIC SOURCE ROUTING PROTOCOL IN
WIRELESS SENSOR NETWORK”, 3rd International Conference on Engineering
Technology and Science (ICETS 2016) held at Muthayammal Engineering Institutions,
Rasipuram, March 18th and 19th 2016. (Under Review by Springer Journal)
 42

CHAPTER 10
BIBLIOGRAPHY
[1] Sami Halawani, Abdul Wahid Khan, “Sensors Lifetime Enhancement Techniques in
Wireless Sensor Networks - A Survey”- Journal of Computing, Volume 2, Issue 5, ISSN
2151-9617, May 2010.

[2] Md Nafees Rahman, M A Matin,” Efficient Algorithm for Prolonging Network Lifetime of
Wireless Sensor Networks”, Tsinghai Science and Technology, December 2011, 16(6):
561- 568.

[3] M.Sheik Dawood, S.Sadasivam, “Energy Efficient Wireless Sensor Networks based on QoS
Enhanced Base Station controlled Dynamic Clustering Protocol”, International Journal of
Computer Applications (0975 – 8887) Volume 13– No.4, January 2011.

[4] Oliver Kosut, Lang Tong, Fellow, and David N. C. Tse, “Polytope Codes Against
Adversaries in Networks”, IEEE Transactions on Information Theory, Vol. 60, No. 6, June
2014.

[5] TaochunWang, Xiaolin Qin, and Liang Liu –“An Energy-Efficient and Scalable Secure Data
Aggregation for Wireless Sensor Networks”, International Journal of Distributed Sensor
Networks Vol. -2013.

[6] Alkalbani “Energy Consumption Evaluation in Trust and Reputation Models for Wireless
Sensor Networks”, 5th International Conference IEEE Mar-2013.

[7] Minakov “A methodology for power consumption evaluation of wireless sensor networks”,
Emerging technologies and factory automation- 2009.

[8] Ettus M. “System capacity, latency, and power consumption in multi-hop routed SS-CDMA
wireless networks”, In: Proc.Radio and Wireless Conf. Colorado Springs, USA, 1998: 55-58.
 43

[9] S. He, J. Chen, Y. Sun, D. K. Y. Yau, and N. K. Yip, “On optimal information capture by
energy- constrained mobile sensor”, IEEE Trans.Veh. Technol., vol. 59, no. 5, pp.
2472_2484, Jun. 2010.

[10] A. Jarry, P. Leone, S.Nikoletseas, and J.Rolim, “Optimal data gathering paths and energy-
Balance mechanisms in wireless networks”, Ad Hoc Network, vol. 9, no. 6, pp. 1036_1048,
2011.

[11] K.Akkaya and M.Younis, “An Energy-Aware QoS Routing Protocol for Wireless Sensor
Networks”, in the Proceedings of the IEEE Workshop on Mobile and Wireless Networks
(MWN 2003), Providence, Rhode Island, May 2003.

[12] P. Sivakumar, K. Amirthavalli and M. Senthil, “Power Conservation and Security

Enhancement in WSN: A Priority Based Approach”, International Journal of Distributed
Sensor Network, Volume 2014 (2014), Article ID 319587.
44