Download Design of Shortest Path Algorithm Based on Adjacency Matrix

International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 5 pp 267-273 August 2013
www.ijsret.org
ISSN 2278 – 0882
Design of Shortest Path Algorithm Based on Adjacency Matrix Reduction
with LEACH as Benchmark
1
1
Shivani Duggal, 2 Ms.Preeti Arora
M.Tech. Scholar, Department of Electronics and Communication Engg., NGF College of Engineering and Technology.
2
Asst. Prof, Deptt. Electronics and Communication Engg., NGF college of Engineering and Technology.
Abstract— Ad-hoc networks are basically selfconfiguring networks with no backbone infrastructure
and all the nodes are connected to each other through
wireless links. Each device in Ad-hoc (mobile) network
is free to move independently in any direction, and will
therefore change its links to other devices frequently.
Each must forward traffic unrelated to its own use, and
therefore be a router. The primary challenge in building
a Ad-hoc (mobile) network is equipping each device to
continuously maintain the information required to
properly route traffic. At present many protocols and
algorithms are in existence for Ad-hoc network routing
and efficient operation. However, all of them have few
strengths and weaknesses.
Low Energy Adaptive Clustering Hierarchy (LEACH) is
an energy-efficient hierarchical based routing protocol
for Wireless Sensor Networks. This clustering routing
protocol that partitions the network into clusters; the
cluster contains, CH, sub-CH (the node that will become
a CH of the cluster in case of CH dies), cluster nodes;
thus extends network lifetime. But the main
disadvantage of LEACH protocol as the number of
nodes increases the energy dissipation of route also
increases.
In this paper our prime aim is to design shortest path for
Ad-hoc network where LEACH is acting as bases for
efficient energy route .In our algorithm design any of
mobile node act as cluster Head. The path design is
based on Adjacency Matrix Reduction. Simulation of
path is done in Matlab Editor for both continuous and
discrete nodes. Analysis of Energy dissipation, time
taken for communication and number of Iteration for
our algorithm for ad-hoc network with the LEACH
algorithm for Wireless Sensor Network. Result shown in
thesis proves that our algorithm is more suitable for Adhoc Network as compared to LEACH Algorithm.
Keyword: Ad-hoc Network, Routing Algorithm, LEACH,
Protocol, Cluster Head
I.
INTRODUCTION
Advances in energy efficient design and wireless
technologies have enabled portable device to support
several important wireless application. Ad-Hoc Networks
are autonomous and decentralized wireless systems. Adhoc consists of mobile nodes that are free in moving in
and out in the network. Nodes are the systems or devices
i.e. mobile phone, laptop, personal digital assistance,
MP3 player and personal computer that are participating
in the network and are mobile. These nodes can act as
host/router or both at the same time. They can form
arbitrary topologies depending on their connectivity with
each other in the network. These nodes have the ability to
configure themselves and because of their self
configuration ability, they can be deployed urgently
without the need of any infrastructure.. Figure 1 shows
the Ad-hoc network.
Figure 1. Communication between nodes in Ad-hoc
Network
Routing is one of the key issues in MANETs due to their
highly dynamic and distributed nature. In particular,
energy efficient routing may be the most important design
criteria for MANETs since mobile nodes will be powered
by batteries with limited capacity. Power failure of a
mobile node not only affect the node itself but also its
ability to forward packets on behalf of others and thus the
overall network lifetime. For this reason, many research
IJSRET @ 2013
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 5 pp 267-273 August 2013
www.ijsret.org
ISSN 2278 – 0882
efforts have been devoted to developing energy aware
routing protocols.
According to routing algorithms in Ad-hoc networks
(mobile) must be designed keeping the following
requirements and constraints in mind:
• Power efficiency is the most important consideration
due to the limited capacity of
a sensor node.
• The Ad-hoc network has to be self-organizing.
• Position awareness is extremely important in many Adhoc applications.
• Data collected by nodes may contain large amounts of
redundancy.
II.
Figure2. LEACH Protocol Architecture
LEACH ALGORITHM FOR WSN
Heinzelman, et.al introduced a hierarchical clustering
algorithm for sensor networks, called Low Energy
Adaptive Clustering Hierarchy (LEACH). LEACH
arranges the nodes in the network into small clusters and
chooses one of them as the cluster-head. Node senses its
target and then sends the relevant information to its
cluster-head. Then the cluster head aggregates and
compresses the information received from all the nodes
and sends it to the base station. The nodes chosen as the
cluster head drain out more energy as compared to the
other nodes as it is required to send data to the base
station which may be far located. Hence LEACH uses
random rotation of the nodes required to be the clusterheads to evenly distribute energy consumption in the
network. TDMA/CDMA MAC [2] is used to reduce intercluster and intra-cluster collisions. This protocol is used
were a constant monitoring by the sensor nodes are
required as data collection is centralized (at the base
station) and is performed periodically .As shown in figure
2 below.
Figure.3. Simulation results of LEACH Algorithm for
WSN shows that Number of packet sent to base station
with each round and number of dead nodes form every
round where dead nodes are absorbing whole data
information before reaching to base station. Also with
increasing number of nodes i.e. as the number of nodes
pass 1500 energy dissipation in each round also
increasing which become as the drawback of LEACH
Algorithm.
Figure3. Number of packets sent to Base Station Vs
Rounds
IJSRET @ 2013
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 5 pp 267-273 August 2013
III.
www.ijsret.org
ISSN 2278 – 0882
ALGORITHM OF MODIFIED LEACH FOR
AD-HOC NETWORK
The algorithm for the Low Energy Adaptive
Clustering Hierarchy (LEACH) implemented is:
Setup phase:
1. CN => r
2. If r < T*(n) then, CH = CN else, go to step1
3. CH => G : id(CH) , req _adv
4. A(i)
CH(j) : id(A(i)) , id(CH(j)) , req _adv
5. CH(j) A(i) : id(CH(j)) , < t(i) , id(A(i)) >
Steady phase :
1. A(i)
CH(j) : id(A(i)) , id(CH(j)) , info
2. CH
BS : id(CH) , id(BS) , aggr_info
The various symbols used here are :
CN : candidate node to become the cluster head.
r : random variable for node (0 < r < 1)
T*(n) : parameter to decide whether the node r can
act as cluster head or not
CH : cluster head
G : all nodes in the network
id : identification number
req _adv : request to join the cluster
A : normal node
req _adv : request to join the cluster
t : time slot to send the sensed data
=> : broadcast
: unicast
Figure4.a. Flowchart of Proposed Routing
Algorithm for Ad-hoc Network
IJSRET @ 2013
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 5 pp 267-273 August 2013
www.ijsret.org
ISSN 2278 – 0882
communication and red node is denoting the destination
node and this is not directly reachable by starting point.
This network is forming cluster as here we have
assumed that all nodes are in continuous fashion and
forming mesh topology. The simulation is shown for
different number of nodes fig 6.1 for N = 200.
Figure4.b Flowchart for designing of new shortest path
algorithm for Ad-hoc network
The above figure shows the flowchart of experiment
carried out in this paper.
IV.
SIMULATION AND RESULTS
We design program for ad-hoc network
simulations
using MATLAB 7.14 version to determine the shortest
path algorithm using adjacency matrix reduction
discussed in this dissertation. For these experiment, the
random, 100 to 1000 node network is established. The
nodes were placed 175 unit geometric distances from
each other.
In graph X axis is showing number of nodes and Y
axis positioning of Nodes i.e. number of vertices. Here
program is written keeping in mind that path developed
between nodes should be cyclic as it is most efficient
path.
The fig below shows the design of number of shortest
paths between the node acting as Cluster Head and the
communicating or we can say destination node. Here in
fig below green node is showing the starting point of
Figure5(a) Network where N =200 are in continuous
fashion and forming mesh topology
The figure 5.(a) above shows the number of path for
transmitting the data packets from source node to
destination node when the nodes are forming cluster as
nodes are in continuous form .the tangential paths that is
the path that are not useful in shortest path designing are
not included in the cluster .The probability of each node
to transmit is taken as 1.The path designed are energy
efficient as they are based on LEACH protocol for WSN
implemented here for ad-hoc networks.
The figure5(b) shows the result of design of shortest path
when there is not fixed value of nodes neither there is any
fixed shaped cluster of nodes formed. The main aim of
this designing of shortest path to ensure the continuous
data communication when there are not specific
distributions of nodes in regular manner in ad-hoc
network.
IJSRET @ 2013
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 5 pp 267-273 August 2013
www.ijsret.org
ISSN 2278 – 0882
there is a rate of change of distance between nodes and
how is our path designed in this case.
Figure5.(b) It showing path when nodes (N) are in
discrete form in network
The figure5(c) shows another case where nodes are in
continuous form but nodes are entering and exiting from
network so communication path is adjusting so that
communication should not break up .Therefore resulting
in
continuous
communication
between
the
communicating nodes.
Figure5(d) Simulation showing paths for network where
nodes are in continuous mode but rate of change of nodes
positioning
V.
CONCLUSION & FUTURE SCOPE
In this paper we considered a well known protocol for
wireless sensor networks called LEACH protocol which
is the first and the most important protocol in wireless
sensor network which uses cluster based broadcasting
technique, followed by a modified LEACH for ad-hoc
networks. From the simulation results, we can draw a
number of conclusions.
 We can implement LEACH protocol for a adhoc networks for finding shortest
path between communicating nodes.
 Total time taken in delivering data packet by new
algorithm is less than that of LEACH
 Any node in network can act as cluster head.
Figure.5(c) Simulation showing paths for network
where nodes are in continuous mode but entering
and exiting the nodes (N =200)
Figure5 (d) below shows another case we have
considered in which nodes are in continuous form but
IJSRET @ 2013
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 5 pp 267-273 August 2013
Table 1: Performance Analysis of LEACH for WSN and
Our Modified Algorithm for Ad-hoc Networks.
Parameter
S.No
1
2
3
MODIFIED
LEACH FOR LEACH FOR
WSN
AD-HOC
NETWORK
Total
time
taken
by
LEACH to
deliver
packets
450 ms
Total Energy
consumed in
single packet
transmission 200 Joules
No.
of
Iterations
required for
successful
data
throughput
400
440 ms
160 Joules
530
In this work we are successful in designing shortest path
for ad-hoc networks. The work can include the designing
of routing protocol for transmission of data between
communicating nodes .Various techniques can be
followed for this energy efficient routing protocol with
security.
VI.
BIBLOGRAPHY
[1] http://en.wikipedia.org/wiki/Mobile_ad_hoc_network,
last visited 25, MAY, 2013
[2] Research and Improvement of LEACH Protocol for
Wireless Sensor Network Baiping Li1, a, Xiaoqin
Zhang2, b 2012 International Conference on Information
Engineering Lecture Notes in Information Technology,
Vol.25
[3] Enhancing the Performance of LEACH Protocol in
Wireless Sensor Networks Yun Li1,2, Nan Yu1, Weiyi
Zhang 3, Weiliang Zhao 1, Xiaohu You2, Mahmoud
Daneshmand4 IEEE Ihoc networks NFOCOM 2011
Workshop on M2MCN-2011
[4] Modify LEACH Algorithm for Wireless Sensor
Network Mortaza Fahimi Khaton Abad P1P , Mohammad
Ali Jabraeil JamaliP IJCSI International Journal of
Computer Science Issues, Vol. 8, Issue 5, No 1,
www.ijsret.org
ISSN 2278 – 0882
September
2011
ISSN
(Online):
1694-0814
www.IJCSI.org
[5] Analysis of Low Energy Adaptive Clustering
Hierarchy (LEACH) protocol.
Taran Deep Singh Pawa. Department of Computer
Science and Engineering
National Institute of Technology, Rourkela, Orissa,
India.2011.
[6] Shailender Gupta, C. K. Nagpal and Charu Singhla,”
IMPACT OF SELFISH NODE CONCENTRATION IN
MANETS”, International Journal of Wireless & Mobile
Networks (IJWMN) Vol. 3, No. 2, April 2011, pp. 29-37
[7]
IMPROVED
LEACH
COMMUNICATION
PROTOCOL FOR WSN Nitin Mittal#1, Davinder Pal
Singh*2, Amanjeet Panghal#3, R.S. Chauhan+4 NCCI
2010 -National Conference on Computational
Instrumentation CSIO Chandigarh, INDIA, 19-20 March
2010
[8] Improvement on LEACH Protocol of Wireless Sensor
Network (VLEACH) M. Bani Yassein, A. Al-zou'bi, Y.
Khamayseh, W. Mardini Department of Computing
Science, Jordan University of Science
[9] Energy Efficient Routing Protocols forMobile Ad
Hoc Networks1Chansu Yu Ben Lee Hee Yong Youn
[10] Mobile ad hoc networks: Problems and possible
solutions Matija Pužar Institutt for informatikk,
Universitetet i Oslo
[11] IRSHAD ULLAH SHOAIB UR REHMAN Analysis
of Black Hole Attack on MANETs Using Different
MANET Routing Protocols
[12] A Routing Algorithm for Wireless Ad Hoc Networks
with Unidirectional Links Ravi Prakash Department of
Computer ScienceUniversity of Texas at Dallas
Richardson, TX 75083-0688.
[13] S. Lu, L. Li, K.Y. Lam, L. Jia, “SAODV: A MANET
Routing Protocol that can Withstand Black Hole Attack.,”
International Conference on Computational Intelligence
and Security, 2009
[14] Y. Geng C. Hong-bing and H. Su-jun. Nhrpa: a
novel hierarchical routing protocol algorithm for wireless
sensor networks. China Universities of Posts and
Telecommunications, September 2008.
[15] Y. Geng C. Hong-bing and H. Su-jun. Nhrpa: a
novel hierarchical routing protocol algorithm for wireless
sensor networks. China Universities of Posts and
Telecommunications, September 2008.
[16] G. Hu D. Wu and G. Ni. Research and improve on
secure routing protocols in wireless sensor networks. In
4th IEEE International Conference on Circuits and
IJSRET @ 2013
International Journal of Scientific Research Engineering & Technology (IJSRET)
Volume 2 Issue 5 pp 267-273 August 2013
Systems for Communications (ICCSC 2008).
17] H. Zhang J. Chen and J. Hu. An eciency security
model of routing protocol in wireless sensor networks. In
2008 Second Asia International Conference on Modeling
and Simulation, pages 59{64, Washington, DC, USA,
2008
[18] C.Wang K. Zhang and C.Wang. A secure routing
protocol for cluster-based wireless sensor networks using
group key management. In 4th IEEE International
conference on Wireless Communications, Networking
and Mobile Computing (WiCOM08)
[19] M. A. Vilaa H. C. Wong M. Bern R. Dahab L. B.
Oliveira, A. Ferreira and A. A. F. Loureiro. Secleach-on
the
security
of
clustered
sensor
networks.
(87(12)):2882{2895, December 2007
[20] A. V. Reddy R. Srinath and R. Srinivasan. Ac:
Cluster based secure routing protocol for wsn. In Third
International Conference on Networking and Services,
page 45, Washington, DC, USA, 2007.
[21] K. Biswas and Md. Liaqat Ali, “Security threats in
Mobile Ad-Hoc Network”, Master Thesis, Blekinge
Institute of Technology” Sweden, 22nd March 2007
[22] M. Bern R. Dahab L. B. Oliveira, H. C. Wong and
A. A. F. Loureiro. Secleach - a random key distribution
solution for securing clustered sensor networks. In Fifth
IEEE International Symposium on Network Computing
and Applications, pages 145{154, Washington, DC, USA,
2006
[23] G. A. Pegueno and J. R. Rivera, “Extension to MAC
802.11 for performance Improvement in MANET”,
Karlstads University, Sweden, December 2006
[24] L. B. Oliveira E. Habib H. C. Wong A. C. Ferreira,
M. A. Vilaa and
A.A. Loureiro. Security of clusterbased communication protocols for wireless sensor
networks. In 4th IEEE International Conference on
Networking (ICN05), volume Lecture Notes in Computer
Science, pages 449{458, Washington, DC, USA, 2005.
[25] Jamal N. Al-karaki and Ahmed E. Kamal. Routing
techniques in wireless sensor networks: A survey. IEEE
Wireless Communications, 11:6{28, 2004.
[26] Georgios Smaragdakis, Ibrahim Matta, and Azer
Bestavrosl. Sep: A stable election protocol for clustered
heterogeneous wireless sensor networks. Proc. of the Intl
Workshop on SANPA, 2004
[27] C. Karlof and D. Wagner. Secure routing in sensor
networks:attacks and counter measures.Ad Hoc
Networks, 1:293315, May 2003.
www.ijsret.org
ISSN 2278 – 0882
[28] C.M barushimana, A.Shahrabi, “Comparative Study
of Reactive and Proactive Routing Protocols Performance
in Mobile Ad-Hoc Networks,” Workshop on Advance
Information Networking and Application, Vol. 2, pp. 679684, May, 2003
[29] S.Zhu, S.Setia, S.Jajodia, LEAP:efcient security
mechanisms for large scale distributed sensor
networks,10thACM Conference on Computer and
Communication
Security,
ACM
Press,
NewYork,2003,pp.6272
[30] H.Deng, W.Li and D.P.Agrawal, “Routing Security
in Wireless Ad-Hoc Networks,” University of Cincinnati,
IEEE Communication Magzine, Oct, 2002.
[31] H. Deng, W. Li, Agrawal, D.P., “Routing security in
wireless Ad-Hoc networks,” Cincinnati Univ.,OH, USA;
IEEE Communications Magazine, , Vol.40, pp.70- 75,
ISSN: 0163-6804, Oct. 2002.
[32] P.V.Jani, “Security within Ad-Hoc Networks,”
Position Paper, PAMPAS Workshop, Sept. 16/17 2002
[33] Wendi Rabiner Heinzelman, Anantha Ch, and Hari
Balakrishnan. Energy-e_cient communication protocol
for wireless microsensor networks. pages 3005{3014,
2000.
[34] T. Meng and R. Volkan. Distributed Network
Protocols for Wireless Communication. In Proc. IEEEE
ISCAS, May 1998.
[35] http://www.faqs.org/rfcs/rfc3561.html
IJSRET @ 2013