Localization is an essential process in many wireless sensors networks applications like environmental surveillance and forest fires detection, where sensors are usually randomly thrown in difficult to reach places, considering the limited wireless s
ensors capability in terms of energy availability and the capacity of computations a low cost and energy conservation algorithms are needed to determine the approximate position of the sensors. In this research a new algorithm was proposed ‘Address Vector Multi-Hop (AV_MH)’ to determine the position of the randomly deployed sensors, this algorithm is based on the idea of making benefit from short address assignment in networks that support hierarchical addressing, considering that the most important techniques used in the field of sensor networks such as ZigBee and 6LowPAN which depend on the IEEE802.15.4 standard support this type of addressing.
The results showed the possibility of obtaining an approximate position of the wireless sensors in a rapid and inexpensive and cost-effective way in terms of the number of sent messages and required calculations.
Many wireless sensor network applications like forest fire detection and environment monitoring recommend making benefit from moving humans, vehicles, or animals to enhance network performance. In this research, we had improved our previous protocol
(Dynamic Tree Routing DTR) to support mobility in a wireless sensor network. First, we had mathematically approximated the speed threshold for mobile sensors, which enables them to successfully associate with nearby coordinators. Second, we test our (MDTR) protocol in a network with mobile sensors sending packets toward the network's main coordinator. The simulation results obtained from network Simulator (NS2) showed a good approximation of speed threshold, and good performance of MDTR in term of delay, throughput, and hop-count compared with AODV and MZBR Protocols.
