e Mitigating Performance Degradation in Congested Sensor Networks e

e Abstract
Datas generated in Wireless Sensor Networks may not all alike, some Data's are more important than other Data and they may have Different Delivery Requirements. If Congestion occurs in the Wireless Network. Some or More Important data may be dropped. But in our Project we handle this problem by addressing Differentiated Delivery Requirements. We propose a class of algorithms that enforce differentiated routing based on the congested areas of a network and data priority. The basic protocol, called Congestion-Aware Routing (CAR), discovers the congested zone of the network that exists between high-priority data sources and the data sink and, using simple forwarding rules, dedicates this portion of the network to forwarding primarily high-priority traffic. Since CAR requires some overhead for establishing the high-priority routing zone, it is unsuitable for highly mobile data sources. To accommodate these, we define MAC-Enhanced CAR (MCAR), which includes MAC-layer enhancements and a protocol for forming high-priority paths on the fly for each burst of data. MCAR effectively handles the mobility of high-priority data sources, at the expense of degrading the performance of low-priority traffic.

e Existing System

Existing Schemes detect Congestion but they Consider all Datas to be Equally Important.

e Demerits in Existing System

Congestion may lead to , Indiscriminate dropping of data (i.e., high-priority (HP) packets may be dropped while low-priority (LP) packets are delivered).
Data Delivery is low.

e Proposed System

In our project we use differentiated routing path for both LP and HP data
Use energy more uniformly in the deployment and reduce the energy consumed in the nodes that lie on the conzone(Congested Zone), which leads to an increase in connectivity lifetime.

e Merits in Proposed System

Provides very low jitter Increasing the delivery ratio of High priority data Energy consumption is low.

System Requirements

Software Requirements:
Operating System Windows XP/2000 Language used JAVA(J2sdk1.4.0 or more),

Data Flow Diagram

CAR(Congested Aware Routing)
Sink N4 LP N1 N2 N3 LP HP N5

Data Flow Diagram

MCAR(Mac enhanced Congested Aware Routing)

Sink N4

LP
N1 N3 LP HP

e Module Description
CAR

1.Network Formation -Here we connect the independent Nodes and assign the depth to all nodes and Assign all the nodes as Off Conzone

2.Conzone Discovery - In this module Nodes discover if they are on the Conzone by using the Conzone discovery mechanism. A Conzone must be then discovered from that neighborhood to the sink for the delivery of HP data. To do this, critical area nodes broadcast discover Conzone to sink (To Sink) messages. This message includes the ID of the source and its depth and is overheard by all neighbors. When a node hears more than _ distinct To Sink messages coming from its children, it marks itself as on Conzone and propagates a single To Sink message.

3.Routing Data via Differentiated path - Once the Conzone is discovered, HP data is routed in the conzone, and LP data is routed off the Conzone. LP data generated inside the conzone is routed out of the Congested Zone

e Module Description
MCAR 1.Network Formation -Here we Create Graphical user Interface for all nodes(Node1,Node2,Node 3 and one Sink Contains two LP sink and one HP sink) -Here we connect the independent Nodes in tree structure but here single child node may also have multiple parents and assign the depth to all nodes and In Default the state of all the nodes Assigned as LP mode

2. Setting Modes -LP mode: In this mode, nodes forward LP data. All nodes in the network are initially in the LP mode. Upon receiving or overhearing an LP packet, nodes remain in the LP mode and, if appropriate, forward any data If a node in the LP mode overhears an HP packet, it transitions to the HP mode.

HP mode: Nodes in the path of HP data are in the HP mode. Node that forward HP data would changed as HP mode. If a node in this mode receives an HP transmission, it begins channel contention by using our modified RTS/CTS protocol and forwards the data. SHADOW mode: If Hp Mode doesnt receive any HP data for certain period it would be transferred as Shadow Mode

3.Routing Data: - Before routing the HP Data the node ask to the neighborhood node by sending HPRTS, the node receiving HPRTS sends reply as HPCTS if it doesnt receive any Request from another node, if another node asks LPRTS to this node it blocks LPRTS by using HPCTS and sends data to the Destination

References

G.-S. Ahn, L.-H. Sun, A. Veres, and A.T. Campbell, Swan: Service Differentiation in Stateless Wireless Ad Hoc Networks, Proc. IEEE INFOCOM, 2002. S.R. Das, C.E. Perkins, and E.M. Belding-Royer, Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks, Proc. IEEE INFOCOM 00, pp. 3-12, 2000 D.B. Johnson and D.A. Maltz, Dynamic Source Routing in Ad Hoc Wireless Networks, Mobile Computing, pp. 153-181, Kluwer Academic Publishers, Feb. 1996.

e System Requirements

Hardware Requirements:
PROCESSOR RAM MONITOR HARD DISK FLOPPY DRIVE CDDRIVE KEYBOARD MOUSE : :
: : : : : :

PENTIUM III 866 MHz 128 MB DD RAM 15 COLOR 20 GB 1.44 MB LG 52X STANDARD 102 KEYS 3 BUTTONS