M2M Communication System for Networked Robots with Low Memory Footprint

1753 Words Feb 16th, 2018 7 Pages
It keeps on performing its task with the aim to minimize the pain w. If the task requires any information to be sent the pain c is incremented. Then the robot starts sensing for the communication signal from its neighbors. If no signal is received the robot starts scanning for neighbors. If no neighbor units are around the robot will take one RRT step, through RRT forward propagation block in Fig. 2, and push the initial location node information into the RRT buffer as shown in Table 1. By doing so the robot has acquired an increment in the pain c. More c represents that the urge to communicate is more. The physical displacement of robot and the RRT buffer state at each step for RRT Forward Block is shown in Fig. 1.
After reaching the new location node the robot again scans its environment for any robot in its communication range. If no robot is found, it again goes through RRT forward propagation block. Each time the pain c increases and a new location node is reached to scan other robots. If even after three steps no robots are detected in scanning. The robot will check for the greater pain among c and w. If c is still greater than w the robot will wait some finite amount of time and keep on decreasing c. When c becomes less then w the robot makes the value of c equal to zero, which means the message to be transferred is lost. The robot then return to…
Open Document