SlideShare a Scribd company logo
1 of 3
Download to read offline
International Journal of Soft Computing and Engineering (IJSCE)
ISSN: 2231-2307, Volume-5 Issue-1, March 2015
107
Published By:
Blue Eyes Intelligence Engineering
& Sciences Publication Pvt. Ltd.
Abstract—Nowadays there are large applications expanding for
the reliable transport of data packets from source node to the sink
node amongst them Mobile Ad hoc network (MANET) has very
vast extent of study. Different mobile sensor nodes are arbitrarily
positioned in given network without having much loss of data
packets in the network. It encompasses number of sensor nodes
having inadequate processing power, communicating over a
network. These sensors are scattered in specified network
environment so that they gathers data, process that data and send
it back to the destination. Various factors are affecting on data
transmission process like reporting rate, packet size. Here by
changing reporting rate, we calculate packet Delivery Ratio,
Packet loss Ratio as well as throughput, control overheads and
Energy consumption of a system.
Index Terms— Mobile Ad hoc Network; Reliability; Reporting
Rate; Packet Delivery ratio; Congestion Control.
I. INTRODUCTION
Mobile Ad hoc network is self-configuring, and
self-maintaining networks. Different Mobile sensor nodes are
randomly placed in given sensor field. As there are no
predefined network infrastructures, so mobile nodes are
continuously changing their positions Mobile nodes acts as
routers and they forward the data packets to the other nodes.
So the routes between nodes may potentially contain multiple
hops. Due to node mobility in MANET route may changes
very frequently. As mobile routers are connected with
wireless link which form random topology of a network. If
MANET is tied with Internet or any other private network
then it is called as Hybrid MANET [1].
MANET will provide full network flexibility which makes it
useful for natural disasters like tsunami, Earthquake; in
military applications, in extreme medical situations and so on,
MANET has many advantages like low cost, Easy and speed
of deployment, flexible and minimizes dependency on
network infrastructure. There may be chance of node
misbehaving means a node is agree to join the route but it does
not forward the packet to next hop node. It is doing so because
it wants to conserve its energy or due to launch a denial of
service attack or may be overload of data packets. To
minimize this, we use a Watchdog Timer Approach. In this
approach, each node governs that whether a node is
forwarded a packet or not, in same way, each node try to
monitor its forwarded node for efficient data packet
transmission process. Path rater is run by each node.
Manuscript Received on March 2015.
Prof. D. V. Biradar, Department of Information Technology, M. S. Bidve
Engineering College, S. R. T. M. U. Nanded University, Latur, India.
Prof. Praful P. Maktedar, Department of Information Technology, M. S.
Bidve Engineering College, S. R. T. M. U. Nanded University, Latur, India.
Each node assign rating to its known node such that
previously unknown nodes are assigns as neutral nodes with
rating 0.5. The suspected misbehaving nodes are rated with
negative value while other nodes having positive rating
between 0 to 0.8 value. Each node wills successfully forward
data packets must sent an acknowledgement to its previous
node [2]. In case of packet loss, node will send NACK means
Not Acknowledgement message to its previous node so that
retransmission of lost packet take placed. Fig.1 illustrate
Mobile Ad hoc network. It involves of 9 mobiles nodes. As
node R1 alternate its position then topology of network
transformed. So that new route must be found to convey
packets to node R1. It is not promising that all the nodes are
present in each other range.
Fig1. Mobile Ad hoc Network
Some of them are present in range of other 2 or more nodes as
well as some are out of range. Another concern is symmetrical
(bi-directional) and asymmetrical (unidirectional) links. As
shown in fig.1 node R2 is in the range of R3 node and node R3
is in the range of R2 node so they can communicate with each
other symmetrically. But node R5 and node R9 are not in the
range hence they link asymmetrically [3].
II. LITERATURE SURVEY
Richard j. La et al [4] suggested that Mobile Ad hoc Network
(MANET) is an association of mobile nodes which can build
and retain their network without any central authority. As
there is no switches and routers for forwarding packets so
each node is depends upon its neighboring node.
A location server will preserve locations of all the mobile
nodes in the network. But in case of MANET location server
is absent. The nodes are deployed in a given geographical
area may be vulnerable to attack by third party.
Here with the use of mobile nodes we make a virtual location
server which will provide location information of all nodes.
Due to distribution and recovery of locality evidence of nodes
routing overheads may arise. Each packet has its ID and
address of its destination node. If mobile nodes are
Performance Exploration of QoS parameters in
MANET
D.V. Biradar, Praful P. Maktedar
Performance Exploration of QoS parameters in MANET
108
Published By:
Blue Eyes Intelligence Engineering
& Sciences Publication Pvt. Ltd.
interrelated means if we know that the position of mobile
nodes and route covered by them then calculated routing
overheads goes on slightly increasing [5]. Shengbo Yang et al
[6] presents that in MANET if we prearranged the route of
data transmission then it is hard to sustain it. The route
discovery and recovery processes are also time and energy
consuming. If in case, the path breaks, then data packets will
get lost or delayed for long time until reconstruction of route.
This paper deals with problems of reliable delivery of data
packets.
It suggested Position Based Opportunistic Routing (POR)
Protocol. A time limit is set for packet forwarding process. If
any node does not forward the packet within certain time limit
then suboptimal candidate node will forward it according to
locally formed order. So all packets are either succeeds in
sending or receiving by candidate nodes leads to no
disturbance in data transmission process. In POP protocol,
additional selecting next hop node, several candidate nodes
are explicitly specified in case of link break and broken route
can recover in timely manner [7]. Xiaoqin Chen et al [8]
MANET is self-configuring, dynamic network in which nodes
are free to move. MANET selects multi hop paths for the data
packets transmission and its reliability is be influenced by
reliability of channel on each hop that link fluctuation. To
sidestep this, it projected a new channel adaptive routing
protocol which extends Ad hoc on Demand Multipath
Distance Vector (AOMDV) Routing protocol [9]. It used to
select stable links for path discovery. So that routes can be
used again when they are accessible again, rather than
discarded [10].
Handoff means getting range of signals anywhere within a
precise zone. Soft handoff is receiving a signal from next cell
without leaving previous cell. Hard handoff means breaking
signal while getting out of the cell. Through path
conservation, expected signal strength and channel average
fading duration are combined with handoff to conflict channel
fading and progress channel consumption [11].
III. PERFORMANCE ANALYSIS
We use Network Simulator (NS2) tool for simulation of
nodes present in a given network area. We take 50 nodes as
one of them is sink node. Reporting rate of packets is 10
packets per second. We use random topology. IEEE 802.11
Medium Access Control (MAC) protocol is used and Ad Hoc
on Demand Routing Protocol (AODV) routing protocol is
used. On the basis of this scenario we can draw the following
graphs.
Fig2. PDR is a function of reporting rate in packets per
second
Fig. 2 shows the graph of packet delivery ratio (PDR) in
percentage as a function of reporting rate in packets per
second. At the beginning, when reporting rate is 10, PDR is
high. But as reporting rate increases; PDR decreases. Because
due to increase in reporting rate, increases number of packets
in given network but processing speed of network and buffer
size is not increased hence congestion happens in given
network so that packets does not find a path to reach to
destination. Nodes that are added in given network go in
starvation mode. They neither transmitting data packets nor
receiving data packets which results in decreasing PDR rate
of a given network.
Fig.3. PLR as a function of reporting rate in packets per
second
Fig. 3 shows the graph of packet loss ratio (PLR) in
percentage as a function of reporting rate in packets per
second. At the beginning, when reporting rate is 10, PLR is
low. But as the reporting rate increases, PLR also increases
because of increase in number of nodes; it is able to receive
more packets at sink node. Hence there is increase in packet
drops due to this PLR rate slowly increases.
Fig.4. Throughput in kbps as a function of reporting rate
in packets per second
Fig. 4 shows the graph of Throughput in kbps as a function
of reporting rate in packets per second. At the beginning,
when reporting rate is 10 then throughput is low. But as the
reporting rate more increases throughput also increases
because data packets may get a clear path to reach to
destination.
International Journal of Soft Computing and Engineering (IJSCE)
ISSN: 2231-2307, Volume-5 Issue-1, March 2015
109
Published By:
Blue Eyes Intelligence Engineering
& Sciences Publication Pvt. Ltd.
Fig.5. Control Overheads as a function of reporting rate
in packets per second
Fig. 5 shows the graph of Control Overheads as a function of
reporting rate in packets per second. At the beginning, when
reporting rate is 10 then Control Overheads is low. But as the
reporting rate more increases Control Overheads also
increases because with handshaking process the connection is
established between source node and sink node and data
transmission process is started effectively.
Fig.6. Average Energy in joule as a function of reporting
rate in packets per second
Fig. 6 shows the graph of Average Energy in joule as a
function of reporting rate in packets per second. At the
beginning, when reporting rate is 10 then Average Energy is
high. But as the reporting rate more increases Average Energy
are decreases because initially energy is used for handshaking
process as well as deciding route for data transmission
process.
IV. CONCLUSION AND FUTURE WORK
In this paper, after examination of five graphs we
conclude that during the data transmission process we noted
down the precious changes occurred. From fig. 2 we had seen
that as reporting rate of data increases PDR rate is decreases.
Similarly from fig. 3 had seen that as reporting rate increases
PLR rate increases. From Fig. 4 we can say that Throughput is
dependent upon reporting rate of data. Fig. 5 shows that
control overheads are increases with increase in reporting
rate. Fig.6 shows average energy consumption is minimized
.It gives better results to the user. Hence it is prove that
reporting rate affects on number of packets received at
destination end during data transmission process
REFERENCES
[1] Lajos Hanzo, Rahim Tafazolli,”QoS aware Routing and Admission
Control in Shadow-Fading Environments for Multirate MANETs” in
IEEE journal, vol. 10, No. 5, May 2011.
[2] Mahmoud Al-Shugran, Osman Ghazali, Suhaidi Hassan, Kashif Nisar,
and A. Sukhi, M. Arif,”A qualitative Comparison Evaluation of the
Greedy forwarding Strategies in Mobile Ad hoc Network”, vol. 36, pp.
887-897, Nov. 2012.
[3] X. Xiang, X. Wang, Y. yang,”Supporting Efficient and Scalable
Multicast for Mobile andAd hoc Networks”, vol. 10, No 5, April 2011.
[4] Richard j. La and Eunyoung Seo,” Expected Routing Overheads for
location service in MANET under flat geographic routing”, vol. 10,
issue 3, March 2011.
[5] Seungjin Park, Seong-Moo Yoo”An Efficient Reliable one- hop
broadcast in Mobile Ad hoc Networks”, vol. 11, pp 19-28, April 2012.
[6] Shengbo Yang, Chai Kiat Yeo, Bu Sung Lee ,“Towards Reliable data
delivery for highly Dynamic Mobile Ad hoc Networks” Journal IEEE
transactions on parallel and Distributed Syatems, vol. 22, issues 12, pp
2100-2107, Dec. 2011.
[7] D.G. Reina, S.L. Toral, P. Johnson and F. Barreiro,”A Reliable Route
Selection based on Caution Zone and Arrival Angle”, IEEE
communication letters, vol. 15, issues 11, pp. 1252-1255, Nov. 2011.
[8] Xiaoqin Chen, Haley M. Jones and Dhammika Jayalath,” Channel
aware Routing in MANET with route Handoff”, vol. 10, issues 1, Jan
2011.
[9] Robert J.Hall,” An Improved Geocast for Mobile Ad hoc Networks”,
IEEE communication letters, vol. 10, No. 2, Feb. 2011.
[10] Zhan Bo Su, Yuan Ming Wu,”Prediction based Event to Sink
Reliability in Wireless Sensor Network”, vol. 1, pp. 4244-4249, 2009.
[11] Zhenzhen Ye ,AlhussionA.Abouzeid,” Optimal Stochastic Location
updates in mobile Ad Hoc Networks”, vol. 10, No. 5, May 2011.
Mr. D. V. Biradar, HOD, Information Technology
Department, M.S. Bidve Engineering College, holds
Bachelors and Master’s Degree of Engineering in
Electronics from SRTMU, Nanded University,
state Maharashtra, country India in 2003 . Currently
he is doing his research work in Mobile Ad hoc
Network and Wireless Sensor Networks. His 23
years of teaching experience is an asset to the
organization. He is working as Associate Professor
in Department of IT, His expertise in the field of Wireless computer
Networks and Embedded system helps in guidance to the PG students.
Mr. Praful P. Maktedar, Assistant Professor,
Information Technology Department, M.S. Bidve
Engineering College, holds Bachelor’s Degree of
Engineering in IT from SRTMU, Nanded
University, and Master’s Degree in IT from Pune
University, state Maharashtra, country India in
2015. Currently he is doing his research work in
Wireless Sensor Networks and Network Security.
He is w orking as Assistan t Professor in
Department of IT.

More Related Content

What's hot

Prediction Algorithm for Mobile Ad Hoc Network Connection Breaks
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksPrediction Algorithm for Mobile Ad Hoc Network Connection Breaks
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksIJCNCJournal
 
Iisrt arunkumar b (networks)
Iisrt arunkumar b (networks)Iisrt arunkumar b (networks)
Iisrt arunkumar b (networks)IISRT
 
Performance Evaluation and Comparison of Ad-Hoc Source Routing Protocols
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsPerformance Evaluation and Comparison of Ad-Hoc Source Routing Protocols
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsNarendra Singh Yadav
 
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...IOSR Journals
 
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...IOSR Journals
 
MANET Routing Protocols , a case study
MANET Routing Protocols , a case studyMANET Routing Protocols , a case study
MANET Routing Protocols , a case studyRehan Hattab
 
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORK
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORK
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKIJCSIT Journal
 
A Study of Routing Techniques in Intermittently Connected MANETs
A Study of Routing Techniques in Intermittently Connected MANETsA Study of Routing Techniques in Intermittently Connected MANETs
A Study of Routing Techniques in Intermittently Connected MANETsIJORCS
 
Effective Path Identification Protocol for Wireless Mesh Networks
Effective Path Identification Protocol for Wireless Mesh NetworksEffective Path Identification Protocol for Wireless Mesh Networks
Effective Path Identification Protocol for Wireless Mesh NetworksIDES Editor
 
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environment
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc EnvironmentComparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environment
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environmentijsrd.com
 
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...ijngnjournal
 
The Impact of Signal Strength over Routing Protocols in Wireless Networks
The Impact of Signal Strength over Routing Protocols in Wireless NetworksThe Impact of Signal Strength over Routing Protocols in Wireless Networks
The Impact of Signal Strength over Routing Protocols in Wireless NetworksDr. Amarjeet Singh
 
1 p pranitha final_paper--1-5
1 p pranitha final_paper--1-51 p pranitha final_paper--1-5
1 p pranitha final_paper--1-5Alexander Decker
 
Cross-layer based performance optimization for different mobility and traffic...
Cross-layer based performance optimization for different mobility and traffic...Cross-layer based performance optimization for different mobility and traffic...
Cross-layer based performance optimization for different mobility and traffic...IOSR Journals
 

What's hot (19)

Prediction Algorithm for Mobile Ad Hoc Network Connection Breaks
Prediction Algorithm for Mobile Ad Hoc Network Connection BreaksPrediction Algorithm for Mobile Ad Hoc Network Connection Breaks
Prediction Algorithm for Mobile Ad Hoc Network Connection Breaks
 
Ag26204209
Ag26204209Ag26204209
Ag26204209
 
Iisrt arunkumar b (networks)
Iisrt arunkumar b (networks)Iisrt arunkumar b (networks)
Iisrt arunkumar b (networks)
 
Performance Evaluation and Comparison of Ad-Hoc Source Routing Protocols
Performance Evaluation and Comparison of Ad-Hoc Source Routing ProtocolsPerformance Evaluation and Comparison of Ad-Hoc Source Routing Protocols
Performance Evaluation and Comparison of Ad-Hoc Source Routing Protocols
 
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...
Analyzing the Effect of Varying CBR on AODV, DSR, IERP Routing Protocols in M...
 
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
Design Test-bed for assessing load utilising using Multicast Forwarding Appro...
 
Be31390392
Be31390392Be31390392
Be31390392
 
Hu3114871491
Hu3114871491Hu3114871491
Hu3114871491
 
MANET Routing Protocols , a case study
MANET Routing Protocols , a case studyMANET Routing Protocols , a case study
MANET Routing Protocols , a case study
 
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORK
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORKANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORK
ANALYSIS OF ROUTING PROTOCOLS IN WIRELESS MESH NETWORK
 
A Study of Routing Techniques in Intermittently Connected MANETs
A Study of Routing Techniques in Intermittently Connected MANETsA Study of Routing Techniques in Intermittently Connected MANETs
A Study of Routing Techniques in Intermittently Connected MANETs
 
E010322531
E010322531E010322531
E010322531
 
Effective Path Identification Protocol for Wireless Mesh Networks
Effective Path Identification Protocol for Wireless Mesh NetworksEffective Path Identification Protocol for Wireless Mesh Networks
Effective Path Identification Protocol for Wireless Mesh Networks
 
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environment
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc EnvironmentComparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environment
Comparatively analysis of AODV and DSR in MAC layer for Ad Hoc Environment
 
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...
IMPLEMENTATION AND COMPARISION OF DATA LINK QUALITY SCHEME ON ODMRP AND ADMR ...
 
The Impact of Signal Strength over Routing Protocols in Wireless Networks
The Impact of Signal Strength over Routing Protocols in Wireless NetworksThe Impact of Signal Strength over Routing Protocols in Wireless Networks
The Impact of Signal Strength over Routing Protocols in Wireless Networks
 
1 p pranitha final_paper--1-5
1 p pranitha final_paper--1-51 p pranitha final_paper--1-5
1 p pranitha final_paper--1-5
 
Cross-layer based performance optimization for different mobility and traffic...
Cross-layer based performance optimization for different mobility and traffic...Cross-layer based performance optimization for different mobility and traffic...
Cross-layer based performance optimization for different mobility and traffic...
 
47 50
47 5047 50
47 50
 

Similar to A2546035115

Opportunistic Data Forwarding in Manet
Opportunistic Data Forwarding in ManetOpportunistic Data Forwarding in Manet
Opportunistic Data Forwarding in ManetIJTET Journal
 
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK cscpconf
 
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...IJCERT
 
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc Networks
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc NetworksBroadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc Networks
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc NetworksIJCNCJournal
 
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKS
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKSBROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKS
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKSIJCNCJournal
 
Review on buffer management schemes for packet queues in wired & wireless net...
Review on buffer management schemes for packet queues in wired & wireless net...Review on buffer management schemes for packet queues in wired & wireless net...
Review on buffer management schemes for packet queues in wired & wireless net...IJERA Editor
 
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACESDATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACEScscpconf
 
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...IJSRD
 
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS ijasuc
 
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS ijasuc
 
“Reducing packet loss in manet”
“Reducing packet loss in manet”“Reducing packet loss in manet”
“Reducing packet loss in manet”Alexander Decker
 
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...Editor IJCATR
 
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ijasuc
 
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANET
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETIMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANET
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETijcsa
 
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKS
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSDATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKS
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSEditor IJMTER
 
A scalable and power efficient solution for routing in mobile ad hoc network ...
A scalable and power efficient solution for routing in mobile ad hoc network ...A scalable and power efficient solution for routing in mobile ad hoc network ...
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
 
Secure Multicast Communication using Behavioural Measurement Technique in MANET
Secure Multicast Communication using Behavioural Measurement Technique in MANET Secure Multicast Communication using Behavioural Measurement Technique in MANET
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
 

Similar to A2546035115 (20)

E0942531
E0942531E0942531
E0942531
 
i2ct_submission_105
i2ct_submission_105i2ct_submission_105
i2ct_submission_105
 
Opportunistic Data Forwarding in Manet
Opportunistic Data Forwarding in ManetOpportunistic Data Forwarding in Manet
Opportunistic Data Forwarding in Manet
 
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK
MOBILITY AWARE ROUTING PROTOCOL IN AD-HOC NETWORK
 
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...
Consistent Data Release in MANET Using Light Weight Verification Algorithm wi...
 
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc Networks
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc NetworksBroadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc Networks
Broadcast Scheduling Protocols in Multi-Hop Mobile Ad hoc Networks
 
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKS
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKSBROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKS
BROADCAST SCHEDULING PROTOCOLS IN MULTIHOP MOBILE AD HOC NETWORKS
 
Review on buffer management schemes for packet queues in wired & wireless net...
Review on buffer management schemes for packet queues in wired & wireless net...Review on buffer management schemes for packet queues in wired & wireless net...
Review on buffer management schemes for packet queues in wired & wireless net...
 
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACESDATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES
DATA FORWARDING IN OPPORTUNISTIC NETWORK USING MOBILE TRACES
 
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...
An Efficient DTN Routing Algorithm for Automatic Crime Information Sharing fo...
 
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
 
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
SECURED GREEDY PERIMETER STATELESS ROUTING FOR WIRELESS SENSOR NETWORKS
 
“Reducing packet loss in manet”
“Reducing packet loss in manet”“Reducing packet loss in manet”
“Reducing packet loss in manet”
 
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
A Multiparametric Reliable AODV Protocol using Alternate Routing in MANET’s u...
 
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...
ANALYSIS OF PROACTIVE AND REACTIVE MANET ROUTING PROTOCOLS UNDER SELECTED TCP...
 
Position based Opportunistic routing in MANET
Position based Opportunistic routing in MANETPosition based Opportunistic routing in MANET
Position based Opportunistic routing in MANET
 
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANET
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANETIMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANET
IMPROVING PACKET DELIVERY RATIO WITH ENHANCED CONFIDENTIALITY IN MANET
 
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKS
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKSDATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKS
DATA TRANSPARENT AUTHENTICATION USING QOD IN HYBRID NETWORKS
 
A scalable and power efficient solution for routing in mobile ad hoc network ...
A scalable and power efficient solution for routing in mobile ad hoc network ...A scalable and power efficient solution for routing in mobile ad hoc network ...
A scalable and power efficient solution for routing in mobile ad hoc network ...
 
Secure Multicast Communication using Behavioural Measurement Technique in MANET
Secure Multicast Communication using Behavioural Measurement Technique in MANET Secure Multicast Communication using Behavioural Measurement Technique in MANET
Secure Multicast Communication using Behavioural Measurement Technique in MANET
 

A2546035115

  • 1. International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-5 Issue-1, March 2015 107 Published By: Blue Eyes Intelligence Engineering & Sciences Publication Pvt. Ltd. Abstract—Nowadays there are large applications expanding for the reliable transport of data packets from source node to the sink node amongst them Mobile Ad hoc network (MANET) has very vast extent of study. Different mobile sensor nodes are arbitrarily positioned in given network without having much loss of data packets in the network. It encompasses number of sensor nodes having inadequate processing power, communicating over a network. These sensors are scattered in specified network environment so that they gathers data, process that data and send it back to the destination. Various factors are affecting on data transmission process like reporting rate, packet size. Here by changing reporting rate, we calculate packet Delivery Ratio, Packet loss Ratio as well as throughput, control overheads and Energy consumption of a system. Index Terms— Mobile Ad hoc Network; Reliability; Reporting Rate; Packet Delivery ratio; Congestion Control. I. INTRODUCTION Mobile Ad hoc network is self-configuring, and self-maintaining networks. Different Mobile sensor nodes are randomly placed in given sensor field. As there are no predefined network infrastructures, so mobile nodes are continuously changing their positions Mobile nodes acts as routers and they forward the data packets to the other nodes. So the routes between nodes may potentially contain multiple hops. Due to node mobility in MANET route may changes very frequently. As mobile routers are connected with wireless link which form random topology of a network. If MANET is tied with Internet or any other private network then it is called as Hybrid MANET [1]. MANET will provide full network flexibility which makes it useful for natural disasters like tsunami, Earthquake; in military applications, in extreme medical situations and so on, MANET has many advantages like low cost, Easy and speed of deployment, flexible and minimizes dependency on network infrastructure. There may be chance of node misbehaving means a node is agree to join the route but it does not forward the packet to next hop node. It is doing so because it wants to conserve its energy or due to launch a denial of service attack or may be overload of data packets. To minimize this, we use a Watchdog Timer Approach. In this approach, each node governs that whether a node is forwarded a packet or not, in same way, each node try to monitor its forwarded node for efficient data packet transmission process. Path rater is run by each node. Manuscript Received on March 2015. Prof. D. V. Biradar, Department of Information Technology, M. S. Bidve Engineering College, S. R. T. M. U. Nanded University, Latur, India. Prof. Praful P. Maktedar, Department of Information Technology, M. S. Bidve Engineering College, S. R. T. M. U. Nanded University, Latur, India. Each node assign rating to its known node such that previously unknown nodes are assigns as neutral nodes with rating 0.5. The suspected misbehaving nodes are rated with negative value while other nodes having positive rating between 0 to 0.8 value. Each node wills successfully forward data packets must sent an acknowledgement to its previous node [2]. In case of packet loss, node will send NACK means Not Acknowledgement message to its previous node so that retransmission of lost packet take placed. Fig.1 illustrate Mobile Ad hoc network. It involves of 9 mobiles nodes. As node R1 alternate its position then topology of network transformed. So that new route must be found to convey packets to node R1. It is not promising that all the nodes are present in each other range. Fig1. Mobile Ad hoc Network Some of them are present in range of other 2 or more nodes as well as some are out of range. Another concern is symmetrical (bi-directional) and asymmetrical (unidirectional) links. As shown in fig.1 node R2 is in the range of R3 node and node R3 is in the range of R2 node so they can communicate with each other symmetrically. But node R5 and node R9 are not in the range hence they link asymmetrically [3]. II. LITERATURE SURVEY Richard j. La et al [4] suggested that Mobile Ad hoc Network (MANET) is an association of mobile nodes which can build and retain their network without any central authority. As there is no switches and routers for forwarding packets so each node is depends upon its neighboring node. A location server will preserve locations of all the mobile nodes in the network. But in case of MANET location server is absent. The nodes are deployed in a given geographical area may be vulnerable to attack by third party. Here with the use of mobile nodes we make a virtual location server which will provide location information of all nodes. Due to distribution and recovery of locality evidence of nodes routing overheads may arise. Each packet has its ID and address of its destination node. If mobile nodes are Performance Exploration of QoS parameters in MANET D.V. Biradar, Praful P. Maktedar
  • 2. Performance Exploration of QoS parameters in MANET 108 Published By: Blue Eyes Intelligence Engineering & Sciences Publication Pvt. Ltd. interrelated means if we know that the position of mobile nodes and route covered by them then calculated routing overheads goes on slightly increasing [5]. Shengbo Yang et al [6] presents that in MANET if we prearranged the route of data transmission then it is hard to sustain it. The route discovery and recovery processes are also time and energy consuming. If in case, the path breaks, then data packets will get lost or delayed for long time until reconstruction of route. This paper deals with problems of reliable delivery of data packets. It suggested Position Based Opportunistic Routing (POR) Protocol. A time limit is set for packet forwarding process. If any node does not forward the packet within certain time limit then suboptimal candidate node will forward it according to locally formed order. So all packets are either succeeds in sending or receiving by candidate nodes leads to no disturbance in data transmission process. In POP protocol, additional selecting next hop node, several candidate nodes are explicitly specified in case of link break and broken route can recover in timely manner [7]. Xiaoqin Chen et al [8] MANET is self-configuring, dynamic network in which nodes are free to move. MANET selects multi hop paths for the data packets transmission and its reliability is be influenced by reliability of channel on each hop that link fluctuation. To sidestep this, it projected a new channel adaptive routing protocol which extends Ad hoc on Demand Multipath Distance Vector (AOMDV) Routing protocol [9]. It used to select stable links for path discovery. So that routes can be used again when they are accessible again, rather than discarded [10]. Handoff means getting range of signals anywhere within a precise zone. Soft handoff is receiving a signal from next cell without leaving previous cell. Hard handoff means breaking signal while getting out of the cell. Through path conservation, expected signal strength and channel average fading duration are combined with handoff to conflict channel fading and progress channel consumption [11]. III. PERFORMANCE ANALYSIS We use Network Simulator (NS2) tool for simulation of nodes present in a given network area. We take 50 nodes as one of them is sink node. Reporting rate of packets is 10 packets per second. We use random topology. IEEE 802.11 Medium Access Control (MAC) protocol is used and Ad Hoc on Demand Routing Protocol (AODV) routing protocol is used. On the basis of this scenario we can draw the following graphs. Fig2. PDR is a function of reporting rate in packets per second Fig. 2 shows the graph of packet delivery ratio (PDR) in percentage as a function of reporting rate in packets per second. At the beginning, when reporting rate is 10, PDR is high. But as reporting rate increases; PDR decreases. Because due to increase in reporting rate, increases number of packets in given network but processing speed of network and buffer size is not increased hence congestion happens in given network so that packets does not find a path to reach to destination. Nodes that are added in given network go in starvation mode. They neither transmitting data packets nor receiving data packets which results in decreasing PDR rate of a given network. Fig.3. PLR as a function of reporting rate in packets per second Fig. 3 shows the graph of packet loss ratio (PLR) in percentage as a function of reporting rate in packets per second. At the beginning, when reporting rate is 10, PLR is low. But as the reporting rate increases, PLR also increases because of increase in number of nodes; it is able to receive more packets at sink node. Hence there is increase in packet drops due to this PLR rate slowly increases. Fig.4. Throughput in kbps as a function of reporting rate in packets per second Fig. 4 shows the graph of Throughput in kbps as a function of reporting rate in packets per second. At the beginning, when reporting rate is 10 then throughput is low. But as the reporting rate more increases throughput also increases because data packets may get a clear path to reach to destination.
  • 3. International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-5 Issue-1, March 2015 109 Published By: Blue Eyes Intelligence Engineering & Sciences Publication Pvt. Ltd. Fig.5. Control Overheads as a function of reporting rate in packets per second Fig. 5 shows the graph of Control Overheads as a function of reporting rate in packets per second. At the beginning, when reporting rate is 10 then Control Overheads is low. But as the reporting rate more increases Control Overheads also increases because with handshaking process the connection is established between source node and sink node and data transmission process is started effectively. Fig.6. Average Energy in joule as a function of reporting rate in packets per second Fig. 6 shows the graph of Average Energy in joule as a function of reporting rate in packets per second. At the beginning, when reporting rate is 10 then Average Energy is high. But as the reporting rate more increases Average Energy are decreases because initially energy is used for handshaking process as well as deciding route for data transmission process. IV. CONCLUSION AND FUTURE WORK In this paper, after examination of five graphs we conclude that during the data transmission process we noted down the precious changes occurred. From fig. 2 we had seen that as reporting rate of data increases PDR rate is decreases. Similarly from fig. 3 had seen that as reporting rate increases PLR rate increases. From Fig. 4 we can say that Throughput is dependent upon reporting rate of data. Fig. 5 shows that control overheads are increases with increase in reporting rate. Fig.6 shows average energy consumption is minimized .It gives better results to the user. Hence it is prove that reporting rate affects on number of packets received at destination end during data transmission process REFERENCES [1] Lajos Hanzo, Rahim Tafazolli,”QoS aware Routing and Admission Control in Shadow-Fading Environments for Multirate MANETs” in IEEE journal, vol. 10, No. 5, May 2011. [2] Mahmoud Al-Shugran, Osman Ghazali, Suhaidi Hassan, Kashif Nisar, and A. Sukhi, M. Arif,”A qualitative Comparison Evaluation of the Greedy forwarding Strategies in Mobile Ad hoc Network”, vol. 36, pp. 887-897, Nov. 2012. [3] X. Xiang, X. Wang, Y. yang,”Supporting Efficient and Scalable Multicast for Mobile andAd hoc Networks”, vol. 10, No 5, April 2011. [4] Richard j. La and Eunyoung Seo,” Expected Routing Overheads for location service in MANET under flat geographic routing”, vol. 10, issue 3, March 2011. [5] Seungjin Park, Seong-Moo Yoo”An Efficient Reliable one- hop broadcast in Mobile Ad hoc Networks”, vol. 11, pp 19-28, April 2012. [6] Shengbo Yang, Chai Kiat Yeo, Bu Sung Lee ,“Towards Reliable data delivery for highly Dynamic Mobile Ad hoc Networks” Journal IEEE transactions on parallel and Distributed Syatems, vol. 22, issues 12, pp 2100-2107, Dec. 2011. [7] D.G. Reina, S.L. Toral, P. Johnson and F. Barreiro,”A Reliable Route Selection based on Caution Zone and Arrival Angle”, IEEE communication letters, vol. 15, issues 11, pp. 1252-1255, Nov. 2011. [8] Xiaoqin Chen, Haley M. Jones and Dhammika Jayalath,” Channel aware Routing in MANET with route Handoff”, vol. 10, issues 1, Jan 2011. [9] Robert J.Hall,” An Improved Geocast for Mobile Ad hoc Networks”, IEEE communication letters, vol. 10, No. 2, Feb. 2011. [10] Zhan Bo Su, Yuan Ming Wu,”Prediction based Event to Sink Reliability in Wireless Sensor Network”, vol. 1, pp. 4244-4249, 2009. [11] Zhenzhen Ye ,AlhussionA.Abouzeid,” Optimal Stochastic Location updates in mobile Ad Hoc Networks”, vol. 10, No. 5, May 2011. Mr. D. V. Biradar, HOD, Information Technology Department, M.S. Bidve Engineering College, holds Bachelors and Master’s Degree of Engineering in Electronics from SRTMU, Nanded University, state Maharashtra, country India in 2003 . Currently he is doing his research work in Mobile Ad hoc Network and Wireless Sensor Networks. His 23 years of teaching experience is an asset to the organization. He is working as Associate Professor in Department of IT, His expertise in the field of Wireless computer Networks and Embedded system helps in guidance to the PG students. Mr. Praful P. Maktedar, Assistant Professor, Information Technology Department, M.S. Bidve Engineering College, holds Bachelor’s Degree of Engineering in IT from SRTMU, Nanded University, and Master’s Degree in IT from Pune University, state Maharashtra, country India in 2015. Currently he is doing his research work in Wireless Sensor Networks and Network Security. He is w orking as Assistan t Professor in Department of IT.