Dynamic Routing for Data Integrity and Delay Differentiated Services in Wireless Sensor Networks

Dynamic Routing for Data Integrity and Delay Differentiated Services in Wireless Sensor Networks

• 1.
  Dynamic Routing forData Integrity and Delay Differentiated Services in Wireless Sensor Networks
• 2.
  ABSTRACT:  Applications runningon the same Wireless Sensor Network (WSN) platform usually have different Quality of Service (QoS) requirements. Two basic requirements are low delay and high data integrity. However, in most situations, these two requirements cannot be satisfied simultaneously. In this paper, based on the concept of potential in physics, we propose IDDR, a multi-path dynamic routing algorithm, to resolve this conflict. By constructing a virtual hybrid potential field, IDDR separates packets of applications with different QoS requirements according to the weight assigned to each packet, and routes them towards the sink through different paths to improve the data fidelity for integrity-sensitive applications as well as reduce the end-to-end delay for delay-sensitive ones. Using the Lyapunov drift technique, we prove that IDDR is stable. Simulation results demonstrate that IDDR provides data integrity and delay differentiated services.
• 3.
  EXISTING SYSTEM:  MostQoS provisioning protocols proposed for traditional ad hoc networks have large overhead caused by end-to-end path discovery and resource reservation. Thus, they are not suitable for resource- constrained WSNs. Some mechanisms have been designed to provide QoS services specifically for WSNs.  Adaptive Forwarding Scheme (AFS) employs the packet priority to determine the forwarding behavior to control the reliability  LIEMRO utilizes a dynamic path maintenance mechanism to monitor the quality of the active paths during network operation and regulates the injected traffic rate of the paths according to the latest perceived paths quality.
• 4.
  DISADVANTAGES OF EXISTING SYSTEM: It does not consider the effects of buffer capacity and service rate of the active nodes to estimate and adjust the traffic rate of the active paths.  This will cause congestion and thus lead to many high integrity packets loss and large end-to-end delay for delay sensitive packets.  Delay-sensitive packets occupy the limited bandwidth and buffers, worsening drops of high-integrity ones.  High-integrity packets block the shortest paths, compelling the delay- sensitive packets to travel more hops before reaching the sink, which increases the delay.  High-integrity packets occupy the buffers, which also increases the queuing delay of delay-sensitive packets.
• 5.
  PROPOSED SYSTEM:  Thiswork aims to simultaneously improve the fidelity for high-integrity applications and decrease the end-to-end delay for delay-sensitive ones, even when the network is congested. We borrow the concept of potential field from the discipline of physics and design a novel potential based routing algorithm, which is called integrity and delay differentiated routing (IDDR). IDDR is able to provide the following two functions:  Improve fidelity for high-integrity applications. The basic idea is to find as much buffer space as possible from the idle and/or under-loaded paths to cache the excessive packets that might be dropped on the shortest path. Therefore, the first task is to find these idle and/or under loaded paths, then the second task is to cache the packets efficiently for subsequent transmission. IDDR constructs a potential field according to the depth1 and queue length information to find the under- utilized paths. The packets with high integrity requirement will be forwarded to the next hop with smaller queue length. A mechanism called Implicit Hop-by-Hop Rate Control is designed to make packet caching more efficient.  Decrease end-to-end delay for delay-sensitive applications. Each application is assigned a weight, which represents the degree of sensitivity to the delay. Through building local dynamic potential fields with different slopes according to the weight values carried by packets, IDDR allows the packets with larger weight to choose shorter paths. In addition, IDDR also employs the priority queue to further decrease the queuing delay of delay-sensitive packets.
• 6.
  ADVANTAGES OF PROPOSEDSYSTEM  IDDR inherently avoids the conflict between high integrity and low delay: the high-integrity packets are cached on the under loaded paths along which packets will suffer a large end-to-end delay because of more hops, and the delay-sensitive packets travel along shorter paths to approach the sink as soon as possible.  Using the Lyapunov drift theory, we prove that IDDR is stable.  Furthermore, the results of a series of simulations conducted on the TOSSIM platform demonstrate the efficiency and feasibility of the IDDR scheme.
• 7.
  SYSTEM ARCHITECTURE:
• 8.
  SYSTEM REQUIREMENTS  HARDWAREREQUIREMENTS:  System : Pentium IV 2.4 GHz.  Hard Disk : 40 GB.  Floppy Drive : 1.44 Mb.  Monitor : 15 VGA Colour.  Mouse : Logitech.  Ram : 512 Mb.  SOFTWARE REQUIREMENTS:  Operating system : Windows XP/7.  Coding Language : JAVA/J2EE  IDE : Netbeans 7.4  Database : MYSQL
• 9.
  REFERENCE: Jiao Zhang, Member,IEEE, Fengyuan Ren, Member, IEEE, Shan Gao, Hongkun Yang, and Chuang Lin, Senior Member, IEEE, “Dynamic Routing for Data Integrity and Delay Differentiated Services in Wireless Sensor Networks”, IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 14, NO. 2, FEBRUARY 2015.