Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks (PDF)

Nagoya Institute of Technology
Hawaii International Conference on System Sciences 01/2006; 9:237c. DOI: 10.1109/HICSS.2006.95
Source: DBLP


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.

Download full-text


Available from: Yoshiaki Katayama,

Click to see the full-text of:

Article: Construction and Maintenance of a Cluster-Based Architecture for Sensor Networks (PDF)

0 B

See full-text
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we have proposed a time efficient, energy saving and robust broadcast/multicast protocol for reconfigurable cluster-based sensor network. In our broadcast protocol, a broadcast can be executed in O(hd2 + D2) rounds and each node needs to be awake in O(D2) rounds, where D and d are the degrees of G and the sub-network induced by the network backbone, respectively, and h is the height of the backbone. When k channels are available, the broadcast can be executed in O((hd2 + D2)/k) rounds and each. We show that our broadcast protocol can be readily modified to the one for multicast. The cluster-based architecture used in this paper for a sensor network is an improved version. The proposed network architecture is self-constructible and self-reconfigurable by using two topological management operations: node-move-in and node-move-out. Details of the protocol along with experimental results are discussed. Simulation results show that the protocol performance is much better than that in the theoretical analysis.
    21th International Parallel and Distributed Processing Symposium (IPDPS 2007), Proceedings, 26-30 March 2007, Long Beach, California, USA; 01/2007
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider an initialization problem in single-hop radio networks. The initialization is the task of assigning distinct ID numbers to nodes in a network. We have greatly improved the previous results [10] for the initialization in an n -node network. We propose randomized initialization algorithms in two cases. The first case is that n is known to all the nodes and the second case is that n is unknown to all the nodes. The algorithm for the first case completes in en + ln n + O (1) expected time slots, and the algorithm for the second case completes in en + O (√ n ) expected slots. The main idea of the algorithm for the case that n is unknown is presumption of the number of nodes. In the algorithm, each node presumes the number of nodes efficiently and is assigned ID by using the algorithm for the case that n is known with the presumption value.
    IEICE Transactions on Information and Systems 06/2007; E90D(6). DOI:10.1093/ietisy/e90-d.6.915 · 0.21 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: A virtual backbone plays an important role for routing and connectivity management in wireless networks. In this paper, we propose a novel distributed algorithm to construct and maintain a virtual backbone to mitigate the unevenness of energy distribution and its undesirable effects like reduced network lifetime and loss of connectivity for wireless Sensor networks (WSNs). The construction of virtual backbone is based on the maximal weighted independent set (MWIS) and rooted tree. A distributed procedure is presented to maintain the virtual backbone when the network topology changes. Theoretical analysis and experiment show that our proposed approach can effectively extend the lifetime of the network, and at the same time, it bears the characteristics of energy efficiency and low complexity.
Show more