0910 0118 0904 0501 0101074

Dr. K. Madhavi et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.1, Issue 1,27 October 2016, pg. 16-21

A Fuzzy Based Dynamic Queue Management Approach to Improve QOS in Wireless sensor Networks Dr. K. Madhavi 1, N. Ushasree 2 ¹ Assistant Professor, Department of CSE, JNTUACE, JNTUA, Anantapuramu, Andhra Pradesh, India. ² Student of M.Tech, Department of CSE, JNTUACE, JNTUA, Anantapuramu, Andhra Pradesh, India.

1

kasamadhavi.cse@jntua.ac.in 2 usha.nyasala@gmail.com

Abstract— Wireless Sensor Networks (WSNs) are predicted to be the following iteration of networks which will kind an indispensable a part of man’s lives and which furnish a bridge between the true bodily and virtual worlds. WSNs will have to be able to aid more than a few functions over the same platform. Specific applications would have unique QoS requirements helping the preliminary specifications for delivering Quality of services (QoS), which is fundamental for numerous purposes, is directly concerning energy consumption, delay, reliability, distortion, and community lifetime. There may be an inevitable correlation between quality of accessible service levels in WSNs and power consumption in these networks, while acquiring any of those bases acquires the influential interface on the other.

Keywords—Data integrity, Delay differentiated services, Dynamic routing, Potential field, Wireless sensor networks.

I. INTRODUCTION

Dynamic Routing for data Integrity and delay Differentiated services in wireless Sensor Networks addressed and analyzed two general QoS standards of WSNs specifically low delay and excessive information integrity. This work customarily focused on improving the data constancy for integrity-sensitive applications as well as reduces the top-to-end delay for delay-sensitive functions when the network is bottlenecked. For this purpose, multi-course dynamic routing algorithm IDDR (integrity and delay Differentiated routing) is offered with the adoption of the suggestion of the expertise subject from the self-discipline of physics to separate the packets of purposes in keeping with the weight assigned to every packet. These are capable to help various applications over the same platform. Distinct purposes would have exceptional QoS standards. For illustration, in a fireplace monitoring application, the event of a hearth alarm will have to be mentioned to the sink as quickly as possible.

Alternatively, some functions require most of their packets to efficiently arrive at the sink regardless of after they arrive. For illustration, in habitat monitoring functions, the advent of packets is allowed to have a extend, however the sink will have to acquire many of the packets.

1. WSNs have two basic QoS requirements: low delay and high data integrity, leading to what are called delay sensitive applications and high-integrity applications, respectively.

Almost always, in a network with mild load, both requisites can also be easily satisfied.

2. However, a closely loaded network will suffer congestion, which raises the top-tofinish extend. This work pursuits to concurrently reinforce the fidelity for topintegrity functions and lower the top-to-end prolong for delay-sensitive ones, even when the community is congested. We borrow the inspiration of abilities area from the self-discipline of physics and design a novel advantage founded routing 16 © 2016, IJARIDEA All Rights Reserved

Dr. K. Madhavi et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.1, Issue 1,27 October 2016, pg. 16-21

algorithm, which is called integrity and delay differentiated routing (IDDR). IDDR is ready to provide the following two services: 1. Improve fidelity for high-integrity functions. The elemental notion is to seek out as a lot buffer space as possible as from the idle and/or under-loaded paths to cache the excessive packets that probably dropped on the shortest route. Consequently, the first venture is to find these idle and/or under loaded paths, then the 2nd project is to cache the packets efficaciously for subsequent transmission. IDDR constructs a competencies subject according to the depth1 and queue length knowledge to find the beneath-utilized paths. The packets with high integrity requirement will probably be forwarded to the following hop with smaller queue size. A mechanism known as Implicit Hop-with the aid of-Hop fee manage is designed to make packet caching more effective.

2. Decrease end-to-end delay for delay-sensitive applications. Each and every utility is assigned a weight, which represents the measure of sensitivity to the extend. By means of building local dynamic knowledge fields with specific slopes according to the burden values carried with the aid of packets, IDDR enables the packets with higher weight to select shorter paths. Furthermore, IDDR also employs the precedence queue to extra cut back the queuing delay of extend sensitive packets.

IDDR inherently avoids the conflict between excessive integrity and low delay: the highintegrity packets are cached on the underneath loaded paths alongside which packets will undergo massive end-to-finish extend considering of more hops, and the extend sensitive packets journey along shorter paths to process the sink as quickly as viable. Using the Lyapunov glide concept, we prove that IDDR is steady. Additionally, the results of a sequence of simulations carried out on the TOSSIM platform show the effectivity and feasibility of the IDDR scheme.

II. RELATED WORK

An Most QoS provisioning protocols proposed for natural ad hoc networks have enormous overhead prompted by using end-to-end path discovery and resource reservation. For this reason, they aren't suitable for resource-confined WSNs. Some mechanisms had been designed to provide QoS services primarily for WSNs. Here we typically focus on the metrics of extend and reliability.

A. Providing Real-Time Service

RAP exploits the notion of speed and proposes a pace monotonic scheduling policy to decrease the ratio of neglected cut-off dates. However, the worldwide information of network topology is required. Implicit Earliest time limit First (EDF) on the whole makes use of a medium entry manage protocol to furnish actual-time provider. The implicit prioritization is used as a substitute of relying on manipulate packets as most different protocols do. Pace keeps a favored delivery velocity throughout the community by means of a novel mixture of feedback manipulate and non-deterministic QoS-conscious geographic forwarding .In a twohop neighbor knowledge-situated gradient routing mechanism is proposed to enhance actualtime performance. The routing selection is made headquartered on the number of hops from a source to the sink and the two-hop knowledge.

B. Providing Reliability Service Surface

Adaptive Forwarding Scheme (AFS) employs the packet precedence to determine the forwarding behavior to manipulate the reliability. ReInforM uses the proposal of dynamic packet states to manipulate the quantity of paths required for the favored reliability .

Nevertheless, both of AFS and ReInforM require to know the global network topology.

17 Š 2016, IJARIDEA All Rights Reserved

Dr. K. Madhavi et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.1, Issue 1,27 October 2016, pg. 16-21

LIEMRO makes use of a dynamic direction renovation mechanism to monitor the first-class of the lively paths in the course of community operation and regulates the injected traffic fee of the paths in keeping with the contemporary perceived paths great. However, it does now not recollect the effects of buffer potential and service cost of the energetic nodes to estimate and alter the site visitors expense of the lively paths.

C. Providing Real-Time and Reliable Services

MMSPEED extends pace for service differentiation and probabilistic QoS assurance.

It uses the identical mechanism as speed to satisfy the prolong necessities for distinctive forms of site visitors, and uses redundant paths to protect accuracy.

The MAC layer operate is modified to furnish prioritized access and trustworthy multicast supply of packets to more than one neighbors. Nevertheless, when the community is congested, the entire source nodes nonetheless continuously transmit packets to the sink alongside multipaths without taking some other mechanisms, equivalent to caching packets for some time.

III. EXISTING SYSTEM

1. Most QoS provisioning protocols proposed for usual advert hoc networks have enormous overhead brought about by way of finish-to-end course discovery and useful resource reservation. As a consequence, they are not suitable for useful resourcerestrained WSNs. Some mechanisms have been designed to provide QoS offerings particularly for WSNs. 2. Adaptive Forwarding Scheme (AFS) employs the packet priority to check the forwarding habits to control the reliability.

3. LIEMRO utilizes a dynamic path preservation Mechanism to watch the pleasant of the lively paths for the duration of network operation and regulates the injected visitors expense of the paths in line with the modern-day perceived paths high-quality.

A. Disadvantages of Existing System

1. It does not consider the effects of buffer capacity and service rate of the lively nodes to estimate and adjust the site visitors fee of the active paths.

2. This may increasingly reason congestion and for that reason lead to many excessive integrity packets loss and big finish-to-end extend for extend sensitive packets.

3. Delay-sensitive packets occupy the restricted bandwidth and buffers, worsening drops of excessive-integrity ones.

4. High-integrity packets block the shortest paths, compelling the prolong-sensitive packets to journey extra hops before accomplishing the sink, which increases the prolong.

5. High-integrity packets occupy the buffers, which also rises the queuing extend of extend-sensitive packets.

IV. PROPOSED SYSTEM

This work ambitions to at the same time give a boost to the fidelity for top-integrity purposes and minimize the tip-to-end delay for delay-sensitive ones, even when the community is congested. We borrow the inspiration of knowledge discipline from the selfdiscipline of physics and design a novel competencies founded. Some exact applications and environments, multiple sink may exist. Nevertheless, most often the information-centric WSNs most effective require nodes to transmit their sampling data to certainly one of them.

For this reason, on this work, we build a specified digital expertise field to customize a multipath dynamic routing algorithm, which finds appropriate paths to the sink for the 18 Š 2016, IJARIDEA All Rights Reserved

Dr. K. Madhavi et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.1, Issue 1,27 October 2016, pg. 16-21

packets with excessive integrity and prolong specifications. Subsequent, the abilities-based routing algorithm for WSNs with one sink is described. It is simple to prolong the algorithm to work in WSNs with more than one sinks.

Routing algorithm, which is called integrity and delay differentiated routing (IDDR). IDDR is competent to provide the following two features: make stronger constancy for highintegrity functions. The elemental notion is to seek out as a lot buffer house as feasible from the idle and/or beneath-loaded paths to cache the immoderate packets that perhaps dropped on the shortest course. Hence, the first undertaking is to search out these idle and/or below loaded paths, then the 2nd mission is to cache the packets successfully for subsequent transmission. IDDR constructs a advantage discipline according to the depth1 and queue size information to find the under-utilized paths. The packets with high integrity requirement shall be forwarded to the following hop with smaller queue length. A mechanism called Implicit Hop-by-Hop expense control is designed to make packet caching more efficient. Cut back end-to-end delay for delay-sensitive purposes. Every software is assigned a weight, It represents the sensitivity degree to the delay. Via building regional dynamic potential fields with unique slopes according to the load values carried by way of packets, IDDR enables the packets with larger weight to prefer shorter paths. In addition, IDDR also employs the priority queue to additional decrease the queuing delay of prolong-sensitive packets.

A. Advantages of Proposed System

1. IDDR inherently avoids the conflict between excessive integrity and low extend: the high-integrity packets are cached on the below loaded paths along which packets will undergo a large finish-to-finish extend when you consider that of extra hops, and the extend-sensitive packets travel alongside shorter paths to strategy the sink as quickly as possible.

2. Using the Lyapunov go with the flow conception, we prove that IDDR is stable.

V. SYSTEM EVALUATION A. Design Of Potential Fields

A potential-based routing paradigm has been designed for ancient wire line networks.

However, it didn't attract widespread attention attributable to its immense management overhead. it's quite pricy to create Associate in Nursing exclusive virtual field for every destination in ancient networks wherever various destinations can be distributed randomly.

On the contrary, the potential-based routing rule is way appropriate for the many-to-one route in WSNs. In some special applications and environments, quite one sink could exist.

However, typically the information-centric WSNs solely need nodes to transmit their sampling data to 1 of them. Therefore, during this work, we tend to build a singular virtual potential field to customise a multipath dynamic routing rule, that finds correct ways to the sink for the packets with high integrity and delay necessities. Next, the potential-based routing rule for WSNs with one sink is delineate. it's easy to increase the rule to figure in WSNs with multiple sinks.

B. High-Integrity Services

The basic plan of IDDR is to think about the total network as an enormous buffer to cache the excessive packets before they gain the sink. There are 2 key steps: 1. Finding enough buffer areas from the idle or beneath loaded nodes, that is truly resource discovery.

19 Š 2016, IJARIDEA All Rights Reserved

Dr. K. Madhavi et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.1, Issue 1,27 October 2016, pg. 16-21

2.

Caching the excessive packets in these idle buffers expeditiously for resulting transmissions, which suggests Associate in Nursing implicit hop-by-hop rate management.

C. Delay-Differentiated Services

There are principally four factors that have an effect on the end-to-end delay in WSNs: 1. Transmission delay. it's restricted by the link bandwidth; 2. Competition of the radio channel. particularly beneath a rivalry primarily based mackintosh, a packet needs to contend for the access of the channel and sit up for transmission till the channel is idle; 3. Queuing delay. an outsized queue can seriously delay packets; 4. Path length. Generally, the additional hops a packet travels, the big propagation delay it'll suffer. The physical limitation determines the transmission delay, and also the mackintosh affects the competition of the radio channel. they're each on the far side the scope of this paper. The IDDR aims to minimise the queuing delay and shorten the trail length for delay sensitive packets. Before describing however IDDR provides the delay-differentiated services, we tend to initial observe some fascinating properties of the hybrid potential field. Then, we tend to propose 2 effective mechanisms to decrease the end-to-end delay of delay-sensitive packets.

D. Design of IDDR Algorithm

Consider a WSN with totally different high-integrity or delay-sensitive applications. The depth potential field is very important as a result of it provides the fundamental routing operate. it's created supported the depth worth of every node. At the start, the depth values of all the nodes are initialized to zero, except that the default depth of the sink is zero. The sink initial sends a depth update message, the nodes one hop far away from the sink obtain their own depth by adding one to the depth worth within the update message then send new update messages with their own depth values. Similarly, all the opposite nodes will get their own depth by receiving update messages from their neighbors UN agency already apprehend the depth worth.

VI. RESULTS

Fig.1 Transmission Time Vs node for End-to-End delay

In the existing system from source to destination sends the packets it’s take more time so it will increases the end-to-end delay. In the proposed IDDR reduces the end-to end- delay when compared to existing system.

20 Š 2016, IJARIDEA All Rights Reserved

Dr. K. Madhavi et al., International Journal of Advanced Research in Innovative Discoveries in Engineering and Applications[IJARIDEA] Vol.1, Issue 1,27 October 2016, pg. 16-21

Fig.2 Average time taken for packets delivery

In the existing system the packet delivery from source to destination takes 155 seconds to transfer 23 packets. where as in proposed IDDR takes148 seconds to transfer 33 packets so it will improve the packet delivery ratio& throughput.

VII.

CONCLUSION

In this paper, a dynamic multipath routing algorithm IDDR is proposed based on the concept of potential in physics to satisfy the two different Quality of service requirements, high data fidelity and low end-to-end delay, over the same WSN simultaneously. The IDDR algorithm is proved stable using the Lyapunov drift theory. Moreover, that IDDR can significantly improve the throughput of the high-integrity applications and decrease the endto-end delay of delay sensitive applications through scattering different packets from different applications spatially and temporally. IDDR can also provide good scalability because only local information is required, which simplifies the implementation. In addition, IDDR has acceptable communication overhead.

[1] [2] [3] [4] [5] [6]

[7]

[8] [9]

[10]

REFERENCES P. Levis, N. Lee, M. Welsh, and D. Culler, “TOSSIM: Accurate and scalable simulation of entire Tiny OS applications,” in Proc. 1st Int. Conf. Embedded Networked Sensor Syst., 2003, pp. 126–137.

T. Chen, J. Tsai, and M. Gerla, “QoS routing performance in multi-hop multimedia wireless networks,” in Proc. IEEE Int. Conf. Universal Personal Commun., 1997, pp. 557–561.

R. Siva kumar, P. Sinha, and V. Bharghavan, “CEDAR: Core extraction distributed ad hoc routing algorithm,” IEEE J. Selected Areas Commun., vol. 17, no. 8, pp. 1454–1465, Aug. 1999.

S. Chen and K. Nahrstedt, “Distributed quality-of service routing in ad hoc networks,” IEEE J. Selected Areas Commun., vol. 17, no. 8, pp. 1488–1505, Aug. 1999.

B. Hughes and V. Cahill, “Achieving real-time guarantees in mobile ad hoc wireless networks,” in Proc. IEEE Real-Time Syst. Symp., 2003.

E. Felemban, C.-G. Lee, and E. Ekici, “MMSPEED: Multipath multi-speed protocol for QoS guarantee of reliability and timeliness in wireless sensor networks,” IEEE Trans. Mobile Comput., vol. 5, no. 6, pp. 738–754, Jun. 2003.

C. Lu, B. Blum, T. Abdelzaher, J. Stankovic, and T. He, “RAP: A real-time communication architecture for large-scale wireless sensor networks,” in Proc. IEEE 8th Real-Time Embedded Technol. Appl. Symp., 2002, pp. 55–66.

M. Caccamo, L. Zhang, L. Sha, and G. Buttazzo, “An implicit prioritized access protocol for wireless sensor networks,” in Proc. IEEE Real-Time Syst. Symp., 2002, pp. 39–48.

T. He, J. Stankovic, C. Lu, and T. Abdelzaher, “SPEED: A stateless protocol for real-time communication in sensor networks,” in Proc. IEEE 23rd Int. Conf. Distrib. Comput. Syst., 2003, pp. 46– 55.

P. T. A. Quang and D.-S. Kim, “Enhancing real-time delivery of gradient routing for industrial wireless sensor networks,” IEEE Trans. Ind. Inform., vol. 8, no. 1, pp. 61–68, Feb. 2012.

21 © 2016, IJARIDEA All Rights Reserved