Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks
Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks
复制标题
DOI：
10.1109/hicss.2006.95
复制
发表时间：
2006-01
期刊：
影响因子：
--
通讯作者：
Jiro Uchida;Islam A. K. M. Muzahidul;Y. Katayama;Wei Chen;K. Wada
中科院分区：
文献类型：
--
作者：
Jiro Uchida;Islam A. K. M. Muzahidul;Y. Katayama;Wei Chen;K. Wada
传感器网络是收发设备（称为节点）的集合。我们假设每个节点每轮进行同步并执行发送或接收操作。在本文中，我们考虑传感器网络基于簇的架构的构建和维护，其中有两个原子操作：节点移入和节点移出，它们通过节点的出现和消失来执行。在我们提出的架构中，确定性广播可以在$O(p)$轮内完成，其中$p$是簇的数量。我们提出了一种用于节点移入的随机算法和一种用于节点移出的确定性算法，它们分别在$O(q)$期望轮数和$O(|T|)$轮数内工作，其中$q$是加入节点在网络中的邻居数量，$T$是架构中以离开节点为根的子树。我们还为这些操作提供了一些替代算法。
A sensor network is a collection of transmitter-receiver devices (referred to as nodes). We assume that each node synchronizes and performs transmission or reception per round. In this paper, we consider the construction and maintenance of a cluster-based architecture for a sensor network, with two atomic operations node-move-in and node-move-out which are performed by appearance and disappearance of a node. In our proposed architecture, a deterministic broadcasting can be done in O(p) rounds, where p is the number of clusters. We present a randomized algorithm for a node-move-in and a deterministic algorithm for a node-move-out, which work in O(q) expected rounds and O(|T|) rounds, respectively, where q is the number of neighbors in the network of the joining node and T is a subtree of the architecture whose root is the leaving node. We also provide some alternative algorithms for the operations.