By Topic

An itinerary for data fusion in distributed sensor network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Meng Chen ; Dept. of Comput., NanChang Univ., Nanchang, China ; Xin Xia

Using mobile agent for data fusion in distributed sensor network brings new problems, the serial itinerary of mobile agent travel makes long task duration, mobile agent transfer introduces new overhead, if a mission need collect data from all nodes many times mobile agent must be dispatched many times, which brings much data transfer overhead. To overcome these shortcomings, A closest first (CF) algorithm is presented to calculate a binary full spanning tree (BST) itinerary for mobile agent, full spanning tree ensuring shortest path. And the function of mobile agent is changed, when first reaching a node mobile agent give a copy of its code (called Resident Agent) into the node, resident agent can stay in the node for many times data collections and data fusion. Simulation shows that resident agent based data fusion can both reduce energy consumption and task duration time.

Published in:

Granular Computing (GrC), 2011 IEEE International Conference on

Date of Conference:

8-10 Nov. 2011