IJRET: International Journal of Research in Engineering and Technology

eISSN: 2319-1163 | pISSN: 2321-7308

PERFORMANCE OF BALANCING ENERGY AND PROBABILISTIC

BASED RANDOM WALKING IN WSN
Priyanka Kanje1, Ramesh D2, G.S Biradar3
M. Tech (DCN) Scholar, BKIT, Bhalki
priyakanje113@gmail.com
2
ECE Department, BKIT, Bhalki
ramesh.dhavalegar29@gmail.com
3
ECE Department, PDACE, Kalburgi
gsbiradar@yahoo.com

Abstract

A vital concern in wireless sensor networks is the partial energy and security assets. The two clashing plan issues for multi-jump
remote sensor systems with non-replenishable vitality assets are lifetime improvement and security. To deal with these two
clashing concerns through two customizable factors: vitality equalization control (VEC) and probabilistic-based arbitrary
strolling, here we proposed the novel secure and effective Cost-Aware SEcure Routing (CASER). We then discover that the
strength utilization is extremely disproportional to the consistent strength arrangement for the given system topology, which
extraordinarily decreases the life span of the sensor systems. To tackle this issue, we propose an effective non-uniform vitality
organization technique to advance the life span and message conveyance proportion in the same vitality asset and security
necessity. We additionally exhibit that the projected CASER convention can accomplish a high message conveyance proportion
while anticipating directing trace back assaults.

Keywords: Lifetime Improvement, Security, Routing, Message Conveyance.

--------------------------------------------------------------------***---------------------------------------------------------------------

1. INTRODUCTION:

The development of technology leads to remote sensor

systems essentially and financially achievable to be broadly
utilized as a part of both military and regular citizen
applications, for example, checking of nearby conditions
identified with nature, valuable species and basic
frameworks [1]. A main element of such systems is that
every system contains a significant number of untethered
and unattended sensor hubs [2]. In existing system they
were give the energy to the all the nodes, which are in either
active or inactive. So energy consumption becomes more.
To reduce this energy we proposed a CASER protocol. In
this protocol the energy is given only to the active nodes, so
energy consumption becomes less and lifetime of network
will be increases. Security is another issue in existing
system. To overcome from this problem, probabilistic based
random walking parameter is taken in proposed system.

2. SYSTEM ARCHITECTURE

Figure2.1: System Architecture

The above figure shows the system architecture of proposed
model. This architecture shows the how the data is flow
from source to destination. Here the network is consistently
alienated into number of gratings and each grating contains
number of nodes. Each node knows its comparative position
and identifies left behind vigor of nearest nodes. It maintains

_______________________________________________________________________________________
Volume: 05 Issue: 06 | Jun-2016, Available @ http://ijret.esatjournals.org

233

IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308
the routing table of all nodes. Here we are using two
steering approaches, namely direct path routing approach
and probabilistic based random walking. The node select
one random number, if it is 0 then it select next hop grid
randomly and sends packet to the destination else it select

next hop grid based on shortest path routing for message

delivery.

3. SYSTEM DESIGN

Figure 3: System design of proposed model

The above figure shows the system design for proposed
model. It shows the how the data flow from source to
destination. Here we initially do the formation of the
network and making them into number of grid. Each grid
divides network into number of nodes. After that the packet
transforms process started. It checks the energy computation
of the route, if it is high then the packets is sending
continuously otherwise we will change the route that contain
high energy level. After the delivery of packet process will
completed.

In the above figure we are taking total 40 nodes that are

from 0 to 39. In this we understood that each nodule retains
its comparative place and residual energy levels of its
instantaneous flanking nearby nodes. The sensor nodes are
very tiny in size and powered by the batteries.

4. RESULT AND DISCUSSION

Figure 4.2: Transmitting of packets from source to

destination

Figure 4.1: Transmitting of packets from source to

destination

The above figure shows the how the packets are transmitting
from source node to sink node. The red color line indicating
that the transmission occurring in air media. The best path
chosen by using shortest path and random walking routing
strategies are 0, 3, 4, 8, 28, and 30. Here the best path is
selected based on QOS values.

_______________________________________________________________________________________
Volume: 05 Issue: 06 | Jun-2016, Available @ http://ijret.esatjournals.org

234

IJRET: International Journal of Research in Engineering and Technology eISSN: 2319-1163 | pISSN: 2321-7308

Figure 4.3: Comparison of two systems

The above graph shows the comparison between two
systems that is between existing system and proposed
system. It is the time v/s energy graph. The Y-axis
represents the energy in joules. The main intension of
proposed system is to reduce the energy consumption of
network and we were reducing the energy of network as
shown in the graph.

5. CONCLUSION:

A safe and effective Cost-Aware SEcure Routing (CASER)

convention is proposed for WSNs to adjust the vitality
utilization and expansion system lifetime. A non-uniform
vitality arrangement plan is proposed to boost the sensor
system lifetime. In this the packet loss is minimized and
packet delivery ratio is maximized.

REFERENCES:

[1]. Y. Li, J. Ren, and J. Wu, Quantitative measurement

and design of source-location privacy schemes for
wireless sensor networks, IEEE Trans. Parallel
Distrib. Syst., vol. 23, no. 7, pp. 13021311, Jul.2012.
[2]. Y. Li, J. Li, J. Ren, and J. Wu, Providing hop-by-hop
authentication and source privacy in wireless sensor
networks, in Proc.IEEE Conf. Comput. Commun.
Mini-Conf., Orlando, FL, USA, Mar.2012, pp. 3071
3075.
[3]. B. Karp and H. T. Kung, GPSR: Greedy perimeter
stateless routing for wireless networks, in Proc. 6th
Annu. Int. Conf. Mobile Comput. Netw., New York,
NY, USA, 2000, pp. 243254.
[4]. J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger, and
R. Morris, A scalable location service for geographic
ad hoc routing, in Proc.6th Annu. Int. Conf. Mobile
Comput. Netw., 2000, pp. 120130.
[5]. Y. Xu, J. Heidemann, and D. Estrin, Geographyinformed energy conservation for ad-hoc routing, in
Proc. 7th Annu. ACM/IEEE Int. Conf. Mobile Comput.
Netw., 2001, pp. 7084.

[6]. Y. Yu, R. Govindan, and D. Estrin, Geographical and

energy aware routing: A recursive data dissemination
protocol for wireless sensor networks, Comput. Sci.
Dept., UCLA, TR-010023, Los Angeles, CA, USA,
Tech. Rep., May 2001.
[7]. N. Bulusu, J. Heidemann, and D. Estrin, GPS-less low
cost outdoor localization for very small devices,
Comput. Sci. Dept., Univ. Southern California, Los
Angeles, CA, USA, Tech. Rep. 00-729, Apr. 2000.
[8]. Savvides, C.-C. Han, and M. B. Srivastava, Dynamic
fine grained localization in ad-hoc networks of
sensors, in Proc. 7th ACM Annu. Int. Conf. Mobile
Comput. Netw., Jul. 2001, pp. 166179.
[9]. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia,
Routing with guaranteed delivery in ad hoc wireless
networks, in Proc. 3rd Int. Workshop Discrete
Algorithms Methods Mobile Comput. Commun. 1999,
pp. 4855.
[10]. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia,
Routing with guaranteed delivery in ad hoc wireless
networks, in Proc. 3rd ACM Int. Workshop Discrete
Algorithms Methods Mobile Comput. Commun.,
Seattle, WA, USA, Aug. 1999, pp. 4855.

_______________________________________________________________________________________
Volume: 05 Issue: 06 | Jun-2016, Available @ http://ijret.esatjournals.org

235