By Topic

Energy-efficient Routing for Mobile Agents in Wireless Sensor Networks

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

4 Author(s)
Cao Yongtao ; Dept. of Electron. Eng., Shanghai Jiao Tong Univ. ; He Chen ; Zhu Zhenyu ; Liu Haitao

In wireless sensor networks, data fusion (in-network processing) is a critical issue because sensor networks are energy-constrained and bandwidth-constrained. Recently, a new scheme based on mobile agent has been proposed to solve the problem. The order and number of nodes on the route traversed by a mobile agent determine the energy consumption and hence, have a significant impact on the overall performance of the whole system. Considering the limited transmission range of sensor nodes, we show that this routing problem in a multi-hop cluster can be modeled as a node-weighted traveling tourist problem (TTP). We prove that the problem is NP-complete. Then we present a new approximation algorithm to solve the problem. Simulation experiments demonstrate that the proposed heuristic is more energy-efficient than two earlier ones

Published in:

Communications, Circuits and Systems Proceedings, 2006 International Conference on  (Volume:3 )

Date of Conference:

25-28 June 2006