A new cluster head based dynamic base station positioning for wireless sensor networks

Tohma, Kadir; Kutlu, Yakup; Abasıkeleş‐Turgut, İpek

doi:10.1109/electronics.2017.7995231

Cited by 2 publications

(3 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…LEACH is one of the most widely used protocols in WSN, used in many research as a benchmark to evaluate the performance of WSN operation in terms of network lifetime, and energy consumption. Finally, in the rest of the sub-sections, the performance of the CH positioning algorithm (CHP) and multi-CHP are compared with the dynamic base station-positioning algorithm [ 34 ], SMOC [ 25 ], DEEC [ 18 ], and the EECPEP-HWSN [ 19 ] in terms of energy consumption and number of alive nodes after certain number of transmission rounds.…”

Section: Simulation Results and Analysismentioning

confidence: 99%

“…In this section, the multi-CHP is compared with a Dynamic Base Station-Positioning algorithm proposed in [ 34 ], which assumes the BS a mobile node, and used the location and residual energy for CHs in the network to determine the best location for the BS. The process of determining the location for BS was repeated every transmission iteration.…”

Section: Simulation Results and Analysismentioning

confidence: 99%

“…Finally, the cluster radius and the packet size are set to 25 m, 100 bytes, respectively [ 34 ]. Figure 19 shows the total residual energy for each multi-CHP and K-medoid with the dynamic base station-positioning algorithm over variable number of rounds.…”

Section: Simulation Results and Analysismentioning

confidence: 99%

See 2 more Smart Citations

Optimal Cluster Head Positioning Algorithm for Wireless Sensor Networks

Khalifeh

Abid

Darabkh

2020

Sensors

View full text Add to dashboard Cite

Wireless sensor networks (WSNs) are increasingly gaining popularity, especially with the advent of many artificial intelligence (AI) driven applications and expert systems. Such applications require specific relevant sensors’ data to be stored, processed, analyzed, and input to the expert systems. Obviously, sensor nodes (SNs) have limited energy and computation capabilities and are normally deployed remotely over an area of interest (AoI). Therefore, proposing efficient protocols for sensing and sending data is paramount to WSNs operation. Nodes’ clustering is a widely used technique in WSNs, where the sensor nodes are grouped into clusters. Each cluster has a cluster head (CH) that is used to gather captured data of sensor nodes and forward it to a remote sink node for further processing and decision-making. In this paper, an optimization algorithm for adjusting the CH location with respect to the nodes within the cluster is proposed. This algorithm aims at finding the optimal CH location that minimizes the total sum of the nodes’ path-loss incurred within the intra-cluster communication links between the sensor nodes and the CH. Once the optimal CH is identified, the CH moves to the optimal location. This suggestion of CH re-positioning is frequently repeated for new geometric position. Excitingly, the algorithm is extended to consider the inter-cluster communication between CH nodes belonging to different clusters and distributed over a spiral trajectory. These CH nodes form a multi-hop communication link that convey the captured data of the clusters’ nodes to the sink destination node. The performance of the proposed CH positioning algorithm for the single and multi-clusters has been evaluated and compared with other related studies. The results showed the effectiveness of the proposed CH positioning algorithm.

show abstract

Section: Simulation Results and Analysismentioning

confidence: 99%

Section: Simulation Results and Analysismentioning

confidence: 99%