Date Added: Dec 2010
As software entities that migrate among nodes, Mobile Agents (MAs) are able to deliver and execute codes for flexible application re-tasking, local processing, and collaborative signal and information processing. In contrast to the conventional wireless sensor network operations based on the client-server computing model, recent research has shown the efficiency of agent-based data collection and aggregation in collaborative and ubiquitous environments. In this paper, the authors consider the problem of calculating multiple itineraries for MAs to visit source nodes in parallel. The authors' algorithm iteratively partitions a directional sector zone where the source nodes are included in an itinerary.