|
篇目详细内容 |
|
【篇名】 |
Energy-efficient routing for mobile agents in wireless sensor networks |
|
【刊名】 |
Frontiers of Electrical and Electronic Engineering in China |
|
【刊名缩写】 |
Front. Electr. Electron. Eng. China |
|
【ISSN】 |
1673-3460 |
|
【EISSN】 |
1673-3584 |
|
【DOI】 |
10.1007/s11460-007-0030-y |
|
【出版社】 |
Higher Education Press and Springer-Verlag |
|
【出版年】 |
2007 |
|
【卷期】 |
2
卷2期 |
|
【页码】 |
161-166
页,共
6
页 |
|
【作者】 |
CAO Yongtao;
HE Chen;
JIANG Lingge;
|
|
【关键词】 |
wireless sensor networks; mobile agent; routing; NP-complete problem |
【摘要】 |
|
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, they have a significant impact on the overall performance of the whole system. Considering the limited transmission range of sensor nodes, we showed that this routing problem in a multi-hop cluster could be modeled as a node-weighted traveling tourist problem (TTP). We proved that the problem was nondeterministic polynomial time (NP)-complete. Then we presented a new approximation algorithm to solve the problem. Simulation experiments demonstrate that the proposed heuristic is more energy-efficient than the two earlier ones. |
