Research Article

Congestion Detection and Alleviation in Multihop Wireless Sensor Networks

Algorithm 2

Mitigating/alleviating congestion.
Initialization
: The sensor node to be congested
: The predecessor node 1-hop away from
: The forwarding node of
: A set of sensor nodes on an active route
TTL: Time to live value
BID: Broadcast Identifier of the Route Request
: Neighbours of sensor node,
: Source and Destination nodes
Ripple-Based Search Mechanism
() IF   receives notification from then
()   It sends notification to
()  IF   receives notification then
()     broadcasts the Request with S, D, BID, and Till TTL = 4-hops
()    FOR  each sensor node , in
()     IF  () OR () AND TTL ! = 0 then
()      Discard the request
()     ELSE IF  () && () && () && (TTL! = 0) then
()      Add reverse route entry
()     Add forward route entry
()     Send Reply towards
()    ELSE IF  () then
()     Add reverse route entry
()     Add forward route entry
()     Broadcast Notification Message
()    ELSE IF  () then
()     Send a Unicast message to to re-discover the route
()    END IF
()    Decrement TTL by 1
()   END FOR
()  END IF
() END IF