Bonfring International Journal of Networking Technologies and Applications, Vol. 5, No.
1, March 2018 9
Using of Bellman Ford's Algorithm in WSN to
Identify the Shortest Path and Improve the Battery
Power & Control the DDOS Attackers and Monitor
the System Environment
Dr.A. Mummoorthy, B. Bhasker and T. Jagadish Kumar
Abstract--- Wireless sensor network is also called as
group of ad-hoc network and use many number of mobility
sensor nodes. It consists of sensing, controlling & monitoring
capability. This article provide shortest path communicate
between the source and designation and measure the
performance. The shortest path routing algorithm used for
distance vector routing. The distance vector is the distinction
of bellman-ford algorithm. Here the nodes are created
dynamic to avoid the loop formation, malicious nodes and
intrusion attacks and also improving the performance of
distance vector by initializing variable randomly and
generating graphs.
Keywords--- Wireless Sensor Networks, Dijkstra’s,
Bellman-Ford, Distance Vector Algorithm, Random,
MATLAB.
I. INTRODUCTION
T HE WSN is built of "nodes" – from a few to several
hundreds or even thousands, where each node is
connected to one (or sometimes several) sensors. Each such
sensor network node has typically several parts: a radio
transceiver with an internal antenna or connection to an
external antenna, a microcontroller, an electronic circuit for
interfacing with the sensors and an energy source, usually a
battery or an embedded form of energy harvesting. A sensor
node might vary in size from that of a shoebox down to the
size of a grain of dust, although functioning "motes" of
genuine microscopic dimensions have yet to be created. The
cost of sensor nodes is similarly variable, ranging from a few
to hundreds of dollars, depending on the complexity of the
individual sensor nodes. Size and cost constraints on sensor
nodes result in corresponding constraints on resources such as
energy, memory, computational speed and communications
bandwidth. The topology of the WSNs can vary from a simple
star network to an advanced multi-hop wireless mesh network.
The propagation technique between the hops of the network
Dr.A. Mummoorthy, Associate Professor, Department of IT, Malla Reddy
College of Engineering & Technology, Secundrabad, India.
E-mail:amummoorthy@gmail.com
B. Bhasker, Assistant Professor, Department of IT, Malla Reddy College
of Engineering & Technology, Secundrabad, India.
E-mail:bhasker.b90@gmail.com
T. Jagadish Kumar, Assistant Professor, Department of CSE, Malla
Reddy College of Engineering & Technology, Secundrabad, India.
E-mail:jagadish.tlgp@gmail.com
DOI:10.9756/BIJNTA.8369
ISSN 2320-5377 | © 2018 Bonfring
can be routing or flooding. The majority of WSNs described in
the literature exhibit a (source, sink) architecture, which may
include any number of: Source nodes: which generate data,
usually by using sensors to measure environmental factors
such as temperature, humidity or radiation, Sink nodes: which
collect the data gathered by source nodes and Intermediate
nodes: which may include source nodes that aid the
transmission from source to sink. These two challenges and
discuss them in detail in the following sections.
II. LITERATURE SURVEY
In smart environments, wireless sensor networks will play
a key role in sensing, collecting, and disseminating
information about environmental phenomena. Sensing
applications represent a new paradigm for network operation,
one that has different goals from more traditional wireless
networks. This paper examines this emerging field to classify
wireless micro-sensor networks according to different
communication functions, data delivery models, and network
dynamics. This taxonomy will aid in defining appropriate
communication infrastructures for different sensor network
application subspaces, allowing network designers to choose
the protocol architecture that best matches the goals of their
application. In addition, this taxonomy will enable new sensor
network models to be defined for use in further research in this
area.
III. ROUTING CHALLENGES AND DESIGN ISSUES IN WSN
Despite the innumerable applications of WSNs, these
networks have several restrictions, e.g., limited energy supply,
limited computing power, and limited bandwidth of the
wireless links connecting sensor nodes. One of the main
design goals of WSNs is to carry out data communication
while trying to prolong the lifetime of the network and prevent
connectivity degradation by employing aggressive energy
management techniques. The design of routing protocols in
WSNs is influenced by many challenging factors. These
factors must be overcome before efficient communication can
be achieved in WSNs. In the following, we summarize some
of the routing challenges and design issues that affect routing
process in WSNs.
Node deployment: Node deployment in WSNs is
application dependent and affects the performance of the
routing protocol. The deployment can be either deterministic
or randomized. In deterministic deployment, the sensors are
Bonfring International Journal of Networking Technologies and Applications, Vol. 5, No. 1, March 2018
manually placed and data is routed through pre-determined
paths. However, in random node deployment, the sensor nodes
are scattered randomly creating an infrastructure in an ad hoc
manner. If the resultant distribution of nodes is not uniform,
optimal clustering becomes necessary to allow connectivity
and enable energy efficient network operation
Energy consumption: without losing accuracy: sensor
nodes can use up their limited supply of energy performing
computations and transmitting information in a wireless
environment. As such, energy conserving forms of
communication and computation are essential.
Data Reporting Model: Data sensing and reporting in
WSNs is dependent on the application and the time criticality
of the data reporting. Data reporting can be categorized as
either time-driven (continuous), event-driven, query-driven,
and hybrid
Node/Link Heterogeneity: In many studies, all sensor
nodes were assumed to be homogeneous, i.e., having equal
capacity in terms of computation, communication, and power.
However, depending on the application a sensor node can
have different role or capability. The existence of
heterogeneous set of sensors raises many technical issues
related to data routing.
Fault Tolerance: Some sensor nodes may fail or be
blocked due to lack of power, physical damage, or
environmental interference. The failure of sensor nodes should
not affect the overall task of the sensor network. If many
nodes fail, MAC and routing protocols must accommodate
formation of new links and routes to the data collection base
stations. This may require actively adjusting transmit powers
and signaling rates on the existing links to reduce energy
consumption, or rerouting packets through regions of the
network where more energy is available.
IV. DESTINATION-SEQUENCED DISTANCE VECTOR
ROUTING
Destination-Sequenced Distance-Vector Routing
(DSDV) is a table-driven routing scheme for ad hoc mobile
networks based on the Bellman–Ford algorithm. It was
developed by C. Perkins and P. Bhagwat in 1994.The main
contribution of the algorithm was to solve the routing loop
problem. Each entry in the routing table contains a sequence
number, the sequence numbers are generally even if a link is
present; else, an odd number is used. The number is generated
by the destination, and the emitter needs to send out the next
update with this number. Routing information is distributed
between nodes by sending full dumps infrequently and smaller
incremental updates more frequently.
Table 1: Routing Table
Designation Next No.of Sequence Install time
Hop Hops number
A A 0 A46 002000
B B 1 B36 002200
C B 2 C28 002500
For example, the routing table of Node A in this network is
Naturally the table contains description of all possible paths
reachable by node A, along with the next hop, number of hops
and sequence number.
ISSN 2320-5377 | © 2018 Bonfring
10
V. SELECTION OF ROUTE
If a router receives new information, then it uses the latest
sequence number. If the sequence number is the same as the
one already in the table, the route with the better metric is
used. Stale entries are those entries that have not been updated
for a while. Such entries as well as the routes using those
nodes as next hops are deleted.
The availability of paths to all destinations in network
always shows that less delay is required in the path set up
process.
The method of incremental update with sequence number
labels, marks the existing wired network protocols adaptable
to Ad-hoc wireless networks. Therefore, all available wired
network protocol can be useful to ad hoc wireless networks
with less modification.
DSDV requires a regular updates of its routing tables,
which uses up battery power and a small amount of bandwidth
even when the network is idle.
Whenever the topology of the network changes, a new
sequence number is necessary before the network re-
converges; thus, DSDV is not suitable for highly dynamic or
large scale networks. (As in all distance-vector protocols, this
does not perturb traffic in regions of the network that are not
concerned by the topology change.
VI. RESULT & CONCLUSION
Simulation parameter assumptions or analysis that is
considered, when building the TCL script, the simplicity to all
packet massages flows in the system are assumed to have the
same type of traffic source node.
AD-Hoc Routing Protocol
REFERENCES
[1] A. Mummoorthy, “A Detailed Study on the Evolution of Recent
Jammers in Wireless Sensor Networks”, International Journal of
Engineering Research and Development, Pp. 12-15, 2012.
[2] T. He, C. Huang, B.M. Blum, J.A. Stankovic and T. Abdelzaher,
“Range-Free Localization Schemes for Large Scale Sensor Networks”,
Proceedings of the 9th Annual International Conference on Mobile
Computing and Networking, San Diego, Pp. 81-95, 2003.
[3] W. Dargie and C. Poellabauer, “Fundamentals of Wireless Sensor
Networks: Theory and Practice”, John Wiley & Sons, Hoboken, 2010.
[4] A. Kumar, V. Kumar and V. Kapoor, “Range Free Localization Schemes
for Wireless Sensor Networks”, 10th WSEAS International Conference
on Software Engineering, Cambridge, Pp. 101-106, 2011.
[5] H. Karl and A. Willig, “Protocols and Architectures for Wireless Sensor
Networks”, John Wiley & Sons, Hoboken, 2007.
Bonfring International Journal of Networking Technologies and Applications, Vol. 5, No. 1, March 2018 11

[6] S.Y. Kim and O.H. Kwon, “Location Estimation Based on Edge
Weights in Wireless Sensor Networks”, The Journal of Korean Institute
of Communications and Information Sciences, Vol.30, Pp. 938-948,
2005
[7] L. Lazos and R. Poovendran, “Serloc: Secure Range-Independent
Localization for Wireless Sensor Networks”, Proceedings of the 3rd
ACM Workshop on Wireless Security, Philadelphia, Pp. 21-30, 2004.
[8] R. Nagpal, H. Shrobe and J. Bachrach, “Organizing a global coordinate
system from local information on an ad hoc sensor network”,
Information processing in sensor networks. Springer, Berlin, Heidelberg,
Pp. 333-348, 2003.
[9] F. Zhao and L. Guibas, “Information Processing in Sensor Networks”,
Springer, Berlin, Pp. 333-348, 2003.
[10] A. Mummoorthy and S Suresh Kumar, “Energy Aware Routing Protocol
Poisson Process using Diffusion Update Algorithm in Wireless Sensor
Networks”, Asian Journal of Research in Social Sciences and
Humanities, Vol. 6, No. 6, Pp. 130-147, 2016.
[11] N. Bulusu, J. Heidemann and D. Estrin, “Gps-Less Low-Cost Outdoor
Localization for Very Small Devices”, IEEE Personal Communications,
Vol.7, Pp. 28-34, 2000.
[12] S. Long, F. Wang, W. Duan and F. Ren, “Range-Free Self-Localization
Mechanism and Algorithm for Wireless Sensor Networks”, Computer
Engineering and Applications, 2004.
[13] T. He, C. Huang, B.M. Blum, J.A. Stankovic and T.F. Abdelzaher,
“Range-Free Localization and Its Impact on Large Scale Sensor
Networks”, ACM Transactions on Embedded Computing Systems,
Vol.4, Pp. 877-906, 2005.
[14] T.S. Rappaport, “Wireless Communications: Principles and Practice.,
Prentice Hall”, Upper Saddle River, Vol. 2, 1996.

ISSN 2320-5377 | © 2018 Bonfring