An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networks


Creative Commons License

Deniz F., Bagci H., KÖRPEOĞLU İ., YAZICI A.

AD HOC NETWORKS, cilt.44, ss.104-117, 2016 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 44
  • Basım Tarihi: 2016
  • Doi Numarası: 10.1016/j.adhoc.2016.02.018
  • Dergi Adı: AD HOC NETWORKS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.104-117
  • Anahtar Kelimeler: Topology control, Fault-tolerance, Energy efficiency, Prolonged network lifetime, k-connectivity, Heterogeneous wireless sensor networks, RELAY NODE PLACEMENT, COMPLEXITY
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

This paper introduces an adaptive, energy-aware and distributed fault-tolerant topology control algorithm, namely the Adaptive Disjoint Path Vector (ADPV) algorithm, for heterogeneous wireless sensor networks. In this heterogeneous model, we have resource-rich supernodes as well as ordinary sensor nodes that are supposed to be connected to the supernodes. Unlike the static alternative Disjoint Path Vector (DPV) algorithm, the focus of ADPV is to secure supernode connectivity in the presence of node failures, and ADPV achieves this goal by dynamically adjusting the sensor nodes' transmission powers. The ADPV algorithm involves two phases: a single initialization phase, which occurs at the beginning, and restoration phases, which are invoked each time the network's supernode connectivity is broken. Restoration phases utilize alternative routes that are computed at the initialization phase by the help of a novel optimization based on the well-known set packing problem. Through extensive simulations, we demonstrate that ADPV is superior in preserving supernode connectivity. In particular, ADPV achieves this goal up to a failure of 95% of the sensor nodes; while the performance of DPV is limited to 5%. In turn, by our adaptive algorithm, we obtain a two-fold increase in supernode-connected lifetimes compared to DPV algorithm. (C) 2016 Elsevier B.V. All rights reserved.