Article

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

ABSTRACT 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.

0 Bookmarks
 · 
55 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A Multiple-Input Multiple-Output (MIMO) transceiver provides extremely high spectral efficiencies by simultaneously transmitting multiple data streams in the same channel. Some research works have used MIMO technology to increase data rate or reduce energy consumption at communication links in wireless sensor networks. Since all layers of the protocol stack affect network performance, an efficient system should exploit the advantage of MIMO technology across all layers as well as the underlying hardware where the resource constraints actually come from. In this paper, we show a joint design of MIMO aware network architecture, routing and MAC protocols underlying physical hardware. Our network architecture is reconfigurable with two functions: node-joining and node-leaving. We show that our design can fully exploit the advantage of MIMO technology and multiple-optimize network throughput, network lifetime and network reconfiguration cost in a dynamic sensor network.
    05/2010;
  • [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.
    Convergence Information Technology, International Conference on. 11/2007;
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider the resource allocation problem in a structured sensor network. While new technologies are making sensors smarter, smaller, and cheaper, an emerging problem is how to allocate limited energy, radio bandwidth, and other resources to achieve efficient global behavior for high performance, QoS, and long network lifetime. Conventionally, resource allocation is treated as an optimization problem. The solution is calculated at each round of scheduling according to the status of all resources and given tasks in a centralized manner, which is very computation and communication intensive and not suitable for multi-hop sensor networks. Recently, some distributed approaches with less computation and communication complexity have been reported. Most of these approaches are completely decentralized without using the advantage of underlying network structures. A large scale sensor networks is usually built with a hierarchical and reconfigurable structure that introduces efficient sensing, computing and networking. In this paper, we propose a hierarchical framework for the resource allocation in a cluster-based sensor network. The framework combines decentralized control scheme with local centralized control scheme. In each cluster, there is a centralized agent that can optimally allocate the resources in the cluster, while in each node there is a decentralized agent that manages the resources at the node. Instead of low-level sensor programming, such as manually tuning sensor and other resource usage, we explore market approach for dynamic allocation of system resources. Network customers can use the price of resources to loosely control the global behavior of the sensor network. All radio transmissions are supported by the routing protocol and reconfiguration function of the underlying cluster-based sensor network. We implement our approach to the task of mobile target tracking. Experiment results show that our approach promises a faster and more accurate tracking. F- urthermore, it can significantly extend the network lifetime.
    Computational intelligence in miulti-criteria decision-making, 2009. mcdm '09. ieee symposium on; 05/2009

Full-text (2 Sources)

Download
21 Downloads
Available from
Jun 1, 2014