p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals A DYNAMIC TRAFFIC-AWARE ROUTING TO IMPROVE QOS IN WIRELESS SENSOR NETWORKS 1 2 B. ROHINI, 2 V. NARAHARI 1 PG Student, Dept. of CSE, ALITS Engineering College,Affiliated to JNTUA , Andhra Pradesh, India Assistant Professor,Dept. of CSE,,ALITS Engineering College,Affiliated to JNTUA, Andhra Pradesh, India Abstract With the enormous advancement in the conflict. By constructing a virtual hybrid field of embedded computer and sensor potential field, IDDR separates packets of technology, Wireless Sensor Networks applications (WSNs) have made remarkable impact in requirements according to the weight today’s world. These WSNs consist of assigned to each packet, and routes them several nodes towards the sink through different paths deployed randoml y, are capable of to improve the data fidelity for integrity- sensing, actuating, and communicating sensitive applications as well as reduce the collected information. Since wireless the end-to-end delay for delay-sensitive sensor networks are constrained by cost, ones. scalability, topology change and power technique, we prove that IDDR is stable. consumption, new technologies are being Simulation considered to overcome these and many IDDR provides data integrity and delay other issues.Applications running on the differentiated services. same Wireless Sensor Network (WSN) Keywords:Wireless platform usually have different Quality of potential field, dynamic routing, data Service (QoS) requirements. Two basic integrity, delay differentiated services. thousands of sensor with Using the results different QoS Lyapunov demonstrate drift that sensor networks, requirements are low delay and high data integrity. However, in most situations, these two requirements cannot I. INTRODUCTION be Wireless sensor networks (WSNs) have satisfied simultaneously. In this paper, gained worldwide attention in recent years, based on the concept of potential in particularly physics, we propose IDDR, a multi-path Micro-Electro-Mechanical dynamic routing algorithm, to resolve this (MEMS) technology which has facilitated with the proliferation Available online:http://edupediapublications.org/journals/index.php/IJR/ in Systems P a g e | 963 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals the development of smart sensors. These allowed to have a delay, but the sink sensors are small, with limited processing should receive most of the packets. and computing resources, and they are WSNs have two basic QoS requirements: inexpensive low delay and high data integrity, leading compared to traditional sensors. These sensor nodes can sense, to measure, and gather information from the applications environment and, based on some local applications, respectively. decision process, they can transmit the Generally, in a network with light load, sensed data to the user. Smart sensor nodes both requirements can be readily satisfied. are low power devices equipped with one However, a heavily loaded network will or more sensors, a processor, memory, suffer congestion, which increases the end- power supply, radio, and an actuator. to-end WSNS, which are used to sense the simultaneously improve the fidelity for physical world, will play an important role high- integrity applications and decrease in the next generation networks. Due to the the end-to-end delay for delay-sensitive diversity and complexity of applications ones, even when the network is congested. running over WSNs, the QoS guarantee in We borrow the concept of potential field such networks gains increasing attention in from the discipline of physics and design a the research community. As a part of an novel potential based routing algorithm, information infrastructure, WSNs should which be able to support various applications differentiated routing (IDDR). IDDR is over able the same platform. Different what are delay. called and This is called to provide delay sensitive high- integrity work aims to integrity and delay the following two applications might have different QoS functions: requirements. For instance, in a fire [1] Improve fidelity for high- integrity monitoring application, the event of a fire applications. The basic idea is to find as alarm should be reported to the sink as much buffer space as possible from the soon as possible. On the other hand, some idle and/or under-loaded paths to cache the applications require most of their packets excessive packets that might be dropped to sink on the shortest path. Therefore, the first irrespective of when they arrive. For task is to find these idle and/or under example, loaded paths, then the second task is to successfully in arrive habitat at the monitoring applications, the arrival of packets is cache the packets Available online:http://edupediapublications.org/journals/index.php/IJR/ efficiently for P a g e | 964 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals subsequent transmission. IDDR constructs on the TOSSIM platform demonstrate the a potential field according to the depth1 efficiency and feasibility of the IDDR and queue length information to find the scheme. under- utilized paths. The packets with II. RELATED WORK high 2.1 Related Work integrity requirement will be forwarded to the next hop with smaller Most QoS provisioning protocols proposed queue length. A mechanism called Implicit for traditional ad hoc networks have large Hop-by-Hop Rate Control is designed to overhead caused by end-to-end path make packet caching more efficient. discovery and resource reservation. Thus, [2] Decrease end-to-end delay for delay- they are sensitive applications. Each application is constrained WSNs. Some mechanisms assigned a weight, which represents the have been designed to provide QoS degree of sensitivity to the delay. Through services specifically for WSNs. Here we building local dynamic potential fields mainly focus on the metrics of delay and with different slopes according to the reliability. weight values carried by packets, IDDR 2.1.1 Providing Real-Time Service allows the packets with larger weight to RAP exploits the notion of velocity and choose shorter paths. In addition, IDDR proposes a velocitymonotonic scheduling also employs the priority queue to further policy to minimize the ratio of missed decrease the queuing delay of delay deadlines. However, sensitive packets. information of IDDR inherently avoids the conflict required. Implicit Earliest Deadline First between high integrity and low delay: the (EDF) mainly utilizes a medium access high- integrity packets are cached on the control protocol to provide real-time under loaded paths along which packets service. The implicit prioritization is used will suffer large end-to-end delay because instead of relying on control packets as of more hops, and the delaysensitive most other protocols do. SPEED maintains packets travel along shorter paths to a desired delivery speed approach the sink as soon as possible. network through a novel combination of Using the Lyapunov drift theory, we prove feedback control and non-deterministic that IDDR is stable. Furthermore, the QoS-aware geographic forwarding .In a results of a series of simulations conducted two-hop not suitable for resource- the network global topology is across the neighbor information-based Available online:http://edupediapublications.org/journals/index.php/IJR/ P a g e | 965 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals gradient routing mechanism is proposed to modified enhance and reliable multicast delivery of packets real-time performance. The to provide prioritized access routing decision is made based on the to multiple neighbors. However, when the number of hops from a source to the sink network is congested, all the source nodes and the two-hop information. still continuously transmit packets to the 2.1.2 Providing Reliability Service sink along multipaths without taking some Adaptive Forwarding (AFS) other mechanisms, such as caching packets employs the packet priority to determine for some time. This not only deteriorates the forwarding behavior to control the reliability but also retards the delay- reliability. ReInforM uses the concept of sensitive packets. Energy- Efficient dynamic packet states to control the QoS-based Multipath Routing Protocol number of paths required for the desired (EQSR) improves reliability through using reliability . However, both of AFS and a lightweight XOR-based Forward Error ReInforM require to know the global Correction network topology. LIEMRO utilizes a introduces data redundancy in the data dynamic path maintenance mechanism to transmission process. monitor the quality of the active paths order to meet the delay requirements of during network operation and regulates various applications, EQSR employs a the injected traffic rate of the paths queuing model to manage real-time and according to the latest perceived paths non-real-time traffic. DARA considers quality. However, it does not consider the reliability, delay and residual energy. effects of buffer capacity and service rate 2.2 Motivation of the active nodes to estimate and adjust A small part of a WSN. Suppose node 1 is the traffic rate of the active paths. a hotspot and there are both high integrity 2.1.3 Providing Real- Time and Reliability packets (hollow rectangles) and delay- Services MMSPEED extends SPEED for sensitive packets (solid rectangles) from service differentiation and probabilistic source nodes A, B and C. A commonly QoS same used routing algorithm will choose the mechanism as SPEED to satisfy the delay optimal path for all the packets. For requirements for different types of traffic, example, the standard shortest path tree and uses redundant paths to ensure (SPT) routing will forward all of them to reliability. The MAC layer function node 1 as shown in Fig. 1a. This will cause guarantee. It Scheme uses the is (FEC) Available online:http://edupediapublications.org/journals/index.php/IJR/ mechanism, and which Furthermore, in P a g e | 966 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals congestion and thus lead to many high length. Some other idle and/or under integrity packets loss and large end-to-end loaded paths. On the other hand, IDDR delay for delay sensitive packets. A gives delay-sensitive packets priority to go multipath routing algorithm. It can utilize ahead in the shortest path to achieve low more paths to avoid hotspots. However, delay. Furthermore, if the traffic on the the low delay and high throughput are shortest path is heavy, IDDR can also hardly met simultaneously. The reasons select other paths for the delay sensitive are: packets. Delay-sensitive packets occupy the limited types of packets using the weight values bandwidth and buffers, worsening drops of inserted into the header of packets, high-integrity ones. and then performs different actions on High- integrity packets block the shortest them. Its cornerstone is to construct proper paths, delay-sensitive potential fields to make right routing hops before decisions for different types of packets. reaching the sink, which increases the Next the potential based IDDR algorithm delay. will High- integrity packets occupy the buffers, widespread attention because of its huge which also increases the queuing delay of management delay-sensitive packets. To overcome the expensive to build an exclusive virtual above drawbacks, we intend to design a field for each destination in traditional mechanism which allows the delay- networks where numerous destinations sensitive packets to move along the might be distributed arbitrarily. On the shortest path and the packets with fidelity contrary, requirements to detour to avoid possible algorithm is much suitable for the many- dropping on the hotspots. In this way, the to-one traffic pattern in WSNs. data integrity and delay differentiated III. EXISTING SYSTEM services can be provided in the same 1) Most QoS provisioning protocols network. Motivated by this understanding, proposed for traditional ad hoc networks we propose the IDDR scheme, a potential- have large overhead caused by end-to-end based path discovery and resource reservation. compelling the packets to travel more multi-path dynamic routing be IDDR distinguishes different described the in overhead. detail. It is potential-based attract quite routing algorithm. The high- integrity packets do Thus, they are not suitable for resource- not choose node 1 due to its large queue constrained WSNs. Some mechanisms Available online:http://edupediapublications.org/journals/index.php/IJR/ P a g e | 967 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals have been designed to provide QoS 5) High- integrity packets occupy the services specifically for WSNs. buffers, which also increases the queuing 2) Adaptive Forwarding Scheme (AFS) delay of delay-sensitive packets. employs the packet priority to determine IV. PROPOSED SYSTEM the forwarding behavior to control the This work aims to simultaneously improve reliability the fidelity for high- integrity applications 3) LIEMRO utilizes a dynamic path and decrease the end-to-end delay for maintenance delay-sensitive ones, mechanism to monitor the quality of the network is congested. We borrow the active paths during network operation and concept of potential field regulates the injected traffic rate of the discipline of physics and design a novel paths according to the latest perceived potential based.some special applications paths quality. and environments, more than one sink may 3.1 Disadvantages of Existing System exist. However, generally the data-centric 1) It does not consider the effects of buffer WSNs only require nodes to transmit their capacity and service rate of the active sampling data to one of them. Therefore, nodes to estimate and adjust the traffic rate in this work, we build a unique virtual of the active paths. potential field to customize a multipath 2) This will cause congestion and thus lead dynamic routing algorithm, which finds to many high integrity packets loss and proper paths to the sink for the packets large end-to-end delay for delay sensitive with high integrity and delay requirements. packets. Next, the potential-based routing algorithm 3) Delay-sensitive packets occupy the for WSNs with one sink is described. It is limited bandwidth and buffers, worsening straightforward to extend the algorithm to drops of high-integrity ones. work in WSNs with multiple sinks. 4) High- integrity packets block even when the from the the routing algorithm, which is called integrity shortest paths, compelling the delay- and delay differentiated routing (IDDR). sensitive packets to travel more hops IDDR is able to provide the following two before reaching the sink, which increases functions: Improve fidelity the delay. integrity applications. The basic idea is to for high- find as much buffer space as possible from the idle and/or under-loaded paths to cache Available online:http://edupediapublications.org/journals/index.php/IJR/ P a g e | 968 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals the excessive packets that might be because of more hops, and the delay- dropped on the shortest path. Therefore, sensitive packets travel along shorter paths the first task is to find these idle and/or to approach the sink as soon as possible. under loaded paths, then the second task is 2) Using the Lyapunov drift theory, we to cache the packets efficiently for prove that IDDR is stable. subsequent transmission. IDDR constructs a potential field according to the depth1 V. IMPLEMENTATION and queue length information to find the Design of Potential Fields under- utilized paths. The packets with A potential-based routing paradigm has high been designed for ancient wire line integrity requirement will be forwarded to the next hop with smaller networks. However, queue length. A mechanism called Implicit widespread attention attributable to its Hop-by-Hop Rate Control is designed to immense management overhead. it's quite make packet caching more efficient. pricy to create Associate in Nursing Decrease end-to-end delay for delay- exclusive virtual field for every destination sensitive applications. Each application is in ancient networks wherever various assigned a weight, which represents the destinations can be distributed randomly. degree of sensitivity to the delay. Through On the contrary, building local dynamic potential fields routing rule is way appropriate for the with different slopes according to the many-to-one route in WSNs. In some weight values carried by packets, IDDR special applications and environments, allows the packets with larger weight to quite one sink could exist. However, choose shorter paths. In addition, IDDR typically the information-centric WSNs also employs the priority queue to further solely decrease the queuing delay of delay- sampling data to 1 of them. Therefore, sensitive packets. during this work, we tend to build a 4.1 Advantages of Proposed System singular virtual potential field to customise 1) IDDR inherently avoids the conflict a multipath dynamic routing rule, that between high integrity and low delay: the finds correct ways to the sink for the high- integrity packets are cached on the packets with high integrity and delay under loaded paths along which packets necessities. will suffer a large end-to-end delay routing rule for WSNs with one sink is need it Available online:http://edupediapublications.org/journals/index.php/IJR/ attract the potential-based nodes to Next, didn't the transmit their potential-based P a g e | 969 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals delineate. it's easy to increase the rule to There are principally four factors that have figure in WSNs with multiple sinks. an effect on the end-to-end delay in High-Integrity Services WSNs: The basic plan of IDDR is to think about restricted by the link bandwidth; (2) the total network as an enormous buffer to Competition cache the excessive packets before they particularly beneath a rivalry primarily gain the sink. There are 2 key steps: (1) based mackintosh, a packet needs to Finding enough buffer areas from the idle contend for the access of the channel and or beneath loaded nodes, that is truly sit up for transmission till the channel is resource discovery. the idle; (3) Queuing delay. an outsized queue excessive packets in these idle buffers can seriously delay packets; (4) Path expeditiously for resulting transmissions, length. Generally, the additional hops a which suggests Associate in Nursing packet travels, the big propagation delay implicit hop-by-hop rate management. it'll In a under-utilized WSN, the queue length determines the transmission delay, and is extremely little, the hybrid potential also field is ruled by the depth potential field. competition of the radio channel. they're IDDR performs just like the shortest path each on the far side the scope of this paper. rule, that is, a node forever chooses one The IDDR aims to decrease the queuing neighbor with lower depth as its next hop. delay and shorten the trail length for delay However, in an exceedingly over-utilized sensitive packets. WSN, the shortest ways ar doubtless be however IDDR filled new differentiated services, we tend to initial returning packets are driven out of the observe some fascinating properties of the shortest ways to seek out different out hybrid potential field. Then, we tend to there resource. If a node is aware of the propose queue length data of its neighbors, it will decrease the end-to-end delay of delay- forward packets to the under loaded sensitive packets. with neighbors (2) Caching packets. to square Therefore, against (1) suffer. the Transmission of the The radio physical mackintosh 2 delay. provides effective channel. limitation affects Before it's the describing the delay- mechanisms to doable dropping. Delay-Differentiated Services Design of IDDR Algorithm Available online:http://edupediapublications.org/journals/index.php/IJR/ P a g e | 970 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals Consider a WSN with totally different regions managed by totally different sinks. high- integrity Therefore, IDDR will add giant scale or delay-sensitive applications. The depth potential field is WSNs with multiple sinks. very important as a result of it provides the fundamental routing operate. it's created VI. CONCLUSION supported the depth worth of every node. In this paper, a dynamic multipath routing At the start, the depth values of all the algorithm IDDR is proposed based on the nodes ar initialized to zero, except that the concept of potential in physics to satisfy default depth of the sink is zero. The sink the two different QoS requirements, high initial sends a depth update message, the data fidelity and low end-to-end delay, nodes one hop far away from the sink over the same WSN simultaneously. The obtain their own depth by adding one to IDDR algorithm is proved stable using the the depth worth within the update message Lyapunov drift theory. Moreover, that then send new update messages with their IDDR can significantly improve the own depth values. Similarly, all the throughput high- integrity opposite nodes will get their own depth by applications and decrease the end-to-end receiving update messages from their delay of delay sensitive applications neighbors UN agency already apprehend through scattering different packets from the depth worth. Multiple sinks could exist different in giant scale WSNs. per the procedure of temporally. IDDR can also provide good the depth potential field construction, these scalability because only local information sinks can sporadically broadcast their is update messages of depth. The nodes implementation. In addition, IDDR has receive these update messages, compare acceptable communication overhead. the various depth values from different REFERENCES sinks, then opt for the closest sink as its [1] P. Levis, N. Lee, M. Welsh, and D. destination. If the littlest depth worth isn't Culler, “TOSSIM: Accurate and scalable distinctive, the node will opt for one simulation of entire Tiny OS applications,” among them willy- nilly. Actually, once in multiple sinks exist in an exceedingly Networked Sensor Syst., 2003, pp. 126– giant scale WSN, IDDR can naturally 137. of applications required, Proc. the 1st which Int. spatially simplifies Conf. and the Embedded partition the total networks into sub Available online:http://edupediapublications.org/journals/index.php/IJR/ P a g e | 971 p-ISSN: 2348-6848 e-ISSN: 2348-795X Volume 03 Issue 10 June 2016 International Journal of Research Available at https://edupediapublications.org/journals [2] T. Chen, J. Tsai, and M. Gerla, [8] M. Caccamo, L. Zhang, L. Sha, and “QoS G. Buttazzo, routing performance in multi- hop “An implicit prioritized multimedia wireless networks,” in Proc. access IEEE networks,” in Proc. IEEE Real-Time Syst. Int. Conf. Universal Personal protocol for wireless sensor Commun., 1997, pp. 557–561. Symp., 2002, pp. 39–48. [3] R. Siva kumar, P. Sinha, and V. [9] T. He, J. Stankovic, C. Lu, and T. Bharghavan, “CEDAR: Core extraction Abdelzaher, “SPEED: A stateless protocol distributed ad hoc routing algorithm,” for real-time communication in sensor IEEE J. Selected Areas Commun., vol. 17, networks,” in Proc. IEEE 23rd Int. Conf. no. 8, pp. 1454–1465, Aug. 1999. Distrib. Comput. Syst., 2003, pp. 46–55. [4] S. [10]P. T. A. Quang and D.-S. Chen and K. Nahrstedt, Kim, “Distributed quality-of service routing in “Enhancing real- time delivery of gradient ad hoc networks,” IEEE J. Selected routing for industrial wireless sensor Areas Commun., vol. 17, no. 8, pp. 1488– networks,” IEEE Trans. Ind. Inform., vol. 1505, Aug. 1999. 8, no. 1, pp. 61–68, Feb. 2012. [5] B. Hughes “Achieving and V. Cahill, real-time guarantees in [11]S. Bhatnagar, B. Deb, and B. Nath, “Service differentiation in sensor mobile ad hoc wireless networks,” in networks,” in Proc. Int. Symp. Wireless Proc. IEEE Real-Time Syst. Symp., 2003. Pers. Multimedia Commun., 2001. [6] E. Felemban, C.-G. Lee, and E. Ekici, [12]B. Deb, S. Bhatnagar, and B. Nath, “MMSPEED: “ReInForM: Multipath multi-speed Reliable information protocol for QoS guarantee of reliability forwarding using multiple paths in sensor and sensor networks,” in Proc. IEEE Intl Conf. networks,” IEEE Trans. Mobile Comput., Local Comput. Netw., 2003, pp. 406–415. vol. 5, no. 6, pp. 738–754, Jun. 2003. [13]M. Radi, B. Dezfouli, K. A. Bakar, S. [7] C. Lu, B. Blum, T. Abdelzaher, J. A. Razak, and M. A. Nematbakhsh, Stankovic, and T. He, “RAP: A real-time “Interference-aware communication architecture for large-scale protocol for QoS improvement in event- wireless sensor networks,” in Proc. IEEE driven wireless. timeliness in wireless multipath routing 8th Real- Time Embedded Technol. Appl. Symp., 2002, pp. 55–66. Available online:http://edupediapublications.org/journals/index.php/IJR/ P a g e | 972