Packet Recovery Approach for Addressing Burstiness in Wireless Sensor Network

Abstract

As wireless sensor networks mature, they are increasingly being used in real-time applications. Many of these applications require reliable transmission within latency bounds. Achieving this goal is very difficult because of link burstiness and interference. The burst-behavior of the wireless links may change due to a change in the physical environment, e.g. node failure, node replacement, or unexpected obstacles. To address this problem we propose two different approaches: packet recovery and link adaptation .In this paper packet recovery approach is addressed. The stimulated annealing algorithm is used to schedule the packet to reach the destination. If some of the packets does not reach destination then, the packet recovery approach is used to retransmit the failure packet. In a packet recovery approach, every node has a queue to hold the un-transmitted packet. The packet can be transmitted later at some other period if there are extra time slots left for packet transmission after all the packets of that period are transmitted successfully. In this way, the packet reaches the destination although it missed its deadline.