|
||||||||||||||||||||||
|
||||||||||||||||||||||
ABSTRACT
Sensor actor networks (SANET) are composed of (mobile) sensors and actors which coordinate via wireless communications to perform distributed sensing and acting tasks. This paper investigates the issue of navigating mobile actors within a mobile SANET in response to dynamic sensing events so as to optimize specific networking performance and/or to balance the actuation workload. In particular, we describe a polynomial-time algorithm that computes an optimal position, in terms of the minimum average hop-count, in a SANET of stationary sensors with complete location information. We then extend the theoretical results tostudy online scenarios and describe heuristic navigation algorithms that continuously compute mobile actors' trajectories by having both the actors and the sensors participate in the trajectory computation. Simulation results demonstrate the effectiveness of the proposed navigation algorithms. REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references. INDEX TERMS
Primary Classification:
General Terms:
Keywords:
Collaborative Colleagues:
|
||||||||||||||||||||||