A Navigation Algorithm Based On Dividing Grids In Sensor Networks

The sensor network is a wireless Ad Hoc and consists of many sensor nodes. The sensors distributing over an area randomly organize and reorganize themselves autonomously in response to task requirements or triggers from the environment. The excellence of sensor itself and the development of wireless communication give the sensor networks a very good application foreground.The distributed random micro sensor nodes integrate with sensor, data processing unit and communication module. They are able to sense the around environment elements people are interest in through its inner multiple modalities, such as: heat, infrared, sonar and volcanoes signals, Thereby detect things people interest in. This paper does the researches building on these features of sensor networks and give a navigation algorithm guiding the objects across an area where exists some dangers or obstacles for the objects—NADG. By placing some sensors to detect and describe the distribution of dangers, the wireless communication module mounted in the object can communicate the sensor networks at real time. So the object can avoid the dangers and arrives at destination safely. The simulation results show that the route of the algorithm computed is safe and can adapt to the network's dynamic changes.There are different goals between sensor networks and traditional wireless networks. The latter is to get the largest bandwidth and guarantee QoS for users through optimizing routing and resources management in moving environment. While in sensor networks which in extremely or very dangerous environments that human can't almost access, to enlarge their life circle is the most important issue. For considering this, the paper develops an improved algorithm (INADG). The simulation shows it can improve the life circle greatly, better than other algorithms.