Abstract

Increasing number of cores in a processor chip and decreasing cost of distributed memory based system setup have led to emerge of a new work theme in which the main concern focused on the parallelization of the well-known algorithmic approaches for utilizing the computational power of the current architectures. In this study, the performances of the conventional parallel and cooperative model based parallel Artificial Bee Colony (ABC) algorithms on the deployment problem related to the wireless sensor networks were investigated. The results obtained from the experimental studies showed that parallelized ABC algorithm with the cooperative model is capable of finding similar or better coverage ratios with the increased convergence speeds than its serial counterpart and parallelized implementation in which the emigrant is chosen as the best food source in the current subcolony.

Highlights

  • Increasing number of cores in a processor chip and decreasing cost of distributed memory based system setup have led to emerge of a new work theme in which the main concern focused on the parallelization of the well-known algorithmic approaches for utilizing the computational power of the current architectures

  • How- and efficiency of the network, studies on the deever, sensor nodes have limited computing abili- ployment of sensor nodes have attracted the reties and storage spaces, their detection ranges are searchers and different approaches for solving the restricted with properties of the sensing units and sensor deployment problem have been proposed

  • Population based optimization algorithms including Artificial Bee Colony (ABC) algorithm are generally suitable for parallelization on distributed or shared memory based architectures

Read more

Summary

Deployment problem in wireless sensor networks

When a wireless sensor network is established, the main purposes of the settlement are to maximize the utilization period of the network and the area where the sensors successfully in communication with each other by sending information obtained from the tracked objects or environmental variables [5,6,7,8,9]. To maximize these two conflicting objectives, exact positions of the mobile and stationary sensor nodes should be determined carefully. The binary sensor detection model used in the coverage calculation is given in the Eq (2) for P and si [5,6,7,8,9]

ABC algorithm and its adaptation to sensor deployment problem
12: Change xi with xnew
Parallelization of ABC algorithm with conventional and cooperative model
1: Initialization: 2
15: Calculate the fitness value of xcoop
Experimental studies
Findings
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call