Dynamic Anchors Based Void Avoidance Scheme for Real-Time Application in WSNs
Sangdae Kim, Taehun Yang, Cheonyong Kim, Hyunchong Cho, Sang‐Ha Kim · 2017
Geographic greedy routing in Wireless Sensor Networks (WSNs) suffers from the local minimum problem, which cannot select the next forwarding node such as the void. Especially, the void, which encountered during data transmission, have a negative effect on the time-sensitive application by the time delay in order to detour the void. Further, it is caused the void diffusion problem to exploiting the same node repeatedly in order to detour the void. To solve these problems, we proposed a dynamic anchor based void avoidance scheme for real-time service in WSNs. The proposed scheme broadcast the information of the void in network initialization phase in order to reduce a disadvantage caused the shape and location of the void. Furthermore, the source node calculates the dynamic anchor points using the information in order to satisfy the requirement of the real-time application and transmits the data to the sink node. Simulation result shows the proposed scheme is suitable for time-sensitive application and alleviate the void diffusion problem.