in general we use the node transformation of data in the networks, in geographic nodes we need to update each and everything of our positions and data nodes as well as we need to identify the next neighbour nodes and its positions when we are sending the information from one location to another location. To implement this process we have chosen two methods that as fallows. First one is to identify the most nearest location nodes and to make the connection without break in the network and not to make heard for the updating process. Second one is to find the longest distance and its harden positions to find out the next node through this two options we are implemented and madden well of positions for the data transforming in the networks. Here the main concept is to updating the nodes information for the further implementation of data process and its related work for the advancing of the process in the network without the delay options.
展开▼
