Computing an agent´s itinerary in a clustered network: An energy efficient approach

The itinerary an agent follows during its visit to each sensor in a cluster of a network has a profound effect on the time taken by the same to complete its tour. An optimal itinerary selection of a mobile agent has a primary role in determining the overall energy consumption of the network and aggregation cost especially when it is assigned the task of data fusion. The work thus proposes a novel approach for determining an agent´s itinerary in a clustered network. Analysis of the same reveal that the proposed approach proves to be a better solution than the existing spatial based node selection techniques.