DESIGNING COST AWARE AND SECURE ROUTING PROTOCOL FOR

WIRELESS SENSOR NETWORK

SUDHA N
E&C Department, VTU, Kumblagodu, Bangalore, Karnataka, India

S C BIRADAR
Asst. Professor, DBIT, kumblagodu, Bangalore, Karnataka, India

ABSTRACT: Multi-hop wireless sensor networks with non-rechargeable energy resources has
two conflicting design issues. Lifetime optimization and security are the conflicting design issues.
A novel secure and efficient Cost-Aware Secure Routing is proposed to address these two
conflicting issues. CASER supports multiple routing strategies based on the routing requirements.
In this the CASER focus on two routing strategies for message forwarding: shortest path message
forwarding and secure message forwarding through random walk. In WSN it is possible for the
adversaries to perform jamming and routing trace back attacks. Firewalls are used to avoid routing
trace back attacks and jamming in a network.

KEYWORDS: security, protocol, firewalls, routing, multi-hop.

INTRODUCTION

Routing strategies are required for sending packets between the sensor nodes for communication.
The sensor network node components are radio transceiver, microcontroller and battery. In both
military and civilian applications wireless sensor networks are feasible. The WSN consists of large
number of sensor nodes. These nodes are non-rechargeable and limited energy resource. Very
challenging design issue for WSN is routing. A properly designed routing protocol is needed.wsn
rely on wireless communication, which is by nature a broadcast medium. In wireless network, the
communication takes place through multi-hop transmission. Multi-hop transmission requires
intermediate nodes to transmit packet in a network. Wireless sensor network are more vulnerable
to security attacks compare to wired sensor network.WSN needs more security due lack of
physical boundary. Hackers with appropriate receiver can intercept the network communication,
performs jamming and routing trace back attacks. The caser forwards the packet in random walk
and shortest path routing strategies. It provides shortest path and random walk routing in the same
work.

For security purpose a firewalls are used. Firewall provides network security. It acts as a barrier
between the trusted and unsecure nodes. It just forward the packets that sent by the trusted node.
Unsecure packets are dropped out. Firewalls are nothing but network security system that controls
the incoming and outgoing packets. it is a set of rules designed to transmit a packet. Packet filter or
network layer filter is a firewall that operates at a low level of the TCP protocol. It allows packet
to pass through firewall only when they match the established rule set.
EXISTING METHODS

In [1], source-location privacy broadcast the messages along with dummy messages. It mixes valid
messages with invalid message. Whenever there is no valid message to transmit, the node
transmits invalid message. The invalid message transmission consumes large amount of network
energy and also increases the network collision. Geographic routing protocol routes the packet
based on location information. In [2], the location information is updated by the GPS. Flooding
overhead can be avoided by location based routing protocol. Geographic adaptive fidelity or GAF
is an energy aware location based routing protocol. The sensor nodes are randomly deployed over
network. The sensor nodes are divided into small grid. Nodes elect one sensor node as a active
node. The active node is responsible for monitoring processing and reporting data to the sink. All
other node except active node in the same grid enters into the sleep mode without sacrificing the
routing efficiency.

GEAR is the geographic and energy aware routing protocol. In [4], GEAR, each node keeps an
estimated cost and a learning cost of reaching the destination through its neighbours. It forwards
the packet in two phases. One is forwarding packets to the target region and another one is
forwarding packets within the region. Major disadvantage of GEAR is limited scalability.

METHODOLOGY

Node Deployment
The WSN consists of large number of sensor nodes. These nodes are randomly deployed in a
sensor network. The sensor node has a very limited energy resource so energy of each node should
be balanced. The source node forwards packet to the destination node through the intermediate
nodes. Communication between nodes is based on the tree topology. The destination address is
made public. The source first broadcasts the request to transmit the packet. The other nodes that
receive the request will set the message sender as a parent. The packet of data consists source
address, destination address and neighbouring address. The packet needs many hop counts to reach
destination.

Neighbour Discovery
In wireless network, the communication takes place through multi-hop transmission. Multi-hop
transmission requires intermediate nodes to transmit packet in a network. One hop neighbours are
identified dynamically. Through tree topology communication takes place between nodes. The
sender node broadcast message with one hop counter. The data are transmitted along the edges of
the tree topology.

Shortest Path Based Routing

The entire network is divided into grids. Each grid maintains its own attributes and relative
location. The node with highest energy is treated as a super node or head node. Each node updates
its location information, remaining energy level in the grid. If random number is 0 then it chooses
shortest path. The shortest path routing finds shortest path to transmit packet. The shortest path
means which requires less cost and energy to transmit packet. The routing table updates available
paths from source to destination and finds the shortest path among them.

189
Secure Routing Strategy
To prevent routing trace back and recovering the source location from the node ID, a dynamic ID
is used. CASER provides routing strategy to make routing path unpredictable. The random walk is
an unpredictable path which takes random steps to transmit the packet. If random value is 1 then it
chooses secure routing. For packet filtering firewalls are used. The firewalls are network security
system provides security while transmitting packet. It is a set of rules to transmit a packet. It just
allows trusted nodes packet to reach destination. The unsecure node packets are dropped out at this
level only.

Source node

Find neighbor

Routing table

Check value

Shortest routing Secure routing

Packet Filtering

Transmit
packets

Destination

Figure 1. Proposed System Methodology

RESULTS

WSN consists of several sensor nodes in a network domain. Here 25 sensor nodes are randomly
deployed i.e from 0 to 24. Source and destination nodes are selected. Attacker node is identified.
Firewalls are located at different levels in a network. Source node starts transmitting packet to

190
destination. Path is selected based on the requirements. Packets before reaching a destination node,
it reaches firewall node to check whether it has sent by the trusted node. The packet that has been
sent by unsecure node is dropped out in this level only. Firewall avoids trace back attacks and
traffic jamming in a network.

Figure 2. Source node broadcast the packets to the destination node.

CONCLUSION

In WSN routing and security are the two design issue. Here two routing strategy is provided in the
same framework and also provides security for transmitting packets. The lifetime of the sensor
nodes is balanced and increased. Firewall prevents trace back attacks and malicious traffic
jamming. Packet delivery ratio also increased.

REFERENCES

M. Shao, Y. Yang, S. Zhu, and G. Cao, Towards statistically strong source anonymity for sensor
networks, in INFOCOM 2008. The 27th Conference on Computer Communications. IEEE,
April 2008, pp. 51 55.
Y. Li, J. Li, J. Ren, and J. Wu, Providing hop-by-hop authentication and source privacy in
wireless sensor networks, in IEEE INFOCOM 2012 Mini-Conference, Orlando, Florida, USA.,
March 25-30, 2012 .

191
B. Karp and H. T. Kung, GPSR: Greedy perimeter stateless routing for wireless networks, in
MobiCom2000, New York, NY, USA, 2000, pp.243 254.
J. Li, J. Jannotti, D. S. J. D. C. David, R. Karger, and R. Morris, A scalable location service for
geographic ad hoc routing, in Mobile computing Networking MobiCom2000. ACM, 2000,
pp. 120 130.
Y. Xu, J. Heidemann, and D. Estrin, Geography-informed energy conservation for ad-hoc
routing, in the Seventh Annual ACM/IEEE International Conference on Mobile Computing
and Networking, 2001, pp. 7084.
Y. Yu, R. Govindan and D. Estrin, Geographical and energy aware routing: A recursive data
dissemination protocol for wireless sensor networks UCLA computer Science Department
Technical Report UCLACSD, May 2001.

192