Optimal Routing in Nanosensor Networks by a Game Theory Approach
In this paper, the authors investigate a moving-Optimum Routing problem with nanosensor networks. Each nanosensor node has a sensor to observe the target and a processor to estimate the target position. It also has wireless communication capability but with limited range and can only communicate with neighbors. The moving target is assumed to be an intelligent agent, which is "Smart" enough to escape from the detection by maximizing the estimation error. This adversary behavior makes the Optimum Routing problem more difficult. In this paper, a "Game Theory" approach for finding an optimum routing in a "Wireless Nanosensor Network" is discussed. WSN is one of the most interesting research fields in the communication networks, and is the center of attention in recent years.