Node Coverage Algorithms in Wireless Sensor Networks Using Mobile Agents

被引：8

作者：

RAINA Manik

KUMAR Subhas

PATRO Ranjeet

机构：

[1] Honeywell Technologies Bangalore

[2] India

来源：

自动化学报 | 2006年 / 06期

关键词：

Wireless sensor networks; mobile agents;

D O I：

10.16383/j.aas.2006.06.011

中图分类号：

TN929.5 [移动通信]; TP212.9 [传感器的应用];

学科分类号：

080402 ; 080904 ; 0810 ; 081001 ; 080202 ;

摘要：

<正>This paper proposes fault tolerant algorithms for routing mobile agents in a single channel wireless sensor network which cover every node in the network. These algorithms use local knowledge (assume no knowledge of global deployment or topology, etc). We propose the algorithms and show mathematical analysis to support our claims. The paper ends with simulation studies and discussion of results.

引用

页码：915 / 921

页数：7

共 4 条

[1]

Reducibility among combinatorial problems. Karp R M. Complexity of Computer Computations . 1972

[2]

Mobile agents based routing protocol for mobile ad hoc networks. Tham C,Marwaha S,Srinivasan D. Proceedings of IEEE Globecorn . 2002

[3]

On computing mobile agent routes for data fusion in distributed sensor networks. Wu Q S,Nageswara S V Rao,Jacob Barhen,Sitharama Iyengar S,Vijay K Vaishnavi,,Qi H,Krishnendu Chakrabarty. IEEE Transactions on Knowledge and Data Engineering . 2004

[4]

Efficient code distribution in wireless sensor networks. Reijers N,,Langendoen K. Proceedings of the 2nd ACM International Conference on Wireless Sensor Networks and Applications . 2003

← 1 →