The cost of algorithm for finding the deployment positions of static sensors in a given terrain is one of the most important issues for sensor deployment. There are many unpredictable conditions on the real filed while deploying sensor node. In this paper a new scheme of deployment of sensor node is proposed similar to On-demand node updating technique. In case of wireless sensor networks, sensor nodes are mostly distributed in wide area using small batteries hence low power consumption is also a requirement. In this research, we introduced a concept of a virtual node which is used for finding near optimal smallest partial updating way. Partial update servers creates a partial sensor node, and thereby it compares the code changes which are required in the new sensor node. By this techniques the major cost of transferring entire code is reduced, because only the updated code needs to be insert into previous code. Different methods like functional address table update is used to minimise the transfer overhead on the system. In the experimental result, it is observed that proposed method reduces the communication overhead for the node update with less power consumption. In case of time complexity it is observed that proposed partial update servers mechanism can reduced the update time by around 80%.
Volume 12 | 08-Special Issue
Pages: 889-897
DOI: 10.5373/JARDCS/V12SP8/20202593