The limited energy capacity of WSNs is a critical challenge that directly impacts the network’s lifetime. This study specifically concentrates on maximizing the network lifetime of WSNs by optimizing base station placement and forming clusters. This paper proposes a new hybrid method combining energy-weighted Halton sequence clustering with an adaptive grid-based search to optimize base station placement in WSNs. Our approach involves the construction of a convex hull around the sensor nodes to reduce the search space, followed by generating Halton sequence points within this bounded region. Both node energy levels and closeness to the network centroid are taken into account, and these points are weighted using Min-Max standardization. The optimal location of the base station is found through an iterative grid-based search, which improves placement by maximizing the lifetime of the network at each iteration step.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Optimized Base Station Placement in WSNs: A Hybrid Adaptive Approach for Maximized Lifetime

  • Ahmed Salah,
  • Heba M. Abdel-Atty,
  • Rawya Y. Rizk,
  • Islam E. Shaalan

摘要

The limited energy capacity of WSNs is a critical challenge that directly impacts the network’s lifetime. This study specifically concentrates on maximizing the network lifetime of WSNs by optimizing base station placement and forming clusters. This paper proposes a new hybrid method combining energy-weighted Halton sequence clustering with an adaptive grid-based search to optimize base station placement in WSNs. Our approach involves the construction of a convex hull around the sensor nodes to reduce the search space, followed by generating Halton sequence points within this bounded region. Both node energy levels and closeness to the network centroid are taken into account, and these points are weighted using Min-Max standardization. The optimal location of the base station is found through an iterative grid-based search, which improves placement by maximizing the lifetime of the network at each iteration step.