Efficient route block avoiding algorithm in cluster based routing method for wireless sensor networks

摘要

Wireless Sensor Networks (WSNs) can afford less expenditure solutions to different real world problems. It's composed of a large number of tiny devices called sensor nodes. The sensor nodes communicate together by many wireless strategies. WSN monitor physical or environmental conditions, such as whether, sounds, pulsation, pressure, motion's main problem is Energy hole. it's a critical issue for data congregation. Sensors near the fixed sink act as relays for far sensors and thus will reduce their energy very rapidly, finally energy holes in the sensor ground. We proposed new technique Efficient Route Block Avoiding algorithm in cluster based method. In this the mobile sink starts the data-collecting path occasionally from the starting site, forwardly collects data from these cluster heads in a single-hop range, and at last returns to the starting ground. Based on the spanning graph, we introduced the barrier free shortest path algorithm. In this method identified the shortest route without obstacles. It will provide efficient solution for energy holes issues. A simulation result proves the effectiveness of cluster based method.