• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Computer Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Energy-efficient and fault-tolerant drone-BS placement in heterogeneous wireless sensor networks

      Thumbnail
      View / Download
      831.2 Kb
      Author(s)
      Deniz, F.
      Bağcı, H.
      Körpeoğlu, İbrahim
      Yazıcı, A.
      Date
      2020
      Source Title
      Wireless Networks
      Print ISSN
      1022-0038
      Publisher
      Springer
      Volume
      27
      Pages
      825 - 838
      Language
      English
      Type
      Article
      Item Usage Stats
      104
      views
      232
      downloads
      Abstract
      This paper introduces a distributed and energy-aware algorithm, called Minimum Drone Placement (MDP) algorithm, to determine the minimum number of base stations mounted on resource-rich Unmanned Aerial Vehicles (UAV-BS), commonly referred to as drone-BS, and their possible locations to provide fault tolerance with high network connectivity in heterogeneous wireless sensor networks. This heterogeneous model consists of resource-rich UAV-BSs, acting as gateways of data, as well as ordinary sensor nodes that are supposed to be connected to the UAV-BSs via multi-hop paths. Previous efforts on fault tolerance in heterogeneous wireless sensor networks attempt to determine transmission radii of the sensor nodes based on the already deployed base station positions. They assume that the base stations are stationary and arbitrarily deployed regardless of the position of the sensor nodes. Our proposed MDP algorithm takes into account the desired degree of fault tolerance and the position of ordinary sensor nodes to determine the optimal number of UAV-BSs and their locations. The MDP algorithm consists of two steps. In the first step, each sensor node chooses low-cost pairwise disjoint paths to a subset of candidate UAV-BSs, using an optimization based on the well-known set-packing problem. In the last step, depending on the desired degree of fault tolerance, MDP chooses a subset of these UAV-BS candidates using a novel optimization based on the well-known set-cover problem. Through extensive simulations, we demonstrate that the MDP achieves up to 40% improvement in UAV-connected lifetimes compared to a random and uniform distribution of UAV-BSs.
      Keywords
      Fault-tolerance
      Energy efficiency
      Heterogeneous wireless sensor networks
      Unmanned aerial vehicles(UAVs)
      k-connectivity
      Set cover problem
      Permalink
      http://hdl.handle.net/11693/75921
      Published Version (Please cite this version)
      https://dx.doi.org/10.1007/s11276-020-02494-x
      Collections
      • Department of Computer Engineering 1561
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy