6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications

Research Article

An Efficient Routing Protocol on a Dynamic Cluster-based Sensor Network

Download98 downloads
  • @INPROCEEDINGS{10.4108/icst.crowncom.2011.245879,
        author={A.K.M. Muzahidul Islam and Koichi  Wada and Shahrum Abdullah and Jiro Uchida and Wei Chen},
        title={An Efficient Routing Protocol on a Dynamic Cluster-based Sensor Network},
        proceedings={6th International ICST Conference on Cognitive Radio Oriented Wireless Networks and Communications},
        publisher={IEEE},
        proceedings_a={CROWNCOM},
        year={2012},
        month={5},
        keywords={Wireless Sensor Network; Routing; Node-Move-in; Node-Move-out; Dynamic Cluster-based Network},
        doi={10.4108/icst.crowncom.2011.245879}
    }
    
  • A.K.M. Muzahidul Islam
    Koichi Wada
    Shahrum Abdullah
    Jiro Uchida
    Wei Chen
    Year: 2012
    An Efficient Routing Protocol on a Dynamic Cluster-based Sensor Network
    CROWNCOM
    IEEE
    DOI: 10.4108/icst.crowncom.2011.245879
A.K.M. Muzahidul Islam1,*, Koichi Wada2, Shahrum Abdullah1, Jiro Uchida3, Wei Chen4
  • 1: Universiti Teknologi Malaysia
  • 2: Nagoya Institute of Technology
  • 3: AISIN AW Co., Ltd.
  • 4: Tennessee State University
*Contact email: akmmislam@ic.utm.my

Abstract

This paper presents an efficient routing protocol on a Dynamic Cluster-based Wireless Sensor Network (WSN). The cluster-based architecture presented here is constructed dynamically. Unlike some previous routing protocol that finds the route on cluster-based architecture which is a spanning tree of graph G, our proposed protocol finds route on G. The cluster-based architecture is dynamic, thus it is self-constructible and reconfigurable and is facilitated by two topology management operations: node-move-in and node-move-out. For these two operations we also propose two algorithms: Node-Move-In and Node-Move-Out. We show that to establish a route on graph G using the architecture, it requires O(p) rounds, where p is the number of clusters in the network. In a scenario where the number of sensor nodes n is enormous, p is much less than n. Finally, our simulation results describe that the proposed routing protocol finds a better route with less length.