Energy-efficient Routing for Mobile Agents in Wireless Sensor Networks
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.
Cao Yongtao He Chen Zhu Zhenyu Liu Haitao
Dept. of Electronics Engineering Shanghai Jiao Tong Univ. Shanghai, China Inst. of Communication Engineering PLA Univ. of Science and Technology Nanjing, China Shanghai Inst. of Microsystem and Information System Shanghai, China
国际会议
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
广西桂林
英文
1518-1522
2006-06-25（万方平台首次上网日期，不代表论文的发表时间）