Reducing Packets Delay in Event-Driven Applications of Wireless Sensor Networks
Keywords:WSNs, data redundancy, average delay
Event-driven WSNs applications are delay-critical applications where packets may considered useless when delivered lately. On the other hand, neighbor nodes tend to have intersected covered area, so they may sense the same information at the same time. Forwarding the duplicated information through the network has two main disadvantages, first, it uses network limited resources inefficiently, and second is the arising of packets delay because the neighbors packets obstacle each other. In this work, an algorithm is suggested to reduce the number of transmission required to inform the BS station about an event by exploiting the intersected area of coverage between neighbor nodes. In the simulation, THVR routing protocol is used for forwarding packets through the network with and without the suggested algorithm. The results show that the packets average delay is effectively reduced.