AN EFFICIENT CONGESTION AWARE ROUTING PROTOCOL FOR WIRELESS NETWORKS

ABSTRACT Congestion is one of the restrictions in wireless networks. Congestion leads to high overhead, long delay and low throughput. To reduce congestion in wireless networks we proposed three different protocols , one in ad hoc networks and two protocols in wireless sensor networks. For ad hoc networks we proposed the Energy Efficient Congestion Aware Routing Protocol(EECARP) and for wireless sensor networks we proposed Congestion Aware

Routing(CAR) and MAC enhanced Car(MCAR) protocol. In this paper, using these three protocols we have given a comparison between them and see to that which protocol improves the performance of the wireless networks. Key words: congestion , wireless network,ad hoc networks , sensor networks

INTRODUCTION An ad hoc network is a collection of mobile nodes without the help of central administration. It forms a temporary network. These networks can be In sensor networks deployments may use thousand or hundreds of nodes. For deploying such large scale networks it incurs high cost so sensors will be shared by large number of applications and gather various types of data like temperature, the presence of chemical gases etc.so the data generated in sensor networks may all not be equally important. Some data may be given more importance than the other data. With large deployment sizes congestion becomes an important problem in sensor networks. here in this paper we will be considering the problems with congestion in both

established at anytime and anywhere. The ingredient wireless nodes of this network, build, operate and maintain this network. since the nodes in this

network have a limited transmission range, the nodes in this network ask the neighbouring nodes for the help for forwarding the packets. The network performance degrades drastically when the number of nodes increase. an ad hoc

network suffers from poor scalability.

heterogeneous

ad

hoc

networks

and

considering all the data present to be equally important. Congestion becomes even more worse when a particular area is generating data at a high rate. We characterise congestion as the degradation of high priority traffic due to competing lower priority traffic. So to overcome these problems which we face due to congestion in both

wireless sensor networks. Congestion in mobile ad hoc wireless networks The general causes for congestion are: Since in a mobile ad hoc wireless network many nodes within a range try to transmit the data simultaneously, so the throughput of the nodes in a given area gets reduced which results in packet loss. Within a particular node the queue or buffer which holds the packets to be transmitted overflows, so this is also one of the reasons for loss.In the heterogeneous networks, different data rates will almost surely lead to some routes having different links with different data rates. link reliability is also a reason for congestion . if there is packet retransmission then due to breaks in the links, there is an increase in congestion. Congestion in wireless sensor networks: Congestion may lead to indiscriminate dropping of data. It also leads to increase in energy consumption to route the packets that were dropped down stream as the links which carry these packets get saturated. Here we ensure that data with higher priority is received in presence of data with lower priority. The existing schemes present detect congestion while

heterogeneous ad hoc networks and in wireless sensor networks we propose the following protocols. To overcome the problem of congestion in heterogeneous networks, we propose an energy efficient congestion aware routing protocol which uses

combined weight values as the routing metric. Based on the node weight of all the in-network nodes, the route with minimum cost index is selected among the

discovered routes.

To overcome the problem of congestion in wireless sensor networks, we propose the use of data prioritization and a differentiated routing protocol and/or a prioritized medium access scheme to mitigate its effects on higher priority traffic. The proposals are as follows: 1) Congestion Aware and Routing

(CAR) Protocol

2) MAC Aware Protocol

enhanced Routing

Congestion (MCAR)

multiple paths are computed during the route discovery.

We now calculate the node weight Energy Efficient Congestion Aware Routing Protocol (EECARP) metric NW which assigns a cost to each link in the network. The node weight NW combines the link quality Lq , MAC This routing protocol employs the following metrics: Data-rate , Buffer queuing delay, Link Quality, Residual Energy, MAC Overhead. In this protocol after the estimation is done for all the metrics, the weight calculation is done for the node. By A. Route Request overhead OHMAC , effective data rate Drate , residual energy RE and the average delay Davg , to select maximum the most

throughput

paths,avoiding

congested links.

selecting any multipath routing protocol, we discover multiple routing paths from a source to a destination. Among the discovered routes, the route with minimum cost index is selected, from all the innetwork nodes for each packet Consider the scenario Let us consider the route S _ _N1_ N2 _ N3_ D To initiate congestion-aware

routing discovery, the source node S sends a RREQ. When the intermediate node N1receives the RREQ packet The node N1 then calculates its node weight NWN1 using

successfully delivered from the source node to the destination node. The nodes cost index is calculated in a backward propagating way.

EECARP is an on-demand routing protocol that aims to create congestionfree routes by making use of information gathered from the MAC layer. For establishing multiple disjoint paths, we adapt the idea from the Adhoc On-Demand Multipath Distance Vector Routing (AOMDV) . The N2 then calculates its weight NWN2 in the same way and adds it to the weight of N1. N2 then forward the RREQ packet with this added weight.

a data processing center for collecting Finally the RREQ reaches the destination node D with the sum of node weights sensitive information from the critical area. Such data is assigned a higher priority than other data. There are also several nodes collecting different types of LP

information from other parts of the network. B. Route Reply background In the LP presence traffic, of this

without

differentiating between the two priority The Destination node D sends the route reply packet RREP along with the total node weight to the immediate upstream node N3. classes, congestion will degrade the

service provided to HP data. This may result in HP data being dropped or delayed so long that it is of no use to the data processing center. We refer to the area that contains the shortest paths from the critical area to the sink as the conzone. HP data

Now N3 calculates its cost C based on the information from RREP as

would ideally traverse the conzone but will face competition for medium access due to LP traffic. CAR, operates solely in the network layer. Packets are classified as HP or LP by the data sources, and nodes

By proceeding in the same way, all the intermediate hosts calculate its cost. On receiving the RREP from all the routes, the source selects the route with minimum cost value.

within a conzone only forward HP traffic. LP traffic is routed out of and/or around the conzone. CAR comprises three steps: HP network formation, conzone discovery, and

differentiated routing. The combination of Congestion aware routing algorithms: these functions segments the network into on-conzone and off-conzone nodes. Only An important event occurs in one portion of the sensor field, which we call the critical area. This critical area consist of multiple nodes. In such a scenario, there is HP traffic is routed by on-conzone nodes. Note that the protocol specifically

accommodates LP traffic, although with less efficient routes than HP traffic. Since nodes in the scenario in send all HP data to

a single sink, tree-based routing, with the HP sink being the root, is most

or there is a network partition resulting in separating the sink from the critical area.

appropriate. High-Priority Formation Routing Network

Fig 1.

A critical area of a sensor network may generate HP data at a high rate. This causes congestion in a part of the network exacerbated by the presence of LP data being routed in that area. Fig. 2. In a dense deployment, multiple nodes can be parents of a node. Each parent lies on a different shortest path route to the sink. This structure is used for shortest multipath routing.

Tree based routing is the most appropriate as all the critical area nodes send the packets to a single HP sink ,where the HP sink is the root. Tree-based routing schemes suffer from congestion, especially if the number of messages generated at the leaves is high. This problem of congestion becomes even worse when we have a movement of both LP and HP traffic travelling through the network. Therefore, a conzone is created by the LP traffic which will span through the network from the critical area to the sink, this happen s when the rate of HP data is relatively low. Because of this congestion, the HP data service is degraded and the nodes within the range die sooner than the other nodes

The HP data collection center (the sink) is responsible for the process of building the HP routing network (HiNet). This network covers all nodes. As the sink will have no information about the various nodes in the network at the time of deployment , it covers all the nodes in the network.

As all the HP data is to be delivered to a single sink , the HiNet formation is based on the minimum distance spanning tree where the sink which is the root. A node that has multiple neighbors with depths (the number of hops to the sink) less than its own considers them all as parents .

Now we consider process. When

the HiNet formation the sink discovers its a Build HiNet

discovery is done dynamically, because the critical area can change during the lifetime of the deployment and is triggered when an area starts generating HP data. The conzone discovery algorithms allow nodes, in a distributed fashion, to determine if they are on a potentially congested path between the critical area and the sink. If they are on the congested path, they mark themselves as on conzone. Here we consider only the conzone discovery from the critical area to the sink. A conzone is discovered from that neighborhood to the sink for the delivery of HP data. For this, critical area nodes send discover conzone to sink (ToSink) messages. This message includes the ID of the source and its depth and is overheard by all neighbors. The depth is included here to make sure that nodes do not

neighbors, it sends

message (containing the ID and depth of the node) asking all nodes in the network to organize as a graph. Once a neighboring node hears this message, it checks if it has already joined the HiNet (i.e., if it knows its depth); if not, it sets its depth to one plus the depth in the message received and sets the source of the message as a parent. This node then rebroadcasts the Build HiNet message, with its own ID and depth. If a node is already a member of the graph, it checks the depth in the message, and if that depth is one less than its own, then the source of the message is added as a parent. In this case, the message is not

rebroadcast. If a node receives a Build HiNet message with a depth value less than that of its parents depth, it updates its own value to the received value, plus one. It then removes all current parents and adds the source of the message as a new parent. Finally, the Build HiNet message is rebroadcast with the new depth value.

respond to the ToSink messages heard from their parents. When a node hears more than distinct ToSink messages

coming from its children, it marks itself as on conzone and propagates a single ToSink message. This message is

overheard by neighbours who mark this Dynamic Conzone Discovery neighbour as being on the conzone in their neighborhood table. Nodes discover whether they are on the conzone or not by using the conzone This threshold is a linear function of the neighborhood size (i.e., the number of nodes within the communication range) and of the depth of the node in the HiNet,

discovery mechanism. The conzone is formed when one area is generating HP data called the critical area. This conzone

present then it sends to an off conzone sibling. If there are no parents or siblings . For node x with depth dx and neighborhood size nx, we have off conzone ,the sink sends a message through the conzone, which contains the coordinates of a line that cuts the conzone in half. This line connects the sink to the The important goal of the conzone center of the critical area. Using this information and its own coordinates, a

discovery algorithm is to split the parents and siblings (nodes with the same depth) in the HiNet into on-conzone and offconzone neighbors.

node can determine on which half of the conzone it lies and hence routes LP data to the parent that is closest to the conzone boundary, i.e., farthest from the line.

Differentiated Routing MCAR After the conzone discovery, HP data is routed in the conzone, and LP data is routed off the conzone. All the HP data is generated inside the conzone as the critical area is a part of the conzone. For routing of HP data a node always forwards its data to its on conzone parents. This parent is chosen randomly from the on conzone In MCAR we mainly consider the mobility of the HP data sources as CAR doesnt support the accommodation of mobile HP data sources in the network. The overhead to maintain the HiNet in the dynamic environment of the network is prohibitive in case of CAR. To overcome this problem we introduce a differentiated routing mechanism to accommodate the mobile HP data sources. MCAR forms the conzone on the release of each data that is addressed to reach the sink through the network. The main disadvantage of

parent list. If the links for the parents are broken for some reason like node failure , then the node will forward the data to the sibling that is on conzone. If that is not possible it will send the data to its neighbours , thinking that it can return to the on conzone node. LP data generated inside the conzone is routed out as follows. When an on conzone node gets a LP packet it forwards it to an off conzone parent. If the parents are not

MCAR is that it blocks the flow of LP data and drop some of the LP data in the network resulting in the service

degradation of LP data.

CAR forms the static network by the means of static nodes while MCAR doesnt from a dynamic as it

packets. This timer monitors how long it has been since the last HP packet was heard and is reset whenever a HP packet is overheard or received. The second timer called the received timer controls nodes that are either generating or forwarding HP data. In MCAR,each of the nodes in the network can be in any of these states HP mode,LP mode and shadow mode signifying

accommodates mobile HP data sources in the network. In turn MCAR forms the dynamic paths that are created to leave a passage for the flow of mobile sources to the sink. Thus MCAR discovers the congested zone on the journey of

transmission of the mobile HP data sources to the sink that are flowing through the HP path. The enhanced MAC-layer utilizes the RTS/CTS protocol that is used to carry the information about the priority level of the data that is being transmitted. During channel contention in the network,when a node that is to send a HP data overhears an LP RTS, it blocks the channel with HP CTS and backs off the forwarding LP data. When a node that is to send a LP data overhears an HP RTS/CTS then it backs off the channel itself thereby obstructing the flow of LP data and also HP data. In MCAR the conzone discovered begins when the nodes in an area starts generating the HP data. In case of MCAR conzone is discovered dynamically by means of two timers to regulate when a node is not in the HP path. One timer called the overhearing timer is used to control nodes that are in the communication range of the conzone but not necessarily in forwarding the

whether the node is in the conzone or not or within the communication range of the conzone but not a part of it.the shadow mode separates HP traffic from LP traffic. LP mode: in this mode,all the nodes are initially in the LP mode and they forward only LP data. When the node in the LP mode receives or overhears an LP packet, the node remains in the LP mode. When it overhears an HP packet, it transitions to the shadow mode. Upon receiving an HP event the node transitions to the HP mode. HP mode: In this mode, the nodes that are in the path of HP data are in the HP mode. The node set two timer called overhearing timer and received timer upon transition to this state.the values of these timer are set depending on the expected inter arrival time delay of the HP data. When a node receives an HP transmission it triggers the channel contention by utilizing our

modified RTS/CTS protocol and forwards

the data. It resets its received and overhearing timers and remains in the HP mode. If a node in the HP mode overhears or receives an LP RTS, it sends a jamming HP CTS to clear the channel of LP data and to announce the existence of an HP path and stays in the HP mode.

CONCLUSION In this paper, we proposed the three protocols for wireless networks . These three protocols reduce the congestion in wireless networks and improve the

network performance.

REFERENCES Shadow mode. Nodes in this state are within the communication range of HP traffic but not on a forwarding path. Nodes in this state suppress LP traffic, thus preventing it from interfering with HP traffic in the network. Upon overhearing an HP packet, the node resets its overhearing timer and stays in this state. A node transitions to the HP mode upon receiving an HP packet itself. If a node in the shadow mode overhears an LP packet, it stays in the shadow mode and takes no action. 2) An Energy-Efficient CongestionAware RoutingProtocol for Heterogeneous Mobile Ad-hoc Networks S.Santhosh Baboo Reader, PG & Research Department of Routing :Before routing the HP Data the node ask to the neighborhood node by Computer Applications, DG Vaishnav College, Arumbakkam, Chennai, India. santhos2001@sify.com B.Narasimhan Lecturer, Department of Computer 1) Mitigating Performance Degradation in Congested Sensor Networks Raju Kumar, Student Member, IEEE, Riccardo Crepaldi, Student Member, IEEE, Hosam Rowaihy, Student Member, IEEE, Albert F. Harris III, Member, IEEE, Guohong Cao, Senior Member, IEEE, Michele Zorzi, Fellow, IEEE, and Thomas F. La Porta, Fellow, IEEE

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.

Applications, K.G.College of Arts& Science, KGiSL Campus, Saravanampatti, Coimbatore, India. bnarasimhanphd@gmail.com