Sie sind auf Seite 1von 8

International Journal of Application or Innovation in Engineering & Management (IJAIEM)

Web Site: www.ijaiem.org Email: editor@ijaiem.org


Volume 5, Issue 11, November 2016

ISSN 2319 - 4847

Implementation of Extension Throughput-delay


Guaranteed Routing for Reliability (ExTeGaR) in
MANET of Wireless Network
Mr. Murali G 1, Dr. Vinayak Murthy2 , Dr. Balakrishna R3
1
Research Scholar, Reva University,
Associate Professor, Department of Information Science and Engineering
SJB Institute of Technology, Bangalore-560060, Karnataka, India
2

Professor School of Computer Science and Application, Reva University, Bangalore-560064, Karnataka, India
3

Principal and Professor Raja Rajeshwari College of Engineering Bangalore -560074, Karnataka, India

ABSTRACT
Rapid advances in Wireless ad hoc Networks that they become increasing complex. Consequently more applications and users
are becoming more demanding. Improving the quality of service (QoS), energy efficiency and consistency is an important
consideration in the wireless sensor networks. Due to the different types of traffics of various data, the path selection, QOS,
limited energy and communication among more number of nodes in wide area of range, it seems especially important to design
a routing algorithm for WSNs so that sensing data can be transmitted to the receiver effectively. We propose a novel protocol
named ExTeGaR (Extension Throughput-delay Guaranteed Routing for Reliability).It selects the neighbor node based upon
priority based expansion in neighbor size. And it maintains each QoS path by increasing the transmission range to expand
neighborhood size for alternate route creation. The aim of ExTeGaR is to provide routing scheme that supports heterogeneous
traffic by differentiating data into C1, C2, C3 andC4 traffic classes. In case, the traffics become higher, the nodes with less hop
count will be transmitting huge number of packets resulting in congestion or die faster. Therefore, the number of potential
neighbors decreases and will result in increase of lost packets. To overcome this problem, the algorithm adjusts its transmission
range to find more neighbors to create the new routes. Certainly, the increase of transmission range causes consumption of
higher energy to transmit a packet.

Keywords: Wireless Sensor Network (WSN), ExTeGaR, Quality of Service (QoS), Packet delivery ratio (PDR),
Average End-to-End delay and Average Throughput.

1. Introduction
Technology development in the areas of shrinking and wireless connectivity has led to the rapid development of
Wireless Sensor Networks (WSNs).Due to the different types of traffics of various data like vehicle traffic monitoring,
habitat monitoring, industrial automation, health applications, etc., WSNs are becoming the primary research field of
many scientists. Most research is related to the architecture, protocols, energy consumption, optimization and Quality
of Service (QoS) in WSNs. Since WSNs consist of wireless nodes, they mostly use batteries as primary power source.
Therefore, most traditional protocols are dealing with issues of energy conservation and prolonging network lifetime.
At the beginning of the WSN development, QoS was not given much attention, but with the appearance of critical,
multimedia and real-time applications, QoS is becoming increasingly significant. Furthermore, WSNs have an
increasing number of users and applications that require guaranteed WSNs performances.

2. RELATED WORK
Due to limited resources, versatile usage and various applications, WSNs should be [1]:
Energy efficient: Energy consumption must be highly constrained.
Application tailored: WSNs should support wide variety of applications.
Scalable: WSNs with huge amounts of nodes should operate normally.
Secure: WSNs should ensure data robustness, integrity and confidentiality.
Long term: Network lifetime should be very long.

Volume 5, Issue 11, November 2016

Page 1

International Journal of Application or Innovation in Engineering & Management (IJAIEM)


Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 11, November 2016

ISSN 2319 - 4847

The working cycle of a WSN can be divided into three phases:


Birth phase: Startup of a WSN. Includes initial organization, conFigureuration and optimization. Since this phase
could be highly energy consuming, it is necessary to develop initialization protocols with minimum energy
consumption. Owing to the fact that it is application dependent, it can be defined in several ways:
At least one node communicates with at least a one data collecting unit.
The entire communication structure has been set-up in a fully connected fashion.
A given percentage of the network is capable of communicating.
Life phase: the WSN is in full working mode; it performs detection, sensing, reporting and data transmitting. The
main goal in this phase is to maintain a predefined QoS.
Death phase: This phase starts with node failures, energy drainage, drastic topological changes or malicious attacks.
However the beginning of the death phase is different for different applications. The death phase could start with:
Failure of the first node.
Failure of the last node.
Lowering the QoS.
QoS is defined differently from the users and applications perspective and differently from the network perspective, as
described in [4]. Users are only concerned with the network services that directly impact the quality of the application,
while from the network perspective it is important to provide the desired QoS and in the same time, efficiently utilize
network resources. Due to the above mentioned reasons and some unique characteristics of WSNs, such as limited
resources, large-scale random deployment and novel data centric communication protocols; it is difficult to define
unique QoS parameters for various types of WSNs. In the literature [4, 5], authors propose different solutions to this
problem.
1.2 Q OS SUPPORT IN WSNS
In recent years, one of the main goals for researchers is how to provide the desired QoS to users and applications
inWSNs and in the same time reduce energy consumption and consequently prolong network lifetime.
1.3QoS Challenges in WSNs
The most important QoS challenges in WSNs are addressed below:
Limited resources and capabilities: QoS methods must be aware of limited resources and capabilities in WSNs such
as limited energy, bandwidth, memory, and processing and communication capabilities. Furthermore, there should
be balance between QoS level and energy consumption.
Node deployment: Unstructured networks have lower deployment cost than structured networks. However,
deterministic deployment solves problems of neighbor and path discovery and as a result QoS methods have
available geographical information of the nodes.
Dynamic network topology: It is standard challenge for mobile WSNs. However, almost all WSNs have dynamic
topology due to link failures, node power failures, or different power management mechanisms. QoS should not be
affected with network topology changes.
Scalability: QoS should not be affected with increasing or decreasing in number of nodes in WSNs.
Multi-source multi-sink systems: The best examples are wireless sensor-actuator networks that besides standard
challenges have issues on platform heterogeneity, service- oriented architecture, resource self-management and
security requirements.
In ad hoc networks, Quality of service support is becoming an inherent necessity rather than an additional feature of the
network. The following are the three main reasons that make a strong case for designing QoS enabled ad-hoc networks
rather than adding such features as an afterthought.
Wireless channel fluctuates rapidly and the fluctuations severely affected multi-hop flows.
Packets contend for the shared media on adjacent links of a flow.
Interference can effect transmissions at nodes beyond the neighbors.
QoS Routing: The QoS metrics of an end-to-end route depends on the links of the computed route. There are three
main challenges in computing a route satisfying QoS requirements.
QoS metrics that can be fulfilled at the network layer are the following:
Minimizing path latency/delay.
Maximizing routing reliability.

Volume 5, Issue 11, November 2016

Page 2

International Journal of Application or Innovation in Engineering & Management (IJAIEM)


Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 11, November 2016

ISSN 2319 - 4847

Minimizing energy consumption.


Minimizing congestion probability.
Providing effective sample rate.
QoS metrics that can be fulfilled at the transport layer are the following:
Maximizing end-to-end reliability.
Bandwidth/throughput fairness.
Minimizing congestion probability.
Minimizing energy consumption.

3.PROPOSED SYSTEM
Quality of service is refers to different notions at different networking layers. In proposed algorithm ExTeGaR, the
source node sends request to all nodes. It selects the neighbor node based upon priority based expansion in neighbor
size. And it maintains each QoS path by increasing the transmission range to expand neighborhood size for alternate
route creation. In case, the traffics become higher, the nodes with less hop count will be transmitting huge number of
packets resulting in congestion or die faster. Therefore, the number of potential neighbors decreases and will result in
increase of lost packets. To overcome this problem, the algorithm adjusts its transmission range to find more neighbors
to create the new routes. The performance of ExTeGaR is evaluated by using different parameters are: Packet Delivery
Ratio (PDR), Average Throughput, Average End-to End Delay, Energy consumption. The parameters are calculated by
using the following formulas:
Packet delivery ratio (PDR) = No. of Pkt _Rcvd / No. of Pkt_Send.
Avg.Troughput = (Rcvd_size / (Stop_time - Start_time)) * (8 /1000). Where Rcvd_size = Rcvd_size + Pkt_size.
Total_EnergyConsump= Total_Energy. Where Total_Energy = Total_Energy + Residual_Energy[i],
Residual_ Energy[i] =Initial_Energy[i] Energy[i].
Avg. End_to_End Delay = N-to-N Delay*1000.
2.1 Algorithm
Step1: Initialize the nodes
Initialization Ni, set F= Ni (lower hop),
M = Ni (equal hop)
Step2: Analyze the packets
Reserve 2 lower for C1, C2
Step3: Priority based delivery
Otherwise, for C3, C4
A = {attributes (Ecu), (AvgHop), (Ds),
(CHfail)}
Step4: Selection of packets based upon the priority
Step5: Route selection
best = {Ni,Mi : max(Ecu) min (AvgHop) min (Ds) min(Chfail)}
Step6: calculate the fitness function
Higher fitness value for C1,C2 packets, otherwise for C3, C4
Step7: Delay estimator
hopDelay [hopDelayCnt] = hDelay;
hopDelayCnt++
2.2 Results

Figureure 1: Source node sending request to all other nodes among 50 nodes.

Volume 5, Issue 11, November 2016

Page 3

International Journal of Application or Innovation in Engineering & Management (IJAIEM)


Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 11, November 2016

ISSN 2319 - 4847

:
Figure 2: Sending packets form source to destination node

Figure 3: Sending source node request to all other nodes among 75 nodes.

Figure 4: Sending packets from source to destination among 75 nodes.

Volume 5, Issue 11, November 2016

Page 4

International Journal of Application or Innovation in Engineering & Management (IJAIEM)


Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 11, November 2016

ISSN 2319 - 4847

Figure 5: Source node sending request to all other nodes among 100 nodes.

Figure 6: source nodes sending packets to destination nodes among 100 nodes.

Figure 7: Delay graph

Volume 5, Issue 11, November 2016

Page 5

International Journal of Application or Innovation in Engineering & Management (IJAIEM)


Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 11, November 2016

ISSN 2319 - 4847

Figure 8: Energy graph

Figure 9: Packet Delivery Ratio (PDR)

Figure 10: Throughput.

Volume 5, Issue 11, November 2016

Page 6

International Journal of Application or Innovation in Engineering & Management (IJAIEM)


Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 11, November 2016

ISSN 2319 - 4847

Table1: ExTeGaR parameters values of various nodes


No. of
Nodes

PDR

Avg.
Throughput
(kbps)

Total
Energy
consumption
(Joules)

Avg. End-toEnd
Delay(ms)

10

0.4259

88.32

16.9351

1105.33

15
20
25
30

0.4579
0.4731
0.4814
0.4855

143.79
199.04
253.87
307.84

24.9835
33.0465
41.0181
49.0438

1551.59
1906.41
1978.01
2118.24

Figure 11: ExTeGaR graph of different parameters values.

3.CONCLUSION
The proposed algorithm ExTeGaR will sends a request to all the nodes in network, before selecting the routing scheme.
It selects the neighbor node based upon priority based expansion in neighbor size. Due to increasing the traffics
become higher, the nodes with less hop count will be transmitting huge number of packets resulting in congestion or
die faster, The algorithm will adjusts its transmission range to find more neighbors to create the new routes.

References
[1] Josip Balen1, Drago Zagar and Goran Martinovic: Quality of Service in Wireless Sensor Networks: A Survey and
Related Patents Recent Patents on Computer Science 2011, 4, 188-202.
[2] Dohler M. Wireless Sensor Networks: The biggest cross community design exercise to-date. Recent Pat ComputSci
2008; 1:9-17.
[3] Yick J, Mukherjee B, Ghosal D. Wireless Sensor Network Survey. Comput Net 2008; 52: 2292-39.
[4] Chen D, Varshney PK. QoS Support in Wireless Sensor Networks: A survey. Proceedings of the 2004
International Conference on Wireless Networks. Las Vegas, USA, June 21-24, 2004.
[5] Wang Y, Liu X, Yin J. Requirements of Quality of Service in Wireless Sensor Network. Proceedings of the
International Conference on Networking, International Conference on Systems and International Conference on
Mobile Communications and Learning Technologies. Morne, Mauritius, April 23-29, 2006.
[6] C.R.Lin and J.S Liu. QoS routing in Ad hoc Wireless networks. IEEE Journal on Selected Area in
Communications, 17(8), 1999.
[7] Prasun Sinha. QoS Issues in Ad hoc Networks Ad hoc Technologies and Protocols.
[8] Rafael Paoliello Guimaraes Quality of Service on Ad-hoc Wireless Networks
[9] Dr.AnnaSaroVijendran,J.VijiGripsy,Enhanced Secure Multipath Routing Scheme in Mobile Adhoc and Sensor
Networks2nd International Conference on Current Trends in Engineering and Technology, ICCTET14.
[10] Ajay Arunachalam, Ohm Sornil, An Analysis of the Overhead and Energy Consumption in Flooding, Random
Walk and Gossip based Resource Discovery Protocols in MP2P Networks,2015 Fifth International Conference on
Advanced Computing & Communication Technologies

Volume 5, Issue 11, November 2016

Page 7

International Journal of Application or Innovation in Engineering & Management (IJAIEM)


Web Site: www.ijaiem.org Email: editor@ijaiem.org
Volume 5, Issue 11, November 2016

ISSN 2319 - 4847

[11] K.Naveen, DuraiDr.K.Baskaran Energy Efficient Random Cast DSR Protocol with Mediation Device in
MANET, International Conference on Advanced Computing and Communication Systems ( ICACCS -2013),
Dec. 19 21, 2013, Coimbatore, INDIA.
[12] Shiva Prakash, J. P. Saini, A review of Energy Efficient Routing Protocols for Mobile Ad Hoc Wireless
Networks, International Journal of Computer Information Systems, Vol. 1, No. 4, 2010.
[13] Dr. Mohammed Ali Hussain, M.RaviSankar, Vijaya Kumar Voleti,Y.SrinivasaRao,NallaLovanjaneyulu, Energy
Conservation Techniques in Ad hoc Networks, International Journal of Computer Science and Information
Technologies, Vol. 2 (3) , 2011, 1182-1186.

AUTHOR
MURALI G, 1Research Scholar, Reva University, Associate Professor, Department of Information
Science and
Engineering, SJB Institute of Technology, Bangalore-560060, Karnataka, India,
received the D.C.Sc, from KJTET in 1998, B.E and M.Tech in Computer Science and Engineering
from SJC Institute of Technology, in 2004 and 2008 respectively. Having around two years of
experience in Industry and 12 years of Teaching experience in reputed engineering colleges. Life
Member of ISTE (LMISTE) and IAENG etc.,
DR. M. VINAYAKAMURTHY

Professor (Assistant Director (R&D))


Having secured Ph. D. in "Computational Fluid Dynamics - Mathematics" from Bangalore University,
M.Sc. in Mathematics, B.Sc. in Mathematics from Bharathidasan University and B. Ed. degree in
Mathematics from Annamalai University, he has 23 years of teaching experience, teaching various
subjects like Discrete Mathematics, Probability and Statistics, Operations Research, System
Simulation and Modeling, Finite Automata Theory, Analysis and Design of Algorithms, Computer
Graphics, Data Mining & Data Warehousing and Numerical Methods. He is interested in guiding research in Data
Mining.
Dr .R.Balakrishna is currently working as a Principal & Professor, Dept of Information Science and
Engineering since 2010. His research and professional career spans about 15 years of Teaching &
research, 1 Year Industrial Experience at TCS. His expertise is primarily in the domains of Ad hoc
Networks, Mobile Computing, Networks, and Distributed OS. He obtained his M.Tech., from Maharshi
Dayanad University and subsequently Ph.D from Sri Krishnadevaraya University. He is a life member
of several organizations and societies like ISTE, IEEE, CSI, IAENG etc He has published 30 papers in
refereed International Journals, 23 papers in national and International Conferences. He has guided 9 M.Tech.
Scholars, 6 Masters and 40 B.E students for their academic project. Currently he is guiding 5 PhD scholars at VTU. 1
M.Sc.Engg. By Research at VTU.

Volume 5, Issue 11, November 2016

Page 8

Das könnte Ihnen auch gefallen